./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 cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_711d2cdf-bd4f-49b5-b240-5264ad404f16/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_711d2cdf-bd4f-49b5-b240-5264ad404f16/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_711d2cdf-bd4f-49b5-b240-5264ad404f16/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_711d2cdf-bd4f-49b5-b240-5264ad404f16/bin/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-15/cstrcspn_mixed_alloca.i -s /tmp/vcloud-vcloud-master/worker/run_dir_711d2cdf-bd4f-49b5-b240-5264ad404f16/bin/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_711d2cdf-bd4f-49b5-b240-5264ad404f16/bin/uautomizer --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.24-cad4683 [2019-11-15 23:38:40,254 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-15 23:38:40,256 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-15 23:38:40,266 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-15 23:38:40,266 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-15 23:38:40,267 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-15 23:38:40,268 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-15 23:38:40,270 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-15 23:38:40,272 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-15 23:38:40,272 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-15 23:38:40,273 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-15 23:38:40,274 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-15 23:38:40,274 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-15 23:38:40,275 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-15 23:38:40,276 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-15 23:38:40,277 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-15 23:38:40,277 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-15 23:38:40,278 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-15 23:38:40,280 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-15 23:38:40,281 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-15 23:38:40,283 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-15 23:38:40,283 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-15 23:38:40,284 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-15 23:38:40,285 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-15 23:38:40,287 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-15 23:38:40,287 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-15 23:38:40,287 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-15 23:38:40,288 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-15 23:38:40,288 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-15 23:38:40,289 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-15 23:38:40,289 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-15 23:38:40,290 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-15 23:38:40,290 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-15 23:38:40,291 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-15 23:38:40,292 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-15 23:38:40,292 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-15 23:38:40,292 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-15 23:38:40,293 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-15 23:38:40,293 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-15 23:38:40,293 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-15 23:38:40,294 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-15 23:38:40,295 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_711d2cdf-bd4f-49b5-b240-5264ad404f16/bin/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2019-11-15 23:38:40,309 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-15 23:38:40,310 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-15 23:38:40,311 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-15 23:38:40,311 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-15 23:38:40,311 INFO L138 SettingsManager]: * Use SBE=true [2019-11-15 23:38:40,311 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-11-15 23:38:40,311 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-11-15 23:38:40,312 INFO L138 SettingsManager]: * Use old map elimination=false [2019-11-15 23:38:40,312 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-11-15 23:38:40,312 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-11-15 23:38:40,312 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-11-15 23:38:40,312 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-15 23:38:40,313 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-15 23:38:40,313 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-15 23:38:40,313 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-15 23:38:40,313 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-11-15 23:38:40,313 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-11-15 23:38:40,314 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-11-15 23:38:40,314 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-15 23:38:40,314 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-11-15 23:38:40,314 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-15 23:38:40,314 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-11-15 23:38:40,315 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-15 23:38:40,315 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-15 23:38:40,315 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-11-15 23:38:40,315 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-15 23:38:40,316 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-15 23:38:40,316 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-11-15 23:38:40,317 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-11-15 23:38:40,317 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 -> /tmp/vcloud-vcloud-master/worker/run_dir_711d2cdf-bd4f-49b5-b240-5264ad404f16/bin/uautomizer 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 [2019-11-15 23:38:40,341 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-15 23:38:40,350 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-15 23:38:40,353 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-15 23:38:40,355 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-15 23:38:40,355 INFO L275 PluginConnector]: CDTParser initialized [2019-11-15 23:38:40,355 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_711d2cdf-bd4f-49b5-b240-5264ad404f16/bin/uautomizer/../../sv-benchmarks/c/termination-15/cstrcspn_mixed_alloca.i [2019-11-15 23:38:40,404 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_711d2cdf-bd4f-49b5-b240-5264ad404f16/bin/uautomizer/data/5a6f398a9/13c4de63a74b4f52ad8d34e1ede29b67/FLAG50a0cd04e [2019-11-15 23:38:40,867 INFO L306 CDTParser]: Found 1 translation units. [2019-11-15 23:38:40,867 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_711d2cdf-bd4f-49b5-b240-5264ad404f16/sv-benchmarks/c/termination-15/cstrcspn_mixed_alloca.i [2019-11-15 23:38:40,880 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_711d2cdf-bd4f-49b5-b240-5264ad404f16/bin/uautomizer/data/5a6f398a9/13c4de63a74b4f52ad8d34e1ede29b67/FLAG50a0cd04e [2019-11-15 23:38:41,372 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_711d2cdf-bd4f-49b5-b240-5264ad404f16/bin/uautomizer/data/5a6f398a9/13c4de63a74b4f52ad8d34e1ede29b67 [2019-11-15 23:38:41,374 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-15 23:38:41,375 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-15 23:38:41,376 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-15 23:38:41,376 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-15 23:38:41,382 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-15 23:38:41,383 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 11:38:41" (1/1) ... [2019-11-15 23:38:41,385 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@63f8962a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:38:41, skipping insertion in model container [2019-11-15 23:38:41,385 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 11:38:41" (1/1) ... [2019-11-15 23:38:41,390 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-15 23:38:41,430 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-15 23:38:41,749 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 23:38:41,758 INFO L188 MainTranslator]: Completed pre-run [2019-11-15 23:38:41,799 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 23:38:41,852 INFO L192 MainTranslator]: Completed translation [2019-11-15 23:38:41,853 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:38:41 WrapperNode [2019-11-15 23:38:41,853 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-15 23:38:41,854 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-15 23:38:41,854 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-15 23:38:41,854 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-15 23:38:41,861 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:38:41" (1/1) ... [2019-11-15 23:38:41,874 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:38:41" (1/1) ... [2019-11-15 23:38:41,896 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-15 23:38:41,897 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-15 23:38:41,897 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-15 23:38:41,897 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-15 23:38:41,905 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:38:41" (1/1) ... [2019-11-15 23:38:41,906 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:38:41" (1/1) ... [2019-11-15 23:38:41,908 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:38:41" (1/1) ... [2019-11-15 23:38:41,909 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:38:41" (1/1) ... [2019-11-15 23:38:41,916 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:38:41" (1/1) ... [2019-11-15 23:38:41,919 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:38:41" (1/1) ... [2019-11-15 23:38:41,921 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:38:41" (1/1) ... [2019-11-15 23:38:41,923 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-15 23:38:41,924 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-15 23:38:41,924 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-15 23:38:41,924 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-15 23:38:41,925 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:38:41" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_711d2cdf-bd4f-49b5-b240-5264ad404f16/bin/uautomizer/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 [2019-11-15 23:38:41,990 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-15 23:38:41,990 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-15 23:38:41,990 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-15 23:38:41,991 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-15 23:38:41,991 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-15 23:38:41,992 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-15 23:38:42,240 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-15 23:38:42,241 INFO L284 CfgBuilder]: Removed 8 assume(true) statements. [2019-11-15 23:38:42,242 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 11:38:42 BoogieIcfgContainer [2019-11-15 23:38:42,242 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-15 23:38:42,242 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-11-15 23:38:42,243 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-11-15 23:38:42,246 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-11-15 23:38:42,246 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-15 23:38:42,247 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 15.11 11:38:41" (1/3) ... [2019-11-15 23:38:42,248 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@207bce83 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 15.11 11:38:42, skipping insertion in model container [2019-11-15 23:38:42,248 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-15 23:38:42,248 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:38:41" (2/3) ... [2019-11-15 23:38:42,248 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@207bce83 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 15.11 11:38:42, skipping insertion in model container [2019-11-15 23:38:42,248 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-15 23:38:42,248 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 11:38:42" (3/3) ... [2019-11-15 23:38:42,250 INFO L371 chiAutomizerObserver]: Analyzing ICFG cstrcspn_mixed_alloca.i [2019-11-15 23:38:42,289 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-11-15 23:38:42,289 INFO L357 BuchiCegarLoop]: Hoare is false [2019-11-15 23:38:42,290 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-11-15 23:38:42,290 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-15 23:38:42,290 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-15 23:38:42,290 INFO L361 BuchiCegarLoop]: Difference is false [2019-11-15 23:38:42,290 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-15 23:38:42,290 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-11-15 23:38:42,318 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states. [2019-11-15 23:38:42,362 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2019-11-15 23:38:42,362 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 23:38:42,362 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 23:38:42,368 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-11-15 23:38:42,368 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2019-11-15 23:38:42,368 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-11-15 23:38:42,369 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states. [2019-11-15 23:38:42,370 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2019-11-15 23:38:42,370 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 23:38:42,370 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 23:38:42,371 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-11-15 23:38:42,371 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2019-11-15 23:38:42,378 INFO L791 eck$LassoCheckResult]: Stem: 13#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 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 [2019-11-15 23:38:42,379 INFO L793 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 [2019-11-15 23:38:42,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:38:42,384 INFO L82 PathProgramCache]: Analyzing trace with hash 28695878, now seen corresponding path program 1 times [2019-11-15 23:38:42,391 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:38:42,391 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [127826158] [2019-11-15 23:38:42,392 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:38:42,392 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:38:42,392 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:38:42,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:38:42,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:38:42,526 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:38:42,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:38:42,527 INFO L82 PathProgramCache]: Analyzing trace with hash 1454917130, now seen corresponding path program 1 times [2019-11-15 23:38:42,527 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:38:42,528 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1531782883] [2019-11-15 23:38:42,528 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:38:42,528 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:38:42,528 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:38:42,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:38:42,556 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:38:42,557 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1531782883] [2019-11-15 23:38:42,557 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:38:42,557 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-15 23:38:42,558 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [58926251] [2019-11-15 23:38:42,562 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-11-15 23:38:42,563 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:38:42,576 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-15 23:38:42,577 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-15 23:38:42,578 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 2 states. [2019-11-15 23:38:42,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:38:42,584 INFO L93 Difference]: Finished difference Result 18 states and 23 transitions. [2019-11-15 23:38:42,584 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-15 23:38:42,586 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 18 states and 23 transitions. [2019-11-15 23:38:42,587 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2019-11-15 23:38:42,591 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 18 states to 13 states and 17 transitions. [2019-11-15 23:38:42,592 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2019-11-15 23:38:42,592 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2019-11-15 23:38:42,592 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 17 transitions. [2019-11-15 23:38:42,593 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 23:38:42,593 INFO L688 BuchiCegarLoop]: Abstraction has 13 states and 17 transitions. [2019-11-15 23:38:42,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 17 transitions. [2019-11-15 23:38:42,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2019-11-15 23:38:42,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-11-15 23:38:42,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 17 transitions. [2019-11-15 23:38:42,617 INFO L711 BuchiCegarLoop]: Abstraction has 13 states and 17 transitions. [2019-11-15 23:38:42,617 INFO L591 BuchiCegarLoop]: Abstraction has 13 states and 17 transitions. [2019-11-15 23:38:42,618 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-11-15 23:38:42,618 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 17 transitions. [2019-11-15 23:38:42,618 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2019-11-15 23:38:42,618 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 23:38:42,619 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 23:38:42,619 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-11-15 23:38:42,619 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:38:42,619 INFO L791 eck$LassoCheckResult]: Stem: 55#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 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 [2019-11-15 23:38:42,620 INFO L793 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 [2019-11-15 23:38:42,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:38:42,620 INFO L82 PathProgramCache]: Analyzing trace with hash 28695878, now seen corresponding path program 2 times [2019-11-15 23:38:42,620 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:38:42,620 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1097887061] [2019-11-15 23:38:42,620 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:38:42,621 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:38:42,621 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:38:42,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:38:42,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:38:42,661 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:38:42,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:38:42,661 INFO L82 PathProgramCache]: Analyzing trace with hash 1927396657, now seen corresponding path program 1 times [2019-11-15 23:38:42,661 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:38:42,662 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1734624482] [2019-11-15 23:38:42,662 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:38:42,662 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:38:42,662 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:38:42,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:38:42,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:38:42,698 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:38:42,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:38:42,698 INFO L82 PathProgramCache]: Analyzing trace with hash -102988426, now seen corresponding path program 1 times [2019-11-15 23:38:42,699 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:38:42,699 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1753769638] [2019-11-15 23:38:42,699 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:38:42,699 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:38:42,699 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:38:42,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:38:42,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:38:42,817 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:38:43,068 WARN L191 SmtUtils]: Spent 245.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 59 [2019-11-15 23:38:43,393 WARN L191 SmtUtils]: Spent 294.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 50 [2019-11-15 23:38:43,762 WARN L191 SmtUtils]: Spent 366.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 93 [2019-11-15 23:38:43,917 WARN L191 SmtUtils]: Spent 152.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2019-11-15 23:38:43,929 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 23:38:43,930 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 23:38:43,931 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 23:38:43,931 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 23:38:43,931 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-15 23:38:43,931 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 23:38:43,931 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 23:38:43,931 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 23:38:43,932 INFO L131 ssoRankerPreferences]: Filename of dumped script: cstrcspn_mixed_alloca.i_Iteration2_Lasso [2019-11-15 23:38:43,932 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 23:38:43,932 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 23:38:43,956 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:38:43,964 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:38:43,968 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:38:43,971 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:38:43,974 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:38:43,977 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:38:43,979 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:38:43,982 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:38:43,990 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:38:43,993 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:38:43,995 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:38:43,997 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:38:43,999 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:38:44,001 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:38:44,003 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:38:44,006 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:38:44,365 WARN L191 SmtUtils]: Spent 241.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 74 [2019-11-15 23:38:44,589 WARN L191 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 57 [2019-11-15 23:38:44,589 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:38:44,592 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:38:45,273 WARN L191 SmtUtils]: Spent 321.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 40 [2019-11-15 23:38:45,521 WARN L191 SmtUtils]: Spent 232.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 34 [2019-11-15 23:38:45,620 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 23:38:45,625 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-15 23:38:45,627 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 [2019-11-15 23:38:45,628 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:38:45,629 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:38:45,629 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:38:45,629 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:38:45,630 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:38:45,631 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:38:45,632 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:38:45,633 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:38:45,634 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 [2019-11-15 23:38:45,634 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:38:45,635 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:38:45,635 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:38:45,635 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:38:45,637 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:38:45,637 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:38:45,640 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:38:45,641 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 [2019-11-15 23:38:45,641 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:38:45,642 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:38:45,642 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:38:45,642 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:38:45,642 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:38:45,643 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:38:45,643 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:38:45,644 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:38:45,644 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 [2019-11-15 23:38:45,645 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:38:45,645 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:38:45,645 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:38:45,646 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:38:45,647 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:38:45,647 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:38:45,650 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:38:45,650 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 [2019-11-15 23:38:45,651 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:38:45,651 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:38:45,651 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:38:45,652 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:38:45,652 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:38:45,652 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:38:45,652 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:38:45,653 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:38:45,654 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 [2019-11-15 23:38:45,654 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:38:45,655 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:38:45,655 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:38:45,655 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:38:45,655 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:38:45,656 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:38:45,656 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:38:45,657 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:38:45,657 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 [2019-11-15 23:38:45,658 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:38:45,658 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:38:45,658 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:38:45,658 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:38:45,659 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:38:45,659 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:38:45,659 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:38:45,660 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:38:45,660 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 [2019-11-15 23:38:45,661 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:38:45,661 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:38:45,661 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:38:45,661 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:38:45,662 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:38:45,662 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:38:45,662 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:38:45,663 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:38:45,664 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 [2019-11-15 23:38:45,664 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:38:45,664 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:38:45,664 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:38:45,665 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:38:45,665 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:38:45,665 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:38:45,665 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:38:45,666 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:38:45,667 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 [2019-11-15 23:38:45,667 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:38:45,667 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:38:45,668 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:38:45,668 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:38:45,668 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:38:45,668 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:38:45,669 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:38:45,669 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:38:45,670 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 [2019-11-15 23:38:45,670 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:38:45,670 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:38:45,671 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:38:45,671 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:38:45,671 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:38:45,671 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:38:45,672 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:38:45,672 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:38:45,673 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 [2019-11-15 23:38:45,673 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:38:45,673 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:38:45,674 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:38:45,674 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:38:45,674 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:38:45,675 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:38:45,675 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:38:45,675 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:38:45,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 [2019-11-15 23:38:45,676 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:38:45,677 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:38:45,677 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:38:45,677 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:38:45,677 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:38:45,678 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:38:45,678 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:38:45,678 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:38:45,679 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 [2019-11-15 23:38:45,679 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:38:45,680 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:38:45,680 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:38:45,680 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:38:45,680 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:38:45,681 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:38:45,681 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:38:45,681 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:38:45,682 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 [2019-11-15 23:38:45,682 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:38:45,683 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:38:45,683 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:38:45,683 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:38:45,683 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:38:45,684 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:38:45,684 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:38:45,685 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:38:45,685 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 [2019-11-15 23:38:45,686 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:38:45,686 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:38:45,686 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:38:45,686 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:38:45,688 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:38:45,689 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:38:45,692 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:38:45,693 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 [2019-11-15 23:38:45,693 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:38:45,694 INFO L202 nArgumentSynthesizer]: 4 stem disjuncts [2019-11-15 23:38:45,694 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:38:45,694 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:38:45,704 INFO L400 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2019-11-15 23:38:45,704 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:38:45,751 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:38:45,752 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 [2019-11-15 23:38:45,753 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:38:45,753 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:38:45,753 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:38:45,753 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:38:45,755 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:38:45,755 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:38:45,757 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:38:45,757 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 [2019-11-15 23:38:45,758 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:38:45,758 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:38:45,758 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:38:45,759 INFO L203 nArgumentSynthesizer]: 4 loop disjuncts [2019-11-15 23:38:45,759 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:38:45,761 INFO L400 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-11-15 23:38:45,761 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:38:45,781 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:38:45,782 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 [2019-11-15 23:38:45,782 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:38:45,782 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:38:45,783 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:38:45,783 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:38:45,784 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:38:45,784 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:38:45,786 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:38:45,787 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 [2019-11-15 23:38:45,787 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:38:45,787 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:38:45,787 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:38:45,788 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:38:45,788 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:38:45,788 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:38:45,788 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:38:45,790 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:38:45,791 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 [2019-11-15 23:38:45,791 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:38:45,791 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:38:45,792 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:38:45,792 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:38:45,794 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:38:45,794 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:38:45,805 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:38:45,806 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 [2019-11-15 23:38:45,806 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:38:45,806 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:38:45,807 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:38:45,807 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:38:45,812 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:38:45,812 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:38:45,873 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-15 23:38:45,940 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-11-15 23:38:45,941 INFO L444 ModelExtractionUtils]: 39 out of 43 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-11-15 23:38:45,943 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-15 23:38:45,945 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-15 23:38:45,946 INFO L510 LassoAnalysis]: Proved termination. [2019-11-15 23:38:45,947 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_cstrcspn_~sc1~0.base)_1, ULTIMATE.start_cstrcspn_~sc1~0.offset) = 1*v_rep(select #length ULTIMATE.start_cstrcspn_~sc1~0.base)_1 - 1*ULTIMATE.start_cstrcspn_~sc1~0.offset Supporting invariants [] [2019-11-15 23:38:45,979 INFO L297 tatePredicateManager]: 8 out of 8 supporting invariants were superfluous and have been removed [2019-11-15 23:38:45,985 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2019-11-15 23:38:46,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:38:46,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:38:46,029 INFO L256 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 23:38:46,030 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:38:46,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:38:46,081 INFO L256 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-15 23:38:46,087 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:38:46,102 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:38:46,104 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 [2019-11-15 23:38:46,104 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 13 states and 17 transitions. cyclomatic complexity: 5 Second operand 3 states. [2019-11-15 23:38:46,148 INFO L76 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. [2019-11-15 23:38:46,149 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-11-15 23:38:46,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-15 23:38:46,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 17 transitions. [2019-11-15 23:38:46,151 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 17 transitions. Stem has 5 letters. Loop has 8 letters. [2019-11-15 23:38:46,152 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 23:38:46,152 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 17 transitions. Stem has 13 letters. Loop has 8 letters. [2019-11-15 23:38:46,152 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 23:38:46,153 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 17 transitions. Stem has 5 letters. Loop has 16 letters. [2019-11-15 23:38:46,153 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 23:38:46,153 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 28 transitions. [2019-11-15 23:38:46,154 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-15 23:38:46,155 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 18 states and 25 transitions. [2019-11-15 23:38:46,155 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2019-11-15 23:38:46,155 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2019-11-15 23:38:46,156 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 25 transitions. [2019-11-15 23:38:46,156 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 23:38:46,156 INFO L688 BuchiCegarLoop]: Abstraction has 18 states and 25 transitions. [2019-11-15 23:38:46,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 25 transitions. [2019-11-15 23:38:46,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2019-11-15 23:38:46,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-11-15 23:38:46,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 25 transitions. [2019-11-15 23:38:46,158 INFO L711 BuchiCegarLoop]: Abstraction has 18 states and 25 transitions. [2019-11-15 23:38:46,158 INFO L591 BuchiCegarLoop]: Abstraction has 18 states and 25 transitions. [2019-11-15 23:38:46,158 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-11-15 23:38:46,158 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 25 transitions. [2019-11-15 23:38:46,159 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-15 23:38:46,159 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 23:38:46,159 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 23:38:46,160 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:38:46,160 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-15 23:38:46,160 INFO L791 eck$LassoCheckResult]: Stem: 180#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 177#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; 178#L382 assume !(main_~length1~0 < 1); 179#L382-2 assume !(main_~length2~0 < 1); 176#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; 173#L369-4 call cstrcspn_#t~mem206 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1); 175#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; 185#L372-5 [2019-11-15 23:38:46,160 INFO L793 eck$LassoCheckResult]: Loop: 185#L372-5 call cstrcspn_#t~mem208 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1);cstrcspn_#t~short210 := 0 != cstrcspn_#t~mem208; 181#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); 182#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; 185#L372-5 [2019-11-15 23:38:46,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:38:46,161 INFO L82 PathProgramCache]: Analyzing trace with hash 1806935595, now seen corresponding path program 1 times [2019-11-15 23:38:46,161 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:38:46,161 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [161348424] [2019-11-15 23:38:46,161 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:38:46,161 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:38:46,161 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:38:46,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:38:46,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:38:46,192 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:38:46,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:38:46,193 INFO L82 PathProgramCache]: Analyzing trace with hash 58692, now seen corresponding path program 1 times [2019-11-15 23:38:46,193 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:38:46,193 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1304282073] [2019-11-15 23:38:46,193 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:38:46,194 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:38:46,194 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:38:46,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:38:46,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:38:46,202 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:38:46,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:38:46,202 INFO L82 PathProgramCache]: Analyzing trace with hash 1593218778, now seen corresponding path program 1 times [2019-11-15 23:38:46,202 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:38:46,203 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1409228640] [2019-11-15 23:38:46,203 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:38:46,203 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:38:46,203 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:38:46,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:38:46,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:38:46,273 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:38:46,447 WARN L191 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 36 [2019-11-15 23:38:46,835 WARN L191 SmtUtils]: Spent 386.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 106 [2019-11-15 23:38:47,007 WARN L191 SmtUtils]: Spent 170.00 ms on a formula simplification that was a NOOP. DAG size: 98 [2019-11-15 23:38:47,009 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 23:38:47,009 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 23:38:47,010 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 23:38:47,010 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 23:38:47,010 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-15 23:38:47,010 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 23:38:47,010 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 23:38:47,010 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 23:38:47,010 INFO L131 ssoRankerPreferences]: Filename of dumped script: cstrcspn_mixed_alloca.i_Iteration3_Lasso [2019-11-15 23:38:47,010 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 23:38:47,010 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 23:38:47,015 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:38:47,018 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:38:47,020 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:38:47,021 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:38:47,023 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:38:47,405 WARN L191 SmtUtils]: Spent 277.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 85 [2019-11-15 23:38:47,520 WARN L191 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 59 [2019-11-15 23:38:47,521 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:38:47,523 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:38:47,526 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:38:47,528 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:38:47,529 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:38:47,531 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:38:47,536 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:38:47,541 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:38:47,543 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:38:47,545 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:38:47,547 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:38:47,548 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:38:47,551 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:38:47,556 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:38:47,704 WARN L191 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 50 [2019-11-15 23:38:48,196 WARN L191 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 36 [2019-11-15 23:38:48,551 WARN L191 SmtUtils]: Spent 354.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 43 [2019-11-15 23:38:48,583 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 23:38:48,583 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-15 23:38:48,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 [2019-11-15 23:38:48,584 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:38:48,584 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:38:48,585 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:38:48,585 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:38:48,585 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:38:48,585 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:38:48,585 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:38:48,586 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:38:48,586 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 [2019-11-15 23:38:48,586 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:38:48,587 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:38:48,587 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:38:48,587 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:38:48,588 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:38:48,588 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:38:48,589 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:38:48,589 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 [2019-11-15 23:38:48,590 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:38:48,590 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:38:48,590 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:38:48,590 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:38:48,590 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:38:48,590 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:38:48,591 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:38:48,591 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:38:48,591 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 [2019-11-15 23:38:48,591 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:38:48,592 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:38:48,592 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:38:48,593 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:38:48,593 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:38:48,593 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:38:48,593 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:38:48,594 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:38:48,594 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 [2019-11-15 23:38:48,595 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:38:48,595 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:38:48,595 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:38:48,595 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:38:48,596 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:38:48,596 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:38:48,597 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:38:48,598 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 [2019-11-15 23:38:48,598 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:38:48,598 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:38:48,598 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:38:48,599 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:38:48,600 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:38:48,600 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:38:48,605 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:38:48,605 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 [2019-11-15 23:38:48,606 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:38:48,606 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:38:48,607 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:38:48,607 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:38:48,611 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:38:48,611 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:38:48,642 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-15 23:38:48,674 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2019-11-15 23:38:48,675 INFO L444 ModelExtractionUtils]: 41 out of 52 variables were initially zero. Simplification set additionally 8 variables to zero. [2019-11-15 23:38:48,675 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-15 23:38:48,676 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-15 23:38:48,677 INFO L510 LassoAnalysis]: Proved termination. [2019-11-15 23:38:48,677 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 [] [2019-11-15 23:38:48,731 INFO L297 tatePredicateManager]: 16 out of 16 supporting invariants were superfluous and have been removed [2019-11-15 23:38:48,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:38:48,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:38:48,763 INFO L256 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 23:38:48,764 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:38:48,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:38:48,771 INFO L256 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-15 23:38:48,771 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:38:48,784 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:38:48,785 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 [2019-11-15 23:38:48,785 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 18 states and 25 transitions. cyclomatic complexity: 9 Second operand 3 states. [2019-11-15 23:38:48,808 INFO L76 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. [2019-11-15 23:38:48,808 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-11-15 23:38:48,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-15 23:38:48,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 18 transitions. [2019-11-15 23:38:48,809 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 18 transitions. Stem has 7 letters. Loop has 3 letters. [2019-11-15 23:38:48,809 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 23:38:48,809 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 18 transitions. Stem has 10 letters. Loop has 3 letters. [2019-11-15 23:38:48,810 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 23:38:48,810 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 18 transitions. Stem has 7 letters. Loop has 6 letters. [2019-11-15 23:38:48,810 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 23:38:48,810 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 43 states and 57 transitions. [2019-11-15 23:38:48,812 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-15 23:38:48,813 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 43 states to 30 states and 40 transitions. [2019-11-15 23:38:48,813 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2019-11-15 23:38:48,813 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2019-11-15 23:38:48,813 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 40 transitions. [2019-11-15 23:38:48,814 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 23:38:48,814 INFO L688 BuchiCegarLoop]: Abstraction has 30 states and 40 transitions. [2019-11-15 23:38:48,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states and 40 transitions. [2019-11-15 23:38:48,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 24. [2019-11-15 23:38:48,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-11-15 23:38:48,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 33 transitions. [2019-11-15 23:38:48,816 INFO L711 BuchiCegarLoop]: Abstraction has 24 states and 33 transitions. [2019-11-15 23:38:48,816 INFO L591 BuchiCegarLoop]: Abstraction has 24 states and 33 transitions. [2019-11-15 23:38:48,817 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-11-15 23:38:48,817 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 33 transitions. [2019-11-15 23:38:48,817 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-15 23:38:48,817 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 23:38:48,818 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 23:38:48,818 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:38:48,818 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-15 23:38:48,818 INFO L791 eck$LassoCheckResult]: Stem: 361#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 354#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; 355#L382 assume !(main_~length1~0 < 1); 356#L382-2 assume !(main_~length2~0 < 1); 353#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; 349#L369-4 call cstrcspn_#t~mem206 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1); 350#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; 363#L372-5 call cstrcspn_#t~mem208 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1);cstrcspn_#t~short210 := 0 != cstrcspn_#t~mem208; 359#L372-1 assume !cstrcspn_#t~short210; 360#L372-3 assume !cstrcspn_#t~short210;havoc cstrcspn_#t~mem208;havoc cstrcspn_#t~mem209;havoc cstrcspn_#t~short210; 345#L372-6 call cstrcspn_#t~mem212 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1); 346#L374 assume !(cstrcspn_#t~mem212 == cstrcspn_~c~0);havoc cstrcspn_#t~mem212; 347#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; 348#L369-4 call cstrcspn_#t~mem206 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1); 352#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; 362#L372-5 [2019-11-15 23:38:48,819 INFO L793 eck$LassoCheckResult]: Loop: 362#L372-5 call cstrcspn_#t~mem208 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1);cstrcspn_#t~short210 := 0 != cstrcspn_#t~mem208; 357#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); 358#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; 362#L372-5 [2019-11-15 23:38:48,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:38:48,819 INFO L82 PathProgramCache]: Analyzing trace with hash 1587378397, now seen corresponding path program 1 times [2019-11-15 23:38:48,819 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:38:48,819 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1410131244] [2019-11-15 23:38:48,819 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:38:48,819 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:38:48,819 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:38:48,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:38:48,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:38:48,859 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:38:48,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:38:48,863 INFO L82 PathProgramCache]: Analyzing trace with hash 58692, now seen corresponding path program 2 times [2019-11-15 23:38:48,864 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:38:48,864 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1350490351] [2019-11-15 23:38:48,864 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:38:48,864 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:38:48,865 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:38:48,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:38:48,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:38:48,872 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:38:48,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:38:48,873 INFO L82 PathProgramCache]: Analyzing trace with hash 1999924968, now seen corresponding path program 1 times [2019-11-15 23:38:48,873 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:38:48,873 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1649879330] [2019-11-15 23:38:48,874 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:38:48,874 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:38:48,874 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:38:48,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:38:48,989 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:38:48,990 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1649879330] [2019-11-15 23:38:48,990 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1340406488] [2019-11-15 23:38:48,990 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_711d2cdf-bd4f-49b5-b240-5264ad404f16/bin/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:38:49,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:38:49,065 INFO L256 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 23 conjunts are in the unsatisfiable core [2019-11-15 23:38:49,066 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:38:49,100 INFO L341 Elim1Store]: treesize reduction 44, result has 18.5 percent of original size [2019-11-15 23:38:49,100 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 23 [2019-11-15 23:38:49,101 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:38:49,108 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:38:49,109 INFO L496 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-11-15 23:38:49,109 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:38, output treesize:23 [2019-11-15 23:39:25,152 WARN L191 SmtUtils]: Spent 12.01 s on a formula simplification that was a NOOP. DAG size: 22 [2019-11-15 23:39:49,224 WARN L191 SmtUtils]: Spent 12.02 s on a formula simplification that was a NOOP. DAG size: 27 [2019-11-15 23:40:37,326 WARN L191 SmtUtils]: Spent 36.06 s on a formula simplification that was a NOOP. DAG size: 30 [2019-11-15 23:41:25,379 WARN L191 SmtUtils]: Spent 24.01 s on a formula simplification that was a NOOP. DAG size: 25 [2019-11-15 23:42:04,926 WARN L191 SmtUtils]: Spent 24.02 s on a formula simplification that was a NOOP. DAG size: 25 [2019-11-15 23:42:04,928 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:42:04,934 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:42:04,935 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 23:42:04,935 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 13 [2019-11-15 23:42:04,935 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1332699870] [2019-11-15 23:42:05,108 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:42:05,108 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-11-15 23:42:05,109 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=116, Unknown=8, NotChecked=0, Total=156 [2019-11-15 23:42:05,109 INFO L87 Difference]: Start difference. First operand 24 states and 33 transitions. cyclomatic complexity: 12 Second operand 13 states. [2019-11-15 23:43:17,217 WARN L191 SmtUtils]: Spent 1.20 m on a formula simplification. DAG size of input: 40 DAG size of output: 35 [2019-11-15 23:44:56,446 WARN L191 SmtUtils]: Spent 1.65 m on a formula simplification. DAG size of input: 41 DAG size of output: 32 [2019-11-15 23:45:56,510 WARN L191 SmtUtils]: Spent 48.03 s on a formula simplification. DAG size of input: 32 DAG size of output: 29 [2019-11-15 23:46:08,551 WARN L191 SmtUtils]: Spent 12.01 s on a formula simplification that was a NOOP. DAG size: 24 [2019-11-15 23:47:32,624 WARN L191 SmtUtils]: Spent 1.20 m on a formula simplification. DAG size of input: 35 DAG size of output: 33 [2019-11-15 23:47:44,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:47:44,667 INFO L93 Difference]: Finished difference Result 59 states and 72 transitions. [2019-11-15 23:47:44,669 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-15 23:47:44,669 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 59 states and 72 transitions. [2019-11-15 23:47:44,672 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-15 23:47:44,674 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 59 states to 43 states and 53 transitions. [2019-11-15 23:47:44,674 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2019-11-15 23:47:44,674 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2019-11-15 23:47:44,674 INFO L73 IsDeterministic]: Start isDeterministic. Operand 43 states and 53 transitions. [2019-11-15 23:47:44,675 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 23:47:44,675 INFO L688 BuchiCegarLoop]: Abstraction has 43 states and 53 transitions. [2019-11-15 23:47:44,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states and 53 transitions. [2019-11-15 23:47:44,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 28. [2019-11-15 23:47:44,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-11-15 23:47:44,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 36 transitions. [2019-11-15 23:47:44,691 INFO L711 BuchiCegarLoop]: Abstraction has 28 states and 36 transitions. [2019-11-15 23:47:44,691 INFO L591 BuchiCegarLoop]: Abstraction has 28 states and 36 transitions. [2019-11-15 23:47:44,691 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2019-11-15 23:47:44,691 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 36 transitions. [2019-11-15 23:47:44,692 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-15 23:47:44,692 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 23:47:44,692 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 23:47:44,693 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:47:44,693 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-15 23:47:44,693 INFO L791 eck$LassoCheckResult]: Stem: 525#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 518#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; 519#L382 assume !(main_~length1~0 < 1); 520#L382-2 assume !(main_~length2~0 < 1); 517#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; 513#L369-4 call cstrcspn_#t~mem206 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1); 514#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; 533#L372-5 call cstrcspn_#t~mem208 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1);cstrcspn_#t~short210 := 0 != cstrcspn_#t~mem208; 523#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); 524#L372-3 assume !cstrcspn_#t~short210;havoc cstrcspn_#t~mem208;havoc cstrcspn_#t~mem209;havoc cstrcspn_#t~short210; 509#L372-6 call cstrcspn_#t~mem212 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1); 510#L374 assume !(cstrcspn_#t~mem212 == cstrcspn_~c~0);havoc cstrcspn_#t~mem212; 511#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; 512#L369-4 call cstrcspn_#t~mem206 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1); 515#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; 526#L372-5 [2019-11-15 23:47:44,693 INFO L793 eck$LassoCheckResult]: Loop: 526#L372-5 call cstrcspn_#t~mem208 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1);cstrcspn_#t~short210 := 0 != cstrcspn_#t~mem208; 521#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); 522#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; 526#L372-5 [2019-11-15 23:47:44,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:47:44,694 INFO L82 PathProgramCache]: Analyzing trace with hash -187628965, now seen corresponding path program 2 times [2019-11-15 23:47:44,694 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:47:44,694 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1098082762] [2019-11-15 23:47:44,694 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:47:44,694 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:47:44,695 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:47:44,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:47:44,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:47:44,721 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:47:44,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:47:44,721 INFO L82 PathProgramCache]: Analyzing trace with hash 58692, now seen corresponding path program 3 times [2019-11-15 23:47:44,722 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:47:44,722 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2142887460] [2019-11-15 23:47:44,722 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:47:44,722 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:47:44,722 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:47:44,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:47:44,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:47:44,729 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:47:44,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:47:44,730 INFO L82 PathProgramCache]: Analyzing trace with hash -1902015318, now seen corresponding path program 1 times [2019-11-15 23:47:44,730 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:47:44,730 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1904370952] [2019-11-15 23:47:44,730 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:47:44,730 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:47:44,731 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:47:44,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:47:44,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:47:44,760 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:47:45,582 WARN L191 SmtUtils]: Spent 644.00 ms on a formula simplification. DAG size of input: 181 DAG size of output: 143 [2019-11-15 23:47:46,693 WARN L191 SmtUtils]: Spent 1.09 s on a formula simplification. DAG size of input: 115 DAG size of output: 115 [2019-11-15 23:47:46,696 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 23:47:46,696 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 23:47:46,696 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 23:47:46,696 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 23:47:46,696 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-15 23:47:46,696 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 23:47:46,696 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 23:47:46,696 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 23:47:46,696 INFO L131 ssoRankerPreferences]: Filename of dumped script: cstrcspn_mixed_alloca.i_Iteration5_Lasso [2019-11-15 23:47:46,696 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 23:47:46,696 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 23:47:46,703 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:47:46,712 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:47:46,714 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:47:46,716 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:47:46,719 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:47:46,720 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:47:46,722 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:47:46,723 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:47:46,726 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:47:46,728 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:47:46,730 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:47:46,732 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:47:46,733 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:47:46,942 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2019-11-15 23:47:47,819 WARN L191 SmtUtils]: Spent 872.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 103 [2019-11-15 23:47:47,955 WARN L191 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 61 [2019-11-15 23:47:47,956 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:47:47,958 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:47:47,960 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:47:47,962 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:47:47,963 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:47:48,375 WARN L191 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 54 [2019-11-15 23:47:48,835 WARN L191 SmtUtils]: Spent 381.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 43 [2019-11-15 23:47:49,373 WARN L191 SmtUtils]: Spent 518.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 46 [2019-11-15 23:47:49,526 WARN L191 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 36 [2019-11-15 23:47:49,622 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 23:47:49,622 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-15 23:47:49,622 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 [2019-11-15 23:47:49,624 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:47:49,624 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:47:49,625 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:47:49,625 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:47:49,625 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:47:49,625 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:47:49,625 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:47:49,625 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:47:49,626 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 [2019-11-15 23:47:49,626 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:47:49,626 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:47:49,626 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:47:49,626 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:47:49,626 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:47:49,626 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:47:49,627 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:47:49,627 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:47:49,627 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 [2019-11-15 23:47:49,628 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:47:49,628 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:47:49,628 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:47:49,628 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:47:49,629 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:47:49,629 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:47:49,629 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:47:49,629 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:47:49,630 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 [2019-11-15 23:47:49,630 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:47:49,630 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:47:49,631 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:47:49,631 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:47:49,631 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:47:49,632 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:47:49,633 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:47:49,633 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 [2019-11-15 23:47:49,634 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:47:49,634 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:47:49,634 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:47:49,634 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:47:49,634 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:47:49,635 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:47:49,635 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:47:49,635 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:47:49,636 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 [2019-11-15 23:47:49,636 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:47:49,636 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:47:49,636 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:47:49,637 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:47:49,637 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:47:49,637 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:47:49,637 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:47:49,638 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:47:49,638 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 [2019-11-15 23:47:49,639 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:47:49,639 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:47:49,639 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:47:49,639 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:47:49,639 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:47:49,640 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:47:49,640 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:47:49,640 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:47:49,641 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 [2019-11-15 23:47:49,641 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:47:49,641 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:47:49,641 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:47:49,642 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:47:49,642 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:47:49,642 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:47:49,643 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:47:49,644 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 [2019-11-15 23:47:49,645 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:47:49,645 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:47:49,645 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:47:49,645 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:47:49,645 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:47:49,646 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:47:49,646 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:47:49,646 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:47:49,647 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 [2019-11-15 23:47:49,647 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:47:49,647 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:47:49,647 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:47:49,648 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:47:49,648 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:47:49,648 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:47:49,648 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:47:49,649 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:47:49,649 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 [2019-11-15 23:47:49,650 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:47:49,650 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:47:49,650 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:47:49,650 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:47:49,650 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:47:49,651 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:47:49,651 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:47:49,651 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:47:49,652 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 [2019-11-15 23:47:49,652 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:47:49,652 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:47:49,653 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:47:49,653 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:47:49,653 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:47:49,653 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:47:49,653 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:47:49,654 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:47:49,654 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 [2019-11-15 23:47:49,655 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:47:49,655 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:47:49,655 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:47:49,655 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:47:49,656 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:47:49,656 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:47:49,660 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:47:49,661 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 [2019-11-15 23:47:49,661 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:47:49,662 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:47:49,662 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:47:49,662 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:47:49,662 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:47:49,663 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:47:49,664 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:47:49,664 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 [2019-11-15 23:47:49,665 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:47:49,665 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:47:49,665 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:47:49,665 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:47:49,666 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:47:49,666 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:47:49,667 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:47:49,667 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 [2019-11-15 23:47:49,668 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:47:49,668 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:47:49,668 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:47:49,669 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:47:49,669 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:47:49,669 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:47:49,670 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:47:49,671 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 [2019-11-15 23:47:49,671 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:47:49,672 INFO L202 nArgumentSynthesizer]: 4 stem disjuncts [2019-11-15 23:47:49,672 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:47:49,672 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:47:49,675 INFO L400 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2019-11-15 23:47:49,675 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:47:49,691 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:47:49,692 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 [2019-11-15 23:47:49,693 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:47:49,693 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:47:49,693 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:47:49,693 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:47:49,694 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:47:49,694 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:47:49,696 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:47:49,696 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 [2019-11-15 23:47:49,697 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:47:49,697 INFO L202 nArgumentSynthesizer]: 8 stem disjuncts [2019-11-15 23:47:49,697 INFO L203 nArgumentSynthesizer]: 6 loop disjuncts [2019-11-15 23:47:49,697 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:47:49,728 INFO L400 nArgumentSynthesizer]: We have 180 Motzkin's Theorem applications. [2019-11-15 23:47:49,728 INFO L401 nArgumentSynthesizer]: A total of 12 supporting invariants were added. [2019-11-15 23:47:50,135 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:47:50,135 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 [2019-11-15 23:47:50,136 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:47:50,137 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:47:50,137 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:47:50,137 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:47:50,140 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:47:50,140 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:47:50,225 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-15 23:47:50,252 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2019-11-15 23:47:50,252 INFO L444 ModelExtractionUtils]: 47 out of 55 variables were initially zero. Simplification set additionally 3 variables to zero. [2019-11-15 23:47:50,253 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-15 23:47:50,254 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2019-11-15 23:47:50,254 INFO L510 LassoAnalysis]: Proved termination. [2019-11-15 23:47:50,254 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~length1~0, ULTIMATE.start_cstrcspn_~s~0.offset) = 1*ULTIMATE.start_main_~length1~0 + 4*ULTIMATE.start_cstrcspn_~s~0.offset Supporting invariants [1*ULTIMATE.start_main_~length1~0 - 2 >= 0] [2019-11-15 23:47:50,424 INFO L297 tatePredicateManager]: 25 out of 26 supporting invariants were superfluous and have been removed [2019-11-15 23:47:50,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:47:50,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:47:50,495 INFO L256 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 25 conjunts are in the unsatisfiable core [2019-11-15 23:47:50,498 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:47:50,542 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-11-15 23:47:50,542 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:47:50,561 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:47:50,568 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 23 [2019-11-15 23:47:50,568 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 23:47:50,593 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:47:50,594 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-11-15 23:47:50,594 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:51, output treesize:31 [2019-11-15 23:47:50,653 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:47:50,653 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 21 [2019-11-15 23:47:50,654 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-11-15 23:47:50,670 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:47:50,671 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 23:47:50,671 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:38, output treesize:16 [2019-11-15 23:47:50,701 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:47:50,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:47:50,729 INFO L256 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-15 23:47:50,729 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:47:50,761 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:47:50,761 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.5 stem predicates 2 loop predicates [2019-11-15 23:47:50,761 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 28 states and 36 transitions. cyclomatic complexity: 11 Second operand 7 states. [2019-11-15 23:47:50,906 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 28 states and 36 transitions. cyclomatic complexity: 11. Second operand 7 states. Result 46 states and 58 transitions. Complement of second has 8 states. [2019-11-15 23:47:50,907 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 4 stem states 1 non-accepting loop states 1 accepting loop states [2019-11-15 23:47:50,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-11-15 23:47:50,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 18 transitions. [2019-11-15 23:47:50,908 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 18 transitions. Stem has 15 letters. Loop has 3 letters. [2019-11-15 23:47:50,908 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 23:47:50,908 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-15 23:47:50,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:47:50,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:47:50,965 INFO L256 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 25 conjunts are in the unsatisfiable core [2019-11-15 23:47:50,967 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:47:50,991 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-11-15 23:47:50,992 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:47:51,009 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:47:51,016 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 23 [2019-11-15 23:47:51,016 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 23:47:51,033 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:47:51,034 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-11-15 23:47:51,034 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:51, output treesize:31 [2019-11-15 23:47:51,094 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:47:51,094 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 21 [2019-11-15 23:47:51,094 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-11-15 23:47:51,109 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:47:51,110 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 23:47:51,110 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:38, output treesize:16 [2019-11-15 23:47:51,147 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:47:51,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:47:51,181 INFO L256 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-15 23:47:51,181 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:47:51,205 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:47:51,205 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.5 stem predicates 2 loop predicates [2019-11-15 23:47:51,205 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 28 states and 36 transitions. cyclomatic complexity: 11 Second operand 7 states. [2019-11-15 23:47:51,302 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 28 states and 36 transitions. cyclomatic complexity: 11. Second operand 7 states. Result 46 states and 58 transitions. Complement of second has 8 states. [2019-11-15 23:47:51,303 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 4 stem states 1 non-accepting loop states 1 accepting loop states [2019-11-15 23:47:51,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-11-15 23:47:51,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 18 transitions. [2019-11-15 23:47:51,306 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 18 transitions. Stem has 15 letters. Loop has 3 letters. [2019-11-15 23:47:51,306 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 23:47:51,306 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-15 23:47:51,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:47:51,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:47:51,351 INFO L256 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 25 conjunts are in the unsatisfiable core [2019-11-15 23:47:51,352 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:47:51,377 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-11-15 23:47:51,377 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:47:51,395 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:47:51,417 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 23 [2019-11-15 23:47:51,418 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 23:47:51,427 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:47:51,428 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-11-15 23:47:51,428 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:51, output treesize:31 [2019-11-15 23:47:51,461 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:47:51,461 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 21 [2019-11-15 23:47:51,461 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-11-15 23:47:51,471 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:47:51,472 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 23:47:51,472 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:38, output treesize:16 [2019-11-15 23:47:51,488 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:47:51,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:47:51,503 INFO L256 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-15 23:47:51,503 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:47:51,516 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:47:51,516 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.5 stem predicates 2 loop predicates [2019-11-15 23:47:51,516 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 28 states and 36 transitions. cyclomatic complexity: 11 Second operand 7 states. [2019-11-15 23:47:51,652 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 28 states and 36 transitions. cyclomatic complexity: 11. Second operand 7 states. Result 53 states and 68 transitions. Complement of second has 10 states. [2019-11-15 23:47:51,653 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 6 stem states 1 non-accepting loop states 1 accepting loop states [2019-11-15 23:47:51,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-11-15 23:47:51,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 38 transitions. [2019-11-15 23:47:51,654 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 38 transitions. Stem has 15 letters. Loop has 3 letters. [2019-11-15 23:47:51,654 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 23:47:51,654 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 38 transitions. Stem has 18 letters. Loop has 3 letters. [2019-11-15 23:47:51,655 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 23:47:51,655 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 38 transitions. Stem has 15 letters. Loop has 6 letters. [2019-11-15 23:47:51,655 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 23:47:51,655 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 53 states and 68 transitions. [2019-11-15 23:47:51,657 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-15 23:47:51,658 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 53 states to 0 states and 0 transitions. [2019-11-15 23:47:51,658 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-11-15 23:47:51,658 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-11-15 23:47:51,658 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-11-15 23:47:51,658 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 23:47:51,658 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 23:47:51,658 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 23:47:51,658 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 23:47:51,658 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2019-11-15 23:47:51,659 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-11-15 23:47:51,659 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-15 23:47:51,659 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-11-15 23:47:51,664 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 15.11 11:47:51 BoogieIcfgContainer [2019-11-15 23:47:51,664 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-11-15 23:47:51,664 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-15 23:47:51,664 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-15 23:47:51,665 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-15 23:47:51,665 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 11:38:42" (3/4) ... [2019-11-15 23:47:51,668 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-11-15 23:47:51,668 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-15 23:47:51,670 INFO L168 Benchmark]: Toolchain (without parser) took 550295.03 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 215.0 MB). Free memory was 942.4 MB in the beginning and 1.0 GB in the end (delta: -80.6 MB). Peak memory consumption was 134.3 MB. Max. memory is 11.5 GB. [2019-11-15 23:47:51,670 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 963.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 23:47:51,671 INFO L168 Benchmark]: CACSL2BoogieTranslator took 477.65 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 143.1 MB). Free memory was 942.4 MB in the beginning and 1.1 GB in the end (delta: -178.0 MB). Peak memory consumption was 19.4 MB. Max. memory is 11.5 GB. [2019-11-15 23:47:51,672 INFO L168 Benchmark]: Boogie Procedure Inliner took 42.99 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-11-15 23:47:51,672 INFO L168 Benchmark]: Boogie Preprocessor took 26.74 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 23:47:51,673 INFO L168 Benchmark]: RCFGBuilder took 318.27 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 22.4 MB). Peak memory consumption was 22.4 MB. Max. memory is 11.5 GB. [2019-11-15 23:47:51,673 INFO L168 Benchmark]: BuchiAutomizer took 549421.53 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 71.8 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 69.6 MB). Peak memory consumption was 141.4 MB. Max. memory is 11.5 GB. [2019-11-15 23:47:51,674 INFO L168 Benchmark]: Witness Printer took 4.29 ms. Allocated memory is still 1.2 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 23:47:51,677 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 963.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 477.65 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 143.1 MB). Free memory was 942.4 MB in the beginning and 1.1 GB in the end (delta: -178.0 MB). Peak memory consumption was 19.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 42.99 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 26.74 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 318.27 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 22.4 MB). Peak memory consumption was 22.4 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 549421.53 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 71.8 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 69.6 MB). Peak memory consumption was 141.4 MB. Max. memory is 11.5 GB. * Witness Printer took 4.29 ms. Allocated memory is still 1.2 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - 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[sc1] + -1 * sc1 and consists of 3 locations. One deterministic module has affine ranking function 2 * s + 1 and consists of 3 locations. One nondeterministic module has affine ranking function length1 + 4 * s and consists of 8 locations. 2 modules have a trivial ranking function, the largest among these consists of 13 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 549.3s and 6 iterations. TraceHistogramMax:2. Analysis of lassos took 208.1s. Construction of modules took 24.2s. Büchi inclusion checks took 316.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: 103 SDtfs, 210 SDslu, 118 SDs, 0 SdLazy, 182 SolverSat, 49 SolverUnsat, 2 SolverUnknown, 0 SolverNotchecked, 24.2s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc1 concLT0 SILN0 SILU0 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital390 mio100 ax100 hnf99 lsp91 ukn75 mio100 lsp38 div114 bol100 ite100 ukn100 eq177 hnf83 smp92 dnf826 smp33 tf100 neg96 sie112 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 438ms 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...