./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/loops/invert_string-3.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version f470102c Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_e78a2f48-e222-435f-b6ad-f4400dab65d7/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_e78a2f48-e222-435f-b6ad-f4400dab65d7/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_e78a2f48-e222-435f-b6ad-f4400dab65d7/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_e78a2f48-e222-435f-b6ad-f4400dab65d7/bin/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/loops/invert_string-3.c -s /tmp/vcloud-vcloud-master/worker/run_dir_e78a2f48-e222-435f-b6ad-f4400dab65d7/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_e78a2f48-e222-435f-b6ad-f4400dab65d7/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 ac7c62eef1736762a9ed0f43546ad9c2b468346f ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Using bit-precise analysis No suitable file found in config dir /tmp/vcloud-vcloud-master/worker/run_dir_e78a2f48-e222-435f-b6ad-f4400dab65d7/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.25-f470102 [2019-12-07 10:21:39,767 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 10:21:39,769 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 10:21:39,778 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 10:21:39,778 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 10:21:39,779 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 10:21:39,780 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 10:21:39,781 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 10:21:39,782 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 10:21:39,783 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 10:21:39,783 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 10:21:39,784 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 10:21:39,784 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 10:21:39,785 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 10:21:39,786 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 10:21:39,786 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 10:21:39,787 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 10:21:39,788 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 10:21:39,789 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 10:21:39,790 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 10:21:39,792 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 10:21:39,792 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 10:21:39,793 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 10:21:39,793 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 10:21:39,795 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 10:21:39,795 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 10:21:39,795 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 10:21:39,796 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 10:21:39,796 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 10:21:39,797 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 10:21:39,797 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 10:21:39,797 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 10:21:39,798 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 10:21:39,798 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 10:21:39,799 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 10:21:39,799 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 10:21:39,799 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 10:21:39,799 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 10:21:39,800 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 10:21:39,800 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 10:21:39,800 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 10:21:39,801 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_e78a2f48-e222-435f-b6ad-f4400dab65d7/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2019-12-07 10:21:39,812 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 10:21:39,812 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 10:21:39,812 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 10:21:39,812 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 10:21:39,813 INFO L138 SettingsManager]: * Use SBE=true [2019-12-07 10:21:39,813 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-12-07 10:21:39,813 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-12-07 10:21:39,813 INFO L138 SettingsManager]: * Use old map elimination=false [2019-12-07 10:21:39,813 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-12-07 10:21:39,813 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-12-07 10:21:39,813 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-12-07 10:21:39,813 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 10:21:39,813 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 10:21:39,813 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-12-07 10:21:39,814 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 10:21:39,814 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 10:21:39,814 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 10:21:39,814 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-12-07 10:21:39,814 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-12-07 10:21:39,814 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-12-07 10:21:39,814 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 10:21:39,814 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 10:21:39,814 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-12-07 10:21:39,815 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 10:21:39,815 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-12-07 10:21:39,815 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 10:21:39,815 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 10:21:39,815 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-12-07 10:21:39,815 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 10:21:39,815 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-07 10:21:39,815 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 10:21:39,816 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-12-07 10:21:39,816 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-12-07 10:21:39,816 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_e78a2f48-e222-435f-b6ad-f4400dab65d7/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 -> ac7c62eef1736762a9ed0f43546ad9c2b468346f [2019-12-07 10:21:39,913 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 10:21:39,921 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 10:21:39,923 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 10:21:39,924 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 10:21:39,925 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 10:21:39,925 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_e78a2f48-e222-435f-b6ad-f4400dab65d7/bin/uautomizer/../../sv-benchmarks/c/loops/invert_string-3.c [2019-12-07 10:21:39,961 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_e78a2f48-e222-435f-b6ad-f4400dab65d7/bin/uautomizer/data/40914dbca/2b629b9a056240faa007b3b807f3fee7/FLAG568d225cd [2019-12-07 10:21:40,374 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 10:21:40,374 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_e78a2f48-e222-435f-b6ad-f4400dab65d7/sv-benchmarks/c/loops/invert_string-3.c [2019-12-07 10:21:40,378 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_e78a2f48-e222-435f-b6ad-f4400dab65d7/bin/uautomizer/data/40914dbca/2b629b9a056240faa007b3b807f3fee7/FLAG568d225cd [2019-12-07 10:21:40,386 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_e78a2f48-e222-435f-b6ad-f4400dab65d7/bin/uautomizer/data/40914dbca/2b629b9a056240faa007b3b807f3fee7 [2019-12-07 10:21:40,388 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 10:21:40,389 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 10:21:40,389 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 10:21:40,389 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 10:21:40,391 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 10:21:40,392 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 10:21:40" (1/1) ... [2019-12-07 10:21:40,394 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3c8c33a1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:21:40, skipping insertion in model container [2019-12-07 10:21:40,394 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 10:21:40" (1/1) ... [2019-12-07 10:21:40,398 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 10:21:40,409 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 10:21:40,546 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 10:21:40,549 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 10:21:40,565 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 10:21:40,577 INFO L208 MainTranslator]: Completed translation [2019-12-07 10:21:40,578 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:21:40 WrapperNode [2019-12-07 10:21:40,578 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 10:21:40,578 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 10:21:40,578 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 10:21:40,578 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 10:21:40,584 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:21:40" (1/1) ... [2019-12-07 10:21:40,589 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:21:40" (1/1) ... [2019-12-07 10:21:40,606 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 10:21:40,607 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 10:21:40,607 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 10:21:40,607 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 10:21:40,613 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:21:40" (1/1) ... [2019-12-07 10:21:40,613 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:21:40" (1/1) ... [2019-12-07 10:21:40,615 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:21:40" (1/1) ... [2019-12-07 10:21:40,615 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:21:40" (1/1) ... [2019-12-07 10:21:40,619 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:21:40" (1/1) ... [2019-12-07 10:21:40,623 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:21:40" (1/1) ... [2019-12-07 10:21:40,625 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:21:40" (1/1) ... [2019-12-07 10:21:40,626 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 10:21:40,627 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 10:21:40,627 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 10:21:40,627 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 10:21:40,628 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:21:40" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e78a2f48-e222-435f-b6ad-f4400dab65d7/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-12-07 10:21:40,670 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-07 10:21:40,670 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 10:21:40,670 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 10:21:40,670 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-12-07 10:21:40,670 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-07 10:21:40,670 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-07 10:21:40,813 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 10:21:40,813 INFO L287 CfgBuilder]: Removed 9 assume(true) statements. [2019-12-07 10:21:40,814 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 10:21:40 BoogieIcfgContainer [2019-12-07 10:21:40,814 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 10:21:40,814 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-12-07 10:21:40,815 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-12-07 10:21:40,817 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-12-07 10:21:40,817 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-12-07 10:21:40,817 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 07.12 10:21:40" (1/3) ... [2019-12-07 10:21:40,818 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6a3d3e11 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 07.12 10:21:40, skipping insertion in model container [2019-12-07 10:21:40,818 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-12-07 10:21:40,818 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:21:40" (2/3) ... [2019-12-07 10:21:40,818 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6a3d3e11 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 07.12 10:21:40, skipping insertion in model container [2019-12-07 10:21:40,818 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-12-07 10:21:40,818 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 10:21:40" (3/3) ... [2019-12-07 10:21:40,819 INFO L371 chiAutomizerObserver]: Analyzing ICFG invert_string-3.c [2019-12-07 10:21:40,847 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-12-07 10:21:40,847 INFO L357 BuchiCegarLoop]: Hoare is false [2019-12-07 10:21:40,847 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-12-07 10:21:40,848 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 10:21:40,848 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 10:21:40,848 INFO L361 BuchiCegarLoop]: Difference is false [2019-12-07 10:21:40,848 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 10:21:40,848 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-12-07 10:21:40,857 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states. [2019-12-07 10:21:40,870 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 9 [2019-12-07 10:21:40,871 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-12-07 10:21:40,871 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-12-07 10:21:40,875 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-12-07 10:21:40,875 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-12-07 10:21:40,875 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-12-07 10:21:40,876 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states. [2019-12-07 10:21:40,877 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 9 [2019-12-07 10:21:40,877 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-12-07 10:21:40,877 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-12-07 10:21:40,877 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-12-07 10:21:40,877 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-12-07 10:21:40,882 INFO L794 eck$LassoCheckResult]: Stem: 10#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 8#L-1true havoc main_#res;havoc main_#t~nondet1, main_#t~post0, main_#t~mem3, main_#t~post4, main_#t~post2, main_#t~mem6, main_#t~mem7, main_#t~post8, main_#t~post5, main_~max~0, main_~#str1~0.base, main_~#str1~0.offset, main_~#str2~0.base, main_~#str2~0.offset, main_~i~0, main_~j~0;main_~max~0 := 5;call main_~#str1~0.base, main_~#str1~0.offset := #Ultimate.allocOnStack((if main_~max~0 % 4294967296 % 4294967296 <= 2147483647 then main_~max~0 % 4294967296 % 4294967296 else main_~max~0 % 4294967296 % 4294967296 - 4294967296));call main_~#str2~0.base, main_~#str2~0.offset := #Ultimate.allocOnStack((if main_~max~0 % 4294967296 % 4294967296 <= 2147483647 then main_~max~0 % 4294967296 % 4294967296 else main_~max~0 % 4294967296 % 4294967296 - 4294967296));havoc main_~i~0;havoc main_~j~0;main_~i~0 := 0; 16#L16-3true [2019-12-07 10:21:40,882 INFO L796 eck$LassoCheckResult]: Loop: 16#L16-3true assume !!(main_~i~0 % 4294967296 < main_~max~0 % 4294967296);call write~int(main_#t~nondet1, main_~#str1~0.base, main_~#str1~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 18#L16-2true main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 16#L16-3true [2019-12-07 10:21:40,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:21:40,888 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2019-12-07 10:21:40,893 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:21:40,894 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1278003077] [2019-12-07 10:21:40,894 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:21:40,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 10:21:40,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 10:21:40,981 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 10:21:40,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:21:40,982 INFO L82 PathProgramCache]: Analyzing trace with hash 1283, now seen corresponding path program 1 times [2019-12-07 10:21:40,982 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:21:40,982 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [375378994] [2019-12-07 10:21:40,983 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:21:40,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 10:21:40,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 10:21:41,001 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 10:21:41,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:21:41,002 INFO L82 PathProgramCache]: Analyzing trace with hash 925765, now seen corresponding path program 1 times [2019-12-07 10:21:41,002 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:21:41,002 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [994165906] [2019-12-07 10:21:41,002 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:21:41,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 10:21:41,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 10:21:41,034 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 10:21:41,232 INFO L210 LassoAnalysis]: Preferences: [2019-12-07 10:21:41,233 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-12-07 10:21:41,233 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-12-07 10:21:41,233 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-12-07 10:21:41,233 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-12-07 10:21:41,233 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 10:21:41,233 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-12-07 10:21:41,233 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-12-07 10:21:41,233 INFO L133 ssoRankerPreferences]: Filename of dumped script: invert_string-3.c_Iteration1_Lasso [2019-12-07 10:21:41,233 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-12-07 10:21:41,234 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-12-07 10:21:41,250 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 10:21:41,254 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 10:21:41,257 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 10:21:41,258 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 10:21:41,260 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 10:21:41,261 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 10:21:41,263 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 10:21:41,265 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 10:21:41,311 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 10:21:41,312 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 10:21:41,313 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 10:21:41,315 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 10:21:41,317 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 10:21:41,318 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 10:21:41,496 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-12-07 10:21:41,499 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e78a2f48-e222-435f-b6ad-f4400dab65d7/bin/uautomizer/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 10:21:41,503 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-12-07 10:21:41,504 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 10:21:41,505 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-12-07 10:21:41,505 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 10:21:41,505 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 10:21:41,505 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 10:21:41,507 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-12-07 10:21:41,507 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-12-07 10:21:41,508 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e78a2f48-e222-435f-b6ad-f4400dab65d7/bin/uautomizer/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 10:21:41,512 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-12-07 10:21:41,513 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 10:21:41,514 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 10:21:41,514 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 10:21:41,514 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 10:21:41,517 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-12-07 10:21:41,517 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-12-07 10:21:41,520 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e78a2f48-e222-435f-b6ad-f4400dab65d7/bin/uautomizer/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 10:21:41,523 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-12-07 10:21:41,525 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 10:21:41,525 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-12-07 10:21:41,525 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 10:21:41,525 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 10:21:41,525 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 10:21:41,526 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-12-07 10:21:41,526 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-12-07 10:21:41,527 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e78a2f48-e222-435f-b6ad-f4400dab65d7/bin/uautomizer/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 10:21:41,530 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-12-07 10:21:41,531 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 10:21:41,532 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-12-07 10:21:41,532 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 10:21:41,532 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 10:21:41,532 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 10:21:41,533 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-12-07 10:21:41,533 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-12-07 10:21:41,534 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e78a2f48-e222-435f-b6ad-f4400dab65d7/bin/uautomizer/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 10:21:41,537 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-12-07 10:21:41,538 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 10:21:41,539 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-12-07 10:21:41,539 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 10:21:41,539 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 10:21:41,539 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 10:21:41,539 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-12-07 10:21:41,539 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-12-07 10:21:41,540 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e78a2f48-e222-435f-b6ad-f4400dab65d7/bin/uautomizer/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 10:21:41,544 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-12-07 10:21:41,545 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 10:21:41,545 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-12-07 10:21:41,545 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 10:21:41,545 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 10:21:41,545 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 10:21:41,546 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-12-07 10:21:41,546 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-12-07 10:21:41,547 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e78a2f48-e222-435f-b6ad-f4400dab65d7/bin/uautomizer/z3 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 10:21:41,551 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-12-07 10:21:41,552 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 10:21:41,552 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 10:21:41,552 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 10:21:41,552 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 10:21:41,554 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-12-07 10:21:41,554 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-12-07 10:21:41,557 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e78a2f48-e222-435f-b6ad-f4400dab65d7/bin/uautomizer/z3 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 10:21:41,561 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-12-07 10:21:41,562 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 10:21:41,563 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 10:21:41,563 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 10:21:41,563 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 10:21:41,565 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-12-07 10:21:41,565 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-12-07 10:21:41,569 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e78a2f48-e222-435f-b6ad-f4400dab65d7/bin/uautomizer/z3 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 10:21:41,573 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-12-07 10:21:41,574 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 10:21:41,574 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-12-07 10:21:41,575 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 10:21:41,575 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 10:21:41,575 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 10:21:41,575 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-12-07 10:21:41,576 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-12-07 10:21:41,577 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e78a2f48-e222-435f-b6ad-f4400dab65d7/bin/uautomizer/z3 Starting monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 10:21:41,581 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-12-07 10:21:41,583 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 10:21:41,583 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 10:21:41,583 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 10:21:41,583 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 10:21:41,586 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-12-07 10:21:41,586 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-12-07 10:21:41,589 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e78a2f48-e222-435f-b6ad-f4400dab65d7/bin/uautomizer/z3 Starting monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 10:21:41,592 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-12-07 10:21:41,594 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 10:21:41,594 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-12-07 10:21:41,594 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 10:21:41,595 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 10:21:41,595 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 10:21:41,595 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-12-07 10:21:41,595 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-12-07 10:21:41,597 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e78a2f48-e222-435f-b6ad-f4400dab65d7/bin/uautomizer/z3 Starting monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 10:21:41,600 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-12-07 10:21:41,602 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 10:21:41,603 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 10:21:41,603 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 10:21:41,603 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 10:21:41,611 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-12-07 10:21:41,611 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-12-07 10:21:41,627 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-12-07 10:21:41,645 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2019-12-07 10:21:41,646 INFO L444 ModelExtractionUtils]: 12 out of 19 variables were initially zero. Simplification set additionally 3 variables to zero. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e78a2f48-e222-435f-b6ad-f4400dab65d7/bin/uautomizer/z3 Starting monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 10:21:41,650 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-12-07 10:21:41,652 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-12-07 10:21:41,653 INFO L510 LassoAnalysis]: Proved termination. [2019-12-07 10:21:41,653 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0, ULTIMATE.start_main_~#str1~0.offset, v_rep(select #length ULTIMATE.start_main_~#str1~0.base)_1) = -1*ULTIMATE.start_main_~i~0 - 1*ULTIMATE.start_main_~#str1~0.offset + 1*v_rep(select #length ULTIMATE.start_main_~#str1~0.base)_1 Supporting invariants [] [2019-12-07 10:21:41,664 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2019-12-07 10:21:41,670 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2019-12-07 10:21:41,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:21:41,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:21:41,693 INFO L264 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 2 conjunts are in the unsatisfiable core [2019-12-07 10:21:41,694 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 10:21:41,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:21:41,704 INFO L264 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjunts are in the unsatisfiable core [2019-12-07 10:21:41,704 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 10:21:41,715 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:21:41,726 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-12-07 10:21:41,727 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 17 states. Second operand 3 states. [2019-12-07 10:21:41,768 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-12-07 10:21:41,768 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-12-07 10:21:41,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-12-07 10:21:41,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 23 transitions. [2019-12-07 10:21:41,772 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 23 transitions. Stem has 2 letters. Loop has 2 letters. [2019-12-07 10:21:41,772 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-12-07 10:21:41,772 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 23 transitions. Stem has 4 letters. Loop has 2 letters. [2019-12-07 10:21:41,773 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-12-07 10:21:41,773 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 23 transitions. Stem has 2 letters. Loop has 4 letters. [2019-12-07 10:21:41,773 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-12-07 10:21:41,774 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 33 states and 47 transitions. [2019-12-07 10:21:41,777 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2019-12-07 10:21:41,780 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 33 states to 14 states and 19 transitions. [2019-12-07 10:21:41,782 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2019-12-07 10:21:41,782 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2019-12-07 10:21:41,782 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 19 transitions. [2019-12-07 10:21:41,782 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-12-07 10:21:41,783 INFO L688 BuchiCegarLoop]: Abstraction has 14 states and 19 transitions. [2019-12-07 10:21:41,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states and 19 transitions. [2019-12-07 10:21:41,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2019-12-07 10:21:41,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-12-07 10:21:41,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 19 transitions. [2019-12-07 10:21:41,801 INFO L711 BuchiCegarLoop]: Abstraction has 14 states and 19 transitions. [2019-12-07 10:21:41,801 INFO L591 BuchiCegarLoop]: Abstraction has 14 states and 19 transitions. [2019-12-07 10:21:41,801 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-12-07 10:21:41,801 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 19 transitions. [2019-12-07 10:21:41,802 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2019-12-07 10:21:41,802 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-12-07 10:21:41,802 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-12-07 10:21:41,802 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2019-12-07 10:21:41,802 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-12-07 10:21:41,802 INFO L794 eck$LassoCheckResult]: Stem: 112#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 108#L-1 havoc main_#res;havoc main_#t~nondet1, main_#t~post0, main_#t~mem3, main_#t~post4, main_#t~post2, main_#t~mem6, main_#t~mem7, main_#t~post8, main_#t~post5, main_~max~0, main_~#str1~0.base, main_~#str1~0.offset, main_~#str2~0.base, main_~#str2~0.offset, main_~i~0, main_~j~0;main_~max~0 := 5;call main_~#str1~0.base, main_~#str1~0.offset := #Ultimate.allocOnStack((if main_~max~0 % 4294967296 % 4294967296 <= 2147483647 then main_~max~0 % 4294967296 % 4294967296 else main_~max~0 % 4294967296 % 4294967296 - 4294967296));call main_~#str2~0.base, main_~#str2~0.offset := #Ultimate.allocOnStack((if main_~max~0 % 4294967296 % 4294967296 <= 2147483647 then main_~max~0 % 4294967296 % 4294967296 else main_~max~0 % 4294967296 % 4294967296 - 4294967296));havoc main_~i~0;havoc main_~j~0;main_~i~0 := 0; 109#L16-3 assume !(main_~i~0 % 4294967296 < main_~max~0 % 4294967296); 113#L16-4 call write~int(0, main_~#str1~0.base, main_~#str1~0.offset + (if (main_~max~0 - 1) % 4294967296 % 4294967296 <= 2147483647 then (main_~max~0 - 1) % 4294967296 % 4294967296 else (main_~max~0 - 1) % 4294967296 % 4294967296 - 4294967296), 1);main_~j~0 := 0;main_~i~0 := (if (main_~max~0 - 1) % 4294967296 % 4294967296 <= 2147483647 then (main_~max~0 - 1) % 4294967296 % 4294967296 else (main_~max~0 - 1) % 4294967296 % 4294967296 - 4294967296); 110#L24-3 [2019-12-07 10:21:41,803 INFO L796 eck$LassoCheckResult]: Loop: 110#L24-3 assume !!(main_~i~0 >= 0);call main_#t~mem3 := read~int(main_~#str1~0.base, main_~#str1~0.offset + main_~i~0, 1);call write~int(main_#t~mem3, main_~#str2~0.base, main_~#str2~0.offset + main_~j~0, 1);havoc main_#t~mem3;main_#t~post4 := main_~j~0;main_~j~0 := 1 + main_#t~post4;havoc main_#t~post4; 111#L24-2 main_#t~post2 := main_~i~0;main_~i~0 := main_#t~post2 - 1;havoc main_#t~post2; 110#L24-3 [2019-12-07 10:21:41,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:21:41,803 INFO L82 PathProgramCache]: Analyzing trace with hash 925707, now seen corresponding path program 1 times [2019-12-07 10:21:41,803 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:21:41,803 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [345444553] [2019-12-07 10:21:41,803 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:21:41,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:21:41,914 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:21:41,915 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [345444553] [2019-12-07 10:21:41,915 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:21:41,916 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 10:21:41,916 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1800265888] [2019-12-07 10:21:41,919 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-12-07 10:21:41,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:21:41,919 INFO L82 PathProgramCache]: Analyzing trace with hash 1731, now seen corresponding path program 1 times [2019-12-07 10:21:41,919 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:21:41,920 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [247326788] [2019-12-07 10:21:41,920 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:21:41,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 10:21:41,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 10:21:41,929 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 10:21:41,972 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:21:41,974 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 10:21:41,975 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 10:21:41,976 INFO L87 Difference]: Start difference. First operand 14 states and 19 transitions. cyclomatic complexity: 8 Second operand 3 states. [2019-12-07 10:21:42,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:21:42,004 INFO L93 Difference]: Finished difference Result 15 states and 17 transitions. [2019-12-07 10:21:42,004 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 10:21:42,005 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 15 states and 17 transitions. [2019-12-07 10:21:42,006 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2019-12-07 10:21:42,007 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 15 states to 14 states and 16 transitions. [2019-12-07 10:21:42,007 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2019-12-07 10:21:42,007 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2019-12-07 10:21:42,007 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 16 transitions. [2019-12-07 10:21:42,007 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-12-07 10:21:42,007 INFO L688 BuchiCegarLoop]: Abstraction has 14 states and 16 transitions. [2019-12-07 10:21:42,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states and 16 transitions. [2019-12-07 10:21:42,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 13. [2019-12-07 10:21:42,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-12-07 10:21:42,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 15 transitions. [2019-12-07 10:21:42,009 INFO L711 BuchiCegarLoop]: Abstraction has 13 states and 15 transitions. [2019-12-07 10:21:42,009 INFO L591 BuchiCegarLoop]: Abstraction has 13 states and 15 transitions. [2019-12-07 10:21:42,010 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-12-07 10:21:42,010 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 15 transitions. [2019-12-07 10:21:42,010 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2019-12-07 10:21:42,010 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-12-07 10:21:42,011 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-12-07 10:21:42,011 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2019-12-07 10:21:42,011 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-12-07 10:21:42,011 INFO L794 eck$LassoCheckResult]: Stem: 142#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 137#L-1 havoc main_#res;havoc main_#t~nondet1, main_#t~post0, main_#t~mem3, main_#t~post4, main_#t~post2, main_#t~mem6, main_#t~mem7, main_#t~post8, main_#t~post5, main_~max~0, main_~#str1~0.base, main_~#str1~0.offset, main_~#str2~0.base, main_~#str2~0.offset, main_~i~0, main_~j~0;main_~max~0 := 5;call main_~#str1~0.base, main_~#str1~0.offset := #Ultimate.allocOnStack((if main_~max~0 % 4294967296 % 4294967296 <= 2147483647 then main_~max~0 % 4294967296 % 4294967296 else main_~max~0 % 4294967296 % 4294967296 - 4294967296));call main_~#str2~0.base, main_~#str2~0.offset := #Ultimate.allocOnStack((if main_~max~0 % 4294967296 % 4294967296 <= 2147483647 then main_~max~0 % 4294967296 % 4294967296 else main_~max~0 % 4294967296 % 4294967296 - 4294967296));havoc main_~i~0;havoc main_~j~0;main_~i~0 := 0; 138#L16-3 assume !!(main_~i~0 % 4294967296 < main_~max~0 % 4294967296);call write~int(main_#t~nondet1, main_~#str1~0.base, main_~#str1~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 148#L16-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 149#L16-3 assume !(main_~i~0 % 4294967296 < main_~max~0 % 4294967296); 146#L16-4 call write~int(0, main_~#str1~0.base, main_~#str1~0.offset + (if (main_~max~0 - 1) % 4294967296 % 4294967296 <= 2147483647 then (main_~max~0 - 1) % 4294967296 % 4294967296 else (main_~max~0 - 1) % 4294967296 % 4294967296 - 4294967296), 1);main_~j~0 := 0;main_~i~0 := (if (main_~max~0 - 1) % 4294967296 % 4294967296 <= 2147483647 then (main_~max~0 - 1) % 4294967296 % 4294967296 else (main_~max~0 - 1) % 4294967296 % 4294967296 - 4294967296); 139#L24-3 [2019-12-07 10:21:42,011 INFO L796 eck$LassoCheckResult]: Loop: 139#L24-3 assume !!(main_~i~0 >= 0);call main_#t~mem3 := read~int(main_~#str1~0.base, main_~#str1~0.offset + main_~i~0, 1);call write~int(main_#t~mem3, main_~#str2~0.base, main_~#str2~0.offset + main_~j~0, 1);havoc main_#t~mem3;main_#t~post4 := main_~j~0;main_~j~0 := 1 + main_#t~post4;havoc main_#t~post4; 141#L24-2 main_#t~post2 := main_~i~0;main_~i~0 := main_#t~post2 - 1;havoc main_#t~post2; 139#L24-3 [2019-12-07 10:21:42,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:21:42,012 INFO L82 PathProgramCache]: Analyzing trace with hash 889660429, now seen corresponding path program 1 times [2019-12-07 10:21:42,012 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:21:42,012 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2034245332] [2019-12-07 10:21:42,012 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:21:42,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:21:42,091 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:21:42,091 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2034245332] [2019-12-07 10:21:42,092 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2084614281] [2019-12-07 10:21:42,092 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e78a2f48-e222-435f-b6ad-f4400dab65d7/bin/uautomizer/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 10:21:42,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:21:42,131 INFO L264 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 15 conjunts are in the unsatisfiable core [2019-12-07 10:21:42,132 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 10:21:42,150 INFO L430 ElimStorePlain]: Different costs {0=[v_prenex_1, |v_#length_28|], 1=[|v_#valid_41|]} [2019-12-07 10:21:42,157 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 10:21:42,158 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:21:42,177 INFO L614 ElimStorePlain]: treesize reduction 5, result has 86.1 percent of original size [2019-12-07 10:21:42,181 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 10:21:42,191 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2019-12-07 10:21:42,191 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 10:21:42,203 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:21:42,209 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-12-07 10:21:42,210 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-07 10:21:42,220 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:21:42,221 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 3 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 10:21:42,222 INFO L239 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:78, output treesize:28 [2019-12-07 10:21:42,267 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:21:42,267 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 10:21:42,267 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2019-12-07 10:21:42,267 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1063341751] [2019-12-07 10:21:42,267 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-12-07 10:21:42,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:21:42,268 INFO L82 PathProgramCache]: Analyzing trace with hash 1731, now seen corresponding path program 2 times [2019-12-07 10:21:42,268 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:21:42,268 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [942353245] [2019-12-07 10:21:42,268 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:21:42,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 10:21:42,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 10:21:42,275 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 10:21:42,311 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:21:42,311 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 10:21:42,311 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-07 10:21:42,311 INFO L87 Difference]: Start difference. First operand 13 states and 15 transitions. cyclomatic complexity: 5 Second operand 6 states. [2019-12-07 10:21:42,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:21:42,379 INFO L93 Difference]: Finished difference Result 16 states and 18 transitions. [2019-12-07 10:21:42,380 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 10:21:42,380 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 16 states and 18 transitions. [2019-12-07 10:21:42,381 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2019-12-07 10:21:42,381 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 16 states to 16 states and 18 transitions. [2019-12-07 10:21:42,381 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2019-12-07 10:21:42,381 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2019-12-07 10:21:42,381 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 18 transitions. [2019-12-07 10:21:42,382 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-12-07 10:21:42,382 INFO L688 BuchiCegarLoop]: Abstraction has 16 states and 18 transitions. [2019-12-07 10:21:42,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states and 18 transitions. [2019-12-07 10:21:42,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 15. [2019-12-07 10:21:42,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-12-07 10:21:42,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 17 transitions. [2019-12-07 10:21:42,383 INFO L711 BuchiCegarLoop]: Abstraction has 15 states and 17 transitions. [2019-12-07 10:21:42,383 INFO L591 BuchiCegarLoop]: Abstraction has 15 states and 17 transitions. [2019-12-07 10:21:42,383 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-12-07 10:21:42,383 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 17 transitions. [2019-12-07 10:21:42,384 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2019-12-07 10:21:42,384 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-12-07 10:21:42,384 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-12-07 10:21:42,384 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1] [2019-12-07 10:21:42,384 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-12-07 10:21:42,384 INFO L794 eck$LassoCheckResult]: Stem: 195#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 190#L-1 havoc main_#res;havoc main_#t~nondet1, main_#t~post0, main_#t~mem3, main_#t~post4, main_#t~post2, main_#t~mem6, main_#t~mem7, main_#t~post8, main_#t~post5, main_~max~0, main_~#str1~0.base, main_~#str1~0.offset, main_~#str2~0.base, main_~#str2~0.offset, main_~i~0, main_~j~0;main_~max~0 := 5;call main_~#str1~0.base, main_~#str1~0.offset := #Ultimate.allocOnStack((if main_~max~0 % 4294967296 % 4294967296 <= 2147483647 then main_~max~0 % 4294967296 % 4294967296 else main_~max~0 % 4294967296 % 4294967296 - 4294967296));call main_~#str2~0.base, main_~#str2~0.offset := #Ultimate.allocOnStack((if main_~max~0 % 4294967296 % 4294967296 <= 2147483647 then main_~max~0 % 4294967296 % 4294967296 else main_~max~0 % 4294967296 % 4294967296 - 4294967296));havoc main_~i~0;havoc main_~j~0;main_~i~0 := 0; 191#L16-3 assume !!(main_~i~0 % 4294967296 < main_~max~0 % 4294967296);call write~int(main_#t~nondet1, main_~#str1~0.base, main_~#str1~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 201#L16-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 202#L16-3 assume !!(main_~i~0 % 4294967296 < main_~max~0 % 4294967296);call write~int(main_#t~nondet1, main_~#str1~0.base, main_~#str1~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 203#L16-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 204#L16-3 assume !(main_~i~0 % 4294967296 < main_~max~0 % 4294967296); 198#L16-4 call write~int(0, main_~#str1~0.base, main_~#str1~0.offset + (if (main_~max~0 - 1) % 4294967296 % 4294967296 <= 2147483647 then (main_~max~0 - 1) % 4294967296 % 4294967296 else (main_~max~0 - 1) % 4294967296 % 4294967296 - 4294967296), 1);main_~j~0 := 0;main_~i~0 := (if (main_~max~0 - 1) % 4294967296 % 4294967296 <= 2147483647 then (main_~max~0 - 1) % 4294967296 % 4294967296 else (main_~max~0 - 1) % 4294967296 % 4294967296 - 4294967296); 192#L24-3 [2019-12-07 10:21:42,384 INFO L796 eck$LassoCheckResult]: Loop: 192#L24-3 assume !!(main_~i~0 >= 0);call main_#t~mem3 := read~int(main_~#str1~0.base, main_~#str1~0.offset + main_~i~0, 1);call write~int(main_#t~mem3, main_~#str2~0.base, main_~#str2~0.offset + main_~j~0, 1);havoc main_#t~mem3;main_#t~post4 := main_~j~0;main_~j~0 := 1 + main_#t~post4;havoc main_#t~post4; 194#L24-2 main_#t~post2 := main_~i~0;main_~i~0 := main_#t~post2 - 1;havoc main_#t~post2; 192#L24-3 [2019-12-07 10:21:42,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:21:42,385 INFO L82 PathProgramCache]: Analyzing trace with hash 265236367, now seen corresponding path program 2 times [2019-12-07 10:21:42,385 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:21:42,385 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [553963594] [2019-12-07 10:21:42,385 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:21:42,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:21:42,460 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:21:42,461 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [553963594] [2019-12-07 10:21:42,461 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2122950575] [2019-12-07 10:21:42,461 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e78a2f48-e222-435f-b6ad-f4400dab65d7/bin/uautomizer/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 10:21:42,487 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-07 10:21:42,487 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 10:21:42,488 INFO L264 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 9 conjunts are in the unsatisfiable core [2019-12-07 10:21:42,488 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 10:21:42,508 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:21:42,508 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 10:21:42,508 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 8 [2019-12-07 10:21:42,508 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1770043105] [2019-12-07 10:21:42,509 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-12-07 10:21:42,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:21:42,509 INFO L82 PathProgramCache]: Analyzing trace with hash 1731, now seen corresponding path program 3 times [2019-12-07 10:21:42,509 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:21:42,509 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [798207784] [2019-12-07 10:21:42,509 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:21:42,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 10:21:42,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 10:21:42,518 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 10:21:42,555 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:21:42,555 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 10:21:42,556 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-07 10:21:42,556 INFO L87 Difference]: Start difference. First operand 15 states and 17 transitions. cyclomatic complexity: 5 Second operand 8 states. [2019-12-07 10:21:42,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:21:42,603 INFO L93 Difference]: Finished difference Result 18 states and 20 transitions. [2019-12-07 10:21:42,603 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 10:21:42,603 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 18 states and 20 transitions. [2019-12-07 10:21:42,604 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2019-12-07 10:21:42,604 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 18 states to 18 states and 20 transitions. [2019-12-07 10:21:42,604 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2019-12-07 10:21:42,604 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2019-12-07 10:21:42,604 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 20 transitions. [2019-12-07 10:21:42,604 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-12-07 10:21:42,604 INFO L688 BuchiCegarLoop]: Abstraction has 18 states and 20 transitions. [2019-12-07 10:21:42,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 20 transitions. [2019-12-07 10:21:42,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 17. [2019-12-07 10:21:42,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-12-07 10:21:42,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 19 transitions. [2019-12-07 10:21:42,606 INFO L711 BuchiCegarLoop]: Abstraction has 17 states and 19 transitions. [2019-12-07 10:21:42,606 INFO L591 BuchiCegarLoop]: Abstraction has 17 states and 19 transitions. [2019-12-07 10:21:42,606 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2019-12-07 10:21:42,606 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 19 transitions. [2019-12-07 10:21:42,606 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2019-12-07 10:21:42,606 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-12-07 10:21:42,606 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-12-07 10:21:42,607 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 1, 1, 1, 1] [2019-12-07 10:21:42,607 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-12-07 10:21:42,607 INFO L794 eck$LassoCheckResult]: Stem: 260#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 255#L-1 havoc main_#res;havoc main_#t~nondet1, main_#t~post0, main_#t~mem3, main_#t~post4, main_#t~post2, main_#t~mem6, main_#t~mem7, main_#t~post8, main_#t~post5, main_~max~0, main_~#str1~0.base, main_~#str1~0.offset, main_~#str2~0.base, main_~#str2~0.offset, main_~i~0, main_~j~0;main_~max~0 := 5;call main_~#str1~0.base, main_~#str1~0.offset := #Ultimate.allocOnStack((if main_~max~0 % 4294967296 % 4294967296 <= 2147483647 then main_~max~0 % 4294967296 % 4294967296 else main_~max~0 % 4294967296 % 4294967296 - 4294967296));call main_~#str2~0.base, main_~#str2~0.offset := #Ultimate.allocOnStack((if main_~max~0 % 4294967296 % 4294967296 <= 2147483647 then main_~max~0 % 4294967296 % 4294967296 else main_~max~0 % 4294967296 % 4294967296 - 4294967296));havoc main_~i~0;havoc main_~j~0;main_~i~0 := 0; 256#L16-3 assume !!(main_~i~0 % 4294967296 < main_~max~0 % 4294967296);call write~int(main_#t~nondet1, main_~#str1~0.base, main_~#str1~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 266#L16-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 267#L16-3 assume !!(main_~i~0 % 4294967296 < main_~max~0 % 4294967296);call write~int(main_#t~nondet1, main_~#str1~0.base, main_~#str1~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 268#L16-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 271#L16-3 assume !!(main_~i~0 % 4294967296 < main_~max~0 % 4294967296);call write~int(main_#t~nondet1, main_~#str1~0.base, main_~#str1~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 270#L16-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 269#L16-3 assume !(main_~i~0 % 4294967296 < main_~max~0 % 4294967296); 263#L16-4 call write~int(0, main_~#str1~0.base, main_~#str1~0.offset + (if (main_~max~0 - 1) % 4294967296 % 4294967296 <= 2147483647 then (main_~max~0 - 1) % 4294967296 % 4294967296 else (main_~max~0 - 1) % 4294967296 % 4294967296 - 4294967296), 1);main_~j~0 := 0;main_~i~0 := (if (main_~max~0 - 1) % 4294967296 % 4294967296 <= 2147483647 then (main_~max~0 - 1) % 4294967296 % 4294967296 else (main_~max~0 - 1) % 4294967296 % 4294967296 - 4294967296); 257#L24-3 [2019-12-07 10:21:42,607 INFO L796 eck$LassoCheckResult]: Loop: 257#L24-3 assume !!(main_~i~0 >= 0);call main_#t~mem3 := read~int(main_~#str1~0.base, main_~#str1~0.offset + main_~i~0, 1);call write~int(main_#t~mem3, main_~#str2~0.base, main_~#str2~0.offset + main_~j~0, 1);havoc main_#t~mem3;main_#t~post4 := main_~j~0;main_~j~0 := 1 + main_#t~post4;havoc main_#t~post4; 259#L24-2 main_#t~post2 := main_~i~0;main_~i~0 := main_#t~post2 - 1;havoc main_#t~post2; 257#L24-3 [2019-12-07 10:21:42,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:21:42,607 INFO L82 PathProgramCache]: Analyzing trace with hash 1489134225, now seen corresponding path program 3 times [2019-12-07 10:21:42,607 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:21:42,607 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1080685245] [2019-12-07 10:21:42,607 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:21:42,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:21:42,939 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:21:42,940 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1080685245] [2019-12-07 10:21:42,940 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1056953532] [2019-12-07 10:21:42,940 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e78a2f48-e222-435f-b6ad-f4400dab65d7/bin/uautomizer/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 10:21:42,971 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-12-07 10:21:42,971 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 10:21:42,972 INFO L264 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 16 conjunts are in the unsatisfiable core [2019-12-07 10:21:42,973 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 10:21:42,980 INFO L430 ElimStorePlain]: Different costs {0=[|v_#length_31|, v_prenex_2], 1=[|v_#valid_44|]} [2019-12-07 10:21:42,983 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 10:21:42,983 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:21:42,997 INFO L614 ElimStorePlain]: treesize reduction 5, result has 86.1 percent of original size [2019-12-07 10:21:42,999 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 10:21:43,000 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2019-12-07 10:21:43,000 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 10:21:43,009 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:21:43,012 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-12-07 10:21:43,012 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-07 10:21:43,019 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:21:43,020 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 3 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 10:21:43,020 INFO L239 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:78, output treesize:28 [2019-12-07 10:21:43,160 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:21:43,160 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 10:21:43,160 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 13 [2019-12-07 10:21:43,160 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2062693129] [2019-12-07 10:21:43,160 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-12-07 10:21:43,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:21:43,161 INFO L82 PathProgramCache]: Analyzing trace with hash 1731, now seen corresponding path program 4 times [2019-12-07 10:21:43,161 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:21:43,161 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1885150265] [2019-12-07 10:21:43,161 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:21:43,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 10:21:43,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 10:21:43,167 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 10:21:43,207 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:21:43,208 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-07 10:21:43,208 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2019-12-07 10:21:43,208 INFO L87 Difference]: Start difference. First operand 17 states and 19 transitions. cyclomatic complexity: 5 Second operand 13 states. [2019-12-07 10:21:43,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:21:43,526 INFO L93 Difference]: Finished difference Result 20 states and 22 transitions. [2019-12-07 10:21:43,527 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 10:21:43,527 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 20 states and 22 transitions. [2019-12-07 10:21:43,528 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2019-12-07 10:21:43,528 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 20 states to 20 states and 22 transitions. [2019-12-07 10:21:43,528 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2019-12-07 10:21:43,528 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2019-12-07 10:21:43,529 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 22 transitions. [2019-12-07 10:21:43,529 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-12-07 10:21:43,529 INFO L688 BuchiCegarLoop]: Abstraction has 20 states and 22 transitions. [2019-12-07 10:21:43,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 22 transitions. [2019-12-07 10:21:43,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 19. [2019-12-07 10:21:43,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-12-07 10:21:43,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 21 transitions. [2019-12-07 10:21:43,530 INFO L711 BuchiCegarLoop]: Abstraction has 19 states and 21 transitions. [2019-12-07 10:21:43,530 INFO L591 BuchiCegarLoop]: Abstraction has 19 states and 21 transitions. [2019-12-07 10:21:43,531 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2019-12-07 10:21:43,531 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 21 transitions. [2019-12-07 10:21:43,531 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2019-12-07 10:21:43,531 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-12-07 10:21:43,531 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-12-07 10:21:43,531 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 1, 1, 1, 1] [2019-12-07 10:21:43,532 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-12-07 10:21:43,532 INFO L794 eck$LassoCheckResult]: Stem: 346#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 341#L-1 havoc main_#res;havoc main_#t~nondet1, main_#t~post0, main_#t~mem3, main_#t~post4, main_#t~post2, main_#t~mem6, main_#t~mem7, main_#t~post8, main_#t~post5, main_~max~0, main_~#str1~0.base, main_~#str1~0.offset, main_~#str2~0.base, main_~#str2~0.offset, main_~i~0, main_~j~0;main_~max~0 := 5;call main_~#str1~0.base, main_~#str1~0.offset := #Ultimate.allocOnStack((if main_~max~0 % 4294967296 % 4294967296 <= 2147483647 then main_~max~0 % 4294967296 % 4294967296 else main_~max~0 % 4294967296 % 4294967296 - 4294967296));call main_~#str2~0.base, main_~#str2~0.offset := #Ultimate.allocOnStack((if main_~max~0 % 4294967296 % 4294967296 <= 2147483647 then main_~max~0 % 4294967296 % 4294967296 else main_~max~0 % 4294967296 % 4294967296 - 4294967296));havoc main_~i~0;havoc main_~j~0;main_~i~0 := 0; 342#L16-3 assume !!(main_~i~0 % 4294967296 < main_~max~0 % 4294967296);call write~int(main_#t~nondet1, main_~#str1~0.base, main_~#str1~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 352#L16-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 353#L16-3 assume !!(main_~i~0 % 4294967296 < main_~max~0 % 4294967296);call write~int(main_#t~nondet1, main_~#str1~0.base, main_~#str1~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 354#L16-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 355#L16-3 assume !!(main_~i~0 % 4294967296 < main_~max~0 % 4294967296);call write~int(main_#t~nondet1, main_~#str1~0.base, main_~#str1~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 359#L16-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 358#L16-3 assume !!(main_~i~0 % 4294967296 < main_~max~0 % 4294967296);call write~int(main_#t~nondet1, main_~#str1~0.base, main_~#str1~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 357#L16-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 356#L16-3 assume !(main_~i~0 % 4294967296 < main_~max~0 % 4294967296); 349#L16-4 call write~int(0, main_~#str1~0.base, main_~#str1~0.offset + (if (main_~max~0 - 1) % 4294967296 % 4294967296 <= 2147483647 then (main_~max~0 - 1) % 4294967296 % 4294967296 else (main_~max~0 - 1) % 4294967296 % 4294967296 - 4294967296), 1);main_~j~0 := 0;main_~i~0 := (if (main_~max~0 - 1) % 4294967296 % 4294967296 <= 2147483647 then (main_~max~0 - 1) % 4294967296 % 4294967296 else (main_~max~0 - 1) % 4294967296 % 4294967296 - 4294967296); 343#L24-3 [2019-12-07 10:21:43,532 INFO L796 eck$LassoCheckResult]: Loop: 343#L24-3 assume !!(main_~i~0 >= 0);call main_#t~mem3 := read~int(main_~#str1~0.base, main_~#str1~0.offset + main_~i~0, 1);call write~int(main_#t~mem3, main_~#str2~0.base, main_~#str2~0.offset + main_~j~0, 1);havoc main_#t~mem3;main_#t~post4 := main_~j~0;main_~j~0 := 1 + main_#t~post4;havoc main_#t~post4; 345#L24-2 main_#t~post2 := main_~i~0;main_~i~0 := main_#t~post2 - 1;havoc main_#t~post2; 343#L24-3 [2019-12-07 10:21:43,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:21:43,532 INFO L82 PathProgramCache]: Analyzing trace with hash 833936659, now seen corresponding path program 4 times [2019-12-07 10:21:43,532 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:21:43,532 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1515440952] [2019-12-07 10:21:43,532 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:21:43,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:21:43,931 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:21:43,932 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1515440952] [2019-12-07 10:21:43,932 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1707021212] [2019-12-07 10:21:43,932 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e78a2f48-e222-435f-b6ad-f4400dab65d7/bin/uautomizer/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 10:21:43,957 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-12-07 10:21:43,957 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 10:21:43,958 INFO L264 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 18 conjunts are in the unsatisfiable core [2019-12-07 10:21:43,959 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 10:21:43,962 INFO L430 ElimStorePlain]: Different costs {0=[|v_#length_33|, v_prenex_3], 1=[|v_#valid_46|]} [2019-12-07 10:21:43,964 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 10:21:43,964 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:21:43,978 INFO L614 ElimStorePlain]: treesize reduction 5, result has 86.1 percent of original size [2019-12-07 10:21:43,981 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 10:21:43,982 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2019-12-07 10:21:43,982 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 10:21:43,990 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:21:43,993 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-12-07 10:21:43,993 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-07 10:21:44,001 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:21:44,002 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 3 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 10:21:44,002 INFO L239 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:78, output treesize:28 [2019-12-07 10:21:44,099 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2019-12-07 10:21:44,100 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:21:44,107 INFO L614 ElimStorePlain]: treesize reduction 7, result has 61.1 percent of original size [2019-12-07 10:21:44,108 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 10:21:44,108 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:7 [2019-12-07 10:21:44,141 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:21:44,141 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 10:21:44,141 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 15 [2019-12-07 10:21:44,141 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [891810063] [2019-12-07 10:21:44,142 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-12-07 10:21:44,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:21:44,142 INFO L82 PathProgramCache]: Analyzing trace with hash 1731, now seen corresponding path program 5 times [2019-12-07 10:21:44,142 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:21:44,142 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1602780234] [2019-12-07 10:21:44,142 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:21:44,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 10:21:44,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 10:21:44,148 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 10:21:44,180 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:21:44,180 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-07 10:21:44,180 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=169, Unknown=0, NotChecked=0, Total=210 [2019-12-07 10:21:44,180 INFO L87 Difference]: Start difference. First operand 19 states and 21 transitions. cyclomatic complexity: 5 Second operand 15 states. [2019-12-07 10:21:44,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:21:44,392 INFO L93 Difference]: Finished difference Result 22 states and 24 transitions. [2019-12-07 10:21:44,392 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 10:21:44,392 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 22 states and 24 transitions. [2019-12-07 10:21:44,393 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2019-12-07 10:21:44,393 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 22 states to 22 states and 24 transitions. [2019-12-07 10:21:44,393 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2019-12-07 10:21:44,393 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2019-12-07 10:21:44,393 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 24 transitions. [2019-12-07 10:21:44,394 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-12-07 10:21:44,394 INFO L688 BuchiCegarLoop]: Abstraction has 22 states and 24 transitions. [2019-12-07 10:21:44,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states and 24 transitions. [2019-12-07 10:21:44,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 21. [2019-12-07 10:21:44,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-12-07 10:21:44,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 23 transitions. [2019-12-07 10:21:44,395 INFO L711 BuchiCegarLoop]: Abstraction has 21 states and 23 transitions. [2019-12-07 10:21:44,395 INFO L591 BuchiCegarLoop]: Abstraction has 21 states and 23 transitions. [2019-12-07 10:21:44,395 INFO L424 BuchiCegarLoop]: ======== Iteration 7============ [2019-12-07 10:21:44,395 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 23 transitions. [2019-12-07 10:21:44,396 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2019-12-07 10:21:44,396 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-12-07 10:21:44,396 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-12-07 10:21:44,396 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 1, 1, 1, 1] [2019-12-07 10:21:44,396 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-12-07 10:21:44,396 INFO L794 eck$LassoCheckResult]: Stem: 440#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 435#L-1 havoc main_#res;havoc main_#t~nondet1, main_#t~post0, main_#t~mem3, main_#t~post4, main_#t~post2, main_#t~mem6, main_#t~mem7, main_#t~post8, main_#t~post5, main_~max~0, main_~#str1~0.base, main_~#str1~0.offset, main_~#str2~0.base, main_~#str2~0.offset, main_~i~0, main_~j~0;main_~max~0 := 5;call main_~#str1~0.base, main_~#str1~0.offset := #Ultimate.allocOnStack((if main_~max~0 % 4294967296 % 4294967296 <= 2147483647 then main_~max~0 % 4294967296 % 4294967296 else main_~max~0 % 4294967296 % 4294967296 - 4294967296));call main_~#str2~0.base, main_~#str2~0.offset := #Ultimate.allocOnStack((if main_~max~0 % 4294967296 % 4294967296 <= 2147483647 then main_~max~0 % 4294967296 % 4294967296 else main_~max~0 % 4294967296 % 4294967296 - 4294967296));havoc main_~i~0;havoc main_~j~0;main_~i~0 := 0; 436#L16-3 assume !!(main_~i~0 % 4294967296 < main_~max~0 % 4294967296);call write~int(main_#t~nondet1, main_~#str1~0.base, main_~#str1~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 446#L16-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 447#L16-3 assume !!(main_~i~0 % 4294967296 < main_~max~0 % 4294967296);call write~int(main_#t~nondet1, main_~#str1~0.base, main_~#str1~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 448#L16-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 449#L16-3 assume !!(main_~i~0 % 4294967296 < main_~max~0 % 4294967296);call write~int(main_#t~nondet1, main_~#str1~0.base, main_~#str1~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 455#L16-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 454#L16-3 assume !!(main_~i~0 % 4294967296 < main_~max~0 % 4294967296);call write~int(main_#t~nondet1, main_~#str1~0.base, main_~#str1~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 453#L16-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 452#L16-3 assume !!(main_~i~0 % 4294967296 < main_~max~0 % 4294967296);call write~int(main_#t~nondet1, main_~#str1~0.base, main_~#str1~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 451#L16-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 450#L16-3 assume !(main_~i~0 % 4294967296 < main_~max~0 % 4294967296); 443#L16-4 call write~int(0, main_~#str1~0.base, main_~#str1~0.offset + (if (main_~max~0 - 1) % 4294967296 % 4294967296 <= 2147483647 then (main_~max~0 - 1) % 4294967296 % 4294967296 else (main_~max~0 - 1) % 4294967296 % 4294967296 - 4294967296), 1);main_~j~0 := 0;main_~i~0 := (if (main_~max~0 - 1) % 4294967296 % 4294967296 <= 2147483647 then (main_~max~0 - 1) % 4294967296 % 4294967296 else (main_~max~0 - 1) % 4294967296 % 4294967296 - 4294967296); 437#L24-3 [2019-12-07 10:21:44,396 INFO L796 eck$LassoCheckResult]: Loop: 437#L24-3 assume !!(main_~i~0 >= 0);call main_#t~mem3 := read~int(main_~#str1~0.base, main_~#str1~0.offset + main_~i~0, 1);call write~int(main_#t~mem3, main_~#str2~0.base, main_~#str2~0.offset + main_~j~0, 1);havoc main_#t~mem3;main_#t~post4 := main_~j~0;main_~j~0 := 1 + main_#t~post4;havoc main_#t~post4; 439#L24-2 main_#t~post2 := main_~i~0;main_~i~0 := main_#t~post2 - 1;havoc main_#t~post2; 437#L24-3 [2019-12-07 10:21:44,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:21:44,396 INFO L82 PathProgramCache]: Analyzing trace with hash -1745699051, now seen corresponding path program 5 times [2019-12-07 10:21:44,396 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:21:44,397 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1668497357] [2019-12-07 10:21:44,397 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:21:44,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 10:21:44,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 10:21:44,423 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 10:21:44,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:21:44,423 INFO L82 PathProgramCache]: Analyzing trace with hash 1731, now seen corresponding path program 6 times [2019-12-07 10:21:44,423 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:21:44,423 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1504550593] [2019-12-07 10:21:44,423 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:21:44,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 10:21:44,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 10:21:44,427 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 10:21:44,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:21:44,428 INFO L82 PathProgramCache]: Analyzing trace with hash 1715425495, now seen corresponding path program 1 times [2019-12-07 10:21:44,428 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:21:44,428 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1169651693] [2019-12-07 10:21:44,428 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:21:44,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 10:21:44,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 10:21:44,456 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 10:21:45,638 WARN L192 SmtUtils]: Spent 1.14 s on a formula simplification. DAG size of input: 151 DAG size of output: 118 [2019-12-07 10:21:46,188 WARN L192 SmtUtils]: Spent 536.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 75 [2019-12-07 10:21:46,190 INFO L210 LassoAnalysis]: Preferences: [2019-12-07 10:21:46,191 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-12-07 10:21:46,191 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-12-07 10:21:46,191 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-12-07 10:21:46,191 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-12-07 10:21:46,191 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 10:21:46,191 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-12-07 10:21:46,191 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-12-07 10:21:46,191 INFO L133 ssoRankerPreferences]: Filename of dumped script: invert_string-3.c_Iteration7_Lasso [2019-12-07 10:21:46,191 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-12-07 10:21:46,191 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-12-07 10:21:46,193 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 10:21:46,194 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 10:21:46,195 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 10:21:46,196 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 10:21:46,197 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 10:21:46,201 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 10:21:46,202 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 10:21:46,265 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 10:21:46,267 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 10:21:46,268 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 10:21:46,269 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 10:21:46,270 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 10:21:46,271 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 10:21:46,403 WARN L192 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 55 [2019-12-07 10:21:46,529 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-12-07 10:21:46,530 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e78a2f48-e222-435f-b6ad-f4400dab65d7/bin/uautomizer/z3 Starting monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 10:21:46,532 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-12-07 10:21:46,533 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 10:21:46,533 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-12-07 10:21:46,533 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 10:21:46,533 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 10:21:46,533 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 10:21:46,534 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-12-07 10:21:46,534 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-12-07 10:21:46,535 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e78a2f48-e222-435f-b6ad-f4400dab65d7/bin/uautomizer/z3 Starting monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 10:21:46,539 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-12-07 10:21:46,540 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 10:21:46,540 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-12-07 10:21:46,540 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 10:21:46,540 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 10:21:46,540 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 10:21:46,540 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-12-07 10:21:46,540 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-12-07 10:21:46,542 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e78a2f48-e222-435f-b6ad-f4400dab65d7/bin/uautomizer/z3 Starting monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 10:21:46,546 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-12-07 10:21:46,547 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 10:21:46,547 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-12-07 10:21:46,547 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 10:21:46,547 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 10:21:46,547 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 10:21:46,548 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-12-07 10:21:46,548 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-12-07 10:21:46,549 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e78a2f48-e222-435f-b6ad-f4400dab65d7/bin/uautomizer/z3 Starting monitored process 22 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 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 10:21:46,553 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-12-07 10:21:46,554 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 10:21:46,554 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-12-07 10:21:46,554 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 10:21:46,554 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 10:21:46,554 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 10:21:46,555 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-12-07 10:21:46,555 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-12-07 10:21:46,556 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e78a2f48-e222-435f-b6ad-f4400dab65d7/bin/uautomizer/z3 Starting monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 10:21:46,560 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-12-07 10:21:46,561 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 10:21:46,561 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 10:21:46,561 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 10:21:46,561 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 10:21:46,562 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-12-07 10:21:46,562 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-12-07 10:21:46,564 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e78a2f48-e222-435f-b6ad-f4400dab65d7/bin/uautomizer/z3 Starting monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 10:21:46,568 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-12-07 10:21:46,570 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 10:21:46,570 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-12-07 10:21:46,570 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 10:21:46,570 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 10:21:46,570 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 10:21:46,570 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-12-07 10:21:46,570 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-12-07 10:21:46,571 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e78a2f48-e222-435f-b6ad-f4400dab65d7/bin/uautomizer/z3 Starting monitored process 25 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 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 10:21:46,575 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-12-07 10:21:46,576 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 10:21:46,576 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 10:21:46,576 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 10:21:46,576 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 10:21:46,578 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-12-07 10:21:46,578 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-12-07 10:21:46,580 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e78a2f48-e222-435f-b6ad-f4400dab65d7/bin/uautomizer/z3 Starting monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 10:21:46,586 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-12-07 10:21:46,587 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 10:21:46,587 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 10:21:46,587 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 10:21:46,587 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 10:21:46,592 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-12-07 10:21:46,592 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-12-07 10:21:46,605 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-12-07 10:21:46,638 INFO L443 ModelExtractionUtils]: Simplification made 16 calls to the SMT solver. [2019-12-07 10:21:46,638 INFO L444 ModelExtractionUtils]: 4 out of 25 variables were initially zero. Simplification set additionally 17 variables to zero. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e78a2f48-e222-435f-b6ad-f4400dab65d7/bin/uautomizer/z3 Starting monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 10:21:46,641 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-12-07 10:21:46,645 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-12-07 10:21:46,645 INFO L510 LassoAnalysis]: Proved termination. [2019-12-07 10:21:46,645 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_~#str2~0.base)_2, ULTIMATE.start_main_~#str2~0.offset, ULTIMATE.start_main_~j~0) = 1*v_rep(select #length ULTIMATE.start_main_~#str2~0.base)_2 - 1*ULTIMATE.start_main_~#str2~0.offset - 1*ULTIMATE.start_main_~j~0 Supporting invariants [] [2019-12-07 10:21:46,655 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2019-12-07 10:21:46,656 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2019-12-07 10:21:46,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:21:46,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:21:46,673 INFO L264 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 2 conjunts are in the unsatisfiable core [2019-12-07 10:21:46,673 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 10:21:46,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:21:46,678 INFO L264 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 4 conjunts are in the unsatisfiable core [2019-12-07 10:21:46,678 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 10:21:46,686 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:21:46,686 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-12-07 10:21:46,686 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 21 states and 23 transitions. cyclomatic complexity: 5 Second operand 3 states. [2019-12-07 10:21:46,693 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 21 states and 23 transitions. cyclomatic complexity: 5. Second operand 3 states. Result 25 states and 29 transitions. Complement of second has 5 states. [2019-12-07 10:21:46,693 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-12-07 10:21:46,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-12-07 10:21:46,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 11 transitions. [2019-12-07 10:21:46,694 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 11 transitions. Stem has 14 letters. Loop has 2 letters. [2019-12-07 10:21:46,694 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-12-07 10:21:46,695 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 11 transitions. Stem has 16 letters. Loop has 2 letters. [2019-12-07 10:21:46,695 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-12-07 10:21:46,695 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 11 transitions. Stem has 14 letters. Loop has 4 letters. [2019-12-07 10:21:46,695 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-12-07 10:21:46,695 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 25 states and 29 transitions. [2019-12-07 10:21:46,696 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-12-07 10:21:46,696 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 25 states to 24 states and 27 transitions. [2019-12-07 10:21:46,696 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2019-12-07 10:21:46,696 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2019-12-07 10:21:46,696 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 27 transitions. [2019-12-07 10:21:46,696 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-12-07 10:21:46,696 INFO L688 BuchiCegarLoop]: Abstraction has 24 states and 27 transitions. [2019-12-07 10:21:46,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states and 27 transitions. [2019-12-07 10:21:46,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 23. [2019-12-07 10:21:46,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-12-07 10:21:46,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 26 transitions. [2019-12-07 10:21:46,698 INFO L711 BuchiCegarLoop]: Abstraction has 23 states and 26 transitions. [2019-12-07 10:21:46,698 INFO L591 BuchiCegarLoop]: Abstraction has 23 states and 26 transitions. [2019-12-07 10:21:46,698 INFO L424 BuchiCegarLoop]: ======== Iteration 8============ [2019-12-07 10:21:46,698 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 26 transitions. [2019-12-07 10:21:46,698 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-12-07 10:21:46,698 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-12-07 10:21:46,698 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-12-07 10:21:46,698 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 1, 1, 1, 1, 1, 1] [2019-12-07 10:21:46,699 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-12-07 10:21:46,699 INFO L794 eck$LassoCheckResult]: Stem: 568#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 562#L-1 havoc main_#res;havoc main_#t~nondet1, main_#t~post0, main_#t~mem3, main_#t~post4, main_#t~post2, main_#t~mem6, main_#t~mem7, main_#t~post8, main_#t~post5, main_~max~0, main_~#str1~0.base, main_~#str1~0.offset, main_~#str2~0.base, main_~#str2~0.offset, main_~i~0, main_~j~0;main_~max~0 := 5;call main_~#str1~0.base, main_~#str1~0.offset := #Ultimate.allocOnStack((if main_~max~0 % 4294967296 % 4294967296 <= 2147483647 then main_~max~0 % 4294967296 % 4294967296 else main_~max~0 % 4294967296 % 4294967296 - 4294967296));call main_~#str2~0.base, main_~#str2~0.offset := #Ultimate.allocOnStack((if main_~max~0 % 4294967296 % 4294967296 <= 2147483647 then main_~max~0 % 4294967296 % 4294967296 else main_~max~0 % 4294967296 % 4294967296 - 4294967296));havoc main_~i~0;havoc main_~j~0;main_~i~0 := 0; 563#L16-3 assume !!(main_~i~0 % 4294967296 < main_~max~0 % 4294967296);call write~int(main_#t~nondet1, main_~#str1~0.base, main_~#str1~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 575#L16-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 576#L16-3 assume !!(main_~i~0 % 4294967296 < main_~max~0 % 4294967296);call write~int(main_#t~nondet1, main_~#str1~0.base, main_~#str1~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 577#L16-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 584#L16-3 assume !!(main_~i~0 % 4294967296 < main_~max~0 % 4294967296);call write~int(main_#t~nondet1, main_~#str1~0.base, main_~#str1~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 583#L16-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 582#L16-3 assume !!(main_~i~0 % 4294967296 < main_~max~0 % 4294967296);call write~int(main_#t~nondet1, main_~#str1~0.base, main_~#str1~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 581#L16-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 580#L16-3 assume !!(main_~i~0 % 4294967296 < main_~max~0 % 4294967296);call write~int(main_#t~nondet1, main_~#str1~0.base, main_~#str1~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 579#L16-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 578#L16-3 assume !(main_~i~0 % 4294967296 < main_~max~0 % 4294967296); 572#L16-4 call write~int(0, main_~#str1~0.base, main_~#str1~0.offset + (if (main_~max~0 - 1) % 4294967296 % 4294967296 <= 2147483647 then (main_~max~0 - 1) % 4294967296 % 4294967296 else (main_~max~0 - 1) % 4294967296 % 4294967296 - 4294967296), 1);main_~j~0 := 0;main_~i~0 := (if (main_~max~0 - 1) % 4294967296 % 4294967296 <= 2147483647 then (main_~max~0 - 1) % 4294967296 % 4294967296 else (main_~max~0 - 1) % 4294967296 % 4294967296 - 4294967296); 573#L24-3 assume !(main_~i~0 >= 0); 565#L24-4 main_~j~0 := (if (main_~max~0 - 1) % 4294967296 % 4294967296 <= 2147483647 then (main_~max~0 - 1) % 4294967296 % 4294967296 else (main_~max~0 - 1) % 4294967296 % 4294967296 - 4294967296);main_~i~0 := 0; 569#L30-3 [2019-12-07 10:21:46,699 INFO L796 eck$LassoCheckResult]: Loop: 569#L30-3 assume !!(main_~i~0 % 4294967296 < main_~max~0 % 4294967296);call main_#t~mem6 := read~int(main_~#str1~0.base, main_~#str1~0.offset + main_~i~0, 1);call main_#t~mem7 := read~int(main_~#str2~0.base, main_~#str2~0.offset + main_~j~0, 1);__VERIFIER_assert_#in~cond := (if main_#t~mem6 == main_#t~mem7 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 570#L4 assume !(0 == __VERIFIER_assert_~cond); 574#L4-2 havoc main_#t~mem7;havoc main_#t~mem6;main_#t~post8 := main_~j~0;main_~j~0 := main_#t~post8 - 1;havoc main_#t~post8; 571#L30-2 main_#t~post5 := main_~i~0;main_~i~0 := 1 + main_#t~post5;havoc main_#t~post5; 569#L30-3 [2019-12-07 10:21:46,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:21:46,699 INFO L82 PathProgramCache]: Analyzing trace with hash 1715425437, now seen corresponding path program 1 times [2019-12-07 10:21:46,699 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:21:46,699 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1273224462] [2019-12-07 10:21:46,699 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:21:46,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:21:46,719 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-12-07 10:21:46,719 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1273224462] [2019-12-07 10:21:46,719 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:21:46,719 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 10:21:46,719 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [310501842] [2019-12-07 10:21:46,720 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-12-07 10:21:46,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:21:46,720 INFO L82 PathProgramCache]: Analyzing trace with hash 2100362, now seen corresponding path program 1 times [2019-12-07 10:21:46,720 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:21:46,720 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1888247198] [2019-12-07 10:21:46,720 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:21:46,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 10:21:46,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 10:21:46,726 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 10:21:46,802 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:21:46,802 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 10:21:46,802 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 10:21:46,802 INFO L87 Difference]: Start difference. First operand 23 states and 26 transitions. cyclomatic complexity: 6 Second operand 4 states. [2019-12-07 10:21:46,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:21:46,818 INFO L93 Difference]: Finished difference Result 23 states and 25 transitions. [2019-12-07 10:21:46,818 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 10:21:46,818 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 23 states and 25 transitions. [2019-12-07 10:21:46,819 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-12-07 10:21:46,819 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 23 states to 23 states and 25 transitions. [2019-12-07 10:21:46,819 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2019-12-07 10:21:46,819 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2019-12-07 10:21:46,819 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 25 transitions. [2019-12-07 10:21:46,819 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-12-07 10:21:46,819 INFO L688 BuchiCegarLoop]: Abstraction has 23 states and 25 transitions. [2019-12-07 10:21:46,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states and 25 transitions. [2019-12-07 10:21:46,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2019-12-07 10:21:46,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-12-07 10:21:46,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 25 transitions. [2019-12-07 10:21:46,821 INFO L711 BuchiCegarLoop]: Abstraction has 23 states and 25 transitions. [2019-12-07 10:21:46,821 INFO L591 BuchiCegarLoop]: Abstraction has 23 states and 25 transitions. [2019-12-07 10:21:46,821 INFO L424 BuchiCegarLoop]: ======== Iteration 9============ [2019-12-07 10:21:46,821 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 25 transitions. [2019-12-07 10:21:46,822 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-12-07 10:21:46,822 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-12-07 10:21:46,822 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-12-07 10:21:46,822 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:21:46,822 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-12-07 10:21:46,823 INFO L794 eck$LassoCheckResult]: Stem: 622#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 617#L-1 havoc main_#res;havoc main_#t~nondet1, main_#t~post0, main_#t~mem3, main_#t~post4, main_#t~post2, main_#t~mem6, main_#t~mem7, main_#t~post8, main_#t~post5, main_~max~0, main_~#str1~0.base, main_~#str1~0.offset, main_~#str2~0.base, main_~#str2~0.offset, main_~i~0, main_~j~0;main_~max~0 := 5;call main_~#str1~0.base, main_~#str1~0.offset := #Ultimate.allocOnStack((if main_~max~0 % 4294967296 % 4294967296 <= 2147483647 then main_~max~0 % 4294967296 % 4294967296 else main_~max~0 % 4294967296 % 4294967296 - 4294967296));call main_~#str2~0.base, main_~#str2~0.offset := #Ultimate.allocOnStack((if main_~max~0 % 4294967296 % 4294967296 <= 2147483647 then main_~max~0 % 4294967296 % 4294967296 else main_~max~0 % 4294967296 % 4294967296 - 4294967296));havoc main_~i~0;havoc main_~j~0;main_~i~0 := 0; 618#L16-3 assume !!(main_~i~0 % 4294967296 < main_~max~0 % 4294967296);call write~int(main_#t~nondet1, main_~#str1~0.base, main_~#str1~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 629#L16-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 630#L16-3 assume !!(main_~i~0 % 4294967296 < main_~max~0 % 4294967296);call write~int(main_#t~nondet1, main_~#str1~0.base, main_~#str1~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 631#L16-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 639#L16-3 assume !!(main_~i~0 % 4294967296 < main_~max~0 % 4294967296);call write~int(main_#t~nondet1, main_~#str1~0.base, main_~#str1~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 638#L16-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 637#L16-3 assume !!(main_~i~0 % 4294967296 < main_~max~0 % 4294967296);call write~int(main_#t~nondet1, main_~#str1~0.base, main_~#str1~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 636#L16-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 635#L16-3 assume !!(main_~i~0 % 4294967296 < main_~max~0 % 4294967296);call write~int(main_#t~nondet1, main_~#str1~0.base, main_~#str1~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 634#L16-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 633#L16-3 assume !(main_~i~0 % 4294967296 < main_~max~0 % 4294967296); 627#L16-4 call write~int(0, main_~#str1~0.base, main_~#str1~0.offset + (if (main_~max~0 - 1) % 4294967296 % 4294967296 <= 2147483647 then (main_~max~0 - 1) % 4294967296 % 4294967296 else (main_~max~0 - 1) % 4294967296 % 4294967296 - 4294967296), 1);main_~j~0 := 0;main_~i~0 := (if (main_~max~0 - 1) % 4294967296 % 4294967296 <= 2147483647 then (main_~max~0 - 1) % 4294967296 % 4294967296 else (main_~max~0 - 1) % 4294967296 % 4294967296 - 4294967296); 619#L24-3 assume !!(main_~i~0 >= 0);call main_#t~mem3 := read~int(main_~#str1~0.base, main_~#str1~0.offset + main_~i~0, 1);call write~int(main_#t~mem3, main_~#str2~0.base, main_~#str2~0.offset + main_~j~0, 1);havoc main_#t~mem3;main_#t~post4 := main_~j~0;main_~j~0 := 1 + main_#t~post4;havoc main_#t~post4; 620#L24-2 main_#t~post2 := main_~i~0;main_~i~0 := main_#t~post2 - 1;havoc main_#t~post2; 625#L24-3 assume !(main_~i~0 >= 0); 632#L24-4 main_~j~0 := (if (main_~max~0 - 1) % 4294967296 % 4294967296 <= 2147483647 then (main_~max~0 - 1) % 4294967296 % 4294967296 else (main_~max~0 - 1) % 4294967296 % 4294967296 - 4294967296);main_~i~0 := 0; 623#L30-3 [2019-12-07 10:21:46,823 INFO L796 eck$LassoCheckResult]: Loop: 623#L30-3 assume !!(main_~i~0 % 4294967296 < main_~max~0 % 4294967296);call main_#t~mem6 := read~int(main_~#str1~0.base, main_~#str1~0.offset + main_~i~0, 1);call main_#t~mem7 := read~int(main_~#str2~0.base, main_~#str2~0.offset + main_~j~0, 1);__VERIFIER_assert_#in~cond := (if main_#t~mem6 == main_#t~mem7 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 624#L4 assume !(0 == __VERIFIER_assert_~cond); 628#L4-2 havoc main_#t~mem7;havoc main_#t~mem6;main_#t~post8 := main_~j~0;main_~j~0 := main_#t~post8 - 1;havoc main_#t~post8; 626#L30-2 main_#t~post5 := main_~i~0;main_~i~0 := 1 + main_#t~post5;havoc main_#t~post5; 623#L30-3 [2019-12-07 10:21:46,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:21:46,823 INFO L82 PathProgramCache]: Analyzing trace with hash -743540257, now seen corresponding path program 1 times [2019-12-07 10:21:46,823 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:21:46,823 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1536773979] [2019-12-07 10:21:46,823 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:21:46,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:21:46,898 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-12-07 10:21:46,899 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1536773979] [2019-12-07 10:21:46,899 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [105096433] [2019-12-07 10:21:46,899 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e78a2f48-e222-435f-b6ad-f4400dab65d7/bin/uautomizer/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 10:21:46,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:21:46,931 INFO L264 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 10 conjunts are in the unsatisfiable core [2019-12-07 10:21:46,932 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 10:21:46,951 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-12-07 10:21:46,951 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 10:21:46,951 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2019-12-07 10:21:46,952 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1665500460] [2019-12-07 10:21:46,952 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-12-07 10:21:46,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:21:46,952 INFO L82 PathProgramCache]: Analyzing trace with hash 2100362, now seen corresponding path program 2 times [2019-12-07 10:21:46,952 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:21:46,952 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [373263139] [2019-12-07 10:21:46,952 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:21:46,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 10:21:46,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 10:21:46,958 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 10:21:47,045 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:21:47,046 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 10:21:47,046 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-12-07 10:21:47,046 INFO L87 Difference]: Start difference. First operand 23 states and 25 transitions. cyclomatic complexity: 5 Second operand 8 states. [2019-12-07 10:21:47,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:21:47,109 INFO L93 Difference]: Finished difference Result 27 states and 30 transitions. [2019-12-07 10:21:47,110 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 10:21:47,110 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 27 states and 30 transitions. [2019-12-07 10:21:47,110 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-12-07 10:21:47,111 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 27 states to 26 states and 29 transitions. [2019-12-07 10:21:47,111 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2019-12-07 10:21:47,111 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2019-12-07 10:21:47,111 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 29 transitions. [2019-12-07 10:21:47,111 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-12-07 10:21:47,111 INFO L688 BuchiCegarLoop]: Abstraction has 26 states and 29 transitions. [2019-12-07 10:21:47,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states and 29 transitions. [2019-12-07 10:21:47,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 24. [2019-12-07 10:21:47,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-12-07 10:21:47,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 26 transitions. [2019-12-07 10:21:47,113 INFO L711 BuchiCegarLoop]: Abstraction has 24 states and 26 transitions. [2019-12-07 10:21:47,113 INFO L591 BuchiCegarLoop]: Abstraction has 24 states and 26 transitions. [2019-12-07 10:21:47,113 INFO L424 BuchiCegarLoop]: ======== Iteration 10============ [2019-12-07 10:21:47,113 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 26 transitions. [2019-12-07 10:21:47,114 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-12-07 10:21:47,114 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-12-07 10:21:47,114 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-12-07 10:21:47,114 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 2, 2, 1, 1, 1, 1, 1, 1] [2019-12-07 10:21:47,114 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-12-07 10:21:47,115 INFO L794 eck$LassoCheckResult]: Stem: 739#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 733#L-1 havoc main_#res;havoc main_#t~nondet1, main_#t~post0, main_#t~mem3, main_#t~post4, main_#t~post2, main_#t~mem6, main_#t~mem7, main_#t~post8, main_#t~post5, main_~max~0, main_~#str1~0.base, main_~#str1~0.offset, main_~#str2~0.base, main_~#str2~0.offset, main_~i~0, main_~j~0;main_~max~0 := 5;call main_~#str1~0.base, main_~#str1~0.offset := #Ultimate.allocOnStack((if main_~max~0 % 4294967296 % 4294967296 <= 2147483647 then main_~max~0 % 4294967296 % 4294967296 else main_~max~0 % 4294967296 % 4294967296 - 4294967296));call main_~#str2~0.base, main_~#str2~0.offset := #Ultimate.allocOnStack((if main_~max~0 % 4294967296 % 4294967296 <= 2147483647 then main_~max~0 % 4294967296 % 4294967296 else main_~max~0 % 4294967296 % 4294967296 - 4294967296));havoc main_~i~0;havoc main_~j~0;main_~i~0 := 0; 734#L16-3 assume !!(main_~i~0 % 4294967296 < main_~max~0 % 4294967296);call write~int(main_#t~nondet1, main_~#str1~0.base, main_~#str1~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 745#L16-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 746#L16-3 assume !!(main_~i~0 % 4294967296 < main_~max~0 % 4294967296);call write~int(main_#t~nondet1, main_~#str1~0.base, main_~#str1~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 747#L16-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 748#L16-3 assume !!(main_~i~0 % 4294967296 < main_~max~0 % 4294967296);call write~int(main_#t~nondet1, main_~#str1~0.base, main_~#str1~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 756#L16-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 755#L16-3 assume !!(main_~i~0 % 4294967296 < main_~max~0 % 4294967296);call write~int(main_#t~nondet1, main_~#str1~0.base, main_~#str1~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 754#L16-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 753#L16-3 assume !!(main_~i~0 % 4294967296 < main_~max~0 % 4294967296);call write~int(main_#t~nondet1, main_~#str1~0.base, main_~#str1~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 751#L16-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 750#L16-3 assume !(main_~i~0 % 4294967296 < main_~max~0 % 4294967296); 742#L16-4 call write~int(0, main_~#str1~0.base, main_~#str1~0.offset + (if (main_~max~0 - 1) % 4294967296 % 4294967296 <= 2147483647 then (main_~max~0 - 1) % 4294967296 % 4294967296 else (main_~max~0 - 1) % 4294967296 % 4294967296 - 4294967296), 1);main_~j~0 := 0;main_~i~0 := (if (main_~max~0 - 1) % 4294967296 % 4294967296 <= 2147483647 then (main_~max~0 - 1) % 4294967296 % 4294967296 else (main_~max~0 - 1) % 4294967296 % 4294967296 - 4294967296); 735#L24-3 assume !!(main_~i~0 >= 0);call main_#t~mem3 := read~int(main_~#str1~0.base, main_~#str1~0.offset + main_~i~0, 1);call write~int(main_#t~mem3, main_~#str2~0.base, main_~#str2~0.offset + main_~j~0, 1);havoc main_#t~mem3;main_#t~post4 := main_~j~0;main_~j~0 := 1 + main_#t~post4;havoc main_#t~post4; 736#L24-2 main_#t~post2 := main_~i~0;main_~i~0 := main_#t~post2 - 1;havoc main_#t~post2; 737#L24-3 assume !!(main_~i~0 >= 0);call main_#t~mem3 := read~int(main_~#str1~0.base, main_~#str1~0.offset + main_~i~0, 1);call write~int(main_#t~mem3, main_~#str2~0.base, main_~#str2~0.offset + main_~j~0, 1);havoc main_#t~mem3;main_#t~post4 := main_~j~0;main_~j~0 := 1 + main_#t~post4;havoc main_#t~post4; 738#L24-2 main_#t~post2 := main_~i~0;main_~i~0 := main_#t~post2 - 1;havoc main_#t~post2; 752#L24-3 assume !(main_~i~0 >= 0); 749#L24-4 main_~j~0 := (if (main_~max~0 - 1) % 4294967296 % 4294967296 <= 2147483647 then (main_~max~0 - 1) % 4294967296 % 4294967296 else (main_~max~0 - 1) % 4294967296 % 4294967296 - 4294967296);main_~i~0 := 0; 740#L30-3 [2019-12-07 10:21:47,115 INFO L796 eck$LassoCheckResult]: Loop: 740#L30-3 assume !!(main_~i~0 % 4294967296 < main_~max~0 % 4294967296);call main_#t~mem6 := read~int(main_~#str1~0.base, main_~#str1~0.offset + main_~i~0, 1);call main_#t~mem7 := read~int(main_~#str2~0.base, main_~#str2~0.offset + main_~j~0, 1);__VERIFIER_assert_#in~cond := (if main_#t~mem6 == main_#t~mem7 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 741#L4 assume !(0 == __VERIFIER_assert_~cond); 744#L4-2 havoc main_#t~mem7;havoc main_#t~mem6;main_#t~post8 := main_~j~0;main_~j~0 := main_#t~post8 - 1;havoc main_#t~post8; 743#L30-2 main_#t~post5 := main_~i~0;main_~i~0 := 1 + main_#t~post5;havoc main_#t~post5; 740#L30-3 [2019-12-07 10:21:47,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:21:47,115 INFO L82 PathProgramCache]: Analyzing trace with hash -1577559391, now seen corresponding path program 2 times [2019-12-07 10:21:47,115 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:21:47,115 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1412905782] [2019-12-07 10:21:47,115 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:21:47,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:21:47,233 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-12-07 10:21:47,234 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1412905782] [2019-12-07 10:21:47,234 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1389412523] [2019-12-07 10:21:47,234 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e78a2f48-e222-435f-b6ad-f4400dab65d7/bin/uautomizer/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 10:21:47,265 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-07 10:21:47,266 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 10:21:47,266 INFO L264 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 13 conjunts are in the unsatisfiable core [2019-12-07 10:21:47,267 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 10:21:47,307 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-12-07 10:21:47,307 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 10:21:47,307 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 11 [2019-12-07 10:21:47,307 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1604797594] [2019-12-07 10:21:47,308 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-12-07 10:21:47,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:21:47,308 INFO L82 PathProgramCache]: Analyzing trace with hash 2100362, now seen corresponding path program 3 times [2019-12-07 10:21:47,308 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:21:47,308 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [84852204] [2019-12-07 10:21:47,308 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:21:47,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 10:21:47,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 10:21:47,313 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 10:21:47,395 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:21:47,396 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-07 10:21:47,396 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2019-12-07 10:21:47,396 INFO L87 Difference]: Start difference. First operand 24 states and 26 transitions. cyclomatic complexity: 5 Second operand 11 states. [2019-12-07 10:21:47,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:21:47,503 INFO L93 Difference]: Finished difference Result 29 states and 32 transitions. [2019-12-07 10:21:47,503 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 10:21:47,503 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 29 states and 32 transitions. [2019-12-07 10:21:47,503 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-12-07 10:21:47,504 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 29 states to 28 states and 31 transitions. [2019-12-07 10:21:47,504 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2019-12-07 10:21:47,504 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2019-12-07 10:21:47,504 INFO L73 IsDeterministic]: Start isDeterministic. Operand 28 states and 31 transitions. [2019-12-07 10:21:47,504 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-12-07 10:21:47,504 INFO L688 BuchiCegarLoop]: Abstraction has 28 states and 31 transitions. [2019-12-07 10:21:47,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states and 31 transitions. [2019-12-07 10:21:47,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 26. [2019-12-07 10:21:47,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-12-07 10:21:47,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 28 transitions. [2019-12-07 10:21:47,506 INFO L711 BuchiCegarLoop]: Abstraction has 26 states and 28 transitions. [2019-12-07 10:21:47,506 INFO L591 BuchiCegarLoop]: Abstraction has 26 states and 28 transitions. [2019-12-07 10:21:47,506 INFO L424 BuchiCegarLoop]: ======== Iteration 11============ [2019-12-07 10:21:47,506 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 26 states and 28 transitions. [2019-12-07 10:21:47,506 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-12-07 10:21:47,506 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-12-07 10:21:47,507 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-12-07 10:21:47,507 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 3, 3, 1, 1, 1, 1, 1, 1] [2019-12-07 10:21:47,507 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-12-07 10:21:47,507 INFO L794 eck$LassoCheckResult]: Stem: 871#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 865#L-1 havoc main_#res;havoc main_#t~nondet1, main_#t~post0, main_#t~mem3, main_#t~post4, main_#t~post2, main_#t~mem6, main_#t~mem7, main_#t~post8, main_#t~post5, main_~max~0, main_~#str1~0.base, main_~#str1~0.offset, main_~#str2~0.base, main_~#str2~0.offset, main_~i~0, main_~j~0;main_~max~0 := 5;call main_~#str1~0.base, main_~#str1~0.offset := #Ultimate.allocOnStack((if main_~max~0 % 4294967296 % 4294967296 <= 2147483647 then main_~max~0 % 4294967296 % 4294967296 else main_~max~0 % 4294967296 % 4294967296 - 4294967296));call main_~#str2~0.base, main_~#str2~0.offset := #Ultimate.allocOnStack((if main_~max~0 % 4294967296 % 4294967296 <= 2147483647 then main_~max~0 % 4294967296 % 4294967296 else main_~max~0 % 4294967296 % 4294967296 - 4294967296));havoc main_~i~0;havoc main_~j~0;main_~i~0 := 0; 866#L16-3 assume !!(main_~i~0 % 4294967296 < main_~max~0 % 4294967296);call write~int(main_#t~nondet1, main_~#str1~0.base, main_~#str1~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 878#L16-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 879#L16-3 assume !!(main_~i~0 % 4294967296 < main_~max~0 % 4294967296);call write~int(main_#t~nondet1, main_~#str1~0.base, main_~#str1~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 880#L16-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 890#L16-3 assume !!(main_~i~0 % 4294967296 < main_~max~0 % 4294967296);call write~int(main_#t~nondet1, main_~#str1~0.base, main_~#str1~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 889#L16-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 888#L16-3 assume !!(main_~i~0 % 4294967296 < main_~max~0 % 4294967296);call write~int(main_#t~nondet1, main_~#str1~0.base, main_~#str1~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 887#L16-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 886#L16-3 assume !!(main_~i~0 % 4294967296 < main_~max~0 % 4294967296);call write~int(main_#t~nondet1, main_~#str1~0.base, main_~#str1~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 883#L16-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 882#L16-3 assume !(main_~i~0 % 4294967296 < main_~max~0 % 4294967296); 875#L16-4 call write~int(0, main_~#str1~0.base, main_~#str1~0.offset + (if (main_~max~0 - 1) % 4294967296 % 4294967296 <= 2147483647 then (main_~max~0 - 1) % 4294967296 % 4294967296 else (main_~max~0 - 1) % 4294967296 % 4294967296 - 4294967296), 1);main_~j~0 := 0;main_~i~0 := (if (main_~max~0 - 1) % 4294967296 % 4294967296 <= 2147483647 then (main_~max~0 - 1) % 4294967296 % 4294967296 else (main_~max~0 - 1) % 4294967296 % 4294967296 - 4294967296); 867#L24-3 assume !!(main_~i~0 >= 0);call main_#t~mem3 := read~int(main_~#str1~0.base, main_~#str1~0.offset + main_~i~0, 1);call write~int(main_#t~mem3, main_~#str2~0.base, main_~#str2~0.offset + main_~j~0, 1);havoc main_#t~mem3;main_#t~post4 := main_~j~0;main_~j~0 := 1 + main_#t~post4;havoc main_#t~post4; 868#L24-2 main_#t~post2 := main_~i~0;main_~i~0 := main_#t~post2 - 1;havoc main_#t~post2; 869#L24-3 assume !!(main_~i~0 >= 0);call main_#t~mem3 := read~int(main_~#str1~0.base, main_~#str1~0.offset + main_~i~0, 1);call write~int(main_#t~mem3, main_~#str2~0.base, main_~#str2~0.offset + main_~j~0, 1);havoc main_#t~mem3;main_#t~post4 := main_~j~0;main_~j~0 := 1 + main_#t~post4;havoc main_#t~post4; 870#L24-2 main_#t~post2 := main_~i~0;main_~i~0 := main_#t~post2 - 1;havoc main_#t~post2; 874#L24-3 assume !!(main_~i~0 >= 0);call main_#t~mem3 := read~int(main_~#str1~0.base, main_~#str1~0.offset + main_~i~0, 1);call write~int(main_#t~mem3, main_~#str2~0.base, main_~#str2~0.offset + main_~j~0, 1);havoc main_#t~mem3;main_#t~post4 := main_~j~0;main_~j~0 := 1 + main_#t~post4;havoc main_#t~post4; 885#L24-2 main_#t~post2 := main_~i~0;main_~i~0 := main_#t~post2 - 1;havoc main_#t~post2; 884#L24-3 assume !(main_~i~0 >= 0); 881#L24-4 main_~j~0 := (if (main_~max~0 - 1) % 4294967296 % 4294967296 <= 2147483647 then (main_~max~0 - 1) % 4294967296 % 4294967296 else (main_~max~0 - 1) % 4294967296 % 4294967296 - 4294967296);main_~i~0 := 0; 872#L30-3 [2019-12-07 10:21:47,507 INFO L796 eck$LassoCheckResult]: Loop: 872#L30-3 assume !!(main_~i~0 % 4294967296 < main_~max~0 % 4294967296);call main_#t~mem6 := read~int(main_~#str1~0.base, main_~#str1~0.offset + main_~i~0, 1);call main_#t~mem7 := read~int(main_~#str2~0.base, main_~#str2~0.offset + main_~j~0, 1);__VERIFIER_assert_#in~cond := (if main_#t~mem6 == main_#t~mem7 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 873#L4 assume !(0 == __VERIFIER_assert_~cond); 877#L4-2 havoc main_#t~mem7;havoc main_#t~mem6;main_#t~post8 := main_~j~0;main_~j~0 := main_#t~post8 - 1;havoc main_#t~post8; 876#L30-2 main_#t~post5 := main_~i~0;main_~i~0 := 1 + main_#t~post5;havoc main_#t~post5; 872#L30-3 [2019-12-07 10:21:47,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:21:47,507 INFO L82 PathProgramCache]: Analyzing trace with hash 88937187, now seen corresponding path program 3 times [2019-12-07 10:21:47,508 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:21:47,508 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [533994197] [2019-12-07 10:21:47,508 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:21:47,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:21:47,640 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-12-07 10:21:47,640 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [533994197] [2019-12-07 10:21:47,640 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [10430763] [2019-12-07 10:21:47,640 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e78a2f48-e222-435f-b6ad-f4400dab65d7/bin/uautomizer/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 10:21:47,682 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-12-07 10:21:47,682 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 10:21:47,683 INFO L264 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 19 conjunts are in the unsatisfiable core [2019-12-07 10:21:47,684 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 10:21:47,688 INFO L430 ElimStorePlain]: Different costs {0=[v_prenex_4, |v_#length_57|], 1=[|v_#valid_78|]} [2019-12-07 10:21:47,691 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 10:21:47,691 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:21:47,703 INFO L614 ElimStorePlain]: treesize reduction 5, result has 84.8 percent of original size [2019-12-07 10:21:47,705 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 10:21:47,706 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2019-12-07 10:21:47,706 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 10:21:47,714 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:21:47,717 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-12-07 10:21:47,717 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-07 10:21:47,723 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:21:47,724 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 3 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 10:21:47,724 INFO L239 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:72, output treesize:25 [2019-12-07 10:21:47,855 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 9 proven. 9 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-12-07 10:21:47,856 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 10:21:47,856 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 15 [2019-12-07 10:21:47,856 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [580145349] [2019-12-07 10:21:47,856 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-12-07 10:21:47,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:21:47,856 INFO L82 PathProgramCache]: Analyzing trace with hash 2100362, now seen corresponding path program 4 times [2019-12-07 10:21:47,856 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:21:47,856 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1086676866] [2019-12-07 10:21:47,857 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:21:47,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 10:21:47,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 10:21:47,863 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 10:21:47,948 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:21:47,948 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-07 10:21:47,948 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=165, Unknown=0, NotChecked=0, Total=210 [2019-12-07 10:21:47,948 INFO L87 Difference]: Start difference. First operand 26 states and 28 transitions. cyclomatic complexity: 5 Second operand 15 states. [2019-12-07 10:21:48,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:21:48,397 INFO L93 Difference]: Finished difference Result 49 states and 51 transitions. [2019-12-07 10:21:48,397 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-07 10:21:48,398 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 49 states and 51 transitions. [2019-12-07 10:21:48,398 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-12-07 10:21:48,399 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 49 states to 47 states and 49 transitions. [2019-12-07 10:21:48,399 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 27 [2019-12-07 10:21:48,399 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 27 [2019-12-07 10:21:48,399 INFO L73 IsDeterministic]: Start isDeterministic. Operand 47 states and 49 transitions. [2019-12-07 10:21:48,399 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-12-07 10:21:48,399 INFO L688 BuchiCegarLoop]: Abstraction has 47 states and 49 transitions. [2019-12-07 10:21:48,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states and 49 transitions. [2019-12-07 10:21:48,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 30. [2019-12-07 10:21:48,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-12-07 10:21:48,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 32 transitions. [2019-12-07 10:21:48,402 INFO L711 BuchiCegarLoop]: Abstraction has 30 states and 32 transitions. [2019-12-07 10:21:48,402 INFO L591 BuchiCegarLoop]: Abstraction has 30 states and 32 transitions. [2019-12-07 10:21:48,402 INFO L424 BuchiCegarLoop]: ======== Iteration 12============ [2019-12-07 10:21:48,402 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 30 states and 32 transitions. [2019-12-07 10:21:48,402 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-12-07 10:21:48,403 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-12-07 10:21:48,403 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-12-07 10:21:48,403 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 5, 5, 1, 1, 1, 1, 1, 1] [2019-12-07 10:21:48,403 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-12-07 10:21:48,404 INFO L794 eck$LassoCheckResult]: Stem: 1043#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 1037#L-1 havoc main_#res;havoc main_#t~nondet1, main_#t~post0, main_#t~mem3, main_#t~post4, main_#t~post2, main_#t~mem6, main_#t~mem7, main_#t~post8, main_#t~post5, main_~max~0, main_~#str1~0.base, main_~#str1~0.offset, main_~#str2~0.base, main_~#str2~0.offset, main_~i~0, main_~j~0;main_~max~0 := 5;call main_~#str1~0.base, main_~#str1~0.offset := #Ultimate.allocOnStack((if main_~max~0 % 4294967296 % 4294967296 <= 2147483647 then main_~max~0 % 4294967296 % 4294967296 else main_~max~0 % 4294967296 % 4294967296 - 4294967296));call main_~#str2~0.base, main_~#str2~0.offset := #Ultimate.allocOnStack((if main_~max~0 % 4294967296 % 4294967296 <= 2147483647 then main_~max~0 % 4294967296 % 4294967296 else main_~max~0 % 4294967296 % 4294967296 - 4294967296));havoc main_~i~0;havoc main_~j~0;main_~i~0 := 0; 1038#L16-3 assume !!(main_~i~0 % 4294967296 < main_~max~0 % 4294967296);call write~int(main_#t~nondet1, main_~#str1~0.base, main_~#str1~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 1049#L16-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 1050#L16-3 assume !!(main_~i~0 % 4294967296 < main_~max~0 % 4294967296);call write~int(main_#t~nondet1, main_~#str1~0.base, main_~#str1~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 1051#L16-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 1062#L16-3 assume !!(main_~i~0 % 4294967296 < main_~max~0 % 4294967296);call write~int(main_#t~nondet1, main_~#str1~0.base, main_~#str1~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 1061#L16-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 1060#L16-3 assume !!(main_~i~0 % 4294967296 < main_~max~0 % 4294967296);call write~int(main_#t~nondet1, main_~#str1~0.base, main_~#str1~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 1059#L16-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 1058#L16-3 assume !!(main_~i~0 % 4294967296 < main_~max~0 % 4294967296);call write~int(main_#t~nondet1, main_~#str1~0.base, main_~#str1~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 1054#L16-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 1053#L16-3 assume !(main_~i~0 % 4294967296 < main_~max~0 % 4294967296); 1047#L16-4 call write~int(0, main_~#str1~0.base, main_~#str1~0.offset + (if (main_~max~0 - 1) % 4294967296 % 4294967296 <= 2147483647 then (main_~max~0 - 1) % 4294967296 % 4294967296 else (main_~max~0 - 1) % 4294967296 % 4294967296 - 4294967296), 1);main_~j~0 := 0;main_~i~0 := (if (main_~max~0 - 1) % 4294967296 % 4294967296 <= 2147483647 then (main_~max~0 - 1) % 4294967296 % 4294967296 else (main_~max~0 - 1) % 4294967296 % 4294967296 - 4294967296); 1039#L24-3 assume !!(main_~i~0 >= 0);call main_#t~mem3 := read~int(main_~#str1~0.base, main_~#str1~0.offset + main_~i~0, 1);call write~int(main_#t~mem3, main_~#str2~0.base, main_~#str2~0.offset + main_~j~0, 1);havoc main_#t~mem3;main_#t~post4 := main_~j~0;main_~j~0 := 1 + main_#t~post4;havoc main_#t~post4; 1040#L24-2 main_#t~post2 := main_~i~0;main_~i~0 := main_#t~post2 - 1;havoc main_#t~post2; 1041#L24-3 assume !!(main_~i~0 >= 0);call main_#t~mem3 := read~int(main_~#str1~0.base, main_~#str1~0.offset + main_~i~0, 1);call write~int(main_#t~mem3, main_~#str2~0.base, main_~#str2~0.offset + main_~j~0, 1);havoc main_#t~mem3;main_#t~post4 := main_~j~0;main_~j~0 := 1 + main_#t~post4;havoc main_#t~post4; 1042#L24-2 main_#t~post2 := main_~i~0;main_~i~0 := main_#t~post2 - 1;havoc main_#t~post2; 1066#L24-3 assume !!(main_~i~0 >= 0);call main_#t~mem3 := read~int(main_~#str1~0.base, main_~#str1~0.offset + main_~i~0, 1);call write~int(main_#t~mem3, main_~#str2~0.base, main_~#str2~0.offset + main_~j~0, 1);havoc main_#t~mem3;main_#t~post4 := main_~j~0;main_~j~0 := 1 + main_#t~post4;havoc main_#t~post4; 1065#L24-2 main_#t~post2 := main_~i~0;main_~i~0 := main_#t~post2 - 1;havoc main_#t~post2; 1064#L24-3 assume !!(main_~i~0 >= 0);call main_#t~mem3 := read~int(main_~#str1~0.base, main_~#str1~0.offset + main_~i~0, 1);call write~int(main_#t~mem3, main_~#str2~0.base, main_~#str2~0.offset + main_~j~0, 1);havoc main_#t~mem3;main_#t~post4 := main_~j~0;main_~j~0 := 1 + main_#t~post4;havoc main_#t~post4; 1063#L24-2 main_#t~post2 := main_~i~0;main_~i~0 := main_#t~post2 - 1;havoc main_#t~post2; 1057#L24-3 assume !!(main_~i~0 >= 0);call main_#t~mem3 := read~int(main_~#str1~0.base, main_~#str1~0.offset + main_~i~0, 1);call write~int(main_#t~mem3, main_~#str2~0.base, main_~#str2~0.offset + main_~j~0, 1);havoc main_#t~mem3;main_#t~post4 := main_~j~0;main_~j~0 := 1 + main_#t~post4;havoc main_#t~post4; 1056#L24-2 main_#t~post2 := main_~i~0;main_~i~0 := main_#t~post2 - 1;havoc main_#t~post2; 1055#L24-3 assume !(main_~i~0 >= 0); 1052#L24-4 main_~j~0 := (if (main_~max~0 - 1) % 4294967296 % 4294967296 <= 2147483647 then (main_~max~0 - 1) % 4294967296 % 4294967296 else (main_~max~0 - 1) % 4294967296 % 4294967296 - 4294967296);main_~i~0 := 0; 1044#L30-3 [2019-12-07 10:21:48,404 INFO L796 eck$LassoCheckResult]: Loop: 1044#L30-3 assume !!(main_~i~0 % 4294967296 < main_~max~0 % 4294967296);call main_#t~mem6 := read~int(main_~#str1~0.base, main_~#str1~0.offset + main_~i~0, 1);call main_#t~mem7 := read~int(main_~#str2~0.base, main_~#str2~0.offset + main_~j~0, 1);__VERIFIER_assert_#in~cond := (if main_#t~mem6 == main_#t~mem7 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 1045#L4 assume !(0 == __VERIFIER_assert_~cond); 1048#L4-2 havoc main_#t~mem7;havoc main_#t~mem6;main_#t~post8 := main_~j~0;main_~j~0 := main_#t~post8 - 1;havoc main_#t~post8; 1046#L30-2 main_#t~post5 := main_~i~0;main_~i~0 := 1 + main_#t~post5;havoc main_#t~post5; 1044#L30-3 [2019-12-07 10:21:48,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:21:48,404 INFO L82 PathProgramCache]: Analyzing trace with hash -1540388377, now seen corresponding path program 4 times [2019-12-07 10:21:48,404 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:21:48,404 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1809602156] [2019-12-07 10:21:48,404 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:21:48,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 10:21:48,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 10:21:48,451 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 10:21:48,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:21:48,451 INFO L82 PathProgramCache]: Analyzing trace with hash 2100362, now seen corresponding path program 5 times [2019-12-07 10:21:48,451 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:21:48,451 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1238565477] [2019-12-07 10:21:48,451 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:21:48,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 10:21:48,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 10:21:48,457 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 10:21:48,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:21:48,457 INFO L82 PathProgramCache]: Analyzing trace with hash -1945357456, now seen corresponding path program 1 times [2019-12-07 10:21:48,457 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:21:48,457 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [731529164] [2019-12-07 10:21:48,457 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:21:48,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 10:21:48,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 10:21:48,495 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 10:21:55,014 WARN L192 SmtUtils]: Spent 6.43 s on a formula simplification. DAG size of input: 270 DAG size of output: 199 [2019-12-07 10:21:57,150 WARN L192 SmtUtils]: Spent 2.11 s on a formula simplification. DAG size of input: 150 DAG size of output: 109 [2019-12-07 10:21:57,153 INFO L210 LassoAnalysis]: Preferences: [2019-12-07 10:21:57,153 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-12-07 10:21:57,153 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-12-07 10:21:57,153 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-12-07 10:21:57,153 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-12-07 10:21:57,153 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 10:21:57,153 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-12-07 10:21:57,153 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-12-07 10:21:57,153 INFO L133 ssoRankerPreferences]: Filename of dumped script: invert_string-3.c_Iteration12_Lasso [2019-12-07 10:21:57,153 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-12-07 10:21:57,153 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-12-07 10:21:57,155 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 10:21:57,157 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 10:21:57,157 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 10:21:57,158 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 10:21:57,160 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 10:21:57,161 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 10:21:57,347 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:612) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.access$16(LassoCheck.java:539) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.checkLassoTermination(LassoCheck.java:957) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.(LassoCheck.java:865) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.(LassoCheck.java:251) 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-12-07 10:21:57,350 INFO L168 Benchmark]: Toolchain (without parser) took 16961.07 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 207.6 MB). Free memory was 946.3 MB in the beginning and 1.2 GB in the end (delta: -243.8 MB). Peak memory consumption was 314.6 MB. Max. memory is 11.5 GB. [2019-12-07 10:21:57,350 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 1.0 GB. Free memory is still 961.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 10:21:57,350 INFO L168 Benchmark]: CACSL2BoogieTranslator took 188.80 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 125.8 MB). Free memory was 946.3 MB in the beginning and 1.1 GB in the end (delta: -174.3 MB). Peak memory consumption was 23.2 MB. Max. memory is 11.5 GB. [2019-12-07 10:21:57,350 INFO L168 Benchmark]: Boogie Procedure Inliner took 28.02 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-12-07 10:21:57,350 INFO L168 Benchmark]: Boogie Preprocessor took 19.88 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-12-07 10:21:57,351 INFO L168 Benchmark]: RCFGBuilder took 187.50 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: 17.0 MB). Peak memory consumption was 17.0 MB. Max. memory is 11.5 GB. [2019-12-07 10:21:57,351 INFO L168 Benchmark]: BuchiAutomizer took 16534.38 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 81.8 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -91.8 MB). Peak memory consumption was 340.7 MB. Max. memory is 11.5 GB. [2019-12-07 10:21:57,352 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.13 ms. Allocated memory is still 1.0 GB. Free memory is still 961.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 188.80 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 125.8 MB). Free memory was 946.3 MB in the beginning and 1.1 GB in the end (delta: -174.3 MB). Peak memory consumption was 23.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 28.02 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. * Boogie Preprocessor took 19.88 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 187.50 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: 17.0 MB). Peak memory consumption was 17.0 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 16534.38 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 81.8 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -91.8 MB). Peak memory consumption was 340.7 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.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...