./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-15/cstrcspn_mixed_alloca.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 9a8b2e8d Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/termination-15/cstrcspn_mixed_alloca.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash bee04d628cc50c5f036e0a10e9bd347013a62a54 .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.25-9a8b2e8 [2020-10-20 06:43:07,716 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-20 06:43:07,720 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-20 06:43:07,763 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-20 06:43:07,764 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-20 06:43:07,775 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-20 06:43:07,778 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-20 06:43:07,782 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-20 06:43:07,785 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-20 06:43:07,789 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-20 06:43:07,791 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-20 06:43:07,792 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-20 06:43:07,793 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-20 06:43:07,797 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-20 06:43:07,799 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-20 06:43:07,801 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-20 06:43:07,803 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-20 06:43:07,804 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-20 06:43:07,807 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-20 06:43:07,815 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-20 06:43:07,817 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-20 06:43:07,828 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-20 06:43:07,829 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-20 06:43:07,830 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-20 06:43:07,832 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-20 06:43:07,832 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-20 06:43:07,832 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-20 06:43:07,833 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-20 06:43:07,833 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-20 06:43:07,834 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-20 06:43:07,834 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-20 06:43:07,835 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-20 06:43:07,836 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-20 06:43:07,836 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-20 06:43:07,837 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-20 06:43:07,837 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-20 06:43:07,838 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-20 06:43:07,838 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-20 06:43:07,838 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-20 06:43:07,839 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-20 06:43:07,840 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-20 06:43:07,841 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2020-10-20 06:43:07,870 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-20 06:43:07,870 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-20 06:43:07,871 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-20 06:43:07,871 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-20 06:43:07,871 INFO L138 SettingsManager]: * Use SBE=true [2020-10-20 06:43:07,872 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-10-20 06:43:07,872 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2020-10-20 06:43:07,872 INFO L138 SettingsManager]: * Use old map elimination=false [2020-10-20 06:43:07,872 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2020-10-20 06:43:07,872 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2020-10-20 06:43:07,873 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-10-20 06:43:07,873 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-20 06:43:07,873 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-10-20 06:43:07,873 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-20 06:43:07,873 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-20 06:43:07,873 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2020-10-20 06:43:07,874 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2020-10-20 06:43:07,874 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2020-10-20 06:43:07,874 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-20 06:43:07,874 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-10-20 06:43:07,874 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-20 06:43:07,874 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2020-10-20 06:43:07,875 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-20 06:43:07,875 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-20 06:43:07,875 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-10-20 06:43:07,875 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-20 06:43:07,875 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-20 06:43:07,876 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-10-20 06:43:07,876 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2020-10-20 06:43:07,877 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2020-10-20 06:43:07,877 INFO L138 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> bee04d628cc50c5f036e0a10e9bd347013a62a54 [2020-10-20 06:43:08,088 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-20 06:43:08,104 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-20 06:43:08,108 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-20 06:43:08,111 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-20 06:43:08,111 INFO L275 PluginConnector]: CDTParser initialized [2020-10-20 06:43:08,112 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-15/cstrcspn_mixed_alloca.i [2020-10-20 06:43:08,187 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cf9ce5ae5/460cb59013574ffea504c84d427b63df/FLAG9a46c16e1 [2020-10-20 06:43:08,781 INFO L306 CDTParser]: Found 1 translation units. [2020-10-20 06:43:08,782 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-15/cstrcspn_mixed_alloca.i [2020-10-20 06:43:08,793 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cf9ce5ae5/460cb59013574ffea504c84d427b63df/FLAG9a46c16e1 [2020-10-20 06:43:09,047 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cf9ce5ae5/460cb59013574ffea504c84d427b63df [2020-10-20 06:43:09,051 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-20 06:43:09,057 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-10-20 06:43:09,058 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-20 06:43:09,059 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-20 06:43:09,062 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-20 06:43:09,063 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.10 06:43:09" (1/1) ... [2020-10-20 06:43:09,066 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5f42dbfe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 06:43:09, skipping insertion in model container [2020-10-20 06:43:09,066 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.10 06:43:09" (1/1) ... [2020-10-20 06:43:09,074 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-20 06:43:09,121 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-20 06:43:09,573 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-20 06:43:09,586 INFO L203 MainTranslator]: Completed pre-run [2020-10-20 06:43:09,643 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-20 06:43:09,736 INFO L208 MainTranslator]: Completed translation [2020-10-20 06:43:09,736 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 06:43:09 WrapperNode [2020-10-20 06:43:09,737 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-20 06:43:09,738 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-20 06:43:09,738 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-20 06:43:09,738 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-20 06:43:09,749 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 06:43:09" (1/1) ... [2020-10-20 06:43:09,770 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 06:43:09" (1/1) ... [2020-10-20 06:43:09,799 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-20 06:43:09,800 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-20 06:43:09,800 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-20 06:43:09,800 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-20 06:43:09,808 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 06:43:09" (1/1) ... [2020-10-20 06:43:09,808 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 06:43:09" (1/1) ... [2020-10-20 06:43:09,811 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 06:43:09" (1/1) ... [2020-10-20 06:43:09,811 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 06:43:09" (1/1) ... [2020-10-20 06:43:09,820 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 06:43:09" (1/1) ... [2020-10-20 06:43:09,825 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 06:43:09" (1/1) ... [2020-10-20 06:43:09,827 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 06:43:09" (1/1) ... [2020-10-20 06:43:09,829 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-20 06:43:09,830 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-20 06:43:09,830 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-20 06:43:09,830 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-20 06:43:09,831 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 06:43:09" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 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 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:43:09,918 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-10-20 06:43:09,918 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-20 06:43:09,919 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-20 06:43:09,919 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-20 06:43:09,919 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-20 06:43:09,920 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-20 06:43:10,201 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-20 06:43:10,202 INFO L298 CfgBuilder]: Removed 8 assume(true) statements. [2020-10-20 06:43:10,204 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.10 06:43:10 BoogieIcfgContainer [2020-10-20 06:43:10,204 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-20 06:43:10,205 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-10-20 06:43:10,205 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-10-20 06:43:10,219 INFO L275 PluginConnector]: BuchiAutomizer initialized [2020-10-20 06:43:10,221 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-10-20 06:43:10,221 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 20.10 06:43:09" (1/3) ... [2020-10-20 06:43:10,222 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@24bb03af and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 20.10 06:43:10, skipping insertion in model container [2020-10-20 06:43:10,223 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-10-20 06:43:10,223 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 06:43:09" (2/3) ... [2020-10-20 06:43:10,224 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@24bb03af and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 20.10 06:43:10, skipping insertion in model container [2020-10-20 06:43:10,224 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-10-20 06:43:10,224 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.10 06:43:10" (3/3) ... [2020-10-20 06:43:10,227 INFO L373 chiAutomizerObserver]: Analyzing ICFG cstrcspn_mixed_alloca.i [2020-10-20 06:43:10,289 INFO L359 BuchiCegarLoop]: Interprodecural is true [2020-10-20 06:43:10,290 INFO L360 BuchiCegarLoop]: Hoare is false [2020-10-20 06:43:10,290 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-10-20 06:43:10,291 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-20 06:43:10,291 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-20 06:43:10,291 INFO L364 BuchiCegarLoop]: Difference is false [2020-10-20 06:43:10,291 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-20 06:43:10,292 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-10-20 06:43:10,312 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states. [2020-10-20 06:43:10,343 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2020-10-20 06:43:10,343 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 06:43:10,344 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 06:43:10,353 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2020-10-20 06:43:10,354 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2020-10-20 06:43:10,354 INFO L427 BuchiCegarLoop]: ======== Iteration 1============ [2020-10-20 06:43:10,354 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states. [2020-10-20 06:43:10,357 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2020-10-20 06:43:10,357 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 06:43:10,358 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 06:43:10,359 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2020-10-20 06:43:10,359 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2020-10-20 06:43:10,369 INFO L794 eck$LassoCheckResult]: Stem: 13#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 10#L-1true havoc main_#res;havoc main_#t~nondet213, main_#t~nondet214, main_#t~malloc215.base, main_#t~malloc215.offset, main_#t~malloc216.base, main_#t~malloc216.offset, main_#t~ret217, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet213;havoc main_#t~nondet213;main_~length2~0 := main_#t~nondet214;havoc main_#t~nondet214; 12#L382true assume !(main_~length1~0 < 1); 15#L382-2true assume !(main_~length2~0 < 1); 9#L385-1true call main_#t~malloc215.base, main_#t~malloc215.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc215.base, main_#t~malloc215.offset;call main_#t~malloc216.base, main_#t~malloc216.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc216.base, main_#t~malloc216.offset;call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset, 1);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1);cstrcspn_#in~s1.base, cstrcspn_#in~s1.offset, cstrcspn_#in~s2.base, cstrcspn_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrcspn_#res;havoc cstrcspn_#t~mem207, cstrcspn_#t~post211.base, cstrcspn_#t~post211.offset, cstrcspn_#t~mem208, cstrcspn_#t~mem209, cstrcspn_#t~short210, cstrcspn_#t~mem212, cstrcspn_#t~post205.base, cstrcspn_#t~post205.offset, cstrcspn_#t~mem206, cstrcspn_~s1.base, cstrcspn_~s1.offset, cstrcspn_~s2.base, cstrcspn_~s2.offset, cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, cstrcspn_~s~0.base, cstrcspn_~s~0.offset, cstrcspn_~c~0;cstrcspn_~s1.base, cstrcspn_~s1.offset := cstrcspn_#in~s1.base, cstrcspn_#in~s1.offset;cstrcspn_~s2.base, cstrcspn_~s2.offset := cstrcspn_#in~s2.base, cstrcspn_#in~s2.offset;havoc cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset;havoc cstrcspn_~s~0.base, cstrcspn_~s~0.offset;havoc cstrcspn_~c~0;cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset := cstrcspn_~s1.base, cstrcspn_~s1.offset; 6#L369-4true [2020-10-20 06:43:10,370 INFO L796 eck$LassoCheckResult]: Loop: 6#L369-4true call cstrcspn_#t~mem206 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1); 18#L369-1true assume !!(0 != cstrcspn_#t~mem206);havoc cstrcspn_#t~mem206;cstrcspn_~s~0.base, cstrcspn_~s~0.offset := cstrcspn_~s2.base, cstrcspn_~s2.offset;call cstrcspn_#t~mem207 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1);cstrcspn_~c~0 := cstrcspn_#t~mem207;havoc cstrcspn_#t~mem207; 20#L372-5true assume !true; 4#L372-6true call cstrcspn_#t~mem212 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1); 8#L374true assume !(cstrcspn_#t~mem212 == cstrcspn_~c~0);havoc cstrcspn_#t~mem212; 5#L369-3true cstrcspn_#t~post205.base, cstrcspn_#t~post205.offset := cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset;cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset := cstrcspn_#t~post205.base, 1 + cstrcspn_#t~post205.offset;havoc cstrcspn_#t~post205.base, cstrcspn_#t~post205.offset; 6#L369-4true [2020-10-20 06:43:10,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:43:10,382 INFO L82 PathProgramCache]: Analyzing trace with hash 28695878, now seen corresponding path program 1 times [2020-10-20 06:43:10,393 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:43:10,394 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1353469838] [2020-10-20 06:43:10,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:43:10,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:43:10,556 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:43:10,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:43:10,613 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:43:10,660 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:43:10,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:43:10,663 INFO L82 PathProgramCache]: Analyzing trace with hash 1454917130, now seen corresponding path program 1 times [2020-10-20 06:43:10,663 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:43:10,664 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1402102898] [2020-10-20 06:43:10,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:43:10,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:43:10,733 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 06:43:10,749 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1402102898] [2020-10-20 06:43:10,750 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 06:43:10,751 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-20 06:43:10,752 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [573424830] [2020-10-20 06:43:10,760 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-10-20 06:43:10,761 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 06:43:10,779 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2020-10-20 06:43:10,780 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-10-20 06:43:10,782 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 2 states. [2020-10-20 06:43:10,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 06:43:10,793 INFO L93 Difference]: Finished difference Result 18 states and 23 transitions. [2020-10-20 06:43:10,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-10-20 06:43:10,795 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 18 states and 23 transitions. [2020-10-20 06:43:10,800 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2020-10-20 06:43:10,807 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 18 states to 13 states and 17 transitions. [2020-10-20 06:43:10,808 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2020-10-20 06:43:10,809 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2020-10-20 06:43:10,810 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 17 transitions. [2020-10-20 06:43:10,811 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-20 06:43:10,811 INFO L691 BuchiCegarLoop]: Abstraction has 13 states and 17 transitions. [2020-10-20 06:43:10,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 17 transitions. [2020-10-20 06:43:10,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2020-10-20 06:43:10,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2020-10-20 06:43:10,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 17 transitions. [2020-10-20 06:43:10,839 INFO L714 BuchiCegarLoop]: Abstraction has 13 states and 17 transitions. [2020-10-20 06:43:10,839 INFO L594 BuchiCegarLoop]: Abstraction has 13 states and 17 transitions. [2020-10-20 06:43:10,840 INFO L427 BuchiCegarLoop]: ======== Iteration 2============ [2020-10-20 06:43:10,840 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 17 transitions. [2020-10-20 06:43:10,840 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2020-10-20 06:43:10,841 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 06:43:10,841 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 06:43:10,841 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2020-10-20 06:43:10,841 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 06:43:10,842 INFO L794 eck$LassoCheckResult]: Stem: 55#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 50#L-1 havoc main_#res;havoc main_#t~nondet213, main_#t~nondet214, main_#t~malloc215.base, main_#t~malloc215.offset, main_#t~malloc216.base, main_#t~malloc216.offset, main_#t~ret217, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet213;havoc main_#t~nondet213;main_~length2~0 := main_#t~nondet214;havoc main_#t~nondet214; 51#L382 assume !(main_~length1~0 < 1); 52#L382-2 assume !(main_~length2~0 < 1); 49#L385-1 call main_#t~malloc215.base, main_#t~malloc215.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc215.base, main_#t~malloc215.offset;call main_#t~malloc216.base, main_#t~malloc216.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc216.base, main_#t~malloc216.offset;call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset, 1);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1);cstrcspn_#in~s1.base, cstrcspn_#in~s1.offset, cstrcspn_#in~s2.base, cstrcspn_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrcspn_#res;havoc cstrcspn_#t~mem207, cstrcspn_#t~post211.base, cstrcspn_#t~post211.offset, cstrcspn_#t~mem208, cstrcspn_#t~mem209, cstrcspn_#t~short210, cstrcspn_#t~mem212, cstrcspn_#t~post205.base, cstrcspn_#t~post205.offset, cstrcspn_#t~mem206, cstrcspn_~s1.base, cstrcspn_~s1.offset, cstrcspn_~s2.base, cstrcspn_~s2.offset, cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, cstrcspn_~s~0.base, cstrcspn_~s~0.offset, cstrcspn_~c~0;cstrcspn_~s1.base, cstrcspn_~s1.offset := cstrcspn_#in~s1.base, cstrcspn_#in~s1.offset;cstrcspn_~s2.base, cstrcspn_~s2.offset := cstrcspn_#in~s2.base, cstrcspn_#in~s2.offset;havoc cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset;havoc cstrcspn_~s~0.base, cstrcspn_~s~0.offset;havoc cstrcspn_~c~0;cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset := cstrcspn_~s1.base, cstrcspn_~s1.offset; 47#L369-4 [2020-10-20 06:43:10,842 INFO L796 eck$LassoCheckResult]: Loop: 47#L369-4 call cstrcspn_#t~mem206 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1); 48#L369-1 assume !!(0 != cstrcspn_#t~mem206);havoc cstrcspn_#t~mem206;cstrcspn_~s~0.base, cstrcspn_~s~0.offset := cstrcspn_~s2.base, cstrcspn_~s2.offset;call cstrcspn_#t~mem207 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1);cstrcspn_~c~0 := cstrcspn_#t~mem207;havoc cstrcspn_#t~mem207; 56#L372-5 call cstrcspn_#t~mem208 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1);cstrcspn_#t~short210 := 0 != cstrcspn_#t~mem208; 53#L372-1 assume cstrcspn_#t~short210;call cstrcspn_#t~mem209 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1);cstrcspn_#t~short210 := cstrcspn_#t~mem209 != (if cstrcspn_~c~0 % 256 <= 127 then cstrcspn_~c~0 % 256 else cstrcspn_~c~0 % 256 - 256); 54#L372-3 assume !cstrcspn_#t~short210;havoc cstrcspn_#t~mem208;havoc cstrcspn_#t~mem209;havoc cstrcspn_#t~short210; 44#L372-6 call cstrcspn_#t~mem212 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1); 45#L374 assume !(cstrcspn_#t~mem212 == cstrcspn_~c~0);havoc cstrcspn_#t~mem212; 46#L369-3 cstrcspn_#t~post205.base, cstrcspn_#t~post205.offset := cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset;cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset := cstrcspn_#t~post205.base, 1 + cstrcspn_#t~post205.offset;havoc cstrcspn_#t~post205.base, cstrcspn_#t~post205.offset; 47#L369-4 [2020-10-20 06:43:10,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:43:10,842 INFO L82 PathProgramCache]: Analyzing trace with hash 28695878, now seen corresponding path program 2 times [2020-10-20 06:43:10,843 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:43:10,843 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [155352669] [2020-10-20 06:43:10,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:43:10,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:43:10,860 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:43:10,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:43:10,876 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:43:10,886 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:43:10,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:43:10,887 INFO L82 PathProgramCache]: Analyzing trace with hash 1927396657, now seen corresponding path program 1 times [2020-10-20 06:43:10,887 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:43:10,888 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1129251635] [2020-10-20 06:43:10,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:43:10,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:43:10,921 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:43:10,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:43:10,934 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:43:10,938 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:43:10,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:43:10,939 INFO L82 PathProgramCache]: Analyzing trace with hash -102988426, now seen corresponding path program 1 times [2020-10-20 06:43:10,939 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:43:10,939 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1825578404] [2020-10-20 06:43:10,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:43:10,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:43:10,971 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:43:11,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:43:11,012 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:43:11,030 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:43:11,295 WARN L193 SmtUtils]: Spent 257.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 59 [2020-10-20 06:43:11,739 WARN L193 SmtUtils]: Spent 343.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 85 [2020-10-20 06:43:11,891 WARN L193 SmtUtils]: Spent 139.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2020-10-20 06:43:11,907 INFO L210 LassoAnalysis]: Preferences: [2020-10-20 06:43:11,908 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-20 06:43:11,908 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-20 06:43:11,908 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-20 06:43:11,908 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-10-20 06:43:11,909 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:43:11,917 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-20 06:43:11,918 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-20 06:43:11,918 INFO L133 ssoRankerPreferences]: Filename of dumped script: cstrcspn_mixed_alloca.i_Iteration2_Lasso [2020-10-20 06:43:11,918 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-20 06:43:11,919 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-20 06:43:11,963 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:43:12,378 WARN L193 SmtUtils]: Spent 234.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 66 [2020-10-20 06:43:12,602 WARN L193 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 57 [2020-10-20 06:43:12,604 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:43:12,607 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:43:12,611 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:43:12,615 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:43:12,622 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:43:12,625 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:43:12,629 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:43:12,631 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:43:12,635 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:43:12,639 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:43:12,641 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:43:12,644 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:43:12,647 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:43:12,649 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:43:12,653 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:43:12,656 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:43:12,660 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:43:13,302 WARN L193 SmtUtils]: Spent 258.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 34 [2020-10-20 06:43:13,505 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-10-20 06:43:13,511 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-20 06:43:13,526 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-10-20 06:43:13,530 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:43:13,530 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:43:13,531 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:43:13,531 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:43:13,565 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 06:43:13,568 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 06:43:13,587 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-10-20 06:43:13,619 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-10-20 06:43:13,621 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:43:13,621 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:43:13,621 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:43:13,621 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:43:13,625 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 06:43:13,625 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 06:43:13,629 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-20 06:43:13,676 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 Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:43:13,678 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:43:13,678 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 06:43:13,678 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:43:13,679 INFO L204 nArgumentSynthesizer]: 4 loop disjuncts [2020-10-20 06:43:13,679 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:43:13,693 INFO L401 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2020-10-20 06:43:13,693 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 06:43:13,707 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-10-20 06:43:13,734 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-10-20 06:43:13,735 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:43:13,735 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 06:43:13,735 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:43:13,736 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:43:13,736 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:43:13,737 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 06:43:13,737 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 06:43:13,739 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-10-20 06:43:13,774 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-10-20 06:43:13,776 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:43:13,776 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:43:13,776 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:43:13,776 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:43:13,780 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 06:43:13,781 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 06:43:13,792 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-10-20 06:43:13,823 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-10-20 06:43:13,825 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:43:13,825 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:43:13,825 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:43:13,825 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:43:13,827 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 06:43:13,828 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 06:43:13,831 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-10-20 06:43:13,861 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-10-20 06:43:13,863 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:43:13,863 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:43:13,863 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:43:13,863 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:43:13,866 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 06:43:13,867 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 06:43:13,872 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-10-20 06:43:13,901 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-10-20 06:43:13,903 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:43:13,904 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:43:13,904 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:43:13,904 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:43:13,919 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 06:43:13,919 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 06:43:13,944 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-10-20 06:43:13,997 INFO L443 ModelExtractionUtils]: Simplification made 12 calls to the SMT solver. [2020-10-20 06:43:13,997 INFO L444 ModelExtractionUtils]: 21 out of 52 variables were initially zero. Simplification set additionally 28 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-10-20 06:43:14,009 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-10-20 06:43:14,016 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-10-20 06:43:14,017 INFO L510 LassoAnalysis]: Proved termination. [2020-10-20 06:43:14,017 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_#t~malloc215.base)_1, ULTIMATE.start_cstrcspn_~sc1~0.offset) = 1*v_rep(select #length ULTIMATE.start_main_#t~malloc215.base)_1 - 1*ULTIMATE.start_cstrcspn_~sc1~0.offset Supporting invariants [] [2020-10-20 06:43:14,124 INFO L297 tatePredicateManager]: 7 out of 8 supporting invariants were superfluous and have been removed [2020-10-20 06:43:14,140 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-10-20 06:43:14,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:43:14,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:43:14,208 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 10 conjunts are in the unsatisfiable core [2020-10-20 06:43:14,210 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 06:43:14,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:43:14,264 INFO L263 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 8 conjunts are in the unsatisfiable core [2020-10-20 06:43:14,265 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 06:43:14,315 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 06:43:14,318 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2020-10-20 06:43:14,319 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 13 states and 17 transitions. cyclomatic complexity: 5 Second operand 3 states. [2020-10-20 06:43:14,400 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 13 states and 17 transitions. cyclomatic complexity: 5. Second operand 3 states. Result 21 states and 28 transitions. Complement of second has 4 states. [2020-10-20 06:43:14,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2020-10-20 06:43:14,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-20 06:43:14,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 17 transitions. [2020-10-20 06:43:14,404 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 17 transitions. Stem has 5 letters. Loop has 8 letters. [2020-10-20 06:43:14,406 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 06:43:14,406 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 17 transitions. Stem has 13 letters. Loop has 8 letters. [2020-10-20 06:43:14,407 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 06:43:14,407 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 17 transitions. Stem has 5 letters. Loop has 16 letters. [2020-10-20 06:43:14,407 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 06:43:14,407 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 28 transitions. [2020-10-20 06:43:14,409 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-10-20 06:43:14,410 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 18 states and 25 transitions. [2020-10-20 06:43:14,410 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2020-10-20 06:43:14,410 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2020-10-20 06:43:14,410 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 25 transitions. [2020-10-20 06:43:14,411 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-20 06:43:14,411 INFO L691 BuchiCegarLoop]: Abstraction has 18 states and 25 transitions. [2020-10-20 06:43:14,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 25 transitions. [2020-10-20 06:43:14,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2020-10-20 06:43:14,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2020-10-20 06:43:14,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 25 transitions. [2020-10-20 06:43:14,414 INFO L714 BuchiCegarLoop]: Abstraction has 18 states and 25 transitions. [2020-10-20 06:43:14,414 INFO L594 BuchiCegarLoop]: Abstraction has 18 states and 25 transitions. [2020-10-20 06:43:14,414 INFO L427 BuchiCegarLoop]: ======== Iteration 3============ [2020-10-20 06:43:14,414 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 25 transitions. [2020-10-20 06:43:14,415 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-10-20 06:43:14,415 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 06:43:14,415 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 06:43:14,415 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2020-10-20 06:43:14,416 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-10-20 06:43:14,416 INFO L794 eck$LassoCheckResult]: Stem: 189#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 182#L-1 havoc main_#res;havoc main_#t~nondet213, main_#t~nondet214, main_#t~malloc215.base, main_#t~malloc215.offset, main_#t~malloc216.base, main_#t~malloc216.offset, main_#t~ret217, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet213;havoc main_#t~nondet213;main_~length2~0 := main_#t~nondet214;havoc main_#t~nondet214; 183#L382 assume !(main_~length1~0 < 1); 184#L382-2 assume !(main_~length2~0 < 1); 181#L385-1 call main_#t~malloc215.base, main_#t~malloc215.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc215.base, main_#t~malloc215.offset;call main_#t~malloc216.base, main_#t~malloc216.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc216.base, main_#t~malloc216.offset;call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset, 1);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1);cstrcspn_#in~s1.base, cstrcspn_#in~s1.offset, cstrcspn_#in~s2.base, cstrcspn_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrcspn_#res;havoc cstrcspn_#t~mem207, cstrcspn_#t~post211.base, cstrcspn_#t~post211.offset, cstrcspn_#t~mem208, cstrcspn_#t~mem209, cstrcspn_#t~short210, cstrcspn_#t~mem212, cstrcspn_#t~post205.base, cstrcspn_#t~post205.offset, cstrcspn_#t~mem206, cstrcspn_~s1.base, cstrcspn_~s1.offset, cstrcspn_~s2.base, cstrcspn_~s2.offset, cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, cstrcspn_~s~0.base, cstrcspn_~s~0.offset, cstrcspn_~c~0;cstrcspn_~s1.base, cstrcspn_~s1.offset := cstrcspn_#in~s1.base, cstrcspn_#in~s1.offset;cstrcspn_~s2.base, cstrcspn_~s2.offset := cstrcspn_#in~s2.base, cstrcspn_#in~s2.offset;havoc cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset;havoc cstrcspn_~s~0.base, cstrcspn_~s~0.offset;havoc cstrcspn_~c~0;cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset := cstrcspn_~s1.base, cstrcspn_~s1.offset; 178#L369-4 call cstrcspn_#t~mem206 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1); 180#L369-1 assume !!(0 != cstrcspn_#t~mem206);havoc cstrcspn_#t~mem206;cstrcspn_~s~0.base, cstrcspn_~s~0.offset := cstrcspn_~s2.base, cstrcspn_~s2.offset;call cstrcspn_#t~mem207 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1);cstrcspn_~c~0 := cstrcspn_#t~mem207;havoc cstrcspn_#t~mem207; 190#L372-5 [2020-10-20 06:43:14,416 INFO L796 eck$LassoCheckResult]: Loop: 190#L372-5 call cstrcspn_#t~mem208 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1);cstrcspn_#t~short210 := 0 != cstrcspn_#t~mem208; 185#L372-1 assume cstrcspn_#t~short210;call cstrcspn_#t~mem209 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1);cstrcspn_#t~short210 := cstrcspn_#t~mem209 != (if cstrcspn_~c~0 % 256 <= 127 then cstrcspn_~c~0 % 256 else cstrcspn_~c~0 % 256 - 256); 186#L372-3 assume !!cstrcspn_#t~short210;havoc cstrcspn_#t~mem208;havoc cstrcspn_#t~mem209;havoc cstrcspn_#t~short210;cstrcspn_#t~post211.base, cstrcspn_#t~post211.offset := cstrcspn_~s~0.base, cstrcspn_~s~0.offset;cstrcspn_~s~0.base, cstrcspn_~s~0.offset := cstrcspn_#t~post211.base, cstrcspn_#t~post211.offset - 1;havoc cstrcspn_#t~post211.base, cstrcspn_#t~post211.offset; 190#L372-5 [2020-10-20 06:43:14,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:43:14,416 INFO L82 PathProgramCache]: Analyzing trace with hash 1806935595, now seen corresponding path program 1 times [2020-10-20 06:43:14,417 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:43:14,417 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1212704339] [2020-10-20 06:43:14,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:43:14,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:43:14,435 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:43:14,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:43:14,453 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:43:14,462 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:43:14,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:43:14,465 INFO L82 PathProgramCache]: Analyzing trace with hash 58692, now seen corresponding path program 1 times [2020-10-20 06:43:14,465 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:43:14,465 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [241558519] [2020-10-20 06:43:14,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:43:14,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:43:14,481 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:43:14,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:43:14,492 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:43:14,497 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:43:14,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:43:14,498 INFO L82 PathProgramCache]: Analyzing trace with hash 1593218778, now seen corresponding path program 1 times [2020-10-20 06:43:14,499 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:43:14,500 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1392946171] [2020-10-20 06:43:14,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:43:14,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:43:14,546 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:43:14,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:43:14,593 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:43:14,601 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:43:15,096 WARN L193 SmtUtils]: Spent 375.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 101 [2020-10-20 06:43:15,256 WARN L193 SmtUtils]: Spent 150.00 ms on a formula simplification that was a NOOP. DAG size: 93 [2020-10-20 06:43:15,259 INFO L210 LassoAnalysis]: Preferences: [2020-10-20 06:43:15,259 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-20 06:43:15,259 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-20 06:43:15,259 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-20 06:43:15,259 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-10-20 06:43:15,260 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:43:15,260 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-20 06:43:15,260 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-20 06:43:15,260 INFO L133 ssoRankerPreferences]: Filename of dumped script: cstrcspn_mixed_alloca.i_Iteration3_Lasso [2020-10-20 06:43:15,260 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-20 06:43:15,260 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-20 06:43:15,270 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:43:15,275 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:43:15,277 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:43:15,284 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:43:15,614 WARN L193 SmtUtils]: Spent 222.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 79 [2020-10-20 06:43:15,731 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:43:15,733 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:43:15,735 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:43:15,738 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:43:15,740 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:43:15,742 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:43:15,745 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:43:15,747 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:43:15,749 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:43:15,752 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:43:15,754 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:43:15,756 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:43:15,758 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:43:15,759 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:43:15,762 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:43:16,037 WARN L193 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 48 [2020-10-20 06:43:16,381 WARN L193 SmtUtils]: Spent 206.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 36 [2020-10-20 06:43:16,567 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-10-20 06:43:16,570 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-20 06:43:16,584 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-10-20 06:43:16,585 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:43:16,586 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 06:43:16,586 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:43:16,586 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:43:16,586 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:43:16,591 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 06:43:16,592 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:43:16,595 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-10-20 06:43:16,637 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-10-20 06:43:16,639 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:43:16,640 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:43:16,640 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:43:16,640 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:43:16,642 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 06:43:16,642 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 06:43:16,646 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-20 06:43:16,695 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-10-20 06:43:16,697 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:43:16,697 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 06:43:16,697 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:43:16,697 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:43:16,697 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:43:16,698 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 06:43:16,698 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 06:43:16,700 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-10-20 06:43:16,731 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-10-20 06:43:16,732 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:43:16,732 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:43:16,732 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:43:16,733 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:43:16,736 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 06:43:16,736 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 06:43:16,742 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 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 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:43:16,765 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-10-20 06:43:16,767 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:43:16,767 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:43:16,767 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:43:16,767 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:43:16,769 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 06:43:16,769 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 06:43:16,772 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 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 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:43:16,795 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-10-20 06:43:16,797 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:43:16,798 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:43:16,799 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:43:16,799 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:43:16,800 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 06:43:16,801 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 06:43:16,804 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 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 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:43:16,828 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-10-20 06:43:16,830 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:43:16,830 INFO L203 nArgumentSynthesizer]: 2 stem disjuncts [2020-10-20 06:43:16,830 INFO L204 nArgumentSynthesizer]: 6 loop disjuncts [2020-10-20 06:43:16,830 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:43:16,914 INFO L401 nArgumentSynthesizer]: We have 108 Motzkin's Theorem applications. [2020-10-20 06:43:16,914 INFO L402 nArgumentSynthesizer]: A total of 12 supporting invariants were added. [2020-10-20 06:43:17,048 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 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 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:43:17,076 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-10-20 06:43:17,078 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:43:17,078 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:43:17,078 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:43:17,078 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:43:17,080 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 06:43:17,080 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 06:43:17,083 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 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 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:43:17,114 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-10-20 06:43:17,116 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:43:17,117 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:43:17,117 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:43:17,117 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:43:17,124 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 06:43:17,124 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 06:43:17,138 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 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 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:43:17,164 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-10-20 06:43:17,166 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:43:17,166 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:43:17,166 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:43:17,166 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:43:17,182 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 06:43:17,183 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 06:43:17,207 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-10-20 06:43:17,262 INFO L443 ModelExtractionUtils]: Simplification made 20 calls to the SMT solver. [2020-10-20 06:43:17,262 INFO L444 ModelExtractionUtils]: 33 out of 52 variables were initially zero. Simplification set additionally 16 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 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 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:43:17,268 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-10-20 06:43:17,270 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-10-20 06:43:17,270 INFO L510 LassoAnalysis]: Proved termination. [2020-10-20 06:43:17,270 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_cstrcspn_~s~0.base)_2, ULTIMATE.start_cstrcspn_~s~0.offset) = 1*v_rep(select #length ULTIMATE.start_cstrcspn_~s~0.base)_2 + 2*ULTIMATE.start_cstrcspn_~s~0.offset Supporting invariants [] [2020-10-20 06:43:17,352 INFO L297 tatePredicateManager]: 16 out of 16 supporting invariants were superfluous and have been removed [2020-10-20 06:43:17,354 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-10-20 06:43:17,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:43:17,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:43:17,400 INFO L263 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-20 06:43:17,401 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 06:43:17,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:43:17,411 INFO L263 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 7 conjunts are in the unsatisfiable core [2020-10-20 06:43:17,412 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 06:43:17,426 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 06:43:17,427 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2020-10-20 06:43:17,427 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 18 states and 25 transitions. cyclomatic complexity: 9 Second operand 3 states. [2020-10-20 06:43:17,456 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 18 states and 25 transitions. cyclomatic complexity: 9. Second operand 3 states. Result 43 states and 57 transitions. Complement of second has 5 states. [2020-10-20 06:43:17,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2020-10-20 06:43:17,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-20 06:43:17,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 18 transitions. [2020-10-20 06:43:17,459 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 18 transitions. Stem has 7 letters. Loop has 3 letters. [2020-10-20 06:43:17,459 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 06:43:17,459 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 18 transitions. Stem has 10 letters. Loop has 3 letters. [2020-10-20 06:43:17,459 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 06:43:17,459 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 18 transitions. Stem has 7 letters. Loop has 6 letters. [2020-10-20 06:43:17,460 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 06:43:17,460 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 43 states and 57 transitions. [2020-10-20 06:43:17,462 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-10-20 06:43:17,463 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 43 states to 30 states and 40 transitions. [2020-10-20 06:43:17,463 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2020-10-20 06:43:17,463 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2020-10-20 06:43:17,463 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 40 transitions. [2020-10-20 06:43:17,463 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-20 06:43:17,463 INFO L691 BuchiCegarLoop]: Abstraction has 30 states and 40 transitions. [2020-10-20 06:43:17,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states and 40 transitions. [2020-10-20 06:43:17,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 24. [2020-10-20 06:43:17,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2020-10-20 06:43:17,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 33 transitions. [2020-10-20 06:43:17,466 INFO L714 BuchiCegarLoop]: Abstraction has 24 states and 33 transitions. [2020-10-20 06:43:17,467 INFO L594 BuchiCegarLoop]: Abstraction has 24 states and 33 transitions. [2020-10-20 06:43:17,467 INFO L427 BuchiCegarLoop]: ======== Iteration 4============ [2020-10-20 06:43:17,467 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 33 transitions. [2020-10-20 06:43:17,468 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-10-20 06:43:17,468 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 06:43:17,468 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 06:43:17,468 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 06:43:17,468 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-10-20 06:43:17,469 INFO L794 eck$LassoCheckResult]: Stem: 366#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 359#L-1 havoc main_#res;havoc main_#t~nondet213, main_#t~nondet214, main_#t~malloc215.base, main_#t~malloc215.offset, main_#t~malloc216.base, main_#t~malloc216.offset, main_#t~ret217, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet213;havoc main_#t~nondet213;main_~length2~0 := main_#t~nondet214;havoc main_#t~nondet214; 360#L382 assume !(main_~length1~0 < 1); 361#L382-2 assume !(main_~length2~0 < 1); 358#L385-1 call main_#t~malloc215.base, main_#t~malloc215.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc215.base, main_#t~malloc215.offset;call main_#t~malloc216.base, main_#t~malloc216.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc216.base, main_#t~malloc216.offset;call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset, 1);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1);cstrcspn_#in~s1.base, cstrcspn_#in~s1.offset, cstrcspn_#in~s2.base, cstrcspn_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrcspn_#res;havoc cstrcspn_#t~mem207, cstrcspn_#t~post211.base, cstrcspn_#t~post211.offset, cstrcspn_#t~mem208, cstrcspn_#t~mem209, cstrcspn_#t~short210, cstrcspn_#t~mem212, cstrcspn_#t~post205.base, cstrcspn_#t~post205.offset, cstrcspn_#t~mem206, cstrcspn_~s1.base, cstrcspn_~s1.offset, cstrcspn_~s2.base, cstrcspn_~s2.offset, cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, cstrcspn_~s~0.base, cstrcspn_~s~0.offset, cstrcspn_~c~0;cstrcspn_~s1.base, cstrcspn_~s1.offset := cstrcspn_#in~s1.base, cstrcspn_#in~s1.offset;cstrcspn_~s2.base, cstrcspn_~s2.offset := cstrcspn_#in~s2.base, cstrcspn_#in~s2.offset;havoc cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset;havoc cstrcspn_~s~0.base, cstrcspn_~s~0.offset;havoc cstrcspn_~c~0;cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset := cstrcspn_~s1.base, cstrcspn_~s1.offset; 354#L369-4 call cstrcspn_#t~mem206 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1); 355#L369-1 assume !!(0 != cstrcspn_#t~mem206);havoc cstrcspn_#t~mem206;cstrcspn_~s~0.base, cstrcspn_~s~0.offset := cstrcspn_~s2.base, cstrcspn_~s2.offset;call cstrcspn_#t~mem207 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1);cstrcspn_~c~0 := cstrcspn_#t~mem207;havoc cstrcspn_#t~mem207; 368#L372-5 call cstrcspn_#t~mem208 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1);cstrcspn_#t~short210 := 0 != cstrcspn_#t~mem208; 364#L372-1 assume !cstrcspn_#t~short210; 365#L372-3 assume !cstrcspn_#t~short210;havoc cstrcspn_#t~mem208;havoc cstrcspn_#t~mem209;havoc cstrcspn_#t~short210; 350#L372-6 call cstrcspn_#t~mem212 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1); 351#L374 assume !(cstrcspn_#t~mem212 == cstrcspn_~c~0);havoc cstrcspn_#t~mem212; 352#L369-3 cstrcspn_#t~post205.base, cstrcspn_#t~post205.offset := cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset;cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset := cstrcspn_#t~post205.base, 1 + cstrcspn_#t~post205.offset;havoc cstrcspn_#t~post205.base, cstrcspn_#t~post205.offset; 353#L369-4 call cstrcspn_#t~mem206 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1); 357#L369-1 assume !!(0 != cstrcspn_#t~mem206);havoc cstrcspn_#t~mem206;cstrcspn_~s~0.base, cstrcspn_~s~0.offset := cstrcspn_~s2.base, cstrcspn_~s2.offset;call cstrcspn_#t~mem207 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1);cstrcspn_~c~0 := cstrcspn_#t~mem207;havoc cstrcspn_#t~mem207; 367#L372-5 [2020-10-20 06:43:17,469 INFO L796 eck$LassoCheckResult]: Loop: 367#L372-5 call cstrcspn_#t~mem208 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1);cstrcspn_#t~short210 := 0 != cstrcspn_#t~mem208; 362#L372-1 assume cstrcspn_#t~short210;call cstrcspn_#t~mem209 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1);cstrcspn_#t~short210 := cstrcspn_#t~mem209 != (if cstrcspn_~c~0 % 256 <= 127 then cstrcspn_~c~0 % 256 else cstrcspn_~c~0 % 256 - 256); 363#L372-3 assume !!cstrcspn_#t~short210;havoc cstrcspn_#t~mem208;havoc cstrcspn_#t~mem209;havoc cstrcspn_#t~short210;cstrcspn_#t~post211.base, cstrcspn_#t~post211.offset := cstrcspn_~s~0.base, cstrcspn_~s~0.offset;cstrcspn_~s~0.base, cstrcspn_~s~0.offset := cstrcspn_#t~post211.base, cstrcspn_#t~post211.offset - 1;havoc cstrcspn_#t~post211.base, cstrcspn_#t~post211.offset; 367#L372-5 [2020-10-20 06:43:17,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:43:17,469 INFO L82 PathProgramCache]: Analyzing trace with hash 1587378397, now seen corresponding path program 1 times [2020-10-20 06:43:17,469 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:43:17,470 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1940043891] [2020-10-20 06:43:17,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:43:17,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:43:17,483 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:43:17,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:43:17,496 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:43:17,502 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:43:17,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:43:17,502 INFO L82 PathProgramCache]: Analyzing trace with hash 58692, now seen corresponding path program 2 times [2020-10-20 06:43:17,502 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:43:17,503 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2137684806] [2020-10-20 06:43:17,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:43:17,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:43:17,507 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:43:17,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:43:17,511 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:43:17,513 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:43:17,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:43:17,514 INFO L82 PathProgramCache]: Analyzing trace with hash 1999924968, now seen corresponding path program 1 times [2020-10-20 06:43:17,514 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:43:17,514 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [50208650] [2020-10-20 06:43:17,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:43:17,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:43:17,604 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 06:43:17,604 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [50208650] [2020-10-20 06:43:17,604 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [626269352] [2020-10-20 06:43:17,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-20 06:43:17,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:43:17,662 INFO L263 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 22 conjunts are in the unsatisfiable core [2020-10-20 06:43:17,664 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 06:43:17,687 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 06:43:17,766 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 06:43:17,770 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 06:43:17,771 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-20 06:43:17,771 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2020-10-20 06:43:17,771 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [363356067] [2020-10-20 06:43:17,889 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 06:43:17,890 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-20 06:43:17,890 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2020-10-20 06:43:17,890 INFO L87 Difference]: Start difference. First operand 24 states and 33 transitions. cyclomatic complexity: 12 Second operand 8 states. [2020-10-20 06:43:18,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 06:43:18,119 INFO L93 Difference]: Finished difference Result 59 states and 72 transitions. [2020-10-20 06:43:18,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-20 06:43:18,120 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 59 states and 72 transitions. [2020-10-20 06:43:18,123 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-10-20 06:43:18,125 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 59 states to 43 states and 53 transitions. [2020-10-20 06:43:18,125 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2020-10-20 06:43:18,125 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2020-10-20 06:43:18,126 INFO L73 IsDeterministic]: Start isDeterministic. Operand 43 states and 53 transitions. [2020-10-20 06:43:18,126 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-20 06:43:18,126 INFO L691 BuchiCegarLoop]: Abstraction has 43 states and 53 transitions. [2020-10-20 06:43:18,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states and 53 transitions. [2020-10-20 06:43:18,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 28. [2020-10-20 06:43:18,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2020-10-20 06:43:18,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 36 transitions. [2020-10-20 06:43:18,130 INFO L714 BuchiCegarLoop]: Abstraction has 28 states and 36 transitions. [2020-10-20 06:43:18,130 INFO L594 BuchiCegarLoop]: Abstraction has 28 states and 36 transitions. [2020-10-20 06:43:18,131 INFO L427 BuchiCegarLoop]: ======== Iteration 5============ [2020-10-20 06:43:18,131 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 36 transitions. [2020-10-20 06:43:18,131 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-10-20 06:43:18,132 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 06:43:18,132 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 06:43:18,132 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 06:43:18,132 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-10-20 06:43:18,133 INFO L794 eck$LassoCheckResult]: Stem: 520#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 513#L-1 havoc main_#res;havoc main_#t~nondet213, main_#t~nondet214, main_#t~malloc215.base, main_#t~malloc215.offset, main_#t~malloc216.base, main_#t~malloc216.offset, main_#t~ret217, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet213;havoc main_#t~nondet213;main_~length2~0 := main_#t~nondet214;havoc main_#t~nondet214; 514#L382 assume !(main_~length1~0 < 1); 515#L382-2 assume !(main_~length2~0 < 1); 512#L385-1 call main_#t~malloc215.base, main_#t~malloc215.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc215.base, main_#t~malloc215.offset;call main_#t~malloc216.base, main_#t~malloc216.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc216.base, main_#t~malloc216.offset;call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset, 1);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1);cstrcspn_#in~s1.base, cstrcspn_#in~s1.offset, cstrcspn_#in~s2.base, cstrcspn_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrcspn_#res;havoc cstrcspn_#t~mem207, cstrcspn_#t~post211.base, cstrcspn_#t~post211.offset, cstrcspn_#t~mem208, cstrcspn_#t~mem209, cstrcspn_#t~short210, cstrcspn_#t~mem212, cstrcspn_#t~post205.base, cstrcspn_#t~post205.offset, cstrcspn_#t~mem206, cstrcspn_~s1.base, cstrcspn_~s1.offset, cstrcspn_~s2.base, cstrcspn_~s2.offset, cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, cstrcspn_~s~0.base, cstrcspn_~s~0.offset, cstrcspn_~c~0;cstrcspn_~s1.base, cstrcspn_~s1.offset := cstrcspn_#in~s1.base, cstrcspn_#in~s1.offset;cstrcspn_~s2.base, cstrcspn_~s2.offset := cstrcspn_#in~s2.base, cstrcspn_#in~s2.offset;havoc cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset;havoc cstrcspn_~s~0.base, cstrcspn_~s~0.offset;havoc cstrcspn_~c~0;cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset := cstrcspn_~s1.base, cstrcspn_~s1.offset; 508#L369-4 call cstrcspn_#t~mem206 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1); 509#L369-1 assume !!(0 != cstrcspn_#t~mem206);havoc cstrcspn_#t~mem206;cstrcspn_~s~0.base, cstrcspn_~s~0.offset := cstrcspn_~s2.base, cstrcspn_~s2.offset;call cstrcspn_#t~mem207 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1);cstrcspn_~c~0 := cstrcspn_#t~mem207;havoc cstrcspn_#t~mem207; 528#L372-5 call cstrcspn_#t~mem208 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1);cstrcspn_#t~short210 := 0 != cstrcspn_#t~mem208; 518#L372-1 assume cstrcspn_#t~short210;call cstrcspn_#t~mem209 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1);cstrcspn_#t~short210 := cstrcspn_#t~mem209 != (if cstrcspn_~c~0 % 256 <= 127 then cstrcspn_~c~0 % 256 else cstrcspn_~c~0 % 256 - 256); 519#L372-3 assume !cstrcspn_#t~short210;havoc cstrcspn_#t~mem208;havoc cstrcspn_#t~mem209;havoc cstrcspn_#t~short210; 504#L372-6 call cstrcspn_#t~mem212 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1); 505#L374 assume !(cstrcspn_#t~mem212 == cstrcspn_~c~0);havoc cstrcspn_#t~mem212; 506#L369-3 cstrcspn_#t~post205.base, cstrcspn_#t~post205.offset := cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset;cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset := cstrcspn_#t~post205.base, 1 + cstrcspn_#t~post205.offset;havoc cstrcspn_#t~post205.base, cstrcspn_#t~post205.offset; 507#L369-4 call cstrcspn_#t~mem206 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1); 511#L369-1 assume !!(0 != cstrcspn_#t~mem206);havoc cstrcspn_#t~mem206;cstrcspn_~s~0.base, cstrcspn_~s~0.offset := cstrcspn_~s2.base, cstrcspn_~s2.offset;call cstrcspn_#t~mem207 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1);cstrcspn_~c~0 := cstrcspn_#t~mem207;havoc cstrcspn_#t~mem207; 521#L372-5 [2020-10-20 06:43:18,133 INFO L796 eck$LassoCheckResult]: Loop: 521#L372-5 call cstrcspn_#t~mem208 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1);cstrcspn_#t~short210 := 0 != cstrcspn_#t~mem208; 516#L372-1 assume cstrcspn_#t~short210;call cstrcspn_#t~mem209 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1);cstrcspn_#t~short210 := cstrcspn_#t~mem209 != (if cstrcspn_~c~0 % 256 <= 127 then cstrcspn_~c~0 % 256 else cstrcspn_~c~0 % 256 - 256); 517#L372-3 assume !!cstrcspn_#t~short210;havoc cstrcspn_#t~mem208;havoc cstrcspn_#t~mem209;havoc cstrcspn_#t~short210;cstrcspn_#t~post211.base, cstrcspn_#t~post211.offset := cstrcspn_~s~0.base, cstrcspn_~s~0.offset;cstrcspn_~s~0.base, cstrcspn_~s~0.offset := cstrcspn_#t~post211.base, cstrcspn_#t~post211.offset - 1;havoc cstrcspn_#t~post211.base, cstrcspn_#t~post211.offset; 521#L372-5 [2020-10-20 06:43:18,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:43:18,133 INFO L82 PathProgramCache]: Analyzing trace with hash -187628965, now seen corresponding path program 2 times [2020-10-20 06:43:18,133 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:43:18,133 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [926293984] [2020-10-20 06:43:18,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:43:18,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:43:18,149 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:43:18,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:43:18,165 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:43:18,172 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:43:18,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:43:18,173 INFO L82 PathProgramCache]: Analyzing trace with hash 58692, now seen corresponding path program 3 times [2020-10-20 06:43:18,173 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:43:18,173 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2136024318] [2020-10-20 06:43:18,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:43:18,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:43:18,178 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:43:18,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:43:18,181 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:43:18,183 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:43:18,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:43:18,184 INFO L82 PathProgramCache]: Analyzing trace with hash -1902015318, now seen corresponding path program 1 times [2020-10-20 06:43:18,184 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:43:18,184 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1252765430] [2020-10-20 06:43:18,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:43:18,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:43:18,204 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:43:18,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:43:18,223 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:43:18,229 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:43:19,005 WARN L193 SmtUtils]: Spent 675.00 ms on a formula simplification. DAG size of input: 178 DAG size of output: 139 [2020-10-20 06:43:19,277 WARN L193 SmtUtils]: Spent 261.00 ms on a formula simplification that was a NOOP. DAG size: 113 [2020-10-20 06:43:19,279 INFO L210 LassoAnalysis]: Preferences: [2020-10-20 06:43:19,279 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-20 06:43:19,279 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-20 06:43:19,279 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-20 06:43:19,279 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-10-20 06:43:19,280 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:43:19,280 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-20 06:43:19,280 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-20 06:43:19,280 INFO L133 ssoRankerPreferences]: Filename of dumped script: cstrcspn_mixed_alloca.i_Iteration5_Lasso [2020-10-20 06:43:19,280 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-20 06:43:19,280 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-20 06:43:19,284 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:43:19,287 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:43:19,289 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:43:19,291 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:43:19,294 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:43:19,297 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:43:19,299 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:43:19,302 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:43:20,377 WARN L193 SmtUtils]: Spent 861.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 98 [2020-10-20 06:43:20,522 WARN L193 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 57 [2020-10-20 06:43:20,523 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:43:20,528 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:43:20,530 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:43:20,533 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:43:20,535 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:43:20,538 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:43:20,540 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:43:20,544 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:43:20,547 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:43:20,548 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:43:20,741 WARN L193 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 45 [2020-10-20 06:43:21,002 WARN L193 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 50 [2020-10-20 06:43:21,823 WARN L193 SmtUtils]: Spent 713.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 46 [2020-10-20 06:43:22,046 WARN L193 SmtUtils]: Spent 221.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 36 [2020-10-20 06:43:22,241 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-10-20 06:43:22,241 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 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 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:43:22,244 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-10-20 06:43:22,246 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:43:22,246 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 06:43:22,247 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:43:22,247 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:43:22,247 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:43:22,247 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 06:43:22,248 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 06:43:22,249 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 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 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:43:22,272 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-10-20 06:43:22,273 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:43:22,273 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 06:43:22,274 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:43:22,274 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:43:22,274 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:43:22,274 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 06:43:22,274 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 06:43:22,275 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-20 06:43:22,298 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-10-20 06:43:22,300 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:43:22,300 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 06:43:22,300 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:43:22,300 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:43:22,300 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:43:22,301 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 06:43:22,301 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:43:22,309 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 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 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:43:22,331 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-10-20 06:43:22,332 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:43:22,332 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:43:22,332 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:43:22,332 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:43:22,333 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 06:43:22,334 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 06:43:22,337 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 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 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:43:22,365 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-10-20 06:43:22,366 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:43:22,374 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 06:43:22,375 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:43:22,375 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:43:22,375 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:43:22,376 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 06:43:22,376 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 06:43:22,377 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 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 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:43:22,399 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-10-20 06:43:22,400 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:43:22,401 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 06:43:22,401 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:43:22,401 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:43:22,401 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:43:22,402 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 06:43:22,402 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 06:43:22,404 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 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 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:43:22,426 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-10-20 06:43:22,427 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:43:22,427 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 06:43:22,428 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:43:22,428 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:43:22,428 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:43:22,428 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 06:43:22,428 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 06:43:22,430 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-20 06:43:22,452 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 Waiting until toolchain timeout for monitored process 30 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:43:22,453 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:43:22,454 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:43:22,454 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:43:22,454 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:43:22,456 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 06:43:22,456 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 06:43:22,461 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 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 31 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:43:22,484 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-10-20 06:43:22,486 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:43:22,486 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:43:22,486 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:43:22,486 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:43:22,488 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 06:43:22,488 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 06:43:22,492 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-20 06:43:22,516 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 Waiting until toolchain timeout for monitored process 32 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:43:22,518 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:43:22,518 INFO L203 nArgumentSynthesizer]: 8 stem disjuncts [2020-10-20 06:43:22,518 INFO L204 nArgumentSynthesizer]: 6 loop disjuncts [2020-10-20 06:43:22,518 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:43:22,620 INFO L401 nArgumentSynthesizer]: We have 180 Motzkin's Theorem applications. [2020-10-20 06:43:22,620 INFO L402 nArgumentSynthesizer]: A total of 12 supporting invariants were added. [2020-10-20 06:43:22,864 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 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 33 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:43:22,888 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-10-20 06:43:22,889 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:43:22,889 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:43:22,889 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:43:22,890 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:43:22,891 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 06:43:22,891 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 06:43:22,895 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 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 34 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:43:22,917 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-10-20 06:43:22,919 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:43:22,919 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:43:22,919 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:43:22,919 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:43:22,925 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 06:43:22,926 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 06:43:22,942 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-20 06:43:22,966 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-10-20 06:43:22,968 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:43:22,969 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:43:22,969 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:43:22,969 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. Waiting until toolchain timeout for monitored process 35 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:43:22,977 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 06:43:22,977 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 06:43:23,001 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-10-20 06:43:23,044 INFO L443 ModelExtractionUtils]: Simplification made 11 calls to the SMT solver. [2020-10-20 06:43:23,044 INFO L444 ModelExtractionUtils]: 41 out of 52 variables were initially zero. Simplification set additionally 8 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-20 06:43:23,048 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... Waiting until toolchain timeout for monitored process 36 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:43:23,052 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-10-20 06:43:23,053 INFO L510 LassoAnalysis]: Proved termination. [2020-10-20 06:43:23,053 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_cstrcspn_~s~0.offset) = 2*ULTIMATE.start_cstrcspn_~s~0.offset + 1 Supporting invariants [] [2020-10-20 06:43:23,275 INFO L297 tatePredicateManager]: 24 out of 24 supporting invariants were superfluous and have been removed [2020-10-20 06:43:23,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:43:23,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:43:23,336 INFO L263 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-20 06:43:23,342 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 06:43:23,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:43:23,361 INFO L263 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 4 conjunts are in the unsatisfiable core [2020-10-20 06:43:23,361 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 06:43:23,382 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 06:43:23,383 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2020-10-20 06:43:23,383 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 28 states and 36 transitions. cyclomatic complexity: 11 Second operand 3 states. [2020-10-20 06:43:23,426 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 28 states and 36 transitions. cyclomatic complexity: 11. Second operand 3 states. Result 46 states and 58 transitions. Complement of second has 5 states. [2020-10-20 06:43:23,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2020-10-20 06:43:23,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-20 06:43:23,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 18 transitions. [2020-10-20 06:43:23,431 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 18 transitions. Stem has 15 letters. Loop has 3 letters. [2020-10-20 06:43:23,431 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 06:43:23,431 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2020-10-20 06:43:23,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:43:23,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:43:23,478 INFO L263 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-20 06:43:23,480 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 06:43:23,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:43:23,491 INFO L263 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 4 conjunts are in the unsatisfiable core [2020-10-20 06:43:23,491 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 06:43:23,503 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 06:43:23,504 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 2 loop predicates [2020-10-20 06:43:23,504 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 28 states and 36 transitions. cyclomatic complexity: 11 Second operand 3 states. [2020-10-20 06:43:23,528 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 28 states and 36 transitions. cyclomatic complexity: 11. Second operand 3 states. Result 46 states and 58 transitions. Complement of second has 5 states. [2020-10-20 06:43:23,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2020-10-20 06:43:23,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-20 06:43:23,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 18 transitions. [2020-10-20 06:43:23,529 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 18 transitions. Stem has 15 letters. Loop has 3 letters. [2020-10-20 06:43:23,530 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 06:43:23,530 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2020-10-20 06:43:23,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:43:23,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:43:23,613 INFO L263 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-20 06:43:23,614 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 06:43:23,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:43:23,623 INFO L263 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 4 conjunts are in the unsatisfiable core [2020-10-20 06:43:23,623 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 06:43:23,632 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 06:43:23,632 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2020-10-20 06:43:23,632 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 28 states and 36 transitions. cyclomatic complexity: 11 Second operand 3 states. [2020-10-20 06:43:23,653 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 28 states and 36 transitions. cyclomatic complexity: 11. Second operand 3 states. Result 45 states and 60 transitions. Complement of second has 4 states. [2020-10-20 06:43:23,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2020-10-20 06:43:23,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-20 06:43:23,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 27 transitions. [2020-10-20 06:43:23,654 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 27 transitions. Stem has 15 letters. Loop has 3 letters. [2020-10-20 06:43:23,655 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 06:43:23,655 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 27 transitions. Stem has 18 letters. Loop has 3 letters. [2020-10-20 06:43:23,655 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 06:43:23,655 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 27 transitions. Stem has 15 letters. Loop has 6 letters. [2020-10-20 06:43:23,656 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 06:43:23,656 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 45 states and 60 transitions. [2020-10-20 06:43:23,658 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-10-20 06:43:23,659 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 45 states to 0 states and 0 transitions. [2020-10-20 06:43:23,659 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2020-10-20 06:43:23,659 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2020-10-20 06:43:23,659 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2020-10-20 06:43:23,659 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-20 06:43:23,659 INFO L691 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-10-20 06:43:23,659 INFO L714 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-10-20 06:43:23,659 INFO L594 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-10-20 06:43:23,660 INFO L427 BuchiCegarLoop]: ======== Iteration 6============ [2020-10-20 06:43:23,660 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2020-10-20 06:43:23,660 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-10-20 06:43:23,660 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-10-20 06:43:23,668 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 20.10 06:43:23 BoogieIcfgContainer [2020-10-20 06:43:23,668 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2020-10-20 06:43:23,668 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-10-20 06:43:23,668 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-10-20 06:43:23,668 INFO L275 PluginConnector]: Witness Printer initialized [2020-10-20 06:43:23,669 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.10 06:43:10" (3/4) ... [2020-10-20 06:43:23,672 INFO L140 WitnessPrinter]: No result that supports witness generation found [2020-10-20 06:43:23,673 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-10-20 06:43:23,675 INFO L168 Benchmark]: Toolchain (without parser) took 14622.51 ms. Allocated memory was 40.9 MB in the beginning and 105.4 MB in the end (delta: 64.5 MB). Free memory was 17.8 MB in the beginning and 68.8 MB in the end (delta: -51.1 MB). Peak memory consumption was 13.4 MB. Max. memory is 14.3 GB. [2020-10-20 06:43:23,676 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 31.5 MB. Free memory was 7.5 MB in the beginning and 7.4 MB in the end (delta: 42.1 kB). Peak memory consumption was 42.1 kB. Max. memory is 14.3 GB. [2020-10-20 06:43:23,676 INFO L168 Benchmark]: CACSL2BoogieTranslator took 678.57 ms. Allocated memory was 40.9 MB in the beginning and 44.0 MB in the end (delta: 3.1 MB). Free memory was 16.9 MB in the beginning and 16.5 MB in the end (delta: 434.4 kB). Peak memory consumption was 8.1 MB. Max. memory is 14.3 GB. [2020-10-20 06:43:23,677 INFO L168 Benchmark]: Boogie Procedure Inliner took 61.52 ms. Allocated memory is still 44.0 MB. Free memory was 16.5 MB in the beginning and 14.2 MB in the end (delta: 2.3 MB). Peak memory consumption was 2.3 MB. Max. memory is 14.3 GB. [2020-10-20 06:43:23,678 INFO L168 Benchmark]: Boogie Preprocessor took 29.91 ms. Allocated memory is still 44.0 MB. Free memory was 14.2 MB in the beginning and 12.6 MB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 14.3 GB. [2020-10-20 06:43:23,678 INFO L168 Benchmark]: RCFGBuilder took 374.42 ms. Allocated memory is still 44.0 MB. Free memory was 12.3 MB in the beginning and 11.2 MB in the end (delta: 1.2 MB). Peak memory consumption was 1.8 MB. Max. memory is 14.3 GB. [2020-10-20 06:43:23,679 INFO L168 Benchmark]: BuchiAutomizer took 13462.81 ms. Allocated memory was 44.0 MB in the beginning and 105.4 MB in the end (delta: 61.3 MB). Free memory was 11.2 MB in the beginning and 70.3 MB in the end (delta: -59.1 MB). Peak memory consumption was 2.2 MB. Max. memory is 14.3 GB. [2020-10-20 06:43:23,680 INFO L168 Benchmark]: Witness Printer took 4.50 ms. Allocated memory is still 105.4 MB. Free memory was 70.3 MB in the beginning and 68.8 MB in the end (delta: 1.5 MB). Peak memory consumption was 1.5 MB. Max. memory is 14.3 GB. [2020-10-20 06:43:23,688 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19 ms. Allocated memory is still 31.5 MB. Free memory was 7.5 MB in the beginning and 7.4 MB in the end (delta: 42.1 kB). Peak memory consumption was 42.1 kB. Max. memory is 14.3 GB. * CACSL2BoogieTranslator took 678.57 ms. Allocated memory was 40.9 MB in the beginning and 44.0 MB in the end (delta: 3.1 MB). Free memory was 16.9 MB in the beginning and 16.5 MB in the end (delta: 434.4 kB). Peak memory consumption was 8.1 MB. Max. memory is 14.3 GB. * Boogie Procedure Inliner took 61.52 ms. Allocated memory is still 44.0 MB. Free memory was 16.5 MB in the beginning and 14.2 MB in the end (delta: 2.3 MB). Peak memory consumption was 2.3 MB. Max. memory is 14.3 GB. * Boogie Preprocessor took 29.91 ms. Allocated memory is still 44.0 MB. Free memory was 14.2 MB in the beginning and 12.6 MB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 14.3 GB. * RCFGBuilder took 374.42 ms. Allocated memory is still 44.0 MB. Free memory was 12.3 MB in the beginning and 11.2 MB in the end (delta: 1.2 MB). Peak memory consumption was 1.8 MB. Max. memory is 14.3 GB. * BuchiAutomizer took 13462.81 ms. Allocated memory was 44.0 MB in the beginning and 105.4 MB in the end (delta: 61.3 MB). Free memory was 11.2 MB in the beginning and 70.3 MB in the end (delta: -59.1 MB). Peak memory consumption was 2.2 MB. Max. memory is 14.3 GB. * Witness Printer took 4.50 ms. Allocated memory is still 105.4 MB. Free memory was 70.3 MB in the beginning and 68.8 MB in the end (delta: 1.5 MB). Peak memory consumption was 1.5 MB. Max. memory is 14.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 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 5 terminating modules (2 trivial, 2 deterministic, 1 nondeterministic). One deterministic module has affine ranking function unknown-#length-unknown[__builtin_alloca(length1 * sizeof(char))] + -1 * sc1 and consists of 3 locations. One deterministic module has affine ranking function unknown-#length-unknown[s] + 2 * s and consists of 3 locations. One nondeterministic module has affine ranking function 2 * s + 1 and consists of 3 locations. 2 modules have a trivial ranking function, the largest among these consists of 8 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 13.3s and 6 iterations. TraceHistogramMax:2. Analysis of lassos took 12.1s. Construction of modules took 0.1s. Büchi inclusion checks took 0.8s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 3. Automata minimization 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 21 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 28 states and ocurred in iteration 4. Nontrivial modules had stage [2, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 115 SDtfs, 110 SDslu, 70 SDs, 0 SdLazy, 117 SolverSat, 22 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc1 concLT0 SILN0 SILU0 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital276 mio100 ax100 hnf99 lsp107 ukn82 mio100 lsp39 div114 bol100 ite100 ukn100 eq179 hnf83 smp87 dnf908 smp24 tf100 neg94 sie114 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 350ms VariablesStem: 7 VariablesLoop: 4 DisjunctsStem: 8 DisjunctsLoop: 6 SupportingInvariants: 12 MotzkinApplications: 180 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! Received shutdown request...