/export/starexec/sandbox/solver/bin/starexec_run_default /export/starexec/sandbox/benchmark/theBenchmark.c /export/starexec/sandbox/output/output_files -------------------------------------------------------------------------------- YES Ultimate: Cannot open display: This is Ultimate 0.1.25-34f2e62 [2020-07-01 13:11:06,901 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-01 13:11:06,903 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-01 13:11:06,914 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-01 13:11:06,914 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-01 13:11:06,915 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-01 13:11:06,916 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-01 13:11:06,918 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-01 13:11:06,920 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-01 13:11:06,920 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-01 13:11:06,921 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-01 13:11:06,922 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-01 13:11:06,922 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-01 13:11:06,923 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-01 13:11:06,924 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-01 13:11:06,925 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-01 13:11:06,926 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-01 13:11:06,927 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-01 13:11:06,929 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-01 13:11:06,930 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-01 13:11:06,932 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-01 13:11:06,933 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-01 13:11:06,934 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-01 13:11:06,934 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-01 13:11:06,937 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-01 13:11:06,937 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-01 13:11:06,937 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-01 13:11:06,938 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-01 13:11:06,938 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-01 13:11:06,939 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-01 13:11:06,939 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-01 13:11:06,940 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-01 13:11:06,941 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-01 13:11:06,941 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-01 13:11:06,942 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-01 13:11:06,942 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-01 13:11:06,943 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-01 13:11:06,943 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-01 13:11:06,943 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-01 13:11:06,944 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-01 13:11:06,945 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-01 13:11:06,946 INFO L101 SettingsManager]: Beginning loading settings from /export/starexec/sandbox/solver/bin/./../termcomp2017.epf [2020-07-01 13:11:06,959 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-01 13:11:06,960 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-01 13:11:06,961 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-01 13:11:06,961 INFO L138 SettingsManager]: * Rewrite not-equals=true [2020-07-01 13:11:06,961 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-01 13:11:06,961 INFO L138 SettingsManager]: * Minimize states using LBE with the strategy=SINGLE [2020-07-01 13:11:06,961 INFO L138 SettingsManager]: * Use SBE=true [2020-07-01 13:11:06,962 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-07-01 13:11:06,962 INFO L138 SettingsManager]: * Use old map elimination=false [2020-07-01 13:11:06,962 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2020-07-01 13:11:06,962 INFO L138 SettingsManager]: * Buchi interpolant automaton construction strategy=DANDELION [2020-07-01 13:11:06,962 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2020-07-01 13:11:06,962 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-07-01 13:11:06,963 INFO L138 SettingsManager]: * Construct termination proof for TermComp=true [2020-07-01 13:11:06,963 INFO L138 SettingsManager]: * Command for external solver (GNTA synthesis)=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-07-01 13:11:06,963 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-01 13:11:06,963 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-07-01 13:11:06,963 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-01 13:11:06,963 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-01 13:11:06,964 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-07-01 13:11:06,964 INFO L138 SettingsManager]: * How to treat unsigned ints differently from normal ones=IGNORE [2020-07-01 13:11:06,964 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-01 13:11:06,964 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-01 13:11:06,964 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-07-01 13:11:06,964 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 [2020-07-01 13:11:06,965 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-01 13:11:06,965 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-01 13:11:06,965 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-01 13:11:06,965 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-01 13:11:07,127 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-01 13:11:07,141 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-01 13:11:07,145 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-01 13:11:07,146 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-01 13:11:07,146 INFO L275 PluginConnector]: CDTParser initialized [2020-07-01 13:11:07,147 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /export/starexec/sandbox/benchmark/theBenchmark.c [2020-07-01 13:11:07,210 INFO L220 CDTParser]: Created temporary CDT project at /export/starexec/sandbox/tmp/BenchExec_run_7ZADKm/tmp/569629ff93e44604b04c88bd55fcc2ac/FLAGfac3369ee !SESSION 2020-07-01 13:11:04.671 ----------------------------------------------- eclipse.buildId=unknown java.version=1.8.0_242 java.vendor=Oracle Corporation BootLoader constants: OS=linux, ARCH=x86_64, WS=gtk, NL=en_US Framework arguments: -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -i /export/starexec/sandbox/benchmark/theBenchmark.c Command-line arguments: -os linux -ws gtk -arch x86_64 -consoleLog -data @user.home/.ultimate -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -data /export/starexec/sandbox/tmp/BenchExec_run_7ZADKm/tmp -i /export/starexec/sandbox/benchmark/theBenchmark.c !ENTRY org.eclipse.cdt.core 1 0 2020-07-01 13:11:07.482 !MESSAGE Indexed 'FLAGfac3369ee' (0 sources, 0 headers) in 0.006 sec: 0 declarations; 0 references; 0 unresolved inclusions; 0 syntax errors; 0 unresolved names (0%) [2020-07-01 13:11:07,559 INFO L306 CDTParser]: Found 1 translation units. [2020-07-01 13:11:07,560 INFO L160 CDTParser]: Scanning /export/starexec/sandbox/benchmark/theBenchmark.c [2020-07-01 13:11:07,560 WARN L117 ultiparseSymbolTable]: System include stdlib.h could not be resolved by CDT -- only built-in system includes are available. [2020-07-01 13:11:07,566 INFO L349 CDTParser]: About to delete temporary CDT project at /export/starexec/sandbox/tmp/BenchExec_run_7ZADKm/tmp/569629ff93e44604b04c88bd55fcc2ac/FLAGfac3369ee [2020-07-01 13:11:08,007 INFO L357 CDTParser]: Successfully deleted /export/starexec/sandbox/tmp/BenchExec_run_7ZADKm/tmp/569629ff93e44604b04c88bd55fcc2ac [2020-07-01 13:11:08,019 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-01 13:11:08,020 INFO L131 ToolchainWalker]: Walking toolchain with 7 elements. [2020-07-01 13:11:08,021 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-01 13:11:08,021 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-01 13:11:08,025 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-01 13:11:08,026 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.07 01:11:08" (1/1) ... [2020-07-01 13:11:08,029 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@457d8f6b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:11:08, skipping insertion in model container [2020-07-01 13:11:08,029 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.07 01:11:08" (1/1) ... [2020-07-01 13:11:08,037 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-01 13:11:08,054 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-01 13:11:08,272 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-01 13:11:08,284 INFO L203 MainTranslator]: Completed pre-run [2020-07-01 13:11:08,300 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-01 13:11:08,315 INFO L208 MainTranslator]: Completed translation [2020-07-01 13:11:08,316 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:11:08 WrapperNode [2020-07-01 13:11:08,316 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-01 13:11:08,317 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-07-01 13:11:08,317 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-07-01 13:11:08,317 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-07-01 13:11:08,326 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:11:08" (1/1) ... [2020-07-01 13:11:08,334 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:11:08" (1/1) ... [2020-07-01 13:11:08,355 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-07-01 13:11:08,356 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-01 13:11:08,356 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-01 13:11:08,356 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-01 13:11:08,365 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:11:08" (1/1) ... [2020-07-01 13:11:08,365 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:11:08" (1/1) ... [2020-07-01 13:11:08,367 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:11:08" (1/1) ... [2020-07-01 13:11:08,367 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:11:08" (1/1) ... [2020-07-01 13:11:08,371 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:11:08" (1/1) ... [2020-07-01 13:11:08,376 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:11:08" (1/1) ... [2020-07-01 13:11:08,377 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:11:08" (1/1) ... [2020-07-01 13:11:08,379 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-01 13:11:08,379 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-01 13:11:08,379 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-01 13:11:08,380 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-01 13:11:08,380 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:11:08" (1/1) ... No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 [2020-07-01 13:11:08,451 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-01 13:11:08,451 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-01 13:11:08,451 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-01 13:11:08,452 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-01 13:11:08,452 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-01 13:11:08,452 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-01 13:11:08,717 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-01 13:11:08,718 INFO L295 CfgBuilder]: Removed 7 assume(true) statements. [2020-07-01 13:11:08,722 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.07 01:11:08 BoogieIcfgContainer [2020-07-01 13:11:08,722 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-01 13:11:08,722 INFO L113 PluginConnector]: ------------------------BlockEncodingV2---------------------------- [2020-07-01 13:11:08,722 INFO L271 PluginConnector]: Initializing BlockEncodingV2... [2020-07-01 13:11:08,724 INFO L275 PluginConnector]: BlockEncodingV2 initialized [2020-07-01 13:11:08,725 INFO L185 PluginConnector]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.07 01:11:08" (1/1) ... [2020-07-01 13:11:08,739 INFO L313 BlockEncoder]: Initial Icfg 44 locations, 45 edges [2020-07-01 13:11:08,740 INFO L258 BlockEncoder]: Using Remove infeasible edges [2020-07-01 13:11:08,741 INFO L263 BlockEncoder]: Using Maximize final states [2020-07-01 13:11:08,741 INFO L270 BlockEncoder]: Using Minimize states even if more edges are added than removed.=false [2020-07-01 13:11:08,742 INFO L276 BlockEncoder]: Using Minimize states using LBE with the strategy=SINGLE [2020-07-01 13:11:08,744 INFO L296 BlockEncoder]: Using Remove sink states [2020-07-01 13:11:08,745 INFO L171 BlockEncoder]: Using Apply optimizations until nothing changes=true [2020-07-01 13:11:08,745 INFO L179 BlockEncoder]: Using Rewrite not-equals [2020-07-01 13:11:08,768 INFO L185 BlockEncoder]: Using Use SBE [2020-07-01 13:11:08,806 INFO L200 BlockEncoder]: SBE split 23 edges [2020-07-01 13:11:08,811 INFO L70 emoveInfeasibleEdges]: Removed 1 edges and 0 locations because of local infeasibility [2020-07-01 13:11:08,813 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-07-01 13:11:08,843 INFO L100 BaseMinimizeStates]: Removed 14 edges and 7 locations by large block encoding [2020-07-01 13:11:08,846 INFO L70 RemoveSinkStates]: Removed 1 edges and 1 locations by removing sink states [2020-07-01 13:11:08,848 INFO L70 emoveInfeasibleEdges]: Removed 0 edges and 0 locations because of local infeasibility [2020-07-01 13:11:08,848 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-07-01 13:11:08,848 INFO L100 BaseMinimizeStates]: Removed 0 edges and 0 locations by large block encoding [2020-07-01 13:11:08,849 INFO L70 RemoveSinkStates]: Removed 0 edges and 0 locations by removing sink states [2020-07-01 13:11:08,849 INFO L313 BlockEncoder]: Encoded RCFG 36 locations, 65 edges [2020-07-01 13:11:08,850 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 01.07 01:11:08 BasicIcfg [2020-07-01 13:11:08,850 INFO L132 PluginConnector]: ------------------------ END BlockEncodingV2---------------------------- [2020-07-01 13:11:08,851 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-01 13:11:08,852 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-01 13:11:08,855 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-01 13:11:08,855 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 01.07 01:11:08" (1/4) ... [2020-07-01 13:11:08,856 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a9e8344 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.07 01:11:08, skipping insertion in model container [2020-07-01 13:11:08,856 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:11:08" (2/4) ... [2020-07-01 13:11:08,856 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a9e8344 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.07 01:11:08, skipping insertion in model container [2020-07-01 13:11:08,857 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.07 01:11:08" (3/4) ... [2020-07-01 13:11:08,857 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a9e8344 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.07 01:11:08, skipping insertion in model container [2020-07-01 13:11:08,857 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 01.07 01:11:08" (4/4) ... [2020-07-01 13:11:08,859 INFO L109 eAbstractionObserver]: Analyzing ICFG theBenchmark.c_BEv2 [2020-07-01 13:11:08,870 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2020-07-01 13:11:08,877 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 22 error locations. [2020-07-01 13:11:08,891 INFO L251 AbstractCegarLoop]: Starting to check reachability of 22 error locations. [2020-07-01 13:11:08,915 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-01 13:11:08,915 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-01 13:11:08,915 INFO L377 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2020-07-01 13:11:08,915 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-01 13:11:08,916 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-01 13:11:08,916 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-01 13:11:08,916 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-01 13:11:08,916 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-01 13:11:08,931 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states. [2020-07-01 13:11:08,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-07-01 13:11:08,937 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 13:11:08,938 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-07-01 13:11:08,938 INFO L427 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-07-01 13:11:08,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:11:08,944 INFO L82 PathProgramCache]: Analyzing trace with hash 111734, now seen corresponding path program 1 times [2020-07-01 13:11:08,954 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:11:08,954 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [808485056] [2020-07-01 13:11:08,955 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:11:09,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:11:09,108 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 13:11:09,109 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [808485056] [2020-07-01 13:11:09,110 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 13:11:09,110 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 13:11:09,111 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1899148740] [2020-07-01 13:11:09,116 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 13:11:09,116 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 13:11:09,130 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 13:11:09,131 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 13:11:09,133 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 3 states. [2020-07-01 13:11:09,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 13:11:09,267 INFO L93 Difference]: Finished difference Result 70 states and 121 transitions. [2020-07-01 13:11:09,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 13:11:09,269 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-07-01 13:11:09,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 13:11:09,281 INFO L225 Difference]: With dead ends: 70 [2020-07-01 13:11:09,281 INFO L226 Difference]: Without dead ends: 36 [2020-07-01 13:11:09,284 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 13:11:09,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2020-07-01 13:11:09,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2020-07-01 13:11:09,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2020-07-01 13:11:09,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 58 transitions. [2020-07-01 13:11:09,323 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 58 transitions. Word has length 3 [2020-07-01 13:11:09,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 13:11:09,323 INFO L479 AbstractCegarLoop]: Abstraction has 36 states and 58 transitions. [2020-07-01 13:11:09,324 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 13:11:09,324 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 58 transitions. [2020-07-01 13:11:09,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-07-01 13:11:09,324 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 13:11:09,324 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-07-01 13:11:09,326 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-01 13:11:09,326 INFO L427 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-07-01 13:11:09,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:11:09,327 INFO L82 PathProgramCache]: Analyzing trace with hash 111703, now seen corresponding path program 1 times [2020-07-01 13:11:09,327 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:11:09,327 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1856495795] [2020-07-01 13:11:09,327 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:11:09,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:11:09,384 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 13:11:09,384 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1856495795] [2020-07-01 13:11:09,385 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 13:11:09,385 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 13:11:09,385 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [949946719] [2020-07-01 13:11:09,387 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 13:11:09,387 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 13:11:09,387 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 13:11:09,388 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 13:11:09,388 INFO L87 Difference]: Start difference. First operand 36 states and 58 transitions. Second operand 3 states. [2020-07-01 13:11:09,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 13:11:09,475 INFO L93 Difference]: Finished difference Result 36 states and 58 transitions. [2020-07-01 13:11:09,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 13:11:09,494 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-07-01 13:11:09,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 13:11:09,495 INFO L225 Difference]: With dead ends: 36 [2020-07-01 13:11:09,496 INFO L226 Difference]: Without dead ends: 34 [2020-07-01 13:11:09,496 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 13:11:09,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2020-07-01 13:11:09,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2020-07-01 13:11:09,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2020-07-01 13:11:09,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 54 transitions. [2020-07-01 13:11:09,501 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 54 transitions. Word has length 3 [2020-07-01 13:11:09,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 13:11:09,502 INFO L479 AbstractCegarLoop]: Abstraction has 34 states and 54 transitions. [2020-07-01 13:11:09,502 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 13:11:09,502 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 54 transitions. [2020-07-01 13:11:09,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-07-01 13:11:09,502 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 13:11:09,503 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-07-01 13:11:09,503 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-01 13:11:09,503 INFO L427 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-07-01 13:11:09,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:11:09,503 INFO L82 PathProgramCache]: Analyzing trace with hash 111705, now seen corresponding path program 1 times [2020-07-01 13:11:09,504 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:11:09,504 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [174574835] [2020-07-01 13:11:09,504 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:11:09,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:11:09,546 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 13:11:09,546 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [174574835] [2020-07-01 13:11:09,546 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 13:11:09,547 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 13:11:09,547 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [486625333] [2020-07-01 13:11:09,547 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 13:11:09,547 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 13:11:09,548 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 13:11:09,548 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 13:11:09,548 INFO L87 Difference]: Start difference. First operand 34 states and 54 transitions. Second operand 3 states. [2020-07-01 13:11:09,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 13:11:09,646 INFO L93 Difference]: Finished difference Result 34 states and 54 transitions. [2020-07-01 13:11:09,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 13:11:09,647 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-07-01 13:11:09,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 13:11:09,647 INFO L225 Difference]: With dead ends: 34 [2020-07-01 13:11:09,648 INFO L226 Difference]: Without dead ends: 32 [2020-07-01 13:11:09,648 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 13:11:09,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2020-07-01 13:11:09,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2020-07-01 13:11:09,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2020-07-01 13:11:09,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 50 transitions. [2020-07-01 13:11:09,653 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 50 transitions. Word has length 3 [2020-07-01 13:11:09,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 13:11:09,653 INFO L479 AbstractCegarLoop]: Abstraction has 32 states and 50 transitions. [2020-07-01 13:11:09,653 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 13:11:09,653 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 50 transitions. [2020-07-01 13:11:09,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2020-07-01 13:11:09,654 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 13:11:09,654 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2020-07-01 13:11:09,654 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-01 13:11:09,654 INFO L427 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-07-01 13:11:09,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:11:09,655 INFO L82 PathProgramCache]: Analyzing trace with hash 3460575, now seen corresponding path program 1 times [2020-07-01 13:11:09,655 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:11:09,655 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [898665491] [2020-07-01 13:11:09,655 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:11:09,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:11:09,684 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 13:11:09,685 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [898665491] [2020-07-01 13:11:09,685 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 13:11:09,685 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 13:11:09,685 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1658185572] [2020-07-01 13:11:09,686 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 13:11:09,686 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 13:11:09,686 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 13:11:09,686 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 13:11:09,687 INFO L87 Difference]: Start difference. First operand 32 states and 50 transitions. Second operand 3 states. [2020-07-01 13:11:09,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 13:11:09,752 INFO L93 Difference]: Finished difference Result 32 states and 50 transitions. [2020-07-01 13:11:09,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 13:11:09,753 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2020-07-01 13:11:09,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 13:11:09,754 INFO L225 Difference]: With dead ends: 32 [2020-07-01 13:11:09,754 INFO L226 Difference]: Without dead ends: 28 [2020-07-01 13:11:09,754 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 13:11:09,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2020-07-01 13:11:09,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2020-07-01 13:11:09,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2020-07-01 13:11:09,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 42 transitions. [2020-07-01 13:11:09,758 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 42 transitions. Word has length 4 [2020-07-01 13:11:09,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 13:11:09,759 INFO L479 AbstractCegarLoop]: Abstraction has 28 states and 42 transitions. [2020-07-01 13:11:09,759 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 13:11:09,759 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 42 transitions. [2020-07-01 13:11:09,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2020-07-01 13:11:09,759 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 13:11:09,759 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2020-07-01 13:11:09,760 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-01 13:11:09,760 INFO L427 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-07-01 13:11:09,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:11:09,760 INFO L82 PathProgramCache]: Analyzing trace with hash 3460577, now seen corresponding path program 1 times [2020-07-01 13:11:09,760 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:11:09,761 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [537479186] [2020-07-01 13:11:09,761 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:11:09,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:11:09,793 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 13:11:09,794 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [537479186] [2020-07-01 13:11:09,794 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 13:11:09,794 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 13:11:09,794 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1636113973] [2020-07-01 13:11:09,795 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 13:11:09,795 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 13:11:09,795 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 13:11:09,795 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 13:11:09,795 INFO L87 Difference]: Start difference. First operand 28 states and 42 transitions. Second operand 3 states. [2020-07-01 13:11:09,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 13:11:09,850 INFO L93 Difference]: Finished difference Result 32 states and 42 transitions. [2020-07-01 13:11:09,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 13:11:09,851 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2020-07-01 13:11:09,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 13:11:09,852 INFO L225 Difference]: With dead ends: 32 [2020-07-01 13:11:09,852 INFO L226 Difference]: Without dead ends: 28 [2020-07-01 13:11:09,853 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 13:11:09,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2020-07-01 13:11:09,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2020-07-01 13:11:09,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2020-07-01 13:11:09,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 38 transitions. [2020-07-01 13:11:09,856 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 38 transitions. Word has length 4 [2020-07-01 13:11:09,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 13:11:09,857 INFO L479 AbstractCegarLoop]: Abstraction has 28 states and 38 transitions. [2020-07-01 13:11:09,857 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 13:11:09,857 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 38 transitions. [2020-07-01 13:11:09,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2020-07-01 13:11:09,857 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 13:11:09,857 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2020-07-01 13:11:09,858 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-07-01 13:11:09,858 INFO L427 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-07-01 13:11:09,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:11:09,858 INFO L82 PathProgramCache]: Analyzing trace with hash 3460578, now seen corresponding path program 1 times [2020-07-01 13:11:09,858 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:11:09,859 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [186193231] [2020-07-01 13:11:09,859 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:11:09,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:11:09,895 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 13:11:09,895 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [186193231] [2020-07-01 13:11:09,896 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 13:11:09,896 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 13:11:09,896 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [907761535] [2020-07-01 13:11:09,896 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 13:11:09,897 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 13:11:09,897 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 13:11:09,897 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 13:11:09,897 INFO L87 Difference]: Start difference. First operand 28 states and 38 transitions. Second operand 3 states. [2020-07-01 13:11:09,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 13:11:09,967 INFO L93 Difference]: Finished difference Result 28 states and 38 transitions. [2020-07-01 13:11:09,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 13:11:09,968 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2020-07-01 13:11:09,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 13:11:09,969 INFO L225 Difference]: With dead ends: 28 [2020-07-01 13:11:09,969 INFO L226 Difference]: Without dead ends: 23 [2020-07-01 13:11:09,969 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 13:11:09,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2020-07-01 13:11:09,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2020-07-01 13:11:09,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2020-07-01 13:11:09,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 33 transitions. [2020-07-01 13:11:09,973 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 33 transitions. Word has length 4 [2020-07-01 13:11:09,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 13:11:09,973 INFO L479 AbstractCegarLoop]: Abstraction has 23 states and 33 transitions. [2020-07-01 13:11:09,973 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 13:11:09,974 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 33 transitions. [2020-07-01 13:11:09,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-07-01 13:11:09,974 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 13:11:09,974 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-07-01 13:11:09,974 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-07-01 13:11:09,974 INFO L427 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-07-01 13:11:09,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:11:09,975 INFO L82 PathProgramCache]: Analyzing trace with hash 107276078, now seen corresponding path program 1 times [2020-07-01 13:11:09,975 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:11:09,975 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1696830280] [2020-07-01 13:11:09,975 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:11:09,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:11:10,008 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 13:11:10,009 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1696830280] [2020-07-01 13:11:10,009 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 13:11:10,009 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 13:11:10,009 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1736427777] [2020-07-01 13:11:10,010 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 13:11:10,010 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 13:11:10,010 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 13:11:10,010 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 13:11:10,010 INFO L87 Difference]: Start difference. First operand 23 states and 33 transitions. Second operand 3 states. [2020-07-01 13:11:10,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 13:11:10,053 INFO L93 Difference]: Finished difference Result 28 states and 33 transitions. [2020-07-01 13:11:10,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 13:11:10,054 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2020-07-01 13:11:10,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 13:11:10,055 INFO L225 Difference]: With dead ends: 28 [2020-07-01 13:11:10,055 INFO L226 Difference]: Without dead ends: 23 [2020-07-01 13:11:10,056 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 13:11:10,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2020-07-01 13:11:10,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2020-07-01 13:11:10,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2020-07-01 13:11:10,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 28 transitions. [2020-07-01 13:11:10,059 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 28 transitions. Word has length 5 [2020-07-01 13:11:10,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 13:11:10,060 INFO L479 AbstractCegarLoop]: Abstraction has 23 states and 28 transitions. [2020-07-01 13:11:10,060 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 13:11:10,060 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 28 transitions. [2020-07-01 13:11:10,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-07-01 13:11:10,061 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 13:11:10,061 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-07-01 13:11:10,061 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-07-01 13:11:10,061 INFO L427 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-07-01 13:11:10,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:11:10,061 INFO L82 PathProgramCache]: Analyzing trace with hash 107276079, now seen corresponding path program 1 times [2020-07-01 13:11:10,062 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:11:10,062 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1168159284] [2020-07-01 13:11:10,063 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:11:10,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:11:10,107 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 13:11:10,107 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1168159284] [2020-07-01 13:11:10,108 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 13:11:10,108 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 13:11:10,109 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1233689886] [2020-07-01 13:11:10,109 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 13:11:10,109 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 13:11:10,109 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 13:11:10,109 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 13:11:10,110 INFO L87 Difference]: Start difference. First operand 23 states and 28 transitions. Second operand 3 states. [2020-07-01 13:11:10,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 13:11:10,149 INFO L93 Difference]: Finished difference Result 23 states and 28 transitions. [2020-07-01 13:11:10,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 13:11:10,149 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2020-07-01 13:11:10,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 13:11:10,150 INFO L225 Difference]: With dead ends: 23 [2020-07-01 13:11:10,150 INFO L226 Difference]: Without dead ends: 18 [2020-07-01 13:11:10,151 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 13:11:10,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2020-07-01 13:11:10,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2020-07-01 13:11:10,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2020-07-01 13:11:10,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 23 transitions. [2020-07-01 13:11:10,153 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 23 transitions. Word has length 5 [2020-07-01 13:11:10,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 13:11:10,154 INFO L479 AbstractCegarLoop]: Abstraction has 18 states and 23 transitions. [2020-07-01 13:11:10,154 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 13:11:10,154 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 23 transitions. [2020-07-01 13:11:10,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-07-01 13:11:10,154 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 13:11:10,154 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-07-01 13:11:10,155 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-07-01 13:11:10,155 INFO L427 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-07-01 13:11:10,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:11:10,155 INFO L82 PathProgramCache]: Analyzing trace with hash 107276076, now seen corresponding path program 1 times [2020-07-01 13:11:10,155 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:11:10,155 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [77827180] [2020-07-01 13:11:10,156 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:11:10,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:11:10,185 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 13:11:10,185 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [77827180] [2020-07-01 13:11:10,186 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 13:11:10,186 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 13:11:10,186 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [15570162] [2020-07-01 13:11:10,186 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 13:11:10,187 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 13:11:10,187 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 13:11:10,187 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 13:11:10,187 INFO L87 Difference]: Start difference. First operand 18 states and 23 transitions. Second operand 3 states. [2020-07-01 13:11:10,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 13:11:10,226 INFO L93 Difference]: Finished difference Result 18 states and 23 transitions. [2020-07-01 13:11:10,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 13:11:10,226 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2020-07-01 13:11:10,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 13:11:10,227 INFO L225 Difference]: With dead ends: 18 [2020-07-01 13:11:10,227 INFO L226 Difference]: Without dead ends: 0 [2020-07-01 13:11:10,227 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 13:11:10,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-07-01 13:11:10,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-07-01 13:11:10,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-07-01 13:11:10,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-07-01 13:11:10,228 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 5 [2020-07-01 13:11:10,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 13:11:10,229 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-01 13:11:10,229 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 13:11:10,229 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-01 13:11:10,229 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-01 13:11:10,229 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-07-01 13:11:10,232 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-07-01 13:11:10,272 INFO L268 CegarLoopResult]: For program point L13(line 13) no Hoare annotation was computed. [2020-07-01 13:11:10,272 INFO L268 CegarLoopResult]: For program point L13-1(line 13) no Hoare annotation was computed. [2020-07-01 13:11:10,272 INFO L268 CegarLoopResult]: For program point L11(line 11) no Hoare annotation was computed. [2020-07-01 13:11:10,272 INFO L268 CegarLoopResult]: For program point L13-2(line 13) no Hoare annotation was computed. [2020-07-01 13:11:10,273 INFO L268 CegarLoopResult]: For program point L-1(line -1) no Hoare annotation was computed. [2020-07-01 13:11:10,273 INFO L268 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2020-07-01 13:11:10,273 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr21REQUIRES_VIOLATION(line 15) no Hoare annotation was computed. [2020-07-01 13:11:10,273 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr18REQUIRES_VIOLATION(line 12) no Hoare annotation was computed. [2020-07-01 13:11:10,273 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr17REQUIRES_VIOLATION(line 12) no Hoare annotation was computed. [2020-07-01 13:11:10,273 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr20REQUIRES_VIOLATION(line 15) no Hoare annotation was computed. [2020-07-01 13:11:10,273 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr19REQUIRES_VIOLATION(line 12) no Hoare annotation was computed. [2020-07-01 13:11:10,273 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr14REQUIRES_VIOLATION(line 13) no Hoare annotation was computed. [2020-07-01 13:11:10,273 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr13REQUIRES_VIOLATION(line 13) no Hoare annotation was computed. [2020-07-01 13:11:10,274 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr16REQUIRES_VIOLATION(line 12) no Hoare annotation was computed. [2020-07-01 13:11:10,274 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr15REQUIRES_VIOLATION(line 13) no Hoare annotation was computed. [2020-07-01 13:11:10,274 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr10REQUIRES_VIOLATION(line 13) no Hoare annotation was computed. [2020-07-01 13:11:10,274 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr9REQUIRES_VIOLATION(line 12) no Hoare annotation was computed. [2020-07-01 13:11:10,274 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr12REQUIRES_VIOLATION(line 13) no Hoare annotation was computed. [2020-07-01 13:11:10,274 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr11REQUIRES_VIOLATION(line 13) no Hoare annotation was computed. [2020-07-01 13:11:10,274 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr6REQUIRES_VIOLATION(line 12) no Hoare annotation was computed. [2020-07-01 13:11:10,274 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr5REQUIRES_VIOLATION(line 12) no Hoare annotation was computed. [2020-07-01 13:11:10,275 INFO L268 CegarLoopResult]: For program point L12-1(line 12) no Hoare annotation was computed. [2020-07-01 13:11:10,275 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr8REQUIRES_VIOLATION(line 12) no Hoare annotation was computed. [2020-07-01 13:11:10,275 INFO L268 CegarLoopResult]: For program point L10(line 10) no Hoare annotation was computed. [2020-07-01 13:11:10,275 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr7REQUIRES_VIOLATION(line 12) no Hoare annotation was computed. [2020-07-01 13:11:10,275 INFO L268 CegarLoopResult]: For program point L12-2(lines 12 14) no Hoare annotation was computed. [2020-07-01 13:11:10,275 INFO L268 CegarLoopResult]: For program point L10-1(line 10) no Hoare annotation was computed. [2020-07-01 13:11:10,275 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr2REQUIRES_VIOLATION(line 11) no Hoare annotation was computed. [2020-07-01 13:11:10,275 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr1REQUIRES_VIOLATION(line 10) no Hoare annotation was computed. [2020-07-01 13:11:10,275 INFO L268 CegarLoopResult]: For program point L12-4(lines 12 14) no Hoare annotation was computed. [2020-07-01 13:11:10,276 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr4REQUIRES_VIOLATION(line 12) no Hoare annotation was computed. [2020-07-01 13:11:10,276 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr3REQUIRES_VIOLATION(line 11) no Hoare annotation was computed. [2020-07-01 13:11:10,276 INFO L268 CegarLoopResult]: For program point L12-6(line 12) no Hoare annotation was computed. [2020-07-01 13:11:10,277 INFO L264 CegarLoopResult]: At program point L12-8(lines 12 14) the Hoare annotation is: (and (= 4 (select |#length| ULTIMATE.start_iterate_~bound_ref~0.base)) (= 1 (select |#valid| ULTIMATE.start_iterate_~i~0.base)) (= 4 (select |#length| ULTIMATE.start_iterate_~i~0.base)) (= 1 (select |#valid| ULTIMATE.start_iterate_~bound_ref~0.base)) (= 4 (select |#length| ULTIMATE.start_iterate_~sum~0.base)) (= 0 ULTIMATE.start_iterate_~sum~0.offset) (<= 1 |#StackHeapBarrier|) (= ULTIMATE.start_iterate_~bound_ref~0.offset 0) (= 0 ULTIMATE.start_iterate_~i~0.offset) (= 1 (select |#valid| ULTIMATE.start_iterate_~sum~0.base))) [2020-07-01 13:11:10,277 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr0REQUIRES_VIOLATION(line 10) no Hoare annotation was computed. [2020-07-01 13:11:10,277 INFO L268 CegarLoopResult]: For program point L12-9(lines 12 14) no Hoare annotation was computed. [2020-07-01 13:11:10,280 INFO L308 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2020-07-01 13:11:10,289 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:11:10,290 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:11:10,290 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:11:10,291 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-01 13:11:10,297 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:11:10,298 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:11:10,298 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:11:10,298 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-01 13:11:10,301 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.07 01:11:10 BasicIcfg [2020-07-01 13:11:10,301 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-01 13:11:10,302 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-07-01 13:11:10,302 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-07-01 13:11:10,305 INFO L275 PluginConnector]: BuchiAutomizer initialized [2020-07-01 13:11:10,306 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 13:11:10,306 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 01.07 01:11:08" (1/5) ... [2020-07-01 13:11:10,307 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1ed783d7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.07 01:11:10, skipping insertion in model container [2020-07-01 13:11:10,307 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 13:11:10,307 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:11:08" (2/5) ... [2020-07-01 13:11:10,307 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1ed783d7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.07 01:11:10, skipping insertion in model container [2020-07-01 13:11:10,308 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 13:11:10,308 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.07 01:11:08" (3/5) ... [2020-07-01 13:11:10,308 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1ed783d7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 01.07 01:11:10, skipping insertion in model container [2020-07-01 13:11:10,308 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 13:11:10,308 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 01.07 01:11:08" (4/5) ... [2020-07-01 13:11:10,308 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1ed783d7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 01.07 01:11:10, skipping insertion in model container [2020-07-01 13:11:10,309 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 13:11:10,309 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.07 01:11:10" (5/5) ... [2020-07-01 13:11:10,310 INFO L371 chiAutomizerObserver]: Analyzing ICFG theBenchmark.c_BEv2 [2020-07-01 13:11:10,333 INFO L356 BuchiCegarLoop]: Interprodecural is true [2020-07-01 13:11:10,333 INFO L357 BuchiCegarLoop]: Hoare is true [2020-07-01 13:11:10,333 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-07-01 13:11:10,333 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-01 13:11:10,333 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-01 13:11:10,333 INFO L361 BuchiCegarLoop]: Difference is false [2020-07-01 13:11:10,334 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-01 13:11:10,334 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-07-01 13:11:10,337 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 36 states. [2020-07-01 13:11:10,343 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2020-07-01 13:11:10,344 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-01 13:11:10,344 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-01 13:11:10,349 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2020-07-01 13:11:10,350 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 13:11:10,350 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2020-07-01 13:11:10,350 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 36 states. [2020-07-01 13:11:10,352 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2020-07-01 13:11:10,352 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-01 13:11:10,352 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-01 13:11:10,352 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2020-07-01 13:11:10,353 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 13:11:10,358 INFO L794 eck$LassoCheckResult]: Stem: 28#ULTIMATE.startENTRYtrue [81] ULTIMATE.startENTRY-->L-1: Formula: (and (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= |v_#valid_1| (store |v_#valid_2| 0 0)) (= |v_#NULL.offset_1| 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_2|} OutVars{#NULL.offset=|v_#NULL.offset_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #NULL.base=|v_#NULL.base_1|, #valid=|v_#valid_1|} AuxVars[] AssignedVars[#valid, #NULL.offset, #NULL.base] 9#L-1true [127] L-1-->L10: Formula: (let ((.cse0 (store |v_#valid_6| |v_ULTIMATE.start_iterate_#t~malloc0.base_1| 1))) (let ((.cse1 (store .cse0 |v_ULTIMATE.start_iterate_#t~malloc1.base_1| 1))) (and (= v_ULTIMATE.start_iterate_~bound_1 |v_ULTIMATE.start_iterate_#in~bound_1|) (= v_ULTIMATE.start_iterate_~bound_ref~0.base_1 |v_ULTIMATE.start_iterate_#t~malloc0.base_1|) (= (select |v_#valid_6| |v_ULTIMATE.start_iterate_#t~malloc0.base_1|) 0) (= 0 |v_ULTIMATE.start_iterate_#t~malloc1.offset_1|) (= v_ULTIMATE.start_iterate_~sum~0.base_1 |v_ULTIMATE.start_iterate_#t~malloc2.base_1|) (= |v_ULTIMATE.start_iterate_#in~bound_1| |v_ULTIMATE.start_main_#t~nondet10_1|) (= v_ULTIMATE.start_iterate_~i~0.base_1 |v_ULTIMATE.start_iterate_#t~malloc1.base_1|) (= v_ULTIMATE.start_iterate_~bound_ref~0.offset_1 |v_ULTIMATE.start_iterate_#t~malloc0.offset_1|) (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start_iterate_#t~malloc1.base_1|) (= (store (store (store |v_#length_4| |v_ULTIMATE.start_iterate_#t~malloc0.base_1| 4) |v_ULTIMATE.start_iterate_#t~malloc1.base_1| 4) |v_ULTIMATE.start_iterate_#t~malloc2.base_1| 4) |v_#length_1|) (< 0 |v_ULTIMATE.start_iterate_#t~malloc2.base_1|) (= v_ULTIMATE.start_iterate_~sum~0.offset_1 |v_ULTIMATE.start_iterate_#t~malloc2.offset_1|) (< 0 |v_ULTIMATE.start_iterate_#t~malloc0.base_1|) (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start_iterate_#t~malloc0.base_1|) (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start_iterate_#t~malloc2.base_1|) (= 0 (select .cse0 |v_ULTIMATE.start_iterate_#t~malloc1.base_1|)) (= 0 |v_ULTIMATE.start_iterate_#t~malloc2.offset_1|) (= (store .cse1 |v_ULTIMATE.start_iterate_#t~malloc2.base_1| 1) |v_#valid_3|) (< 0 |v_ULTIMATE.start_iterate_#t~malloc1.base_1|) (= 0 (select .cse1 |v_ULTIMATE.start_iterate_#t~malloc2.base_1|)) (= v_ULTIMATE.start_iterate_~i~0.offset_1 |v_ULTIMATE.start_iterate_#t~malloc1.offset_1|) (= 0 |v_ULTIMATE.start_iterate_#t~malloc0.offset_1|)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_4|, #valid=|v_#valid_6|} OutVars{ULTIMATE.start_main_#t~nondet10=|v_ULTIMATE.start_main_#t~nondet10_1|, ULTIMATE.start_iterate_#t~malloc0.offset=|v_ULTIMATE.start_iterate_#t~malloc0.offset_1|, ULTIMATE.start_iterate_~bound_ref~0.offset=v_ULTIMATE.start_iterate_~bound_ref~0.offset_1, ULTIMATE.start_iterate_#t~malloc0.base=|v_ULTIMATE.start_iterate_#t~malloc0.base_1|, ULTIMATE.start_iterate_#t~malloc1.base=|v_ULTIMATE.start_iterate_#t~malloc1.base_1|, ULTIMATE.start_iterate_#t~malloc2.base=|v_ULTIMATE.start_iterate_#t~malloc2.base_1|, ULTIMATE.start_iterate_~i~0.offset=v_ULTIMATE.start_iterate_~i~0.offset_1, ULTIMATE.start_iterate_~sum~0.offset=v_ULTIMATE.start_iterate_~sum~0.offset_1, ULTIMATE.start_iterate_~bound_ref~0.base=v_ULTIMATE.start_iterate_~bound_ref~0.base_1, #length=|v_#length_1|, ULTIMATE.start_iterate_~i~0.base=v_ULTIMATE.start_iterate_~i~0.base_1, ULTIMATE.start_iterate_#t~post4=|v_ULTIMATE.start_iterate_#t~post4_1|, ULTIMATE.start_iterate_#t~malloc2.offset=|v_ULTIMATE.start_iterate_#t~malloc2.offset_1|, #StackHeapBarrier=|v_#StackHeapBarrier_2|, ULTIMATE.start_iterate_#t~malloc1.offset=|v_ULTIMATE.start_iterate_#t~malloc1.offset_1|, ULTIMATE.start_iterate_#t~mem7=|v_ULTIMATE.start_iterate_#t~mem7_1|, ULTIMATE.start_iterate_#t~mem6=|v_ULTIMATE.start_iterate_#t~mem6_1|, ULTIMATE.start_iterate_#in~bound=|v_ULTIMATE.start_iterate_#in~bound_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, ULTIMATE.start_iterate_#t~mem9=|v_ULTIMATE.start_iterate_#t~mem9_1|, #valid=|v_#valid_3|, ULTIMATE.start_main_#t~ret11=|v_ULTIMATE.start_main_#t~ret11_1|, ULTIMATE.start_iterate_#t~mem8=|v_ULTIMATE.start_iterate_#t~mem8_1|, ULTIMATE.start_iterate_#t~mem3=|v_ULTIMATE.start_iterate_#t~mem3_1|, ULTIMATE.start_iterate_#t~mem5=|v_ULTIMATE.start_iterate_#t~mem5_1|, ULTIMATE.start_iterate_~bound=v_ULTIMATE.start_iterate_~bound_1, ULTIMATE.start_iterate_~sum~0.base=v_ULTIMATE.start_iterate_~sum~0.base_1, ULTIMATE.start_iterate_#res=|v_ULTIMATE.start_iterate_#res_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet10, ULTIMATE.start_iterate_#t~malloc0.offset, ULTIMATE.start_iterate_~bound_ref~0.offset, ULTIMATE.start_iterate_#t~malloc0.base, ULTIMATE.start_iterate_#t~malloc1.base, ULTIMATE.start_iterate_#t~malloc2.base, ULTIMATE.start_iterate_~i~0.offset, ULTIMATE.start_iterate_~sum~0.offset, ULTIMATE.start_iterate_~bound_ref~0.base, #length, ULTIMATE.start_iterate_~i~0.base, ULTIMATE.start_iterate_#t~post4, ULTIMATE.start_iterate_#t~malloc2.offset, ULTIMATE.start_iterate_#t~malloc1.offset, ULTIMATE.start_iterate_#t~mem7, ULTIMATE.start_iterate_#t~mem6, ULTIMATE.start_iterate_#in~bound, ULTIMATE.start_main_#res, ULTIMATE.start_iterate_#t~mem9, #valid, ULTIMATE.start_main_#t~ret11, ULTIMATE.start_iterate_#t~mem8, ULTIMATE.start_iterate_#t~mem3, ULTIMATE.start_iterate_#t~mem5, ULTIMATE.start_iterate_~bound, ULTIMATE.start_iterate_~sum~0.base, ULTIMATE.start_iterate_#res] 11#L10true [58] L10-->L10-1: Formula: (and (= 1 (select |v_#valid_7| v_ULTIMATE.start_iterate_~bound_ref~0.base_3)) (<= (+ v_ULTIMATE.start_iterate_~bound_ref~0.offset_3 4) (select |v_#length_5| v_ULTIMATE.start_iterate_~bound_ref~0.base_3)) (<= 0 v_ULTIMATE.start_iterate_~bound_ref~0.offset_3) (= (store |v_#memory_int_2| v_ULTIMATE.start_iterate_~bound_ref~0.base_3 (store (select |v_#memory_int_2| v_ULTIMATE.start_iterate_~bound_ref~0.base_3) v_ULTIMATE.start_iterate_~bound_ref~0.offset_3 v_ULTIMATE.start_iterate_~bound_3)) |v_#memory_int_1|)) InVars {#valid=|v_#valid_7|, #memory_int=|v_#memory_int_2|, ULTIMATE.start_iterate_~bound_ref~0.offset=v_ULTIMATE.start_iterate_~bound_ref~0.offset_3, ULTIMATE.start_iterate_~bound_ref~0.base=v_ULTIMATE.start_iterate_~bound_ref~0.base_3, #length=|v_#length_5|, ULTIMATE.start_iterate_~bound=v_ULTIMATE.start_iterate_~bound_3} OutVars{#valid=|v_#valid_7|, #memory_int=|v_#memory_int_1|, ULTIMATE.start_iterate_~bound_ref~0.offset=v_ULTIMATE.start_iterate_~bound_ref~0.offset_3, ULTIMATE.start_iterate_~bound_ref~0.base=v_ULTIMATE.start_iterate_~bound_ref~0.base_3, #length=|v_#length_5|, ULTIMATE.start_iterate_~bound=v_ULTIMATE.start_iterate_~bound_3} AuxVars[] AssignedVars[#memory_int] 25#L10-1true [77] L10-1-->L11: Formula: (and (<= 0 v_ULTIMATE.start_iterate_~sum~0.offset_3) (<= (+ v_ULTIMATE.start_iterate_~sum~0.offset_3 4) (select |v_#length_7| v_ULTIMATE.start_iterate_~sum~0.base_3)) (= 1 (select |v_#valid_9| v_ULTIMATE.start_iterate_~sum~0.base_3)) (= |v_#memory_int_3| (store |v_#memory_int_4| v_ULTIMATE.start_iterate_~sum~0.base_3 (store (select |v_#memory_int_4| v_ULTIMATE.start_iterate_~sum~0.base_3) v_ULTIMATE.start_iterate_~sum~0.offset_3 0)))) InVars {#memory_int=|v_#memory_int_4|, ULTIMATE.start_iterate_~sum~0.offset=v_ULTIMATE.start_iterate_~sum~0.offset_3, #length=|v_#length_7|, #valid=|v_#valid_9|, ULTIMATE.start_iterate_~sum~0.base=v_ULTIMATE.start_iterate_~sum~0.base_3} OutVars{#memory_int=|v_#memory_int_3|, ULTIMATE.start_iterate_~sum~0.offset=v_ULTIMATE.start_iterate_~sum~0.offset_3, #length=|v_#length_7|, #valid=|v_#valid_9|, ULTIMATE.start_iterate_~sum~0.base=v_ULTIMATE.start_iterate_~sum~0.base_3} AuxVars[] AssignedVars[#memory_int] 29#L11true [82] L11-->L12-8: Formula: (and (= 1 (select |v_#valid_11| v_ULTIMATE.start_iterate_~i~0.base_3)) (<= (+ v_ULTIMATE.start_iterate_~i~0.offset_3 4) (select |v_#length_9| v_ULTIMATE.start_iterate_~i~0.base_3)) (= |v_#memory_int_5| (store |v_#memory_int_6| v_ULTIMATE.start_iterate_~i~0.base_3 (store (select |v_#memory_int_6| v_ULTIMATE.start_iterate_~i~0.base_3) v_ULTIMATE.start_iterate_~i~0.offset_3 0))) (<= 0 v_ULTIMATE.start_iterate_~i~0.offset_3)) InVars {ULTIMATE.start_iterate_~i~0.offset=v_ULTIMATE.start_iterate_~i~0.offset_3, #memory_int=|v_#memory_int_6|, #length=|v_#length_9|, ULTIMATE.start_iterate_~i~0.base=v_ULTIMATE.start_iterate_~i~0.base_3, #valid=|v_#valid_11|} OutVars{ULTIMATE.start_iterate_~i~0.offset=v_ULTIMATE.start_iterate_~i~0.offset_3, #memory_int=|v_#memory_int_5|, #length=|v_#length_9|, ULTIMATE.start_iterate_~i~0.base=v_ULTIMATE.start_iterate_~i~0.base_3, #valid=|v_#valid_11|} AuxVars[] AssignedVars[#memory_int] 37#L12-8true [2020-07-01 13:11:10,359 INFO L796 eck$LassoCheckResult]: Loop: 37#L12-8true [98] L12-8-->L12-1: Formula: (and (<= (+ v_ULTIMATE.start_iterate_~i~0.offset_5 4) (select |v_#length_11| v_ULTIMATE.start_iterate_~i~0.base_6)) (= (select (select |v_#memory_int_7| v_ULTIMATE.start_iterate_~i~0.base_6) v_ULTIMATE.start_iterate_~i~0.offset_5) |v_ULTIMATE.start_iterate_#t~mem5_2|) (<= 0 v_ULTIMATE.start_iterate_~i~0.offset_5) (= 1 (select |v_#valid_13| v_ULTIMATE.start_iterate_~i~0.base_6))) InVars {ULTIMATE.start_iterate_~i~0.offset=v_ULTIMATE.start_iterate_~i~0.offset_5, #memory_int=|v_#memory_int_7|, #length=|v_#length_11|, ULTIMATE.start_iterate_~i~0.base=v_ULTIMATE.start_iterate_~i~0.base_6, #valid=|v_#valid_13|} OutVars{ULTIMATE.start_iterate_~i~0.offset=v_ULTIMATE.start_iterate_~i~0.offset_5, #valid=|v_#valid_13|, #memory_int=|v_#memory_int_7|, ULTIMATE.start_iterate_#t~mem5=|v_ULTIMATE.start_iterate_#t~mem5_2|, #length=|v_#length_11|, ULTIMATE.start_iterate_~i~0.base=v_ULTIMATE.start_iterate_~i~0.base_6} AuxVars[] AssignedVars[ULTIMATE.start_iterate_#t~mem5] 14#L12-1true [63] L12-1-->L12-2: Formula: (and (<= (+ v_ULTIMATE.start_iterate_~bound_ref~0.offset_5 4) (select |v_#length_13| v_ULTIMATE.start_iterate_~bound_ref~0.base_6)) (= 1 (select |v_#valid_15| v_ULTIMATE.start_iterate_~bound_ref~0.base_6)) (<= 0 v_ULTIMATE.start_iterate_~bound_ref~0.offset_5) (= |v_ULTIMATE.start_iterate_#t~mem6_2| (select (select |v_#memory_int_8| v_ULTIMATE.start_iterate_~bound_ref~0.base_6) v_ULTIMATE.start_iterate_~bound_ref~0.offset_5))) InVars {ULTIMATE.start_iterate_~bound_ref~0.offset=v_ULTIMATE.start_iterate_~bound_ref~0.offset_5, #memory_int=|v_#memory_int_8|, ULTIMATE.start_iterate_~bound_ref~0.base=v_ULTIMATE.start_iterate_~bound_ref~0.base_6, #length=|v_#length_13|, #valid=|v_#valid_15|} OutVars{ULTIMATE.start_iterate_#t~mem6=|v_ULTIMATE.start_iterate_#t~mem6_2|, #valid=|v_#valid_15|, ULTIMATE.start_iterate_~bound_ref~0.offset=v_ULTIMATE.start_iterate_~bound_ref~0.offset_5, #memory_int=|v_#memory_int_8|, ULTIMATE.start_iterate_~bound_ref~0.base=v_ULTIMATE.start_iterate_~bound_ref~0.base_6, #length=|v_#length_13|} AuxVars[] AssignedVars[ULTIMATE.start_iterate_#t~mem6] 12#L12-2true [62] L12-2-->L13: Formula: (< |v_ULTIMATE.start_iterate_#t~mem5_6| |v_ULTIMATE.start_iterate_#t~mem6_6|) InVars {ULTIMATE.start_iterate_#t~mem6=|v_ULTIMATE.start_iterate_#t~mem6_6|, ULTIMATE.start_iterate_#t~mem5=|v_ULTIMATE.start_iterate_#t~mem5_6|} OutVars{ULTIMATE.start_iterate_#t~mem6=|v_ULTIMATE.start_iterate_#t~mem6_5|, ULTIMATE.start_iterate_#t~mem5=|v_ULTIMATE.start_iterate_#t~mem5_5|} AuxVars[] AssignedVars[ULTIMATE.start_iterate_#t~mem6, ULTIMATE.start_iterate_#t~mem5] 34#L13true [91] L13-->L13-1: Formula: (and (= 1 (select |v_#valid_17| v_ULTIMATE.start_iterate_~sum~0.base_6)) (<= 0 v_ULTIMATE.start_iterate_~sum~0.offset_5) (<= (+ v_ULTIMATE.start_iterate_~sum~0.offset_5 4) (select |v_#length_15| v_ULTIMATE.start_iterate_~sum~0.base_6)) (= |v_ULTIMATE.start_iterate_#t~mem7_2| (select (select |v_#memory_int_9| v_ULTIMATE.start_iterate_~sum~0.base_6) v_ULTIMATE.start_iterate_~sum~0.offset_5))) InVars {#memory_int=|v_#memory_int_9|, ULTIMATE.start_iterate_~sum~0.offset=v_ULTIMATE.start_iterate_~sum~0.offset_5, #length=|v_#length_15|, #valid=|v_#valid_17|, ULTIMATE.start_iterate_~sum~0.base=v_ULTIMATE.start_iterate_~sum~0.base_6} OutVars{ULTIMATE.start_iterate_~sum~0.offset=v_ULTIMATE.start_iterate_~sum~0.offset_5, ULTIMATE.start_iterate_#t~mem7=|v_ULTIMATE.start_iterate_#t~mem7_2|, #valid=|v_#valid_17|, #memory_int=|v_#memory_int_9|, #length=|v_#length_15|, ULTIMATE.start_iterate_~sum~0.base=v_ULTIMATE.start_iterate_~sum~0.base_6} AuxVars[] AssignedVars[ULTIMATE.start_iterate_#t~mem7] 32#L13-1true [88] L13-1-->L13-2: Formula: (and (<= 0 v_ULTIMATE.start_iterate_~i~0.offset_7) (= 1 (select |v_#valid_19| v_ULTIMATE.start_iterate_~i~0.base_9)) (<= (+ v_ULTIMATE.start_iterate_~i~0.offset_7 4) (select |v_#length_17| v_ULTIMATE.start_iterate_~i~0.base_9)) (= |v_ULTIMATE.start_iterate_#t~mem8_2| (select (select |v_#memory_int_10| v_ULTIMATE.start_iterate_~i~0.base_9) v_ULTIMATE.start_iterate_~i~0.offset_7))) InVars {ULTIMATE.start_iterate_~i~0.offset=v_ULTIMATE.start_iterate_~i~0.offset_7, #memory_int=|v_#memory_int_10|, #length=|v_#length_17|, ULTIMATE.start_iterate_~i~0.base=v_ULTIMATE.start_iterate_~i~0.base_9, #valid=|v_#valid_19|} OutVars{ULTIMATE.start_iterate_~i~0.offset=v_ULTIMATE.start_iterate_~i~0.offset_7, ULTIMATE.start_iterate_#t~mem8=|v_ULTIMATE.start_iterate_#t~mem8_2|, #valid=|v_#valid_19|, #memory_int=|v_#memory_int_10|, #length=|v_#length_17|, ULTIMATE.start_iterate_~i~0.base=v_ULTIMATE.start_iterate_~i~0.base_9} AuxVars[] AssignedVars[ULTIMATE.start_iterate_#t~mem8] 30#L13-2true [180] L13-2-->L12-4: Formula: (and (<= (+ v_ULTIMATE.start_iterate_~sum~0.offset_13 4) (select |v_#length_29| v_ULTIMATE.start_iterate_~sum~0.base_17)) (= (store |v_#memory_int_20| v_ULTIMATE.start_iterate_~sum~0.base_17 (store (select |v_#memory_int_20| v_ULTIMATE.start_iterate_~sum~0.base_17) v_ULTIMATE.start_iterate_~sum~0.offset_13 (+ |v_ULTIMATE.start_iterate_#t~mem7_6| |v_ULTIMATE.start_iterate_#t~mem8_6|))) |v_#memory_int_19|) (= 1 (select |v_#valid_37| v_ULTIMATE.start_iterate_~sum~0.base_17)) (<= 0 v_ULTIMATE.start_iterate_~sum~0.offset_13)) InVars {ULTIMATE.start_iterate_~sum~0.offset=v_ULTIMATE.start_iterate_~sum~0.offset_13, ULTIMATE.start_iterate_#t~mem7=|v_ULTIMATE.start_iterate_#t~mem7_6|, ULTIMATE.start_iterate_#t~mem8=|v_ULTIMATE.start_iterate_#t~mem8_6|, #valid=|v_#valid_37|, #memory_int=|v_#memory_int_20|, #length=|v_#length_29|, ULTIMATE.start_iterate_~sum~0.base=v_ULTIMATE.start_iterate_~sum~0.base_17} OutVars{ULTIMATE.start_iterate_~sum~0.offset=v_ULTIMATE.start_iterate_~sum~0.offset_13, ULTIMATE.start_iterate_#t~mem7=|v_ULTIMATE.start_iterate_#t~mem7_5|, ULTIMATE.start_iterate_#t~mem8=|v_ULTIMATE.start_iterate_#t~mem8_5|, #valid=|v_#valid_37|, #memory_int=|v_#memory_int_19|, #length=|v_#length_29|, ULTIMATE.start_iterate_~sum~0.base=v_ULTIMATE.start_iterate_~sum~0.base_17} AuxVars[] AssignedVars[ULTIMATE.start_iterate_#t~mem7, ULTIMATE.start_iterate_#t~mem8, #memory_int] 24#L12-4true [183] L12-4-->L12-6: Formula: (and (<= (+ v_ULTIMATE.start_iterate_~i~0.offset_13 4) (select |v_#length_32| v_ULTIMATE.start_iterate_~i~0.base_18)) (= |v_ULTIMATE.start_iterate_#t~mem3_5| (select (select |v_#memory_int_23| v_ULTIMATE.start_iterate_~i~0.base_18) v_ULTIMATE.start_iterate_~i~0.offset_13)) (= 1 (select |v_#valid_42| v_ULTIMATE.start_iterate_~i~0.base_18)) (<= 0 v_ULTIMATE.start_iterate_~i~0.offset_13) (= |v_ULTIMATE.start_iterate_#t~mem3_5| |v_ULTIMATE.start_iterate_#t~post4_5|)) InVars {ULTIMATE.start_iterate_~i~0.offset=v_ULTIMATE.start_iterate_~i~0.offset_13, #valid=|v_#valid_42|, #memory_int=|v_#memory_int_23|, #length=|v_#length_32|, ULTIMATE.start_iterate_~i~0.base=v_ULTIMATE.start_iterate_~i~0.base_18} OutVars{ULTIMATE.start_iterate_~i~0.offset=v_ULTIMATE.start_iterate_~i~0.offset_13, ULTIMATE.start_iterate_#t~post4=|v_ULTIMATE.start_iterate_#t~post4_5|, #valid=|v_#valid_42|, ULTIMATE.start_iterate_#t~mem3=|v_ULTIMATE.start_iterate_#t~mem3_5|, #memory_int=|v_#memory_int_23|, #length=|v_#length_32|, ULTIMATE.start_iterate_~i~0.base=v_ULTIMATE.start_iterate_~i~0.base_18} AuxVars[] AssignedVars[ULTIMATE.start_iterate_#t~post4, ULTIMATE.start_iterate_#t~mem3] 20#L12-6true [184] L12-6-->L12-8: Formula: (and (<= 0 v_ULTIMATE.start_iterate_~i~0.offset_14) (= (store |v_#memory_int_25| v_ULTIMATE.start_iterate_~i~0.base_19 (store (select |v_#memory_int_25| v_ULTIMATE.start_iterate_~i~0.base_19) v_ULTIMATE.start_iterate_~i~0.offset_14 (+ |v_ULTIMATE.start_iterate_#t~post4_7| 1))) |v_#memory_int_24|) (<= (+ v_ULTIMATE.start_iterate_~i~0.offset_14 4) (select |v_#length_33| v_ULTIMATE.start_iterate_~i~0.base_19)) (= 1 (select |v_#valid_43| v_ULTIMATE.start_iterate_~i~0.base_19))) InVars {ULTIMATE.start_iterate_~i~0.offset=v_ULTIMATE.start_iterate_~i~0.offset_14, ULTIMATE.start_iterate_#t~post4=|v_ULTIMATE.start_iterate_#t~post4_7|, #valid=|v_#valid_43|, #memory_int=|v_#memory_int_25|, #length=|v_#length_33|, ULTIMATE.start_iterate_~i~0.base=v_ULTIMATE.start_iterate_~i~0.base_19} OutVars{ULTIMATE.start_iterate_~i~0.offset=v_ULTIMATE.start_iterate_~i~0.offset_14, ULTIMATE.start_iterate_#t~post4=|v_ULTIMATE.start_iterate_#t~post4_6|, #valid=|v_#valid_43|, ULTIMATE.start_iterate_#t~mem3=|v_ULTIMATE.start_iterate_#t~mem3_6|, #memory_int=|v_#memory_int_24|, #length=|v_#length_33|, ULTIMATE.start_iterate_~i~0.base=v_ULTIMATE.start_iterate_~i~0.base_19} AuxVars[] AssignedVars[ULTIMATE.start_iterate_#t~post4, ULTIMATE.start_iterate_#t~mem3, #memory_int] 37#L12-8true [2020-07-01 13:11:10,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:11:10,361 INFO L82 PathProgramCache]: Analyzing trace with hash 107276016, now seen corresponding path program 1 times [2020-07-01 13:11:10,361 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:11:10,361 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1041433742] [2020-07-01 13:11:10,361 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:11:10,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 13:11:10,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 13:11:10,413 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-01 13:11:10,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:11:10,414 INFO L82 PathProgramCache]: Analyzing trace with hash -870728200, now seen corresponding path program 1 times [2020-07-01 13:11:10,414 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:11:10,415 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1145231464] [2020-07-01 13:11:10,415 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:11:10,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 13:11:10,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 13:11:10,439 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-01 13:11:10,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:11:10,439 INFO L82 PathProgramCache]: Analyzing trace with hash 370951655, now seen corresponding path program 1 times [2020-07-01 13:11:10,439 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:11:10,440 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1667916443] [2020-07-01 13:11:10,440 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:11:10,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 13:11:10,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 13:11:10,490 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-01 13:11:10,943 WARN L192 SmtUtils]: Spent 307.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 79 [2020-07-01 13:11:11,053 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 73 [2020-07-01 13:11:11,068 INFO L210 LassoAnalysis]: Preferences: [2020-07-01 13:11:11,068 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-01 13:11:11,068 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-01 13:11:11,069 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-01 13:11:11,069 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-01 13:11:11,069 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-01 13:11:11,069 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-01 13:11:11,069 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-01 13:11:11,069 INFO L133 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration1_Lasso [2020-07-01 13:11:11,070 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-01 13:11:11,070 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-01 13:11:11,088 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 13:11:11,094 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 13:11:11,097 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 13:11:11,100 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 13:11:11,103 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 13:11:11,105 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 13:11:11,108 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 13:11:11,110 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 13:11:11,113 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 13:11:11,116 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 13:11:11,118 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 13:11:11,121 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 13:11:11,393 WARN L192 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 65 [2020-07-01 13:11:11,504 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 13:11:11,507 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 13:11:11,935 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-01 13:11:11,941 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-01 13:11:11,946 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-01 13:11:11,948 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-01 13:11:11,949 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-01 13:11:11,949 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-01 13:11:11,949 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-01 13:11:11,950 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-01 13:11:11,952 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-01 13:11:11,952 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-01 13:11:11,955 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-01 13:11:11,987 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-01 13:11:11,989 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-01 13:11:11,989 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-01 13:11:11,989 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-01 13:11:11,990 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-01 13:11:11,990 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-01 13:11:11,990 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-01 13:11:11,990 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-01 13:11:11,992 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-01 13:11:12,024 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-01 13:11:12,026 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-01 13:11:12,026 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-01 13:11:12,026 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-01 13:11:12,026 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-01 13:11:12,030 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-01 13:11:12,030 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-01 13:11:12,034 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-01 13:11:12,066 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-01 13:11:12,068 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-01 13:11:12,068 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-01 13:11:12,068 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-01 13:11:12,068 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-01 13:11:12,068 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-01 13:11:12,069 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-01 13:11:12,069 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-01 13:11:12,071 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-01 13:11:12,103 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-01 13:11:12,104 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-01 13:11:12,105 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-01 13:11:12,105 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-01 13:11:12,105 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-01 13:11:12,105 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-01 13:11:12,106 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-01 13:11:12,106 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-01 13:11:12,107 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-01 13:11:12,140 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-01 13:11:12,142 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-01 13:11:12,142 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-01 13:11:12,142 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-01 13:11:12,142 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-01 13:11:12,145 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-01 13:11:12,145 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-01 13:11:12,149 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-01 13:11:12,181 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-01 13:11:12,182 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-01 13:11:12,183 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-01 13:11:12,183 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-01 13:11:12,183 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-01 13:11:12,183 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-01 13:11:12,184 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-01 13:11:12,184 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-01 13:11:12,186 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-01 13:11:12,218 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-01 13:11:12,220 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-01 13:11:12,220 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-01 13:11:12,220 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-01 13:11:12,220 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-01 13:11:12,220 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-01 13:11:12,221 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-01 13:11:12,221 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-01 13:11:12,222 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-01 13:11:12,254 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-01 13:11:12,256 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-01 13:11:12,256 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-01 13:11:12,256 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-01 13:11:12,256 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-01 13:11:12,259 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-01 13:11:12,259 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-01 13:11:12,263 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-01 13:11:12,295 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-01 13:11:12,297 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-01 13:11:12,297 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-01 13:11:12,297 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-01 13:11:12,297 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-01 13:11:12,298 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-01 13:11:12,298 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-01 13:11:12,298 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-01 13:11:12,300 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-01 13:11:12,334 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-01 13:11:12,336 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-01 13:11:12,336 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-01 13:11:12,336 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-01 13:11:12,336 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-01 13:11:12,337 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-01 13:11:12,337 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-01 13:11:12,337 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-01 13:11:12,339 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-01 13:11:12,374 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-01 13:11:12,376 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-01 13:11:12,376 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-01 13:11:12,376 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-01 13:11:12,376 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-01 13:11:12,384 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-01 13:11:12,384 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-01 13:11:12,396 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-01 13:11:12,421 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2020-07-01 13:11:12,421 INFO L444 ModelExtractionUtils]: 8 out of 22 variables were initially zero. Simplification set additionally 11 variables to zero. No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-01 13:11:12,427 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-07-01 13:11:12,431 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-07-01 13:11:12,431 INFO L510 LassoAnalysis]: Proved termination. [2020-07-01 13:11:12,432 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_iterate_~bound_ref~0.base) ULTIMATE.start_iterate_~bound_ref~0.offset)_1, v_rep(select (select #memory_int ULTIMATE.start_iterate_~i~0.base) ULTIMATE.start_iterate_~i~0.offset)_1) = 1*v_rep(select (select #memory_int ULTIMATE.start_iterate_~bound_ref~0.base) ULTIMATE.start_iterate_~bound_ref~0.offset)_1 - 1*v_rep(select (select #memory_int ULTIMATE.start_iterate_~i~0.base) ULTIMATE.start_iterate_~i~0.offset)_1 Supporting invariants [] [2020-07-01 13:11:12,567 INFO L297 tatePredicateManager]: 20 out of 24 supporting invariants were superfluous and have been removed [2020-07-01 13:11:12,577 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 13:11:12,577 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 13:11:12,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:11:12,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:11:12,626 INFO L264 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 10 conjunts are in the unsatisfiable core [2020-07-01 13:11:12,628 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 13:11:12,678 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 12 [2020-07-01 13:11:12,679 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-01 13:11:12,692 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 13:11:12,692 INFO L539 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-07-01 13:11:12,692 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:16 [2020-07-01 13:11:12,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:11:12,712 INFO L264 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 15 conjunts are in the unsatisfiable core [2020-07-01 13:11:12,713 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 13:11:12,849 INFO L189 IndexEqualityManager]: detected not equals via solver [2020-07-01 13:11:12,861 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 13:11:12,861 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 46 [2020-07-01 13:11:12,863 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-01 13:11:12,898 INFO L619 ElimStorePlain]: treesize reduction 20, result has 71.4 percent of original size [2020-07-01 13:11:12,899 INFO L539 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-01 13:11:12,900 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:54, output treesize:41 [2020-07-01 13:11:12,930 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 13:11:13,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 13:11:13,060 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings [2020-07-01 13:11:13,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:11:13,074 INFO L264 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 15 conjunts are in the unsatisfiable core [2020-07-01 13:11:13,075 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 13:11:13,085 INFO L189 IndexEqualityManager]: detected not equals via solver [2020-07-01 13:11:13,092 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 13:11:13,093 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 41 [2020-07-01 13:11:13,094 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-01 13:11:13,121 INFO L619 ElimStorePlain]: treesize reduction 20, result has 64.9 percent of original size [2020-07-01 13:11:13,122 INFO L539 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-01 13:11:13,122 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:41, output treesize:28 [2020-07-01 13:11:13,194 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 13:11:13,194 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 63 [2020-07-01 13:11:13,197 INFO L477 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2020-07-01 13:11:13,197 INFO L477 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-01 13:11:13,201 INFO L477 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-07-01 13:11:13,202 INFO L477 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-01 13:11:13,203 INFO L477 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-01 13:11:13,205 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-01 13:11:13,285 INFO L619 ElimStorePlain]: treesize reduction 27, result has 74.5 percent of original size [2020-07-01 13:11:13,286 INFO L539 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-01 13:11:13,286 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:48, output treesize:82 [2020-07-01 13:11:13,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:11:13,749 INFO L264 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 15 conjunts are in the unsatisfiable core [2020-07-01 13:11:13,750 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 13:11:13,760 INFO L189 IndexEqualityManager]: detected not equals via solver [2020-07-01 13:11:13,766 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 13:11:13,766 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 41 [2020-07-01 13:11:13,767 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-01 13:11:13,791 INFO L619 ElimStorePlain]: treesize reduction 20, result has 64.9 percent of original size [2020-07-01 13:11:13,792 INFO L539 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-01 13:11:13,792 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:41, output treesize:28 [2020-07-01 13:11:13,827 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 13:11:13,828 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 63 [2020-07-01 13:11:13,830 INFO L477 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2020-07-01 13:11:13,831 INFO L477 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-01 13:11:13,832 INFO L477 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-07-01 13:11:13,833 INFO L477 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-01 13:11:13,835 INFO L477 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-01 13:11:13,836 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-01 13:11:13,901 INFO L619 ElimStorePlain]: treesize reduction 27, result has 74.5 percent of original size [2020-07-01 13:11:13,902 INFO L539 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-01 13:11:13,902 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:48, output treesize:82 [2020-07-01 13:11:13,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:11:13,948 INFO L264 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 15 conjunts are in the unsatisfiable core [2020-07-01 13:11:13,948 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 13:11:13,975 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 13:11:13,976 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 63 [2020-07-01 13:11:13,978 INFO L477 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2020-07-01 13:11:13,979 INFO L477 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-01 13:11:13,980 INFO L477 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-07-01 13:11:13,981 INFO L477 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-01 13:11:13,982 INFO L477 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-01 13:11:13,983 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-01 13:11:14,050 INFO L619 ElimStorePlain]: treesize reduction 27, result has 74.5 percent of original size [2020-07-01 13:11:14,052 INFO L539 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-01 13:11:14,052 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:48, output treesize:82 [2020-07-01 13:11:14,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 13:11:14,098 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings [2020-07-01 13:11:14,098 INFO L98 LoopCannibalizer]: 9 predicates before loop cannibalization 16 predicates after loop cannibalization [2020-07-01 13:11:14,103 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.5 stem predicates 16 loop predicates [2020-07-01 13:11:14,103 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 36 states. Second operand 7 states. [2020-07-01 13:11:14,545 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 36 states.. Second operand 7 states. Result 61 states and 115 transitions. Complement of second has 13 states. [2020-07-01 13:11:14,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 2 stem states 5 non-accepting loop states 1 accepting loop states [2020-07-01 13:11:14,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-01 13:11:14,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 107 transitions. [2020-07-01 13:11:14,569 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 107 transitions. Stem has 5 letters. Loop has 8 letters. [2020-07-01 13:11:14,569 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-01 13:11:14,569 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 107 transitions. Stem has 13 letters. Loop has 8 letters. [2020-07-01 13:11:14,570 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-01 13:11:14,570 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 107 transitions. Stem has 5 letters. Loop has 16 letters. [2020-07-01 13:11:14,570 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-01 13:11:14,581 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 61 states and 115 transitions. [2020-07-01 13:11:14,584 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-07-01 13:11:14,584 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 61 states to 0 states and 0 transitions. [2020-07-01 13:11:14,586 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2020-07-01 13:11:14,586 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2020-07-01 13:11:14,586 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2020-07-01 13:11:14,587 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-01 13:11:14,587 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-01 13:11:14,587 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-01 13:11:14,587 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-01 13:11:14,587 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2020-07-01 13:11:14,587 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2020-07-01 13:11:14,587 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-07-01 13:11:14,587 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-07-01 13:11:14,593 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 01.07 01:11:14 BasicIcfg [2020-07-01 13:11:14,593 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2020-07-01 13:11:14,595 INFO L168 Benchmark]: Toolchain (without parser) took 6574.79 ms. Allocated memory was 649.6 MB in the beginning and 771.2 MB in the end (delta: 121.6 MB). Free memory was 561.7 MB in the beginning and 400.1 MB in the end (delta: 161.7 MB). Peak memory consumption was 283.3 MB. Max. memory is 50.3 GB. [2020-07-01 13:11:14,595 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 649.6 MB. Free memory is still 583.3 MB. There was no memory consumed. Max. memory is 50.3 GB. [2020-07-01 13:11:14,596 INFO L168 Benchmark]: CACSL2BoogieTranslator took 295.35 ms. Allocated memory was 649.6 MB in the beginning and 679.0 MB in the end (delta: 29.4 MB). Free memory was 561.7 MB in the beginning and 642.0 MB in the end (delta: -80.3 MB). Peak memory consumption was 28.8 MB. Max. memory is 50.3 GB. [2020-07-01 13:11:14,596 INFO L168 Benchmark]: Boogie Procedure Inliner took 38.48 ms. Allocated memory is still 679.0 MB. Free memory was 642.0 MB in the beginning and 640.7 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 50.3 GB. [2020-07-01 13:11:14,596 INFO L168 Benchmark]: Boogie Preprocessor took 23.19 ms. Allocated memory is still 679.0 MB. Free memory was 640.7 MB in the beginning and 638.0 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 50.3 GB. [2020-07-01 13:11:14,597 INFO L168 Benchmark]: RCFGBuilder took 342.65 ms. Allocated memory is still 679.0 MB. Free memory was 638.0 MB in the beginning and 613.1 MB in the end (delta: 24.8 MB). Peak memory consumption was 24.8 MB. Max. memory is 50.3 GB. [2020-07-01 13:11:14,597 INFO L168 Benchmark]: BlockEncodingV2 took 128.08 ms. Allocated memory is still 679.0 MB. Free memory was 613.1 MB in the beginning and 602.3 MB in the end (delta: 10.8 MB). Peak memory consumption was 10.8 MB. Max. memory is 50.3 GB. [2020-07-01 13:11:14,598 INFO L168 Benchmark]: TraceAbstraction took 1449.98 ms. Allocated memory is still 679.0 MB. Free memory was 601.0 MB in the beginning and 440.8 MB in the end (delta: 160.2 MB). Peak memory consumption was 160.2 MB. Max. memory is 50.3 GB. [2020-07-01 13:11:14,598 INFO L168 Benchmark]: BuchiAutomizer took 4291.20 ms. Allocated memory was 679.0 MB in the beginning and 771.2 MB in the end (delta: 92.3 MB). Free memory was 440.8 MB in the beginning and 400.1 MB in the end (delta: 40.8 MB). Peak memory consumption was 133.1 MB. Max. memory is 50.3 GB. [2020-07-01 13:11:14,602 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: - StatisticsResult: Initial Icfg 44 locations, 45 edges - StatisticsResult: Encoded RCFG 36 locations, 65 edges * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17 ms. Allocated memory is still 649.6 MB. Free memory is still 583.3 MB. There was no memory consumed. Max. memory is 50.3 GB. * CACSL2BoogieTranslator took 295.35 ms. Allocated memory was 649.6 MB in the beginning and 679.0 MB in the end (delta: 29.4 MB). Free memory was 561.7 MB in the beginning and 642.0 MB in the end (delta: -80.3 MB). Peak memory consumption was 28.8 MB. Max. memory is 50.3 GB. * Boogie Procedure Inliner took 38.48 ms. Allocated memory is still 679.0 MB. Free memory was 642.0 MB in the beginning and 640.7 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 50.3 GB. * Boogie Preprocessor took 23.19 ms. Allocated memory is still 679.0 MB. Free memory was 640.7 MB in the beginning and 638.0 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 50.3 GB. * RCFGBuilder took 342.65 ms. Allocated memory is still 679.0 MB. Free memory was 638.0 MB in the beginning and 613.1 MB in the end (delta: 24.8 MB). Peak memory consumption was 24.8 MB. Max. memory is 50.3 GB. * BlockEncodingV2 took 128.08 ms. Allocated memory is still 679.0 MB. Free memory was 613.1 MB in the beginning and 602.3 MB in the end (delta: 10.8 MB). Peak memory consumption was 10.8 MB. Max. memory is 50.3 GB. * TraceAbstraction took 1449.98 ms. Allocated memory is still 679.0 MB. Free memory was 601.0 MB in the beginning and 440.8 MB in the end (delta: 160.2 MB). Peak memory consumption was 160.2 MB. Max. memory is 50.3 GB. * BuchiAutomizer took 4291.20 ms. Allocated memory was 679.0 MB in the beginning and 771.2 MB in the end (delta: 92.3 MB). Free memory was 440.8 MB in the beginning and 400.1 MB in the end (delta: 40.8 MB). Peak memory consumption was 133.1 MB. Max. memory is 50.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #StackHeapBarrier - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #StackHeapBarrier - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 13]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 10]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 13]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 10]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 15]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 13]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 13]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 12]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 13]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 11]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 13]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 11]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 12]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 12]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 12]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 12]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 12]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 15]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 12]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 12]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 12]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 12]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 22 specifications checked. All of them hold - InvariantResult [Line: 12]: Loop Invariant [2020-07-01 13:11:14,610 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:11:14,610 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:11:14,611 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:11:14,611 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-01 13:11:14,612 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:11:14,612 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:11:14,612 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:11:14,612 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier Derived loop invariant: ((((((((4 == unknown-#length-unknown[bound_ref] && 1 == \valid[i]) && 4 == unknown-#length-unknown[i]) && 1 == \valid[bound_ref]) && 4 == unknown-#length-unknown[sum]) && 0 == sum) && 1 <= unknown-#StackHeapBarrier-unknown) && bound_ref == 0) && 0 == i) && 1 == \valid[sum] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 36 locations, 22 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 1.3s, OverallIterations: 9, TraceHistogramMax: 1, AutomataDifference: 0.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 40 SDtfs, 314 SDslu, 5 SDs, 0 SdLazy, 303 SolverSat, 42 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 18 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=36occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 9 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 1 LocationsWithAnnotation, 1 PreInvPairs, 2 NumberOfFragments, 43 HoareAnnotationTreeSize, 1 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 1 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 36 NumberOfCodeBlocks, 36 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 27 ConstructedInterpolants, 0 QuantifiedInterpolants, 367 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - StatisticsResult: Constructed decomposition of program Your program was decomposed into 1 terminating modules (0 trivial, 0 deterministic, 1 nondeterministic). One nondeterministic module has affine ranking function unknown-#memory_int-unknown[bound_ref][bound_ref] + -1 * unknown-#memory_int-unknown[i][i] and consists of 8 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 4.2s and 2 iterations. TraceHistogramMax:1. Analysis of lassos took 2.2s. Construction of modules took 0.2s. Büchi inclusion checks took 1.7s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 0. Automata minimization No data available. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 0 states and ocurred in iteration 1. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 2 SDtfs, 590 SDslu, 22 SDs, 0 SdLazy, 345 SolverSat, 65 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso1 LassoPreprocessingBenchmarks: Lassos: inital306 mio100 ax100 hnf100 lsp97 ukn56 mio100 lsp40 div100 bol100 ite100 ukn100 eq194 hnf87 smp100 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 12ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! !ENTRY org.eclipse.core.resources 2 10035 2020-07-01 13:11:14.836 !MESSAGE The workspace will exit with unsaved changes in this session. Received shutdown request... Ultimate: GTK+ Version Check