./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/loops/invert_string-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- 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_b208bfc5-5374-4318-9aa5-bfe9b7726c52/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_b208bfc5-5374-4318-9aa5-bfe9b7726c52/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_b208bfc5-5374-4318-9aa5-bfe9b7726c52/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_b208bfc5-5374-4318-9aa5-bfe9b7726c52/bin/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/loops/invert_string-1.c -s /tmp/vcloud-vcloud-master/worker/run_dir_b208bfc5-5374-4318-9aa5-bfe9b7726c52/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_b208bfc5-5374-4318-9aa5-bfe9b7726c52/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 32bit --witnessprinter.graph.data.programhash 4335483d0b28de4d854f33f949d3555a767d1bde ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Using bit-precise analysis No suitable file found in config dir /tmp/vcloud-vcloud-master/worker/run_dir_b208bfc5-5374-4318-9aa5-bfe9b7726c52/bin/uautomizer/config using search string *Termination*32bit*_Bitvector*.epf No suitable settings file found using Termination*32bit*_Bitvector ERROR: UNSUPPORTED PROPERTY Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: AssertionError: MapEliminator tries to combine Int and (Array Int Int) --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-11-15 23:08:33,457 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-15 23:08:33,459 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-15 23:08:33,476 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-15 23:08:33,476 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-15 23:08:33,478 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-15 23:08:33,480 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-15 23:08:33,492 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-15 23:08:33,496 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-15 23:08:33,500 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-15 23:08:33,502 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-15 23:08:33,504 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-15 23:08:33,504 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-15 23:08:33,507 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-15 23:08:33,508 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-15 23:08:33,509 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-15 23:08:33,510 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-15 23:08:33,512 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-15 23:08:33,515 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-15 23:08:33,519 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-15 23:08:33,524 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-15 23:08:33,526 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-15 23:08:33,529 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-15 23:08:33,530 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-15 23:08:33,534 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-15 23:08:33,534 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-15 23:08:33,535 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-15 23:08:33,536 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-15 23:08:33,537 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-15 23:08:33,538 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-15 23:08:33,538 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-15 23:08:33,539 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-15 23:08:33,539 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-15 23:08:33,540 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-15 23:08:33,542 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-15 23:08:33,542 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-15 23:08:33,543 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-15 23:08:33,543 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-15 23:08:33,543 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-15 23:08:33,544 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-15 23:08:33,545 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-15 23:08:33,546 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_b208bfc5-5374-4318-9aa5-bfe9b7726c52/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2019-11-15 23:08:33,578 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-15 23:08:33,590 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-15 23:08:33,591 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-15 23:08:33,592 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-15 23:08:33,592 INFO L138 SettingsManager]: * Use SBE=true [2019-11-15 23:08:33,592 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-11-15 23:08:33,592 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-11-15 23:08:33,593 INFO L138 SettingsManager]: * Use old map elimination=false [2019-11-15 23:08:33,593 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-11-15 23:08:33,593 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-11-15 23:08:33,594 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-11-15 23:08:33,594 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-15 23:08:33,594 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-15 23:08:33,594 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-15 23:08:33,595 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-15 23:08:33,595 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-15 23:08:33,595 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-15 23:08:33,596 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-11-15 23:08:33,596 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-11-15 23:08:33,596 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-11-15 23:08:33,596 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-15 23:08:33,598 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-15 23:08:33,598 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-11-15 23:08:33,598 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-15 23:08:33,599 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-11-15 23:08:33,599 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-15 23:08:33,599 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-15 23:08:33,599 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-11-15 23:08:33,600 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-15 23:08:33,601 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-15 23:08:33,601 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-11-15 23:08:33,602 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-11-15 23:08:33,603 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_b208bfc5-5374-4318-9aa5-bfe9b7726c52/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 -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 4335483d0b28de4d854f33f949d3555a767d1bde [2019-11-15 23:08:33,645 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-15 23:08:33,666 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-15 23:08:33,671 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-15 23:08:33,673 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-15 23:08:33,673 INFO L275 PluginConnector]: CDTParser initialized [2019-11-15 23:08:33,674 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_b208bfc5-5374-4318-9aa5-bfe9b7726c52/bin/uautomizer/../../sv-benchmarks/c/loops/invert_string-1.c [2019-11-15 23:08:33,738 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_b208bfc5-5374-4318-9aa5-bfe9b7726c52/bin/uautomizer/data/7e6d66913/5c1778605ed54709b1c26127e37535ba/FLAG1e75a0303 [2019-11-15 23:08:34,198 INFO L306 CDTParser]: Found 1 translation units. [2019-11-15 23:08:34,199 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_b208bfc5-5374-4318-9aa5-bfe9b7726c52/sv-benchmarks/c/loops/invert_string-1.c [2019-11-15 23:08:34,205 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_b208bfc5-5374-4318-9aa5-bfe9b7726c52/bin/uautomizer/data/7e6d66913/5c1778605ed54709b1c26127e37535ba/FLAG1e75a0303 [2019-11-15 23:08:34,612 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_b208bfc5-5374-4318-9aa5-bfe9b7726c52/bin/uautomizer/data/7e6d66913/5c1778605ed54709b1c26127e37535ba [2019-11-15 23:08:34,615 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-15 23:08:34,616 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-15 23:08:34,617 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-15 23:08:34,617 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-15 23:08:34,622 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-15 23:08:34,622 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 11:08:34" (1/1) ... [2019-11-15 23:08:34,625 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@22fa19ee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:08:34, skipping insertion in model container [2019-11-15 23:08:34,626 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 11:08:34" (1/1) ... [2019-11-15 23:08:34,634 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-15 23:08:34,651 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-15 23:08:34,935 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 23:08:34,941 INFO L188 MainTranslator]: Completed pre-run [2019-11-15 23:08:34,980 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 23:08:35,000 INFO L192 MainTranslator]: Completed translation [2019-11-15 23:08:35,001 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:08:35 WrapperNode [2019-11-15 23:08:35,001 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-15 23:08:35,002 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-15 23:08:35,002 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-15 23:08:35,002 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-15 23:08:35,011 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:08:35" (1/1) ... [2019-11-15 23:08:35,018 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:08:35" (1/1) ... [2019-11-15 23:08:35,040 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-15 23:08:35,041 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-15 23:08:35,041 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-15 23:08:35,041 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-15 23:08:35,052 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:08:35" (1/1) ... [2019-11-15 23:08:35,052 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:08:35" (1/1) ... [2019-11-15 23:08:35,054 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:08:35" (1/1) ... [2019-11-15 23:08:35,054 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:08:35" (1/1) ... [2019-11-15 23:08:35,061 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:08:35" (1/1) ... [2019-11-15 23:08:35,067 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:08:35" (1/1) ... [2019-11-15 23:08:35,068 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:08:35" (1/1) ... [2019-11-15 23:08:35,071 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-15 23:08:35,071 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-15 23:08:35,072 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-15 23:08:35,072 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-15 23:08:35,073 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:08:35" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b208bfc5-5374-4318-9aa5-bfe9b7726c52/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:08:35,135 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-15 23:08:35,135 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-15 23:08:35,136 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-15 23:08:35,136 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-15 23:08:35,137 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-15 23:08:35,137 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-15 23:08:35,430 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-15 23:08:35,430 INFO L284 CfgBuilder]: Removed 9 assume(true) statements. [2019-11-15 23:08:35,431 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 11:08:35 BoogieIcfgContainer [2019-11-15 23:08:35,431 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-15 23:08:35,432 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-11-15 23:08:35,432 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-11-15 23:08:35,436 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-11-15 23:08:35,437 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-15 23:08:35,438 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 15.11 11:08:34" (1/3) ... [2019-11-15 23:08:35,439 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4cbf373 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 15.11 11:08:35, skipping insertion in model container [2019-11-15 23:08:35,439 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-15 23:08:35,440 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:08:35" (2/3) ... [2019-11-15 23:08:35,440 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4cbf373 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 15.11 11:08:35, skipping insertion in model container [2019-11-15 23:08:35,440 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-15 23:08:35,441 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 11:08:35" (3/3) ... [2019-11-15 23:08:35,442 INFO L371 chiAutomizerObserver]: Analyzing ICFG invert_string-1.c [2019-11-15 23:08:35,515 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-11-15 23:08:35,515 INFO L357 BuchiCegarLoop]: Hoare is false [2019-11-15 23:08:35,515 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-11-15 23:08:35,515 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-15 23:08:35,516 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-15 23:08:35,516 INFO L361 BuchiCegarLoop]: Difference is false [2019-11-15 23:08:35,516 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-15 23:08:35,516 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-11-15 23:08:35,532 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states. [2019-11-15 23:08:35,555 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 9 [2019-11-15 23:08:35,555 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 23:08:35,555 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 23:08:35,562 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-11-15 23:08:35,563 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-15 23:08:35,563 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-11-15 23:08:35,563 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states. [2019-11-15 23:08:35,565 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 9 [2019-11-15 23:08:35,565 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 23:08:35,566 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 23:08:35,566 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-11-15 23:08:35,566 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-15 23:08:35,575 INFO L791 eck$LassoCheckResult]: Stem: 12#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 10#L-1true havoc main_#res;havoc main_#t~nondet1, main_#t~nondet3, main_#t~post2, main_#t~mem5, main_#t~post6, main_#t~post4, main_#t~mem8, main_#t~mem9, main_#t~post10, main_#t~post7, main_~MAX~0, main_~#str1~0.base, main_~#str1~0.offset, main_~#str2~0.base, main_~#str2~0.offset, main_~cont~0, main_~i~0, main_~j~0;main_~MAX~0 := (if main_#t~nondet1 % 4294967296 % 4294967296 <= 2147483647 then main_#t~nondet1 % 4294967296 % 4294967296 else main_#t~nondet1 % 4294967296 % 4294967296 - 4294967296);havoc main_#t~nondet1;assume 0 != (if main_~MAX~0 > 0 then 1 else 0);call main_~#str1~0.base, main_~#str1~0.offset := #Ultimate.allocOnStack(main_~MAX~0);call main_~#str2~0.base, main_~#str2~0.offset := #Ultimate.allocOnStack(main_~MAX~0);havoc main_~cont~0;havoc main_~i~0;havoc main_~j~0;main_~cont~0 := 0;main_~i~0 := 0; 6#L20-3true [2019-11-15 23:08:35,575 INFO L793 eck$LassoCheckResult]: Loop: 6#L20-3true assume !!(main_~i~0 < main_~MAX~0);call write~int(main_#t~nondet3, main_~#str1~0.base, main_~#str1~0.offset + main_~i~0, 1);havoc main_#t~nondet3; 7#L20-2true main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 6#L20-3true [2019-11-15 23:08:35,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:08:35,582 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2019-11-15 23:08:35,592 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:08:35,592 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [680314168] [2019-11-15 23:08:35,593 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:08:35,593 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:08:35,593 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:08:35,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:08:35,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:08:35,731 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:08:35,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:08:35,732 INFO L82 PathProgramCache]: Analyzing trace with hash 1283, now seen corresponding path program 1 times [2019-11-15 23:08:35,733 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:08:35,733 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1634263738] [2019-11-15 23:08:35,733 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:08:35,733 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:08:35,734 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:08:35,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:08:35,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:08:35,750 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:08:35,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:08:35,752 INFO L82 PathProgramCache]: Analyzing trace with hash 925765, now seen corresponding path program 1 times [2019-11-15 23:08:35,753 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:08:35,753 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1012031510] [2019-11-15 23:08:35,753 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:08:35,753 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:08:35,754 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:08:35,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:08:35,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:08:35,821 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:08:36,360 WARN L191 SmtUtils]: Spent 336.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 47 [2019-11-15 23:08:36,373 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 23:08:36,374 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 23:08:36,374 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 23:08:36,374 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 23:08:36,374 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-15 23:08:36,375 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 23:08:36,375 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 23:08:36,375 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 23:08:36,375 INFO L131 ssoRankerPreferences]: Filename of dumped script: invert_string-1.c_Iteration1_Lasso [2019-11-15 23:08:36,376 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 23:08:36,376 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 23:08:36,403 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:08:36,412 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:08:36,416 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:08:36,421 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:08:36,425 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:08:36,428 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:08:36,431 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:08:36,436 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:08:36,440 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:08:36,444 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:08:36,449 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:08:36,555 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:08:36,557 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:08:36,561 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:08:36,563 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:08:36,566 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:08:36,955 WARN L191 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 19 [2019-11-15 23:08:36,982 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 23:08:36,987 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-15 23:08:36,989 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:08:36,992 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:08:36,992 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:08:36,993 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:08:36,994 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:08:36,994 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:08:36,996 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:08:36,996 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:08:37,001 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:08:37,002 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:08:37,003 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:08:37,003 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:08:37,004 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:08:37,004 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:08:37,004 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:08:37,006 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:08:37,011 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:08:37,018 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:08:37,021 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:08:37,022 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:08:37,023 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:08:37,024 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:08:37,025 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:08:37,028 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:08:37,031 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:08:37,036 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:08:37,052 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:08:37,053 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:08:37,054 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:08:37,054 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:08:37,054 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:08:37,054 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:08:37,055 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:08:37,055 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:08:37,056 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:08:37,056 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:08:37,057 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:08:37,058 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:08:37,058 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:08:37,058 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:08:37,058 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:08:37,059 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:08:37,059 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:08:37,060 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:08:37,061 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:08:37,062 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:08:37,062 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:08:37,062 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:08:37,062 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:08:37,073 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:08:37,074 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:08:37,074 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:08:37,076 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:08:37,077 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:08:37,077 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:08:37,078 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:08:37,078 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:08:37,078 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:08:37,080 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:08:37,081 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:08:37,084 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:08:37,085 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:08:37,089 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:08:37,089 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:08:37,090 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:08:37,090 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:08:37,090 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:08:37,091 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:08:37,091 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:08:37,093 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:08:37,095 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:08:37,096 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:08:37,096 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:08:37,097 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:08:37,097 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:08:37,097 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:08:37,098 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:08:37,098 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:08:37,099 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:08:37,100 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:08:37,101 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:08:37,102 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:08:37,103 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:08:37,103 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:08:37,108 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:08:37,109 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:08:37,113 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:08:37,121 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:08:37,122 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:08:37,123 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:08:37,123 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:08:37,123 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:08:37,125 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:08:37,131 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:08:37,140 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:08:37,145 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:08:37,146 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:08:37,146 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:08:37,146 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:08:37,146 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:08:37,147 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:08:37,147 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:08:37,147 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:08:37,149 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:08:37,150 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:08:37,151 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:08:37,151 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:08:37,151 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:08:37,151 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:08:37,157 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:08:37,157 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:08:37,241 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-15 23:08:37,311 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2019-11-15 23:08:37,322 INFO L444 ModelExtractionUtils]: 13 out of 19 variables were initially zero. Simplification set additionally 2 variables to zero. [2019-11-15 23:08:37,325 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-15 23:08:37,327 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-15 23:08:37,328 INFO L510 LassoAnalysis]: Proved termination. [2019-11-15 23:08:37,329 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0, v_rep(select #length ULTIMATE.start_main_~#str1~0.base)_1, ULTIMATE.start_main_~#str1~0.offset) = -1*ULTIMATE.start_main_~i~0 + 1*v_rep(select #length ULTIMATE.start_main_~#str1~0.base)_1 - 1*ULTIMATE.start_main_~#str1~0.offset Supporting invariants [] [2019-11-15 23:08:37,342 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2019-11-15 23:08:37,351 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2019-11-15 23:08:37,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:08:37,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:08:37,410 INFO L256 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 23:08:37,412 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:08:37,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:08:37,433 INFO L256 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-15 23:08:37,434 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:08:37,463 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:08:37,486 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:08:37,488 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 17 states. Second operand 3 states. [2019-11-15 23:08:37,552 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 17 states.. Second operand 3 states. Result 33 states and 47 transitions. Complement of second has 8 states. [2019-11-15 23:08:37,554 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-11-15 23:08:37,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-15 23:08:37,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 23 transitions. [2019-11-15 23:08:37,560 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 23 transitions. Stem has 2 letters. Loop has 2 letters. [2019-11-15 23:08:37,560 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 23:08:37,560 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 23 transitions. Stem has 4 letters. Loop has 2 letters. [2019-11-15 23:08:37,561 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 23:08:37,561 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 23 transitions. Stem has 2 letters. Loop has 4 letters. [2019-11-15 23:08:37,561 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 23:08:37,562 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 33 states and 47 transitions. [2019-11-15 23:08:37,571 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2019-11-15 23:08:37,577 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 33 states to 14 states and 19 transitions. [2019-11-15 23:08:37,584 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2019-11-15 23:08:37,585 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2019-11-15 23:08:37,586 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 19 transitions. [2019-11-15 23:08:37,587 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 23:08:37,587 INFO L688 BuchiCegarLoop]: Abstraction has 14 states and 19 transitions. [2019-11-15 23:08:37,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states and 19 transitions. [2019-11-15 23:08:37,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2019-11-15 23:08:37,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-11-15 23:08:37,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 19 transitions. [2019-11-15 23:08:37,623 INFO L711 BuchiCegarLoop]: Abstraction has 14 states and 19 transitions. [2019-11-15 23:08:37,624 INFO L591 BuchiCegarLoop]: Abstraction has 14 states and 19 transitions. [2019-11-15 23:08:37,624 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-11-15 23:08:37,624 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 19 transitions. [2019-11-15 23:08:37,634 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2019-11-15 23:08:37,635 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 23:08:37,635 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 23:08:37,636 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2019-11-15 23:08:37,636 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-15 23:08:37,637 INFO L791 eck$LassoCheckResult]: Stem: 113#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 112#L-1 havoc main_#res;havoc main_#t~nondet1, main_#t~nondet3, main_#t~post2, main_#t~mem5, main_#t~post6, main_#t~post4, main_#t~mem8, main_#t~mem9, main_#t~post10, main_#t~post7, main_~MAX~0, main_~#str1~0.base, main_~#str1~0.offset, main_~#str2~0.base, main_~#str2~0.offset, main_~cont~0, main_~i~0, main_~j~0;main_~MAX~0 := (if main_#t~nondet1 % 4294967296 % 4294967296 <= 2147483647 then main_#t~nondet1 % 4294967296 % 4294967296 else main_#t~nondet1 % 4294967296 % 4294967296 - 4294967296);havoc main_#t~nondet1;assume 0 != (if main_~MAX~0 > 0 then 1 else 0);call main_~#str1~0.base, main_~#str1~0.offset := #Ultimate.allocOnStack(main_~MAX~0);call main_~#str2~0.base, main_~#str2~0.offset := #Ultimate.allocOnStack(main_~MAX~0);havoc main_~cont~0;havoc main_~i~0;havoc main_~j~0;main_~cont~0 := 0;main_~i~0 := 0; 107#L20-3 assume !(main_~i~0 < main_~MAX~0); 105#L20-4 call write~int(0, main_~#str1~0.base, main_~#str1~0.offset + (main_~MAX~0 - 1), 1);main_~j~0 := 0;main_~i~0 := main_~MAX~0 - 1; 106#L27-3 [2019-11-15 23:08:37,637 INFO L793 eck$LassoCheckResult]: Loop: 106#L27-3 assume !!(main_~i~0 >= 0);call main_#t~mem5 := read~int(main_~#str1~0.base, main_~#str1~0.offset, 1);call write~int(main_#t~mem5, main_~#str2~0.base, main_~#str2~0.offset + main_~j~0, 1);havoc main_#t~mem5;main_#t~post6 := main_~j~0;main_~j~0 := 1 + main_#t~post6;havoc main_#t~post6; 115#L27-2 main_#t~post4 := main_~i~0;main_~i~0 := main_#t~post4 - 1;havoc main_#t~post4; 106#L27-3 [2019-11-15 23:08:37,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:08:37,638 INFO L82 PathProgramCache]: Analyzing trace with hash 925707, now seen corresponding path program 1 times [2019-11-15 23:08:37,638 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:08:37,638 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [380294623] [2019-11-15 23:08:37,639 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:08:37,639 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:08:37,639 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:08:37,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:08:37,724 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:08:37,725 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [380294623] [2019-11-15 23:08:37,726 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:08:37,726 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:08:37,726 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1202161003] [2019-11-15 23:08:37,728 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-11-15 23:08:37,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:08:37,729 INFO L82 PathProgramCache]: Analyzing trace with hash 1731, now seen corresponding path program 1 times [2019-11-15 23:08:37,729 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:08:37,729 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1232862273] [2019-11-15 23:08:37,729 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:08:37,729 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:08:37,729 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:08:37,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:08:37,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:08:37,741 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:08:37,849 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:08:37,851 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:08:37,852 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:08:37,853 INFO L87 Difference]: Start difference. First operand 14 states and 19 transitions. cyclomatic complexity: 8 Second operand 3 states. [2019-11-15 23:08:37,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:08:37,887 INFO L93 Difference]: Finished difference Result 15 states and 17 transitions. [2019-11-15 23:08:37,887 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:08:37,888 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 15 states and 17 transitions. [2019-11-15 23:08:37,889 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2019-11-15 23:08:37,890 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 15 states to 14 states and 16 transitions. [2019-11-15 23:08:37,890 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2019-11-15 23:08:37,890 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2019-11-15 23:08:37,890 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 16 transitions. [2019-11-15 23:08:37,891 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 23:08:37,891 INFO L688 BuchiCegarLoop]: Abstraction has 14 states and 16 transitions. [2019-11-15 23:08:37,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states and 16 transitions. [2019-11-15 23:08:37,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 13. [2019-11-15 23:08:37,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-11-15 23:08:37,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 15 transitions. [2019-11-15 23:08:37,893 INFO L711 BuchiCegarLoop]: Abstraction has 13 states and 15 transitions. [2019-11-15 23:08:37,893 INFO L591 BuchiCegarLoop]: Abstraction has 13 states and 15 transitions. [2019-11-15 23:08:37,893 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-11-15 23:08:37,893 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 15 transitions. [2019-11-15 23:08:37,894 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2019-11-15 23:08:37,894 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 23:08:37,894 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 23:08:37,895 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2019-11-15 23:08:37,895 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-15 23:08:37,895 INFO L791 eck$LassoCheckResult]: Stem: 143#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 139#L-1 havoc main_#res;havoc main_#t~nondet1, main_#t~nondet3, main_#t~post2, main_#t~mem5, main_#t~post6, main_#t~post4, main_#t~mem8, main_#t~mem9, main_#t~post10, main_#t~post7, main_~MAX~0, main_~#str1~0.base, main_~#str1~0.offset, main_~#str2~0.base, main_~#str2~0.offset, main_~cont~0, main_~i~0, main_~j~0;main_~MAX~0 := (if main_#t~nondet1 % 4294967296 % 4294967296 <= 2147483647 then main_#t~nondet1 % 4294967296 % 4294967296 else main_#t~nondet1 % 4294967296 % 4294967296 - 4294967296);havoc main_#t~nondet1;assume 0 != (if main_~MAX~0 > 0 then 1 else 0);call main_~#str1~0.base, main_~#str1~0.offset := #Ultimate.allocOnStack(main_~MAX~0);call main_~#str2~0.base, main_~#str2~0.offset := #Ultimate.allocOnStack(main_~MAX~0);havoc main_~cont~0;havoc main_~i~0;havoc main_~j~0;main_~cont~0 := 0;main_~i~0 := 0; 140#L20-3 assume !!(main_~i~0 < main_~MAX~0);call write~int(main_#t~nondet3, main_~#str1~0.base, main_~#str1~0.offset + main_~i~0, 1);havoc main_#t~nondet3; 146#L20-2 main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 147#L20-3 assume !(main_~i~0 < main_~MAX~0); 144#L20-4 call write~int(0, main_~#str1~0.base, main_~#str1~0.offset + (main_~MAX~0 - 1), 1);main_~j~0 := 0;main_~i~0 := main_~MAX~0 - 1; 145#L27-3 [2019-11-15 23:08:37,895 INFO L793 eck$LassoCheckResult]: Loop: 145#L27-3 assume !!(main_~i~0 >= 0);call main_#t~mem5 := read~int(main_~#str1~0.base, main_~#str1~0.offset, 1);call write~int(main_#t~mem5, main_~#str2~0.base, main_~#str2~0.offset + main_~j~0, 1);havoc main_#t~mem5;main_#t~post6 := main_~j~0;main_~j~0 := 1 + main_#t~post6;havoc main_#t~post6; 149#L27-2 main_#t~post4 := main_~i~0;main_~i~0 := main_#t~post4 - 1;havoc main_#t~post4; 145#L27-3 [2019-11-15 23:08:37,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:08:37,896 INFO L82 PathProgramCache]: Analyzing trace with hash 889660429, now seen corresponding path program 1 times [2019-11-15 23:08:37,896 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:08:37,897 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1574300539] [2019-11-15 23:08:37,897 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:08:37,897 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:08:37,897 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:08:37,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:08:37,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:08:37,932 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:08:37,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:08:37,932 INFO L82 PathProgramCache]: Analyzing trace with hash 1731, now seen corresponding path program 2 times [2019-11-15 23:08:37,933 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:08:37,933 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1529642200] [2019-11-15 23:08:37,933 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:08:37,934 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:08:37,934 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:08:37,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:08:37,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:08:37,946 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:08:37,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:08:37,947 INFO L82 PathProgramCache]: Analyzing trace with hash 265181135, now seen corresponding path program 1 times [2019-11-15 23:08:37,947 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:08:37,947 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [887469467] [2019-11-15 23:08:37,948 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:08:37,948 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:08:37,948 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:08:37,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:08:37,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:08:37,988 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:08:38,322 WARN L191 SmtUtils]: Spent 268.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 77 [2019-11-15 23:08:38,564 WARN L191 SmtUtils]: Spent 233.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 59 [2019-11-15 23:08:38,572 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 23:08:38,572 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 23:08:38,572 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 23:08:38,573 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 23:08:38,573 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-15 23:08:38,573 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 23:08:38,573 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 23:08:38,573 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 23:08:38,573 INFO L131 ssoRankerPreferences]: Filename of dumped script: invert_string-1.c_Iteration3_Lasso [2019-11-15 23:08:38,573 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 23:08:38,573 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 23:08:38,577 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:08:38,585 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:08:38,588 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:08:38,591 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:08:38,736 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:08:38,739 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:08:38,741 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:08:38,749 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:08:38,751 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:08:38,753 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:08:38,755 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:08:38,757 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:08:38,760 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:08:38,762 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:08:38,766 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:08:38,900 WARN L191 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 36 [2019-11-15 23:08:39,227 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 23:08:39,228 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-15 23:08:39,228 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:08:39,229 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:08:39,229 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:08:39,229 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:08:39,229 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:08:39,230 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:08:39,230 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:08:39,230 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:08:39,231 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:08:39,231 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:08:39,232 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:08:39,232 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:08:39,232 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:08:39,232 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:08:39,232 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:08:39,233 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:08:39,233 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:08:39,233 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:08:39,234 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:08:39,234 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:08:39,234 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:08:39,235 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:08:39,235 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:08:39,237 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:08:39,237 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:08:39,239 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:08:39,240 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:08:39,240 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:08:39,241 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:08:39,241 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:08:39,241 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:08:39,242 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:08:39,243 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:08:39,247 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:08:39,248 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:08:39,249 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:08:39,249 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:08:39,249 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:08:39,249 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:08:39,253 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:08:39,253 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:08:39,286 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-15 23:08:39,302 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-11-15 23:08:39,303 INFO L444 ModelExtractionUtils]: 20 out of 25 variables were initially zero. Simplification set additionally 2 variables to zero. [2019-11-15 23:08:39,303 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-15 23:08:39,304 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-15 23:08:39,304 INFO L510 LassoAnalysis]: Proved termination. [2019-11-15 23:08:39,304 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0) = 2*ULTIMATE.start_main_~i~0 + 1 Supporting invariants [] [2019-11-15 23:08:39,324 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2019-11-15 23:08:39,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:08:39,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:08:39,385 INFO L256 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 23:08:39,386 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:08:39,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:08:39,395 INFO L256 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-15 23:08:39,396 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:08:39,416 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:08:39,416 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:08:39,416 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 13 states and 15 transitions. cyclomatic complexity: 5 Second operand 3 states. [2019-11-15 23:08:39,441 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 13 states and 15 transitions. cyclomatic complexity: 5. Second operand 3 states. Result 16 states and 21 transitions. Complement of second has 7 states. [2019-11-15 23:08:39,444 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-11-15 23:08:39,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-15 23:08:39,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 9 transitions. [2019-11-15 23:08:39,445 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 9 transitions. Stem has 6 letters. Loop has 2 letters. [2019-11-15 23:08:39,446 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 23:08:39,447 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 9 transitions. Stem has 8 letters. Loop has 2 letters. [2019-11-15 23:08:39,447 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 23:08:39,447 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 9 transitions. Stem has 6 letters. Loop has 4 letters. [2019-11-15 23:08:39,447 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 23:08:39,447 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 16 states and 21 transitions. [2019-11-15 23:08:39,449 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-11-15 23:08:39,449 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 16 states to 14 states and 17 transitions. [2019-11-15 23:08:39,449 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2019-11-15 23:08:39,450 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2019-11-15 23:08:39,450 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 17 transitions. [2019-11-15 23:08:39,450 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 23:08:39,450 INFO L688 BuchiCegarLoop]: Abstraction has 14 states and 17 transitions. [2019-11-15 23:08:39,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states and 17 transitions. [2019-11-15 23:08:39,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2019-11-15 23:08:39,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-11-15 23:08:39,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 17 transitions. [2019-11-15 23:08:39,452 INFO L711 BuchiCegarLoop]: Abstraction has 14 states and 17 transitions. [2019-11-15 23:08:39,452 INFO L591 BuchiCegarLoop]: Abstraction has 14 states and 17 transitions. [2019-11-15 23:08:39,453 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-11-15 23:08:39,453 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 17 transitions. [2019-11-15 23:08:39,453 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-11-15 23:08:39,454 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 23:08:39,454 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 23:08:39,454 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:08:39,454 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-11-15 23:08:39,455 INFO L791 eck$LassoCheckResult]: Stem: 232#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 228#L-1 havoc main_#res;havoc main_#t~nondet1, main_#t~nondet3, main_#t~post2, main_#t~mem5, main_#t~post6, main_#t~post4, main_#t~mem8, main_#t~mem9, main_#t~post10, main_#t~post7, main_~MAX~0, main_~#str1~0.base, main_~#str1~0.offset, main_~#str2~0.base, main_~#str2~0.offset, main_~cont~0, main_~i~0, main_~j~0;main_~MAX~0 := (if main_#t~nondet1 % 4294967296 % 4294967296 <= 2147483647 then main_#t~nondet1 % 4294967296 % 4294967296 else main_#t~nondet1 % 4294967296 % 4294967296 - 4294967296);havoc main_#t~nondet1;assume 0 != (if main_~MAX~0 > 0 then 1 else 0);call main_~#str1~0.base, main_~#str1~0.offset := #Ultimate.allocOnStack(main_~MAX~0);call main_~#str2~0.base, main_~#str2~0.offset := #Ultimate.allocOnStack(main_~MAX~0);havoc main_~cont~0;havoc main_~i~0;havoc main_~j~0;main_~cont~0 := 0;main_~i~0 := 0; 229#L20-3 assume !!(main_~i~0 < main_~MAX~0);call write~int(main_#t~nondet3, main_~#str1~0.base, main_~#str1~0.offset + main_~i~0, 1);havoc main_#t~nondet3; 235#L20-2 main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 236#L20-3 assume !(main_~i~0 < main_~MAX~0); 233#L20-4 call write~int(0, main_~#str1~0.base, main_~#str1~0.offset + (main_~MAX~0 - 1), 1);main_~j~0 := 0;main_~i~0 := main_~MAX~0 - 1; 234#L27-3 assume !(main_~i~0 >= 0); 237#L27-4 main_~j~0 := main_~MAX~0 - 1;main_~i~0 := 0; 227#L33-3 [2019-11-15 23:08:39,455 INFO L793 eck$LassoCheckResult]: Loop: 227#L33-3 assume !!(main_~i~0 < main_~MAX~0);call main_#t~mem8 := read~int(main_~#str1~0.base, main_~#str1~0.offset + main_~i~0, 1);call main_#t~mem9 := read~int(main_~#str2~0.base, main_~#str2~0.offset + main_~j~0, 1);__VERIFIER_assert_#in~cond := (if main_#t~mem8 == main_#t~mem9 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 230#L5 assume !(0 == __VERIFIER_assert_~cond); 231#L5-2 havoc main_#t~mem8;havoc main_#t~mem9;main_#t~post10 := main_~j~0;main_~j~0 := main_#t~post10 - 1;havoc main_#t~post10; 226#L33-2 main_#t~post7 := main_~i~0;main_~i~0 := 1 + main_#t~post7;havoc main_#t~post7; 227#L33-3 [2019-11-15 23:08:39,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:08:39,455 INFO L82 PathProgramCache]: Analyzing trace with hash 265181077, now seen corresponding path program 1 times [2019-11-15 23:08:39,455 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:08:39,456 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [878636940] [2019-11-15 23:08:39,456 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:08:39,464 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:08:39,464 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:08:39,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:08:39,509 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-15 23:08:39,509 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [878636940] [2019-11-15 23:08:39,509 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:08:39,510 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 23:08:39,510 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [582502060] [2019-11-15 23:08:39,510 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-11-15 23:08:39,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:08:39,510 INFO L82 PathProgramCache]: Analyzing trace with hash 2100362, now seen corresponding path program 1 times [2019-11-15 23:08:39,511 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:08:39,511 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1006144009] [2019-11-15 23:08:39,511 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:08:39,511 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:08:39,511 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:08:39,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:08:39,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:08:39,530 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:08:39,680 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:08:39,680 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:08:39,681 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:08:39,681 INFO L87 Difference]: Start difference. First operand 14 states and 17 transitions. cyclomatic complexity: 6 Second operand 4 states. [2019-11-15 23:08:39,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:08:39,735 INFO L93 Difference]: Finished difference Result 14 states and 16 transitions. [2019-11-15 23:08:39,735 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:08:39,735 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 14 states and 16 transitions. [2019-11-15 23:08:39,736 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-11-15 23:08:39,737 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 14 states to 14 states and 16 transitions. [2019-11-15 23:08:39,737 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2019-11-15 23:08:39,737 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2019-11-15 23:08:39,737 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 16 transitions. [2019-11-15 23:08:39,737 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 23:08:39,737 INFO L688 BuchiCegarLoop]: Abstraction has 14 states and 16 transitions. [2019-11-15 23:08:39,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states and 16 transitions. [2019-11-15 23:08:39,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2019-11-15 23:08:39,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-11-15 23:08:39,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 16 transitions. [2019-11-15 23:08:39,739 INFO L711 BuchiCegarLoop]: Abstraction has 14 states and 16 transitions. [2019-11-15 23:08:39,739 INFO L591 BuchiCegarLoop]: Abstraction has 14 states and 16 transitions. [2019-11-15 23:08:39,740 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2019-11-15 23:08:39,740 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 16 transitions. [2019-11-15 23:08:39,740 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-11-15 23:08:39,741 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 23:08:39,741 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 23:08:39,741 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:08:39,741 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-11-15 23:08:39,741 INFO L791 eck$LassoCheckResult]: Stem: 269#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 265#L-1 havoc main_#res;havoc main_#t~nondet1, main_#t~nondet3, main_#t~post2, main_#t~mem5, main_#t~post6, main_#t~post4, main_#t~mem8, main_#t~mem9, main_#t~post10, main_#t~post7, main_~MAX~0, main_~#str1~0.base, main_~#str1~0.offset, main_~#str2~0.base, main_~#str2~0.offset, main_~cont~0, main_~i~0, main_~j~0;main_~MAX~0 := (if main_#t~nondet1 % 4294967296 % 4294967296 <= 2147483647 then main_#t~nondet1 % 4294967296 % 4294967296 else main_#t~nondet1 % 4294967296 % 4294967296 - 4294967296);havoc main_#t~nondet1;assume 0 != (if main_~MAX~0 > 0 then 1 else 0);call main_~#str1~0.base, main_~#str1~0.offset := #Ultimate.allocOnStack(main_~MAX~0);call main_~#str2~0.base, main_~#str2~0.offset := #Ultimate.allocOnStack(main_~MAX~0);havoc main_~cont~0;havoc main_~i~0;havoc main_~j~0;main_~cont~0 := 0;main_~i~0 := 0; 266#L20-3 assume !!(main_~i~0 < main_~MAX~0);call write~int(main_#t~nondet3, main_~#str1~0.base, main_~#str1~0.offset + main_~i~0, 1);havoc main_#t~nondet3; 272#L20-2 main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 273#L20-3 assume !(main_~i~0 < main_~MAX~0); 270#L20-4 call write~int(0, main_~#str1~0.base, main_~#str1~0.offset + (main_~MAX~0 - 1), 1);main_~j~0 := 0;main_~i~0 := main_~MAX~0 - 1; 271#L27-3 assume !!(main_~i~0 >= 0);call main_#t~mem5 := read~int(main_~#str1~0.base, main_~#str1~0.offset, 1);call write~int(main_#t~mem5, main_~#str2~0.base, main_~#str2~0.offset + main_~j~0, 1);havoc main_#t~mem5;main_#t~post6 := main_~j~0;main_~j~0 := 1 + main_#t~post6;havoc main_#t~post6; 275#L27-2 main_#t~post4 := main_~i~0;main_~i~0 := main_#t~post4 - 1;havoc main_#t~post4; 276#L27-3 assume !(main_~i~0 >= 0); 274#L27-4 main_~j~0 := main_~MAX~0 - 1;main_~i~0 := 0; 264#L33-3 [2019-11-15 23:08:39,742 INFO L793 eck$LassoCheckResult]: Loop: 264#L33-3 assume !!(main_~i~0 < main_~MAX~0);call main_#t~mem8 := read~int(main_~#str1~0.base, main_~#str1~0.offset + main_~i~0, 1);call main_#t~mem9 := read~int(main_~#str2~0.base, main_~#str2~0.offset + main_~j~0, 1);__VERIFIER_assert_#in~cond := (if main_#t~mem8 == main_#t~mem9 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 267#L5 assume !(0 == __VERIFIER_assert_~cond); 268#L5-2 havoc main_#t~mem8;havoc main_#t~mem9;main_#t~post10 := main_~j~0;main_~j~0 := main_#t~post10 - 1;havoc main_#t~post10; 263#L33-2 main_#t~post7 := main_~i~0;main_~i~0 := 1 + main_#t~post7;havoc main_#t~post7; 264#L33-3 [2019-11-15 23:08:39,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:08:39,742 INFO L82 PathProgramCache]: Analyzing trace with hash 1436000983, now seen corresponding path program 1 times [2019-11-15 23:08:39,742 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:08:39,742 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1076648705] [2019-11-15 23:08:39,743 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:08:39,743 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:08:39,743 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:08:39,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:08:39,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:08:39,775 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:08:39,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:08:39,776 INFO L82 PathProgramCache]: Analyzing trace with hash 2100362, now seen corresponding path program 2 times [2019-11-15 23:08:39,776 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:08:39,777 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1738675859] [2019-11-15 23:08:39,777 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:08:39,777 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:08:39,777 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:08:39,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:08:39,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:08:39,787 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:08:39,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:08:39,788 INFO L82 PathProgramCache]: Analyzing trace with hash -1461824416, now seen corresponding path program 1 times [2019-11-15 23:08:39,788 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:08:39,788 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1120406455] [2019-11-15 23:08:39,788 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:08:39,788 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:08:39,789 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:08:39,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:08:39,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:08:39,828 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:08:40,295 WARN L191 SmtUtils]: Spent 323.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 98 [2019-11-15 23:08:40,573 WARN L191 SmtUtils]: Spent 270.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 63 [2019-11-15 23:08:40,575 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 23:08:40,575 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 23:08:40,575 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 23:08:40,575 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 23:08:40,575 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-15 23:08:40,575 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 23:08:40,575 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 23:08:40,575 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 23:08:40,575 INFO L131 ssoRankerPreferences]: Filename of dumped script: invert_string-1.c_Iteration5_Lasso [2019-11-15 23:08:40,575 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 23:08:40,576 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 23:08:40,579 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:08:40,585 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:08:40,587 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:08:40,588 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:08:40,591 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:08:40,739 WARN L191 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 47 [2019-11-15 23:08:40,783 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:08:40,785 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:08:40,787 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:08:40,793 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:08:40,795 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:08:40,801 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:08:40,804 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:08:40,808 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:08:40,810 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:08:40,813 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:08:40,815 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:08:41,243 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 23:08:41,243 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-15 23:08:41,244 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:08:41,244 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:08:41,244 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:08:41,245 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:08:41,245 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:08:41,245 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:08:41,245 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:08:41,245 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:08:41,246 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:08:41,246 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:08:41,247 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:08:41,247 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:08:41,247 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:08:41,247 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:08:41,247 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:08:41,247 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:08:41,248 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:08:41,248 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:08:41,248 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:08:41,250 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:08:41,250 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:08:41,250 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:08:41,251 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:08:41,251 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:08:41,251 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:08:41,251 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:08:41,252 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:08:41,252 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:08:41,253 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:08:41,253 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:08:41,253 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:08:41,253 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:08:41,255 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:08:41,255 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:08:41,256 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:08:41,257 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:08:41,257 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:08:41,258 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:08:41,258 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:08:41,258 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:08:41,261 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:08:41,262 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:08:41,292 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-15 23:08:41,325 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-11-15 23:08:41,326 INFO L444 ModelExtractionUtils]: 21 out of 25 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-11-15 23:08:41,326 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-15 23:08:41,327 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-15 23:08:41,327 INFO L510 LassoAnalysis]: Proved termination. [2019-11-15 23:08:41,328 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0) = -2*ULTIMATE.start_main_~i~0 + 1 Supporting invariants [] [2019-11-15 23:08:41,341 INFO L297 tatePredicateManager]: 3 out of 4 supporting invariants were superfluous and have been removed [2019-11-15 23:08:41,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:08:41,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:08:41,390 INFO L256 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-15 23:08:41,391 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:08:41,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:08:41,501 INFO L256 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-15 23:08:41,502 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:08:41,522 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:08:41,522 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.4 stem predicates 2 loop predicates [2019-11-15 23:08:41,522 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 14 states and 16 transitions. cyclomatic complexity: 5 Second operand 6 states. [2019-11-15 23:08:41,690 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 14 states and 16 transitions. cyclomatic complexity: 5. Second operand 6 states. Result 32 states and 37 transitions. Complement of second has 10 states. [2019-11-15 23:08:41,690 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 5 stem states 1 non-accepting loop states 2 accepting loop states [2019-11-15 23:08:41,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-11-15 23:08:41,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 24 transitions. [2019-11-15 23:08:41,691 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 24 transitions. Stem has 10 letters. Loop has 4 letters. [2019-11-15 23:08:41,692 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 23:08:41,692 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 24 transitions. Stem has 14 letters. Loop has 4 letters. [2019-11-15 23:08:41,692 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 23:08:41,692 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 24 transitions. Stem has 10 letters. Loop has 8 letters. [2019-11-15 23:08:41,693 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 23:08:41,693 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 32 states and 37 transitions. [2019-11-15 23:08:41,694 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-11-15 23:08:41,695 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 32 states to 19 states and 21 transitions. [2019-11-15 23:08:41,695 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2019-11-15 23:08:41,695 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2019-11-15 23:08:41,696 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 21 transitions. [2019-11-15 23:08:41,696 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 23:08:41,696 INFO L688 BuchiCegarLoop]: Abstraction has 19 states and 21 transitions. [2019-11-15 23:08:41,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states and 21 transitions. [2019-11-15 23:08:41,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 16. [2019-11-15 23:08:41,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-11-15 23:08:41,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 18 transitions. [2019-11-15 23:08:41,698 INFO L711 BuchiCegarLoop]: Abstraction has 16 states and 18 transitions. [2019-11-15 23:08:41,699 INFO L591 BuchiCegarLoop]: Abstraction has 16 states and 18 transitions. [2019-11-15 23:08:41,699 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2019-11-15 23:08:41,699 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 18 transitions. [2019-11-15 23:08:41,700 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-11-15 23:08:41,700 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 23:08:41,701 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 23:08:41,701 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:08:41,702 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-11-15 23:08:41,702 INFO L791 eck$LassoCheckResult]: Stem: 416#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 410#L-1 havoc main_#res;havoc main_#t~nondet1, main_#t~nondet3, main_#t~post2, main_#t~mem5, main_#t~post6, main_#t~post4, main_#t~mem8, main_#t~mem9, main_#t~post10, main_#t~post7, main_~MAX~0, main_~#str1~0.base, main_~#str1~0.offset, main_~#str2~0.base, main_~#str2~0.offset, main_~cont~0, main_~i~0, main_~j~0;main_~MAX~0 := (if main_#t~nondet1 % 4294967296 % 4294967296 <= 2147483647 then main_#t~nondet1 % 4294967296 % 4294967296 else main_#t~nondet1 % 4294967296 % 4294967296 - 4294967296);havoc main_#t~nondet1;assume 0 != (if main_~MAX~0 > 0 then 1 else 0);call main_~#str1~0.base, main_~#str1~0.offset := #Ultimate.allocOnStack(main_~MAX~0);call main_~#str2~0.base, main_~#str2~0.offset := #Ultimate.allocOnStack(main_~MAX~0);havoc main_~cont~0;havoc main_~i~0;havoc main_~j~0;main_~cont~0 := 0;main_~i~0 := 0; 411#L20-3 assume !!(main_~i~0 < main_~MAX~0);call write~int(main_#t~nondet3, main_~#str1~0.base, main_~#str1~0.offset + main_~i~0, 1);havoc main_#t~nondet3; 419#L20-2 main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 420#L20-3 assume !!(main_~i~0 < main_~MAX~0);call write~int(main_#t~nondet3, main_~#str1~0.base, main_~#str1~0.offset + main_~i~0, 1);havoc main_#t~nondet3; 421#L20-2 main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 425#L20-3 assume !(main_~i~0 < main_~MAX~0); 417#L20-4 call write~int(0, main_~#str1~0.base, main_~#str1~0.offset + (main_~MAX~0 - 1), 1);main_~j~0 := 0;main_~i~0 := main_~MAX~0 - 1; 418#L27-3 assume !!(main_~i~0 >= 0);call main_#t~mem5 := read~int(main_~#str1~0.base, main_~#str1~0.offset, 1);call write~int(main_#t~mem5, main_~#str2~0.base, main_~#str2~0.offset + main_~j~0, 1);havoc main_#t~mem5;main_#t~post6 := main_~j~0;main_~j~0 := 1 + main_#t~post6;havoc main_#t~post6; 423#L27-2 main_#t~post4 := main_~i~0;main_~i~0 := main_#t~post4 - 1;havoc main_#t~post4; 424#L27-3 assume !(main_~i~0 >= 0); 422#L27-4 main_~j~0 := main_~MAX~0 - 1;main_~i~0 := 0; 413#L33-3 [2019-11-15 23:08:41,702 INFO L793 eck$LassoCheckResult]: Loop: 413#L33-3 assume !!(main_~i~0 < main_~MAX~0);call main_#t~mem8 := read~int(main_~#str1~0.base, main_~#str1~0.offset + main_~i~0, 1);call main_#t~mem9 := read~int(main_~#str2~0.base, main_~#str2~0.offset + main_~j~0, 1);__VERIFIER_assert_#in~cond := (if main_#t~mem8 == main_#t~mem9 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 414#L5 assume !(0 == __VERIFIER_assert_~cond); 415#L5-2 havoc main_#t~mem8;havoc main_#t~mem9;main_#t~post10 := main_~j~0;main_~j~0 := main_#t~post10 - 1;havoc main_#t~post10; 412#L33-2 main_#t~post7 := main_~i~0;main_~i~0 := 1 + main_#t~post7;havoc main_#t~post7; 413#L33-3 [2019-11-15 23:08:41,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:08:41,703 INFO L82 PathProgramCache]: Analyzing trace with hash 780803417, now seen corresponding path program 2 times [2019-11-15 23:08:41,703 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:08:41,703 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1765799097] [2019-11-15 23:08:41,703 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:08:41,704 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:08:41,704 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:08:41,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:08:41,850 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:08:41,850 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1765799097] [2019-11-15 23:08:41,850 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1875314449] [2019-11-15 23:08:41,850 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b208bfc5-5374-4318-9aa5-bfe9b7726c52/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:08:41,946 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-15 23:08:41,946 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 23:08:41,947 INFO L256 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-15 23:08:41,948 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:08:41,970 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:08:41,971 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 23:08:41,971 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 5] total 10 [2019-11-15 23:08:41,971 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [168657710] [2019-11-15 23:08:41,972 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-11-15 23:08:41,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:08:41,972 INFO L82 PathProgramCache]: Analyzing trace with hash 2100362, now seen corresponding path program 3 times [2019-11-15 23:08:41,972 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:08:41,972 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [718298838] [2019-11-15 23:08:41,973 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:08:41,973 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:08:41,973 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:08:41,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:08:42,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:08:42,030 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:08:42,193 WARN L191 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 43 [2019-11-15 23:08:42,194 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:08:42,194 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-15 23:08:42,194 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2019-11-15 23:08:42,194 INFO L87 Difference]: Start difference. First operand 16 states and 18 transitions. cyclomatic complexity: 5 Second operand 10 states. [2019-11-15 23:08:42,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:08:42,434 INFO L93 Difference]: Finished difference Result 22 states and 24 transitions. [2019-11-15 23:08:42,434 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-15 23:08:42,435 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 22 states and 24 transitions. [2019-11-15 23:08:42,435 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-11-15 23:08:42,436 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 22 states to 22 states and 24 transitions. [2019-11-15 23:08:42,436 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2019-11-15 23:08:42,436 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2019-11-15 23:08:42,436 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 24 transitions. [2019-11-15 23:08:42,437 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 23:08:42,437 INFO L688 BuchiCegarLoop]: Abstraction has 22 states and 24 transitions. [2019-11-15 23:08:42,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states and 24 transitions. [2019-11-15 23:08:42,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 18. [2019-11-15 23:08:42,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-11-15 23:08:42,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 20 transitions. [2019-11-15 23:08:42,439 INFO L711 BuchiCegarLoop]: Abstraction has 18 states and 20 transitions. [2019-11-15 23:08:42,439 INFO L591 BuchiCegarLoop]: Abstraction has 18 states and 20 transitions. [2019-11-15 23:08:42,439 INFO L424 BuchiCegarLoop]: ======== Iteration 7============ [2019-11-15 23:08:42,439 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 20 transitions. [2019-11-15 23:08:42,440 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-11-15 23:08:42,440 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 23:08:42,440 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 23:08:42,443 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2019-11-15 23:08:42,443 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-11-15 23:08:42,444 INFO L791 eck$LassoCheckResult]: Stem: 514#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 508#L-1 havoc main_#res;havoc main_#t~nondet1, main_#t~nondet3, main_#t~post2, main_#t~mem5, main_#t~post6, main_#t~post4, main_#t~mem8, main_#t~mem9, main_#t~post10, main_#t~post7, main_~MAX~0, main_~#str1~0.base, main_~#str1~0.offset, main_~#str2~0.base, main_~#str2~0.offset, main_~cont~0, main_~i~0, main_~j~0;main_~MAX~0 := (if main_#t~nondet1 % 4294967296 % 4294967296 <= 2147483647 then main_#t~nondet1 % 4294967296 % 4294967296 else main_#t~nondet1 % 4294967296 % 4294967296 - 4294967296);havoc main_#t~nondet1;assume 0 != (if main_~MAX~0 > 0 then 1 else 0);call main_~#str1~0.base, main_~#str1~0.offset := #Ultimate.allocOnStack(main_~MAX~0);call main_~#str2~0.base, main_~#str2~0.offset := #Ultimate.allocOnStack(main_~MAX~0);havoc main_~cont~0;havoc main_~i~0;havoc main_~j~0;main_~cont~0 := 0;main_~i~0 := 0; 509#L20-3 assume !!(main_~i~0 < main_~MAX~0);call write~int(main_#t~nondet3, main_~#str1~0.base, main_~#str1~0.offset + main_~i~0, 1);havoc main_#t~nondet3; 515#L20-2 main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 516#L20-3 assume !!(main_~i~0 < main_~MAX~0);call write~int(main_#t~nondet3, main_~#str1~0.base, main_~#str1~0.offset + main_~i~0, 1);havoc main_#t~nondet3; 517#L20-2 main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 522#L20-3 assume !(main_~i~0 < main_~MAX~0); 512#L20-4 call write~int(0, main_~#str1~0.base, main_~#str1~0.offset + (main_~MAX~0 - 1), 1);main_~j~0 := 0;main_~i~0 := main_~MAX~0 - 1; 513#L27-3 assume !!(main_~i~0 >= 0);call main_#t~mem5 := read~int(main_~#str1~0.base, main_~#str1~0.offset, 1);call write~int(main_#t~mem5, main_~#str2~0.base, main_~#str2~0.offset + main_~j~0, 1);havoc main_#t~mem5;main_#t~post6 := main_~j~0;main_~j~0 := 1 + main_#t~post6;havoc main_#t~post6; 519#L27-2 main_#t~post4 := main_~i~0;main_~i~0 := main_#t~post4 - 1;havoc main_#t~post4; 520#L27-3 assume !!(main_~i~0 >= 0);call main_#t~mem5 := read~int(main_~#str1~0.base, main_~#str1~0.offset, 1);call write~int(main_#t~mem5, main_~#str2~0.base, main_~#str2~0.offset + main_~j~0, 1);havoc main_#t~mem5;main_#t~post6 := main_~j~0;main_~j~0 := 1 + main_#t~post6;havoc main_#t~post6; 521#L27-2 main_#t~post4 := main_~i~0;main_~i~0 := main_#t~post4 - 1;havoc main_#t~post4; 523#L27-3 assume !(main_~i~0 >= 0); 518#L27-4 main_~j~0 := main_~MAX~0 - 1;main_~i~0 := 0; 507#L33-3 [2019-11-15 23:08:42,444 INFO L793 eck$LassoCheckResult]: Loop: 507#L33-3 assume !!(main_~i~0 < main_~MAX~0);call main_#t~mem8 := read~int(main_~#str1~0.base, main_~#str1~0.offset + main_~i~0, 1);call main_#t~mem9 := read~int(main_~#str2~0.base, main_~#str2~0.offset + main_~j~0, 1);__VERIFIER_assert_#in~cond := (if main_#t~mem8 == main_#t~mem9 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 510#L5 assume !(0 == __VERIFIER_assert_~cond); 511#L5-2 havoc main_#t~mem8;havoc main_#t~mem9;main_#t~post10 := main_~j~0;main_~j~0 := main_#t~post10 - 1;havoc main_#t~post10; 506#L33-2 main_#t~post7 := main_~i~0;main_~i~0 := 1 + main_#t~post7;havoc main_#t~post7; 507#L33-3 [2019-11-15 23:08:42,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:08:42,445 INFO L82 PathProgramCache]: Analyzing trace with hash -1267136613, now seen corresponding path program 3 times [2019-11-15 23:08:42,446 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:08:42,446 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [98934554] [2019-11-15 23:08:42,446 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:08:42,446 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:08:42,446 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:08:42,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:08:42,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:08:42,512 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:08:42,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:08:42,519 INFO L82 PathProgramCache]: Analyzing trace with hash 2100362, now seen corresponding path program 4 times [2019-11-15 23:08:42,520 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:08:42,520 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [573282163] [2019-11-15 23:08:42,520 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:08:42,520 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:08:42,520 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:08:42,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:08:42,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:08:42,531 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:08:42,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:08:42,532 INFO L82 PathProgramCache]: Analyzing trace with hash 993507108, now seen corresponding path program 2 times [2019-11-15 23:08:42,532 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:08:42,532 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [818090705] [2019-11-15 23:08:42,533 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:08:42,533 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:08:42,533 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:08:42,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:08:42,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:08:42,602 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:08:43,449 WARN L191 SmtUtils]: Spent 708.00 ms on a formula simplification. DAG size of input: 152 DAG size of output: 123 [2019-11-15 23:08:43,717 WARN L191 SmtUtils]: Spent 257.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 81 [2019-11-15 23:08:43,719 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 23:08:43,719 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 23:08:43,720 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 23:08:43,720 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 23:08:43,720 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-15 23:08:43,720 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 23:08:43,720 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 23:08:43,720 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 23:08:43,720 INFO L131 ssoRankerPreferences]: Filename of dumped script: invert_string-1.c_Iteration7_Lasso [2019-11-15 23:08:43,720 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 23:08:43,720 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 23:08:43,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:08:43,727 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:08:43,729 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:08:43,731 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:08:43,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:08:43,735 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:08:43,737 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:08:43,739 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:08:43,745 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:08:43,820 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer has thrown an exception: java.lang.AssertionError: MapEliminator tries to combine Int and (Array Int Int) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.mapelimination.MapEliminator.indexEqualityInequalityImpliesValueEquality(MapEliminator.java:850) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.mapelimination.MapEliminator.replaceSelectStoreTerm(MapEliminator.java:592) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.mapelimination.MapEliminator.replaceStoreTerms(MapEliminator.java:542) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.mapelimination.MapEliminator.getRewrittenTransFormula(MapEliminator.java:330) at de.uni_freiburg.informatik.ultimate.lassoranker.preprocessors.MapEliminationLassoPreprocessor.process(MapEliminationLassoPreprocessor.java:109) at de.uni_freiburg.informatik.ultimate.lassoranker.variables.LassoBuilder.applyPreprocessor(LassoBuilder.java:154) at de.uni_freiburg.informatik.ultimate.lassoranker.variables.LassoBuilder.preprocess(LassoBuilder.java:262) at de.uni_freiburg.informatik.ultimate.lassoranker.LassoAnalysis.preprocess(LassoAnalysis.java:278) at de.uni_freiburg.informatik.ultimate.lassoranker.LassoAnalysis.(LassoAnalysis.java:229) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.synthesize(LassoCheck.java:609) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.access$16(LassoCheck.java:536) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.checkLassoTermination(LassoCheck.java:951) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.(LassoCheck.java:862) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.(LassoCheck.java:248) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiCegarLoop.iterate(BuchiCegarLoop.java:458) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.doTerminationAnalysis(BuchiAutomizerObserver.java:141) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.finish(BuchiAutomizerObserver.java:380) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2019-11-15 23:08:43,823 INFO L168 Benchmark]: Toolchain (without parser) took 9207.10 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 331.4 MB). Free memory was 950.1 MB in the beginning and 1.1 GB in the end (delta: -183.4 MB). Peak memory consumption was 147.9 MB. Max. memory is 11.5 GB. [2019-11-15 23:08:43,823 INFO L168 Benchmark]: CDTParser took 0.73 ms. Allocated memory is still 1.0 GB. Free memory is still 967.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 23:08:43,824 INFO L168 Benchmark]: CACSL2BoogieTranslator took 384.50 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 143.7 MB). Free memory was 950.1 MB in the beginning and 1.1 GB in the end (delta: -185.0 MB). Peak memory consumption was 24.3 MB. Max. memory is 11.5 GB. [2019-11-15 23:08:43,825 INFO L168 Benchmark]: Boogie Procedure Inliner took 38.58 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: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 11.5 GB. [2019-11-15 23:08:43,825 INFO L168 Benchmark]: Boogie Preprocessor took 30.49 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:08:43,826 INFO L168 Benchmark]: RCFGBuilder took 360.08 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: 21.4 MB). Peak memory consumption was 21.4 MB. Max. memory is 11.5 GB. [2019-11-15 23:08:43,826 INFO L168 Benchmark]: BuchiAutomizer took 8389.65 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 187.7 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -21.5 MB). Peak memory consumption was 166.2 MB. Max. memory is 11.5 GB. [2019-11-15 23:08:43,830 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.73 ms. Allocated memory is still 1.0 GB. Free memory is still 967.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 384.50 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 143.7 MB). Free memory was 950.1 MB in the beginning and 1.1 GB in the end (delta: -185.0 MB). Peak memory consumption was 24.3 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 38.58 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: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 30.49 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 360.08 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: 21.4 MB). Peak memory consumption was 21.4 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 8389.65 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 187.7 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -21.5 MB). Peak memory consumption was 166.2 MB. 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.buchiautomizer: - ExceptionOrErrorResult: AssertionError: MapEliminator tries to combine Int and (Array Int Int) de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: AssertionError: MapEliminator tries to combine Int and (Array Int Int): de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.mapelimination.MapEliminator.indexEqualityInequalityImpliesValueEquality(MapEliminator.java:850) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...