./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/loops/invert_string_true-unreach-call_true-termination.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_35b8a581-f5c9-4620-b203-ea444a2a9423/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_35b8a581-f5c9-4620-b203-ea444a2a9423/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_35b8a581-f5c9-4620-b203-ea444a2a9423/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_35b8a581-f5c9-4620-b203-ea444a2a9423/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/loops/invert_string_true-unreach-call_true-termination.i -s /tmp/vcloud-vcloud-master/worker/working_dir_35b8a581-f5c9-4620-b203-ea444a2a9423/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_35b8a581-f5c9-4620-b203-ea444a2a9423/bin-2019/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 60adf12976c621166b8ffd5e872004e7d6c30802 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Using bit-precise analysis No suitable file found in config dir /tmp/vcloud-vcloud-master/worker/working_dir_35b8a581-f5c9-4620-b203-ea444a2a9423/bin-2019/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.23-635dfa2 [2018-12-02 06:55:22,780 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-02 06:55:22,781 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-02 06:55:22,787 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-02 06:55:22,787 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-02 06:55:22,788 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-02 06:55:22,788 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-02 06:55:22,789 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-02 06:55:22,790 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-02 06:55:22,790 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-02 06:55:22,791 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-02 06:55:22,791 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-02 06:55:22,791 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-02 06:55:22,792 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-02 06:55:22,792 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-02 06:55:22,793 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-02 06:55:22,793 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-02 06:55:22,794 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-02 06:55:22,795 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-02 06:55:22,796 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-02 06:55:22,796 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-02 06:55:22,797 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-02 06:55:22,798 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-02 06:55:22,798 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-02 06:55:22,798 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-02 06:55:22,799 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-02 06:55:22,799 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-02 06:55:22,800 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-02 06:55:22,800 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-02 06:55:22,801 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-02 06:55:22,801 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-02 06:55:22,801 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-02 06:55:22,801 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-02 06:55:22,801 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-02 06:55:22,802 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-02 06:55:22,802 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-02 06:55:22,803 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_35b8a581-f5c9-4620-b203-ea444a2a9423/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-12-02 06:55:22,810 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-02 06:55:22,811 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-02 06:55:22,811 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-02 06:55:22,811 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-02 06:55:22,811 INFO L133 SettingsManager]: * Use SBE=true [2018-12-02 06:55:22,812 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-12-02 06:55:22,812 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-12-02 06:55:22,812 INFO L133 SettingsManager]: * Use old map elimination=false [2018-12-02 06:55:22,812 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-12-02 06:55:22,812 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-12-02 06:55:22,812 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-12-02 06:55:22,812 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-02 06:55:22,812 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-02 06:55:22,812 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-12-02 06:55:22,812 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-02 06:55:22,812 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-02 06:55:22,813 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-02 06:55:22,813 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-12-02 06:55:22,813 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-12-02 06:55:22,813 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-12-02 06:55:22,813 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-02 06:55:22,813 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-02 06:55:22,813 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-12-02 06:55:22,813 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-02 06:55:22,813 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-12-02 06:55:22,813 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-02 06:55:22,814 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-02 06:55:22,814 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-12-02 06:55:22,814 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-02 06:55:22,814 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-02 06:55:22,814 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-12-02 06:55:22,814 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-12-02 06:55:22,814 INFO L133 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/working_dir_35b8a581-f5c9-4620-b203-ea444a2a9423/bin-2019/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 -> 60adf12976c621166b8ffd5e872004e7d6c30802 [2018-12-02 06:55:22,833 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-02 06:55:22,842 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-02 06:55:22,845 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-02 06:55:22,845 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-02 06:55:22,846 INFO L276 PluginConnector]: CDTParser initialized [2018-12-02 06:55:22,846 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_35b8a581-f5c9-4620-b203-ea444a2a9423/bin-2019/uautomizer/../../sv-benchmarks/c/loops/invert_string_true-unreach-call_true-termination.i [2018-12-02 06:55:22,881 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_35b8a581-f5c9-4620-b203-ea444a2a9423/bin-2019/uautomizer/data/704070c5a/a0d4b2b51bd544db81482a768ab48c8a/FLAGb8d92702e [2018-12-02 06:55:23,319 INFO L307 CDTParser]: Found 1 translation units. [2018-12-02 06:55:23,320 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_35b8a581-f5c9-4620-b203-ea444a2a9423/sv-benchmarks/c/loops/invert_string_true-unreach-call_true-termination.i [2018-12-02 06:55:23,323 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_35b8a581-f5c9-4620-b203-ea444a2a9423/bin-2019/uautomizer/data/704070c5a/a0d4b2b51bd544db81482a768ab48c8a/FLAGb8d92702e [2018-12-02 06:55:23,718 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_35b8a581-f5c9-4620-b203-ea444a2a9423/bin-2019/uautomizer/data/704070c5a/a0d4b2b51bd544db81482a768ab48c8a [2018-12-02 06:55:23,720 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-02 06:55:23,721 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-02 06:55:23,722 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-02 06:55:23,722 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-02 06:55:23,725 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-02 06:55:23,725 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 06:55:23" (1/1) ... [2018-12-02 06:55:23,727 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@770bfda7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:55:23, skipping insertion in model container [2018-12-02 06:55:23,727 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 06:55:23" (1/1) ... [2018-12-02 06:55:23,732 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-02 06:55:23,742 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-02 06:55:23,829 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 06:55:23,832 INFO L191 MainTranslator]: Completed pre-run [2018-12-02 06:55:23,844 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 06:55:23,855 INFO L195 MainTranslator]: Completed translation [2018-12-02 06:55:23,855 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:55:23 WrapperNode [2018-12-02 06:55:23,855 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-02 06:55:23,856 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-02 06:55:23,856 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-02 06:55:23,856 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-02 06:55:23,861 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:55:23" (1/1) ... [2018-12-02 06:55:23,865 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:55:23" (1/1) ... [2018-12-02 06:55:23,877 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-02 06:55:23,878 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-02 06:55:23,878 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-02 06:55:23,878 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-02 06:55:23,912 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:55:23" (1/1) ... [2018-12-02 06:55:23,913 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:55:23" (1/1) ... [2018-12-02 06:55:23,914 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:55:23" (1/1) ... [2018-12-02 06:55:23,914 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:55:23" (1/1) ... [2018-12-02 06:55:23,918 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:55:23" (1/1) ... [2018-12-02 06:55:23,922 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:55:23" (1/1) ... [2018-12-02 06:55:23,923 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:55:23" (1/1) ... [2018-12-02 06:55:23,924 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-02 06:55:23,925 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-02 06:55:23,925 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-02 06:55:23,925 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-02 06:55:23,925 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:55:23" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_35b8a581-f5c9-4620-b203-ea444a2a9423/bin-2019/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 [2018-12-02 06:55:23,958 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-02 06:55:23,958 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-02 06:55:23,958 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-02 06:55:23,958 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-02 06:55:23,959 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-12-02 06:55:23,959 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-02 06:55:24,083 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-02 06:55:24,083 INFO L280 CfgBuilder]: Removed 9 assue(true) statements. [2018-12-02 06:55:24,083 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 06:55:24 BoogieIcfgContainer [2018-12-02 06:55:24,083 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-02 06:55:24,083 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-12-02 06:55:24,084 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-12-02 06:55:24,086 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-12-02 06:55:24,086 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-02 06:55:24,086 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 02.12 06:55:23" (1/3) ... [2018-12-02 06:55:24,087 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@26b5d07f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 02.12 06:55:24, skipping insertion in model container [2018-12-02 06:55:24,087 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-02 06:55:24,087 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:55:23" (2/3) ... [2018-12-02 06:55:24,087 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@26b5d07f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 02.12 06:55:24, skipping insertion in model container [2018-12-02 06:55:24,087 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-02 06:55:24,087 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 06:55:24" (3/3) ... [2018-12-02 06:55:24,088 INFO L375 chiAutomizerObserver]: Analyzing ICFG invert_string_true-unreach-call_true-termination.i [2018-12-02 06:55:24,119 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-02 06:55:24,119 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-12-02 06:55:24,119 INFO L375 BuchiCegarLoop]: Hoare is false [2018-12-02 06:55:24,119 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-12-02 06:55:24,119 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-02 06:55:24,120 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-02 06:55:24,120 INFO L379 BuchiCegarLoop]: Difference is false [2018-12-02 06:55:24,120 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-02 06:55:24,120 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-12-02 06:55:24,128 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states. [2018-12-02 06:55:24,143 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 9 [2018-12-02 06:55:24,144 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 06:55:24,144 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 06:55:24,149 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-12-02 06:55:24,149 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-12-02 06:55:24,150 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-12-02 06:55:24,150 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states. [2018-12-02 06:55:24,151 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 9 [2018-12-02 06:55:24,151 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 06:55:24,151 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 06:55:24,151 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-12-02 06:55:24,151 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-12-02 06:55:24,157 INFO L794 eck$LassoCheckResult]: Stem: 10#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 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.alloc((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.alloc((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 [2018-12-02 06:55:24,157 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 [2018-12-02 06:55:24,160 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 06:55:24,160 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2018-12-02 06:55:24,162 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 06:55:24,162 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 06:55:24,189 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:55:24,189 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 06:55:24,189 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:55:24,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 06:55:24,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 06:55:24,232 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 06:55:24,232 INFO L82 PathProgramCache]: Analyzing trace with hash 1283, now seen corresponding path program 1 times [2018-12-02 06:55:24,232 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 06:55:24,232 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 06:55:24,233 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:55:24,233 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 06:55:24,233 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:55:24,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 06:55:24,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 06:55:24,245 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 06:55:24,245 INFO L82 PathProgramCache]: Analyzing trace with hash 925765, now seen corresponding path program 1 times [2018-12-02 06:55:24,245 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 06:55:24,245 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 06:55:24,246 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:55:24,246 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 06:55:24,246 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:55:24,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 06:55:24,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 06:55:24,414 INFO L216 LassoAnalysis]: Preferences: [2018-12-02 06:55:24,415 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-02 06:55:24,415 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-02 06:55:24,415 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-02 06:55:24,416 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-02 06:55:24,416 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 06:55:24,416 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-02 06:55:24,416 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-02 06:55:24,416 INFO L131 ssoRankerPreferences]: Filename of dumped script: invert_string_true-unreach-call_true-termination.i_Iteration1_Lasso [2018-12-02 06:55:24,416 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-02 06:55:24,417 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-02 06:55:24,433 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 06:55:24,437 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 06:55:24,439 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 06:55:24,478 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 06:55:24,480 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 06:55:24,481 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 06:55:24,483 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 06:55:24,484 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 06:55:24,486 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 06:55:24,488 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 06:55:24,489 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 06:55:24,490 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 06:55:24,492 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 06:55:24,494 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 06:55:24,645 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-02 06:55:24,648 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-02 06:55:24,649 INFO L122 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 [2018-12-02 06:55:24,650 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 06:55:24,651 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 06:55:24,651 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 06:55:24,651 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 06:55:24,651 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 06:55:24,652 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 06:55:24,652 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 06:55:24,653 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 06:55:24,654 INFO L122 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 [2018-12-02 06:55:24,654 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 06:55:24,654 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 06:55:24,654 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 06:55:24,655 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 06:55:24,656 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 06:55:24,656 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 06:55:24,658 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 06:55:24,658 INFO L122 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 [2018-12-02 06:55:24,659 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 06:55:24,659 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 06:55:24,659 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 06:55:24,659 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 06:55:24,659 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 06:55:24,660 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 06:55:24,660 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 06:55:24,660 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 06:55:24,661 INFO L122 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 [2018-12-02 06:55:24,661 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 06:55:24,661 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 06:55:24,661 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 06:55:24,661 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 06:55:24,662 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 06:55:24,662 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 06:55:24,669 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 06:55:24,669 INFO L122 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 [2018-12-02 06:55:24,669 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 06:55:24,670 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-02 06:55:24,670 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 06:55:24,670 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 06:55:24,671 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-02 06:55:24,671 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 06:55:24,674 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 06:55:24,675 INFO L122 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 [2018-12-02 06:55:24,675 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 06:55:24,675 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 06:55:24,675 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 06:55:24,676 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 06:55:24,677 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 06:55:24,677 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 06:55:24,679 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 06:55:24,679 INFO L122 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 [2018-12-02 06:55:24,680 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 06:55:24,680 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 06:55:24,680 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 06:55:24,680 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 06:55:24,680 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 06:55:24,680 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 06:55:24,681 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 06:55:24,682 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 06:55:24,682 INFO L122 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 [2018-12-02 06:55:24,683 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 06:55:24,683 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 06:55:24,683 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 06:55:24,683 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 06:55:24,686 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 06:55:24,686 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 06:55:24,710 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-02 06:55:24,727 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2018-12-02 06:55:24,727 INFO L444 ModelExtractionUtils]: 13 out of 19 variables were initially zero. Simplification set additionally 2 variables to zero. [2018-12-02 06:55:24,728 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-02 06:55:24,729 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-12-02 06:55:24,730 INFO L518 LassoAnalysis]: Proved termination. [2018-12-02 06:55:24,730 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_~#str1~0.base)_1, ULTIMATE.start_main_~i~0, ULTIMATE.start_main_~#str1~0.offset) = 1*v_rep(select #length ULTIMATE.start_main_~#str1~0.base)_1 - 1*ULTIMATE.start_main_~i~0 - 1*ULTIMATE.start_main_~#str1~0.offset Supporting invariants [] [2018-12-02 06:55:24,740 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2018-12-02 06:55:24,746 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2018-12-02 06:55:24,761 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 06:55:24,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 06:55:24,771 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 06:55:24,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 06:55:24,780 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 06:55:24,789 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 06:55:24,799 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 [2018-12-02 06:55:24,799 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 17 states. Second operand 3 states. [2018-12-02 06:55:24,831 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. [2018-12-02 06:55:24,832 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 [2018-12-02 06:55:24,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-12-02 06:55:24,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 23 transitions. [2018-12-02 06:55:24,834 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 23 transitions. Stem has 2 letters. Loop has 2 letters. [2018-12-02 06:55:24,835 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 06:55:24,835 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 23 transitions. Stem has 4 letters. Loop has 2 letters. [2018-12-02 06:55:24,835 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 06:55:24,835 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 23 transitions. Stem has 2 letters. Loop has 4 letters. [2018-12-02 06:55:24,835 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 06:55:24,836 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 33 states and 47 transitions. [2018-12-02 06:55:24,838 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2018-12-02 06:55:24,840 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 33 states to 14 states and 19 transitions. [2018-12-02 06:55:24,841 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2018-12-02 06:55:24,841 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2018-12-02 06:55:24,842 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 19 transitions. [2018-12-02 06:55:24,842 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-02 06:55:24,842 INFO L705 BuchiCegarLoop]: Abstraction has 14 states and 19 transitions. [2018-12-02 06:55:24,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states and 19 transitions. [2018-12-02 06:55:24,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2018-12-02 06:55:24,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-12-02 06:55:24,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 19 transitions. [2018-12-02 06:55:24,859 INFO L728 BuchiCegarLoop]: Abstraction has 14 states and 19 transitions. [2018-12-02 06:55:24,859 INFO L608 BuchiCegarLoop]: Abstraction has 14 states and 19 transitions. [2018-12-02 06:55:24,859 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-12-02 06:55:24,859 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 19 transitions. [2018-12-02 06:55:24,860 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2018-12-02 06:55:24,860 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 06:55:24,860 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 06:55:24,860 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-12-02 06:55:24,860 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-12-02 06:55:24,861 INFO L794 eck$LassoCheckResult]: Stem: 112#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 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.alloc((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.alloc((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 [2018-12-02 06:55:24,861 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 [2018-12-02 06:55:24,861 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 06:55:24,861 INFO L82 PathProgramCache]: Analyzing trace with hash 925707, now seen corresponding path program 1 times [2018-12-02 06:55:24,861 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 06:55:24,861 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 06:55:24,862 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:55:24,862 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 06:55:24,862 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:55:24,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 06:55:24,940 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 06:55:24,941 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 06:55:24,941 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 06:55:24,942 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-02 06:55:24,942 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 06:55:24,942 INFO L82 PathProgramCache]: Analyzing trace with hash 1731, now seen corresponding path program 1 times [2018-12-02 06:55:24,942 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 06:55:24,943 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 06:55:24,943 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:55:24,943 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 06:55:24,943 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:55:24,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 06:55:24,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 06:55:24,988 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 06:55:24,988 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 06:55:24,989 INFO L87 Difference]: Start difference. First operand 14 states and 19 transitions. cyclomatic complexity: 8 Second operand 3 states. [2018-12-02 06:55:25,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 06:55:25,007 INFO L93 Difference]: Finished difference Result 15 states and 17 transitions. [2018-12-02 06:55:25,007 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 06:55:25,008 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 15 states and 17 transitions. [2018-12-02 06:55:25,008 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2018-12-02 06:55:25,009 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 15 states to 14 states and 16 transitions. [2018-12-02 06:55:25,009 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2018-12-02 06:55:25,009 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2018-12-02 06:55:25,009 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 16 transitions. [2018-12-02 06:55:25,010 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-02 06:55:25,010 INFO L705 BuchiCegarLoop]: Abstraction has 14 states and 16 transitions. [2018-12-02 06:55:25,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states and 16 transitions. [2018-12-02 06:55:25,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 13. [2018-12-02 06:55:25,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-12-02 06:55:25,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 15 transitions. [2018-12-02 06:55:25,011 INFO L728 BuchiCegarLoop]: Abstraction has 13 states and 15 transitions. [2018-12-02 06:55:25,011 INFO L608 BuchiCegarLoop]: Abstraction has 13 states and 15 transitions. [2018-12-02 06:55:25,011 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-12-02 06:55:25,012 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 15 transitions. [2018-12-02 06:55:25,012 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2018-12-02 06:55:25,012 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 06:55:25,012 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 06:55:25,012 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2018-12-02 06:55:25,013 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-12-02 06:55:25,013 INFO L794 eck$LassoCheckResult]: Stem: 142#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 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.alloc((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.alloc((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 [2018-12-02 06:55:25,013 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 [2018-12-02 06:55:25,013 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 06:55:25,013 INFO L82 PathProgramCache]: Analyzing trace with hash 889660429, now seen corresponding path program 1 times [2018-12-02 06:55:25,013 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 06:55:25,014 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 06:55:25,014 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:55:25,014 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 06:55:25,014 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:55:25,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 06:55:25,219 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 06:55:25,220 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 06:55:25,220 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_35b8a581-f5c9-4620-b203-ea444a2a9423/bin-2019/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 06:55:25,226 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 06:55:25,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 06:55:25,236 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 06:55:25,281 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 16 [2018-12-02 06:55:25,284 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 16 treesize of output 19 [2018-12-02 06:55:25,284 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 06:55:25,291 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 06:55:25,300 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 5 treesize of output 1 [2018-12-02 06:55:25,300 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-02 06:55:25,308 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 06:55:25,308 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:78, output treesize:28 [2018-12-02 06:55:25,345 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 06:55:25,360 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 06:55:25,360 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 8 [2018-12-02 06:55:25,360 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-02 06:55:25,360 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 06:55:25,360 INFO L82 PathProgramCache]: Analyzing trace with hash 1731, now seen corresponding path program 2 times [2018-12-02 06:55:25,360 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 06:55:25,360 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 06:55:25,361 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:55:25,361 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 06:55:25,361 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:55:25,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 06:55:25,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 06:55:25,400 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-02 06:55:25,400 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2018-12-02 06:55:25,400 INFO L87 Difference]: Start difference. First operand 13 states and 15 transitions. cyclomatic complexity: 5 Second operand 8 states. [2018-12-02 06:55:25,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 06:55:25,467 INFO L93 Difference]: Finished difference Result 16 states and 18 transitions. [2018-12-02 06:55:25,468 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 06:55:25,468 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 16 states and 18 transitions. [2018-12-02 06:55:25,468 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2018-12-02 06:55:25,469 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 16 states to 16 states and 18 transitions. [2018-12-02 06:55:25,469 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2018-12-02 06:55:25,469 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2018-12-02 06:55:25,469 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 18 transitions. [2018-12-02 06:55:25,469 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-02 06:55:25,469 INFO L705 BuchiCegarLoop]: Abstraction has 16 states and 18 transitions. [2018-12-02 06:55:25,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states and 18 transitions. [2018-12-02 06:55:25,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 15. [2018-12-02 06:55:25,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-12-02 06:55:25,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 17 transitions. [2018-12-02 06:55:25,471 INFO L728 BuchiCegarLoop]: Abstraction has 15 states and 17 transitions. [2018-12-02 06:55:25,471 INFO L608 BuchiCegarLoop]: Abstraction has 15 states and 17 transitions. [2018-12-02 06:55:25,471 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-12-02 06:55:25,471 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 17 transitions. [2018-12-02 06:55:25,471 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2018-12-02 06:55:25,472 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 06:55:25,472 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 06:55:25,472 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1] [2018-12-02 06:55:25,472 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-12-02 06:55:25,472 INFO L794 eck$LassoCheckResult]: Stem: 197#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 192#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.alloc((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.alloc((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; 193#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);call write~int(main_#t~nondet1, main_~#str1~0.base, main_~#str1~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 205#L16-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 206#L16-3 assume !(main_~i~0 % 4294967296 < main_~max~0 % 4294967296); 200#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); 194#L24-3 [2018-12-02 06:55:25,472 INFO L796 eck$LassoCheckResult]: Loop: 194#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; 196#L24-2 main_#t~post2 := main_~i~0;main_~i~0 := main_#t~post2 - 1;havoc main_#t~post2; 194#L24-3 [2018-12-02 06:55:25,473 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 06:55:25,473 INFO L82 PathProgramCache]: Analyzing trace with hash 265236367, now seen corresponding path program 2 times [2018-12-02 06:55:25,473 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 06:55:25,473 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 06:55:25,473 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:55:25,474 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 06:55:25,474 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:55:25,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 06:55:25,685 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 06:55:25,685 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 06:55:25,686 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_35b8a581-f5c9-4620-b203-ea444a2a9423/bin-2019/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 06:55:25,695 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-12-02 06:55:25,704 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-02 06:55:25,704 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 06:55:25,705 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 06:55:25,736 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 06:55:25,750 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 06:55:25,751 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 10 [2018-12-02 06:55:25,751 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-02 06:55:25,751 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 06:55:25,751 INFO L82 PathProgramCache]: Analyzing trace with hash 1731, now seen corresponding path program 3 times [2018-12-02 06:55:25,751 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 06:55:25,751 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 06:55:25,752 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:55:25,752 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 06:55:25,752 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:55:25,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 06:55:25,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 06:55:25,784 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-02 06:55:25,784 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-12-02 06:55:25,784 INFO L87 Difference]: Start difference. First operand 15 states and 17 transitions. cyclomatic complexity: 5 Second operand 10 states. [2018-12-02 06:55:25,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 06:55:25,882 INFO L93 Difference]: Finished difference Result 18 states and 20 transitions. [2018-12-02 06:55:25,883 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 06:55:25,883 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 18 states and 20 transitions. [2018-12-02 06:55:25,883 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2018-12-02 06:55:25,883 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 18 states to 18 states and 20 transitions. [2018-12-02 06:55:25,883 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2018-12-02 06:55:25,884 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2018-12-02 06:55:25,884 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 20 transitions. [2018-12-02 06:55:25,884 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-02 06:55:25,884 INFO L705 BuchiCegarLoop]: Abstraction has 18 states and 20 transitions. [2018-12-02 06:55:25,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 20 transitions. [2018-12-02 06:55:25,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 17. [2018-12-02 06:55:25,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-12-02 06:55:25,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 19 transitions. [2018-12-02 06:55:25,885 INFO L728 BuchiCegarLoop]: Abstraction has 17 states and 19 transitions. [2018-12-02 06:55:25,885 INFO L608 BuchiCegarLoop]: Abstraction has 17 states and 19 transitions. [2018-12-02 06:55:25,885 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-12-02 06:55:25,885 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 19 transitions. [2018-12-02 06:55:25,886 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2018-12-02 06:55:25,886 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 06:55:25,886 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 06:55:25,886 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 1, 1, 1, 1] [2018-12-02 06:55:25,886 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-12-02 06:55:25,886 INFO L794 eck$LassoCheckResult]: Stem: 266#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 261#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.alloc((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.alloc((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; 262#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; 272#L16-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 277#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; 275#L16-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 273#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; 274#L16-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 276#L16-3 assume !(main_~i~0 % 4294967296 < main_~max~0 % 4294967296); 270#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); 263#L24-3 [2018-12-02 06:55:25,886 INFO L796 eck$LassoCheckResult]: Loop: 263#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; 265#L24-2 main_#t~post2 := main_~i~0;main_~i~0 := main_#t~post2 - 1;havoc main_#t~post2; 263#L24-3 [2018-12-02 06:55:25,886 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 06:55:25,887 INFO L82 PathProgramCache]: Analyzing trace with hash 1489134225, now seen corresponding path program 3 times [2018-12-02 06:55:25,887 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 06:55:25,887 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 06:55:25,887 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:55:25,887 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 06:55:25,887 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:55:25,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 06:55:26,140 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 06:55:26,140 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 06:55:26,140 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_35b8a581-f5c9-4620-b203-ea444a2a9423/bin-2019/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 06:55:26,146 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-02 06:55:26,159 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-12-02 06:55:26,159 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 06:55:26,160 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 06:55:26,182 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 16 [2018-12-02 06:55:26,184 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 16 treesize of output 19 [2018-12-02 06:55:26,184 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 06:55:26,187 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 06:55:26,197 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 5 treesize of output 1 [2018-12-02 06:55:26,197 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-02 06:55:26,203 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 06:55:26,203 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:78, output treesize:28 [2018-12-02 06:55:26,271 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 06:55:26,286 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 06:55:26,286 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 12 [2018-12-02 06:55:26,286 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-02 06:55:26,286 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 06:55:26,286 INFO L82 PathProgramCache]: Analyzing trace with hash 1731, now seen corresponding path program 4 times [2018-12-02 06:55:26,287 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 06:55:26,287 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 06:55:26,287 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:55:26,287 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 06:55:26,287 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:55:26,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 06:55:26,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 06:55:26,320 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-02 06:55:26,320 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2018-12-02 06:55:26,320 INFO L87 Difference]: Start difference. First operand 17 states and 19 transitions. cyclomatic complexity: 5 Second operand 12 states. [2018-12-02 06:55:26,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 06:55:26,431 INFO L93 Difference]: Finished difference Result 20 states and 22 transitions. [2018-12-02 06:55:26,432 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-02 06:55:26,432 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 20 states and 22 transitions. [2018-12-02 06:55:26,432 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2018-12-02 06:55:26,432 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 20 states to 20 states and 22 transitions. [2018-12-02 06:55:26,432 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2018-12-02 06:55:26,433 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2018-12-02 06:55:26,433 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 22 transitions. [2018-12-02 06:55:26,433 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-02 06:55:26,433 INFO L705 BuchiCegarLoop]: Abstraction has 20 states and 22 transitions. [2018-12-02 06:55:26,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 22 transitions. [2018-12-02 06:55:26,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 19. [2018-12-02 06:55:26,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-12-02 06:55:26,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 21 transitions. [2018-12-02 06:55:26,434 INFO L728 BuchiCegarLoop]: Abstraction has 19 states and 21 transitions. [2018-12-02 06:55:26,434 INFO L608 BuchiCegarLoop]: Abstraction has 19 states and 21 transitions. [2018-12-02 06:55:26,434 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-12-02 06:55:26,434 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 21 transitions. [2018-12-02 06:55:26,434 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2018-12-02 06:55:26,434 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 06:55:26,434 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 06:55:26,435 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 1, 1, 1, 1] [2018-12-02 06:55:26,435 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-12-02 06:55:26,435 INFO L794 eck$LassoCheckResult]: Stem: 345#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 340#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.alloc((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.alloc((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; 341#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; 351#L16-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 352#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; 353#L16-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 354#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; 358#L16-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 357#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; 356#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); 348#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); 342#L24-3 [2018-12-02 06:55:26,435 INFO L796 eck$LassoCheckResult]: Loop: 342#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; 344#L24-2 main_#t~post2 := main_~i~0;main_~i~0 := main_#t~post2 - 1;havoc main_#t~post2; 342#L24-3 [2018-12-02 06:55:26,435 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 06:55:26,435 INFO L82 PathProgramCache]: Analyzing trace with hash 833936659, now seen corresponding path program 4 times [2018-12-02 06:55:26,435 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 06:55:26,435 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 06:55:26,436 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:55:26,436 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 06:55:26,436 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:55:26,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 06:55:26,507 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 06:55:26,507 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 06:55:26,507 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_35b8a581-f5c9-4620-b203-ea444a2a9423/bin-2019/uautomizer/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 06:55:26,513 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-02 06:55:26,526 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-02 06:55:26,527 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 06:55:26,528 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 06:55:26,552 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 16 [2018-12-02 06:55:26,554 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 16 treesize of output 19 [2018-12-02 06:55:26,555 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 06:55:26,563 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 06:55:26,571 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 5 treesize of output 1 [2018-12-02 06:55:26,571 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-02 06:55:26,577 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 06:55:26,578 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:78, output treesize:28 [2018-12-02 06:55:26,639 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 06:55:26,655 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 06:55:26,655 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 13 [2018-12-02 06:55:26,655 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-02 06:55:26,655 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 06:55:26,655 INFO L82 PathProgramCache]: Analyzing trace with hash 1731, now seen corresponding path program 5 times [2018-12-02 06:55:26,655 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 06:55:26,655 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 06:55:26,656 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:55:26,656 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 06:55:26,656 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:55:26,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 06:55:26,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 06:55:26,694 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-12-02 06:55:26,695 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2018-12-02 06:55:26,695 INFO L87 Difference]: Start difference. First operand 19 states and 21 transitions. cyclomatic complexity: 5 Second operand 13 states. [2018-12-02 06:55:26,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 06:55:26,803 INFO L93 Difference]: Finished difference Result 22 states and 24 transitions. [2018-12-02 06:55:26,803 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 06:55:26,803 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 22 states and 24 transitions. [2018-12-02 06:55:26,803 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2018-12-02 06:55:26,804 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 22 states to 22 states and 24 transitions. [2018-12-02 06:55:26,804 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2018-12-02 06:55:26,804 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2018-12-02 06:55:26,804 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 24 transitions. [2018-12-02 06:55:26,804 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-02 06:55:26,804 INFO L705 BuchiCegarLoop]: Abstraction has 22 states and 24 transitions. [2018-12-02 06:55:26,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states and 24 transitions. [2018-12-02 06:55:26,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 21. [2018-12-02 06:55:26,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-12-02 06:55:26,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 23 transitions. [2018-12-02 06:55:26,805 INFO L728 BuchiCegarLoop]: Abstraction has 21 states and 23 transitions. [2018-12-02 06:55:26,805 INFO L608 BuchiCegarLoop]: Abstraction has 21 states and 23 transitions. [2018-12-02 06:55:26,805 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-12-02 06:55:26,805 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 23 transitions. [2018-12-02 06:55:26,805 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2018-12-02 06:55:26,805 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 06:55:26,805 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 06:55:26,806 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 1, 1, 1, 1] [2018-12-02 06:55:26,806 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-12-02 06:55:26,806 INFO L794 eck$LassoCheckResult]: Stem: 435#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 430#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.alloc((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.alloc((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; 431#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; 441#L16-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 442#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; 443#L16-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 444#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; 450#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; 448#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; 446#L16-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 445#L16-3 assume !(main_~i~0 % 4294967296 < main_~max~0 % 4294967296); 438#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); 432#L24-3 [2018-12-02 06:55:26,806 INFO L796 eck$LassoCheckResult]: Loop: 432#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; 434#L24-2 main_#t~post2 := main_~i~0;main_~i~0 := main_#t~post2 - 1;havoc main_#t~post2; 432#L24-3 [2018-12-02 06:55:26,806 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 06:55:26,806 INFO L82 PathProgramCache]: Analyzing trace with hash -1745699051, now seen corresponding path program 5 times [2018-12-02 06:55:26,806 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 06:55:26,806 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 06:55:26,806 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:55:26,807 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 06:55:26,807 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:55:26,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 06:55:26,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 06:55:26,827 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 06:55:26,827 INFO L82 PathProgramCache]: Analyzing trace with hash 1731, now seen corresponding path program 6 times [2018-12-02 06:55:26,827 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 06:55:26,827 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 06:55:26,828 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:55:26,828 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 06:55:26,828 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:55:26,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 06:55:26,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 06:55:26,832 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 06:55:26,833 INFO L82 PathProgramCache]: Analyzing trace with hash 1715425495, now seen corresponding path program 1 times [2018-12-02 06:55:26,833 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 06:55:26,833 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 06:55:26,833 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:55:26,833 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 06:55:26,833 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:55:26,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 06:55:26,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 06:55:27,764 WARN L180 SmtUtils]: Spent 865.00 ms on a formula simplification. DAG size of input: 147 DAG size of output: 118 [2018-12-02 06:55:27,933 WARN L180 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 75 [2018-12-02 06:55:27,935 INFO L216 LassoAnalysis]: Preferences: [2018-12-02 06:55:27,935 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-02 06:55:27,935 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-02 06:55:27,935 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-02 06:55:27,935 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-02 06:55:27,935 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 06:55:27,935 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-02 06:55:27,935 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-02 06:55:27,935 INFO L131 ssoRankerPreferences]: Filename of dumped script: invert_string_true-unreach-call_true-termination.i_Iteration7_Lasso [2018-12-02 06:55:27,935 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-02 06:55:27,935 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-02 06:55:27,937 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 06:55:27,938 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 06:55:27,939 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 06:55:27,990 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 06:55:27,991 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 06:55:27,992 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 06:55:27,993 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 06:55:27,994 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 06:55:27,995 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 06:55:27,996 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 06:55:27,996 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 06:55:27,997 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 06:55:27,998 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 06:55:28,219 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-02 06:55:28,219 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-02 06:55:28,219 INFO L122 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 [2018-12-02 06:55:28,220 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 06:55:28,220 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 06:55:28,220 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 06:55:28,220 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 06:55:28,220 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 06:55:28,220 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 06:55:28,220 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 06:55:28,221 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 06:55:28,221 INFO L122 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 [2018-12-02 06:55:28,221 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 06:55:28,222 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 06:55:28,222 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 06:55:28,222 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 06:55:28,222 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 06:55:28,222 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 06:55:28,222 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 06:55:28,222 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 06:55:28,223 INFO L122 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 [2018-12-02 06:55:28,223 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 06:55:28,223 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 06:55:28,223 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 06:55:28,223 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 06:55:28,224 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 06:55:28,224 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 06:55:28,226 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 06:55:28,226 INFO L122 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 [2018-12-02 06:55:28,226 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 06:55:28,226 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 06:55:28,226 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 06:55:28,226 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 06:55:28,228 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 06:55:28,228 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 06:55:28,236 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-02 06:55:28,247 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2018-12-02 06:55:28,247 INFO L444 ModelExtractionUtils]: 18 out of 25 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-12-02 06:55:28,247 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-02 06:55:28,248 INFO L440 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2018-12-02 06:55:28,248 INFO L518 LassoAnalysis]: Proved termination. [2018-12-02 06:55:28,248 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~#str2~0.offset, ULTIMATE.start_main_~j~0) = -2*ULTIMATE.start_main_~#str2~0.offset - 2*ULTIMATE.start_main_~j~0 + 8589934589 Supporting invariants [-1*v_rep(select #length ULTIMATE.start_main_~#str2~0.base)_2 + 4294967295 >= 0] [2018-12-02 06:55:28,255 INFO L297 tatePredicateManager]: 3 out of 4 supporting invariants were superfluous and have been removed [2018-12-02 06:55:28,273 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 06:55:28,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 06:55:28,283 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 06:55:28,286 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 25 treesize of output 27 [2018-12-02 06:55:28,289 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 19 [2018-12-02 06:55:28,290 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 06:55:28,296 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 06:55:28,310 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 20 treesize of output 22 [2018-12-02 06:55:28,313 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2018-12-02 06:55:28,313 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 06:55:28,319 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 06:55:28,333 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2018-12-02 06:55:28,333 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:46, output treesize:48 [2018-12-02 06:55:30,296 WARN L180 SmtUtils]: Spent 1.94 s on a formula simplification that was a NOOP. DAG size: 29 [2018-12-02 06:55:30,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 06:55:30,315 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 06:55:30,334 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 06:55:30,334 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2018-12-02 06:55:30,334 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 21 states and 23 transitions. cyclomatic complexity: 5 Second operand 4 states. [2018-12-02 06:55:32,434 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 21 states and 23 transitions. cyclomatic complexity: 5. Second operand 4 states. Result 25 states and 29 transitions. Complement of second has 6 states. [2018-12-02 06:55:32,435 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2018-12-02 06:55:32,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-12-02 06:55:32,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 11 transitions. [2018-12-02 06:55:32,435 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 14 letters. Loop has 2 letters. [2018-12-02 06:55:32,436 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 06:55:32,436 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 16 letters. Loop has 2 letters. [2018-12-02 06:55:32,436 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 06:55:32,436 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 14 letters. Loop has 4 letters. [2018-12-02 06:55:32,436 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 06:55:32,436 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 25 states and 29 transitions. [2018-12-02 06:55:32,437 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-12-02 06:55:32,437 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 25 states to 24 states and 27 transitions. [2018-12-02 06:55:32,437 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2018-12-02 06:55:32,437 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2018-12-02 06:55:32,437 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 27 transitions. [2018-12-02 06:55:32,437 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-02 06:55:32,437 INFO L705 BuchiCegarLoop]: Abstraction has 24 states and 27 transitions. [2018-12-02 06:55:32,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states and 27 transitions. [2018-12-02 06:55:32,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 23. [2018-12-02 06:55:32,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-12-02 06:55:32,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 26 transitions. [2018-12-02 06:55:32,438 INFO L728 BuchiCegarLoop]: Abstraction has 23 states and 26 transitions. [2018-12-02 06:55:32,438 INFO L608 BuchiCegarLoop]: Abstraction has 23 states and 26 transitions. [2018-12-02 06:55:32,438 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2018-12-02 06:55:32,438 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 26 transitions. [2018-12-02 06:55:32,439 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-12-02 06:55:32,439 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 06:55:32,439 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 06:55:32,439 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 1, 1, 1, 1, 1, 1] [2018-12-02 06:55:32,439 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-12-02 06:55:32,439 INFO L794 eck$LassoCheckResult]: Stem: 575#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 569#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.alloc((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.alloc((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; 570#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; 582#L16-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 583#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; 584#L16-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 585#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; 591#L16-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 590#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; 589#L16-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 588#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; 587#L16-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 586#L16-3 assume !(main_~i~0 % 4294967296 < main_~max~0 % 4294967296); 578#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); 579#L24-3 assume !(main_~i~0 >= 0); 572#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; 576#L30-3 [2018-12-02 06:55:32,439 INFO L796 eck$LassoCheckResult]: Loop: 576#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; 577#L4 assume !(0 == __VERIFIER_assert_~cond); 581#L4-2 havoc main_#t~mem6;havoc main_#t~mem7;main_#t~post8 := main_~j~0;main_~j~0 := main_#t~post8 - 1;havoc main_#t~post8; 580#L30-2 main_#t~post5 := main_~i~0;main_~i~0 := 1 + main_#t~post5;havoc main_#t~post5; 576#L30-3 [2018-12-02 06:55:32,439 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 06:55:32,439 INFO L82 PathProgramCache]: Analyzing trace with hash 1715425437, now seen corresponding path program 1 times [2018-12-02 06:55:32,440 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 06:55:32,440 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 06:55:32,440 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:55:32,440 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 06:55:32,440 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:55:32,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 06:55:32,459 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-12-02 06:55:32,459 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 06:55:32,459 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 06:55:32,459 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-02 06:55:32,459 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 06:55:32,459 INFO L82 PathProgramCache]: Analyzing trace with hash 2100362, now seen corresponding path program 1 times [2018-12-02 06:55:32,459 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 06:55:32,459 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 06:55:32,460 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:55:32,460 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 06:55:32,460 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:55:32,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 06:55:32,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 06:55:32,543 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 06:55:32,544 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 06:55:32,544 INFO L87 Difference]: Start difference. First operand 23 states and 26 transitions. cyclomatic complexity: 6 Second operand 4 states. [2018-12-02 06:55:32,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 06:55:32,559 INFO L93 Difference]: Finished difference Result 23 states and 25 transitions. [2018-12-02 06:55:32,559 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 06:55:32,560 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 23 states and 25 transitions. [2018-12-02 06:55:32,560 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-12-02 06:55:32,560 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 23 states to 23 states and 25 transitions. [2018-12-02 06:55:32,560 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2018-12-02 06:55:32,560 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2018-12-02 06:55:32,560 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 25 transitions. [2018-12-02 06:55:32,560 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-02 06:55:32,560 INFO L705 BuchiCegarLoop]: Abstraction has 23 states and 25 transitions. [2018-12-02 06:55:32,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states and 25 transitions. [2018-12-02 06:55:32,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2018-12-02 06:55:32,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-12-02 06:55:32,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 25 transitions. [2018-12-02 06:55:32,562 INFO L728 BuchiCegarLoop]: Abstraction has 23 states and 25 transitions. [2018-12-02 06:55:32,562 INFO L608 BuchiCegarLoop]: Abstraction has 23 states and 25 transitions. [2018-12-02 06:55:32,562 INFO L442 BuchiCegarLoop]: ======== Iteration 9============ [2018-12-02 06:55:32,562 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 25 transitions. [2018-12-02 06:55:32,562 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-12-02 06:55:32,562 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 06:55:32,562 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 06:55:32,562 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 06:55:32,562 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-12-02 06:55:32,562 INFO L794 eck$LassoCheckResult]: Stem: 629#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 624#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.alloc((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.alloc((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; 625#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; 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; 638#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; 646#L16-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 645#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; 644#L16-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 643#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; 642#L16-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 641#L16-3 assume !(main_~i~0 % 4294967296 < main_~max~0 % 4294967296); 633#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); 626#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; 627#L24-2 main_#t~post2 := main_~i~0;main_~i~0 := main_#t~post2 - 1;havoc main_#t~post2; 632#L24-3 assume !(main_~i~0 >= 0); 640#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; 630#L30-3 [2018-12-02 06:55:32,562 INFO L796 eck$LassoCheckResult]: Loop: 630#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; 631#L4 assume !(0 == __VERIFIER_assert_~cond); 635#L4-2 havoc main_#t~mem6;havoc main_#t~mem7;main_#t~post8 := main_~j~0;main_~j~0 := main_#t~post8 - 1;havoc main_#t~post8; 634#L30-2 main_#t~post5 := main_~i~0;main_~i~0 := 1 + main_#t~post5;havoc main_#t~post5; 630#L30-3 [2018-12-02 06:55:32,563 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 06:55:32,563 INFO L82 PathProgramCache]: Analyzing trace with hash -743540257, now seen corresponding path program 1 times [2018-12-02 06:55:32,563 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 06:55:32,563 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 06:55:32,563 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:55:32,563 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 06:55:32,563 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:55:32,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 06:55:32,618 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-12-02 06:55:32,619 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 06:55:32,619 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_35b8a581-f5c9-4620-b203-ea444a2a9423/bin-2019/uautomizer/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 06:55:32,625 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 06:55:32,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 06:55:32,640 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 06:55:32,655 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-12-02 06:55:32,670 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 06:55:32,670 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2018-12-02 06:55:32,670 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-02 06:55:32,670 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 06:55:32,670 INFO L82 PathProgramCache]: Analyzing trace with hash 2100362, now seen corresponding path program 2 times [2018-12-02 06:55:32,670 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 06:55:32,670 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 06:55:32,671 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:55:32,671 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 06:55:32,671 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:55:32,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 06:55:32,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 06:55:32,745 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-02 06:55:32,745 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-12-02 06:55:32,745 INFO L87 Difference]: Start difference. First operand 23 states and 25 transitions. cyclomatic complexity: 5 Second operand 8 states. [2018-12-02 06:55:32,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 06:55:32,797 INFO L93 Difference]: Finished difference Result 27 states and 30 transitions. [2018-12-02 06:55:32,797 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 06:55:32,797 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 27 states and 30 transitions. [2018-12-02 06:55:32,797 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-12-02 06:55:32,798 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 27 states to 26 states and 29 transitions. [2018-12-02 06:55:32,798 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2018-12-02 06:55:32,798 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2018-12-02 06:55:32,798 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 29 transitions. [2018-12-02 06:55:32,798 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-02 06:55:32,798 INFO L705 BuchiCegarLoop]: Abstraction has 26 states and 29 transitions. [2018-12-02 06:55:32,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states and 29 transitions. [2018-12-02 06:55:32,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 24. [2018-12-02 06:55:32,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-12-02 06:55:32,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 26 transitions. [2018-12-02 06:55:32,799 INFO L728 BuchiCegarLoop]: Abstraction has 24 states and 26 transitions. [2018-12-02 06:55:32,799 INFO L608 BuchiCegarLoop]: Abstraction has 24 states and 26 transitions. [2018-12-02 06:55:32,799 INFO L442 BuchiCegarLoop]: ======== Iteration 10============ [2018-12-02 06:55:32,799 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 26 transitions. [2018-12-02 06:55:32,799 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-12-02 06:55:32,799 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 06:55:32,799 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 06:55:32,800 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 2, 2, 1, 1, 1, 1, 1, 1] [2018-12-02 06:55:32,800 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-12-02 06:55:32,800 INFO L794 eck$LassoCheckResult]: Stem: 746#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 740#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.alloc((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.alloc((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; 741#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; 752#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; 754#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; 763#L16-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 762#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; 761#L16-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 760#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; 758#L16-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 757#L16-3 assume !(main_~i~0 % 4294967296 < main_~max~0 % 4294967296); 749#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); 742#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; 743#L24-2 main_#t~post2 := main_~i~0;main_~i~0 := main_#t~post2 - 1;havoc main_#t~post2; 744#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; 745#L24-2 main_#t~post2 := main_~i~0;main_~i~0 := main_#t~post2 - 1;havoc main_#t~post2; 759#L24-3 assume !(main_~i~0 >= 0); 756#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; 747#L30-3 [2018-12-02 06:55:32,800 INFO L796 eck$LassoCheckResult]: Loop: 747#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; 748#L4 assume !(0 == __VERIFIER_assert_~cond); 751#L4-2 havoc main_#t~mem6;havoc main_#t~mem7;main_#t~post8 := main_~j~0;main_~j~0 := main_#t~post8 - 1;havoc main_#t~post8; 750#L30-2 main_#t~post5 := main_~i~0;main_~i~0 := 1 + main_#t~post5;havoc main_#t~post5; 747#L30-3 [2018-12-02 06:55:32,800 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 06:55:32,800 INFO L82 PathProgramCache]: Analyzing trace with hash -1577559391, now seen corresponding path program 2 times [2018-12-02 06:55:32,800 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 06:55:32,800 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 06:55:32,801 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:55:32,801 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 06:55:32,801 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:55:32,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 06:55:32,868 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-12-02 06:55:32,868 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 06:55:32,868 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_35b8a581-f5c9-4620-b203-ea444a2a9423/bin-2019/uautomizer/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 06:55:32,874 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-12-02 06:55:32,887 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-02 06:55:32,887 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 06:55:32,889 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 06:55:32,945 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-12-02 06:55:32,961 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 06:55:32,961 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 11 [2018-12-02 06:55:32,961 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-02 06:55:32,961 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 06:55:32,961 INFO L82 PathProgramCache]: Analyzing trace with hash 2100362, now seen corresponding path program 3 times [2018-12-02 06:55:32,961 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 06:55:32,962 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 06:55:32,962 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:55:32,962 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 06:55:32,962 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:55:32,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 06:55:32,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 06:55:33,047 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-02 06:55:33,047 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2018-12-02 06:55:33,047 INFO L87 Difference]: Start difference. First operand 24 states and 26 transitions. cyclomatic complexity: 5 Second operand 11 states. [2018-12-02 06:55:33,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 06:55:33,119 INFO L93 Difference]: Finished difference Result 29 states and 32 transitions. [2018-12-02 06:55:33,120 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 06:55:33,120 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 29 states and 32 transitions. [2018-12-02 06:55:33,120 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-12-02 06:55:33,121 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 29 states to 28 states and 31 transitions. [2018-12-02 06:55:33,121 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2018-12-02 06:55:33,121 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2018-12-02 06:55:33,121 INFO L73 IsDeterministic]: Start isDeterministic. Operand 28 states and 31 transitions. [2018-12-02 06:55:33,121 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-02 06:55:33,121 INFO L705 BuchiCegarLoop]: Abstraction has 28 states and 31 transitions. [2018-12-02 06:55:33,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states and 31 transitions. [2018-12-02 06:55:33,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 26. [2018-12-02 06:55:33,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-12-02 06:55:33,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 28 transitions. [2018-12-02 06:55:33,123 INFO L728 BuchiCegarLoop]: Abstraction has 26 states and 28 transitions. [2018-12-02 06:55:33,123 INFO L608 BuchiCegarLoop]: Abstraction has 26 states and 28 transitions. [2018-12-02 06:55:33,123 INFO L442 BuchiCegarLoop]: ======== Iteration 11============ [2018-12-02 06:55:33,123 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 26 states and 28 transitions. [2018-12-02 06:55:33,123 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-12-02 06:55:33,123 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 06:55:33,123 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 06:55:33,124 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 3, 3, 1, 1, 1, 1, 1, 1] [2018-12-02 06:55:33,124 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-12-02 06:55:33,124 INFO L794 eck$LassoCheckResult]: Stem: 878#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 872#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.alloc((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.alloc((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; 873#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; 885#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; 887#L16-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 897#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; 896#L16-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 895#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; 894#L16-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 893#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; 890#L16-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 889#L16-3 assume !(main_~i~0 % 4294967296 < main_~max~0 % 4294967296); 882#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); 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; 875#L24-2 main_#t~post2 := main_~i~0;main_~i~0 := main_#t~post2 - 1;havoc main_#t~post2; 876#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; 877#L24-2 main_#t~post2 := main_~i~0;main_~i~0 := main_#t~post2 - 1;havoc main_#t~post2; 881#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; 892#L24-2 main_#t~post2 := main_~i~0;main_~i~0 := main_#t~post2 - 1;havoc main_#t~post2; 891#L24-3 assume !(main_~i~0 >= 0); 888#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; 879#L30-3 [2018-12-02 06:55:33,124 INFO L796 eck$LassoCheckResult]: Loop: 879#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; 880#L4 assume !(0 == __VERIFIER_assert_~cond); 884#L4-2 havoc main_#t~mem6;havoc main_#t~mem7;main_#t~post8 := main_~j~0;main_~j~0 := main_#t~post8 - 1;havoc main_#t~post8; 883#L30-2 main_#t~post5 := main_~i~0;main_~i~0 := 1 + main_#t~post5;havoc main_#t~post5; 879#L30-3 [2018-12-02 06:55:33,124 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 06:55:33,124 INFO L82 PathProgramCache]: Analyzing trace with hash 88937187, now seen corresponding path program 3 times [2018-12-02 06:55:33,124 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 06:55:33,124 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 06:55:33,125 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:55:33,125 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 06:55:33,125 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:55:33,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 06:55:33,219 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-12-02 06:55:33,220 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 06:55:33,220 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_35b8a581-f5c9-4620-b203-ea444a2a9423/bin-2019/uautomizer/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 06:55:33,227 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-02 06:55:33,255 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-12-02 06:55:33,255 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 06:55:33,257 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 06:55:33,301 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-12-02 06:55:33,325 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 06:55:33,325 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 13 [2018-12-02 06:55:33,325 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-02 06:55:33,325 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 06:55:33,325 INFO L82 PathProgramCache]: Analyzing trace with hash 2100362, now seen corresponding path program 4 times [2018-12-02 06:55:33,326 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 06:55:33,326 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 06:55:33,326 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:55:33,326 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 06:55:33,326 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:55:33,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 06:55:33,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 06:55:33,422 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-12-02 06:55:33,422 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2018-12-02 06:55:33,422 INFO L87 Difference]: Start difference. First operand 26 states and 28 transitions. cyclomatic complexity: 5 Second operand 13 states. [2018-12-02 06:55:33,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 06:55:33,539 INFO L93 Difference]: Finished difference Result 31 states and 34 transitions. [2018-12-02 06:55:33,539 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-02 06:55:33,539 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 31 states and 34 transitions. [2018-12-02 06:55:33,539 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-12-02 06:55:33,540 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 31 states to 30 states and 33 transitions. [2018-12-02 06:55:33,540 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2018-12-02 06:55:33,540 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2018-12-02 06:55:33,540 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 33 transitions. [2018-12-02 06:55:33,540 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-02 06:55:33,540 INFO L705 BuchiCegarLoop]: Abstraction has 30 states and 33 transitions. [2018-12-02 06:55:33,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states and 33 transitions. [2018-12-02 06:55:33,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 28. [2018-12-02 06:55:33,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-12-02 06:55:33,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 30 transitions. [2018-12-02 06:55:33,541 INFO L728 BuchiCegarLoop]: Abstraction has 28 states and 30 transitions. [2018-12-02 06:55:33,541 INFO L608 BuchiCegarLoop]: Abstraction has 28 states and 30 transitions. [2018-12-02 06:55:33,541 INFO L442 BuchiCegarLoop]: ======== Iteration 12============ [2018-12-02 06:55:33,541 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 30 transitions. [2018-12-02 06:55:33,541 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-12-02 06:55:33,541 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 06:55:33,541 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 06:55:33,542 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 4, 4, 1, 1, 1, 1, 1, 1] [2018-12-02 06:55:33,542 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-12-02 06:55:33,542 INFO L794 eck$LassoCheckResult]: Stem: 1024#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1018#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.alloc((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.alloc((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; 1019#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; 1032#L16-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 1033#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; 1034#L16-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 1044#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; 1043#L16-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 1042#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; 1041#L16-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 1040#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; 1037#L16-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 1036#L16-3 assume !(main_~i~0 % 4294967296 < main_~max~0 % 4294967296); 1029#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); 1020#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; 1021#L24-2 main_#t~post2 := main_~i~0;main_~i~0 := main_#t~post2 - 1;havoc main_#t~post2; 1022#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; 1023#L24-2 main_#t~post2 := main_~i~0;main_~i~0 := main_#t~post2 - 1;havoc main_#t~post2; 1045#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; 1027#L24-2 main_#t~post2 := main_~i~0;main_~i~0 := main_#t~post2 - 1;havoc main_#t~post2; 1028#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; 1039#L24-2 main_#t~post2 := main_~i~0;main_~i~0 := main_#t~post2 - 1;havoc main_#t~post2; 1038#L24-3 assume !(main_~i~0 >= 0); 1035#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; 1025#L30-3 [2018-12-02 06:55:33,542 INFO L796 eck$LassoCheckResult]: Loop: 1025#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; 1026#L4 assume !(0 == __VERIFIER_assert_~cond); 1031#L4-2 havoc main_#t~mem6;havoc main_#t~mem7;main_#t~post8 := main_~j~0;main_~j~0 := main_#t~post8 - 1;havoc main_#t~post8; 1030#L30-2 main_#t~post5 := main_~i~0;main_~i~0 := 1 + main_#t~post5;havoc main_#t~post5; 1025#L30-3 [2018-12-02 06:55:33,542 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 06:55:33,542 INFO L82 PathProgramCache]: Analyzing trace with hash -430652763, now seen corresponding path program 4 times [2018-12-02 06:55:33,542 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 06:55:33,542 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 06:55:33,543 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:55:33,543 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 06:55:33,543 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:55:33,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 06:55:33,652 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-12-02 06:55:33,652 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 06:55:33,653 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_35b8a581-f5c9-4620-b203-ea444a2a9423/bin-2019/uautomizer/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 06:55:33,660 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-02 06:55:33,678 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-02 06:55:33,678 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 06:55:33,680 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 06:55:33,742 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-12-02 06:55:33,756 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 06:55:33,756 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2018-12-02 06:55:33,757 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-02 06:55:33,757 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 06:55:33,757 INFO L82 PathProgramCache]: Analyzing trace with hash 2100362, now seen corresponding path program 5 times [2018-12-02 06:55:33,757 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 06:55:33,757 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 06:55:33,757 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:55:33,757 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 06:55:33,757 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:55:33,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 06:55:33,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 06:55:33,831 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-12-02 06:55:33,831 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=200, Unknown=0, NotChecked=0, Total=240 [2018-12-02 06:55:33,831 INFO L87 Difference]: Start difference. First operand 28 states and 30 transitions. cyclomatic complexity: 5 Second operand 16 states. [2018-12-02 06:55:34,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 06:55:34,144 INFO L93 Difference]: Finished difference Result 48 states and 50 transitions. [2018-12-02 06:55:34,144 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-02 06:55:34,144 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 48 states and 50 transitions. [2018-12-02 06:55:34,144 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-12-02 06:55:34,145 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 48 states to 47 states and 49 transitions. [2018-12-02 06:55:34,145 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 27 [2018-12-02 06:55:34,145 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 27 [2018-12-02 06:55:34,145 INFO L73 IsDeterministic]: Start isDeterministic. Operand 47 states and 49 transitions. [2018-12-02 06:55:34,145 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-02 06:55:34,145 INFO L705 BuchiCegarLoop]: Abstraction has 47 states and 49 transitions. [2018-12-02 06:55:34,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states and 49 transitions. [2018-12-02 06:55:34,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 30. [2018-12-02 06:55:34,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-12-02 06:55:34,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 32 transitions. [2018-12-02 06:55:34,146 INFO L728 BuchiCegarLoop]: Abstraction has 30 states and 32 transitions. [2018-12-02 06:55:34,146 INFO L608 BuchiCegarLoop]: Abstraction has 30 states and 32 transitions. [2018-12-02 06:55:34,146 INFO L442 BuchiCegarLoop]: ======== Iteration 13============ [2018-12-02 06:55:34,146 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 30 states and 32 transitions. [2018-12-02 06:55:34,147 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-12-02 06:55:34,147 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 06:55:34,147 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 06:55:34,147 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 5, 5, 1, 1, 1, 1, 1, 1] [2018-12-02 06:55:34,147 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-12-02 06:55:34,147 INFO L794 eck$LassoCheckResult]: Stem: 1210#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1204#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.alloc((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.alloc((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; 1205#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; 1216#L16-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 1217#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; 1218#L16-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 1229#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; 1228#L16-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 1227#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; 1226#L16-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 1225#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; 1221#L16-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 1220#L16-3 assume !(main_~i~0 % 4294967296 < main_~max~0 % 4294967296); 1213#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); 1206#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; 1207#L24-2 main_#t~post2 := main_~i~0;main_~i~0 := main_#t~post2 - 1;havoc main_#t~post2; 1208#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; 1209#L24-2 main_#t~post2 := main_~i~0;main_~i~0 := main_#t~post2 - 1;havoc main_#t~post2; 1233#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; 1232#L24-2 main_#t~post2 := main_~i~0;main_~i~0 := main_#t~post2 - 1;havoc main_#t~post2; 1231#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; 1230#L24-2 main_#t~post2 := main_~i~0;main_~i~0 := main_#t~post2 - 1;havoc main_#t~post2; 1224#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; 1223#L24-2 main_#t~post2 := main_~i~0;main_~i~0 := main_#t~post2 - 1;havoc main_#t~post2; 1222#L24-3 assume !(main_~i~0 >= 0); 1219#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; 1211#L30-3 [2018-12-02 06:55:34,147 INFO L796 eck$LassoCheckResult]: Loop: 1211#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; 1212#L4 assume !(0 == __VERIFIER_assert_~cond); 1215#L4-2 havoc main_#t~mem6;havoc main_#t~mem7;main_#t~post8 := main_~j~0;main_~j~0 := main_#t~post8 - 1;havoc main_#t~post8; 1214#L30-2 main_#t~post5 := main_~i~0;main_~i~0 := 1 + main_#t~post5;havoc main_#t~post5; 1211#L30-3 [2018-12-02 06:55:34,148 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 06:55:34,148 INFO L82 PathProgramCache]: Analyzing trace with hash -1540388377, now seen corresponding path program 5 times [2018-12-02 06:55:34,148 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 06:55:34,148 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 06:55:34,148 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:55:34,148 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 06:55:34,148 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:55:34,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 06:55:34,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 06:55:34,173 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 06:55:34,173 INFO L82 PathProgramCache]: Analyzing trace with hash 2100362, now seen corresponding path program 6 times [2018-12-02 06:55:34,173 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 06:55:34,173 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 06:55:34,174 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:55:34,174 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 06:55:34,174 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:55:34,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 06:55:34,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 06:55:34,177 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 06:55:34,178 INFO L82 PathProgramCache]: Analyzing trace with hash -1945357456, now seen corresponding path program 1 times [2018-12-02 06:55:34,178 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 06:55:34,178 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 06:55:34,178 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:55:34,178 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 06:55:34,178 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:55:34,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 06:55:34,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 06:55:44,188 WARN L180 SmtUtils]: Spent 9.90 s on a formula simplification. DAG size of input: 266 DAG size of output: 205 [2018-12-02 06:55:45,778 WARN L180 SmtUtils]: Spent 1.58 s on a formula simplification. DAG size of input: 167 DAG size of output: 122 [2018-12-02 06:55:45,781 INFO L216 LassoAnalysis]: Preferences: [2018-12-02 06:55:45,781 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-02 06:55:45,781 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-02 06:55:45,781 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-02 06:55:45,781 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-02 06:55:45,781 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 06:55:45,781 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-02 06:55:45,781 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-02 06:55:45,781 INFO L131 ssoRankerPreferences]: Filename of dumped script: invert_string_true-unreach-call_true-termination.i_Iteration13_Lasso [2018-12-02 06:55:45,781 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-02 06:55:45,781 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-02 06:55:45,783 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 06:55:45,784 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 06:55:45,786 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 06:55:45,787 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 06:55:45,788 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 06:55:45,791 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 06:55:45,792 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 06:55:45,793 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 06:55:45,794 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 06:55:45,795 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 06:55:45,795 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 06:55:45,796 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 06:55:46,004 FATAL L292 ToolchainWalker]: 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.modelcheckerutils.smt.mapelimination.MapEliminator.indexEqualityInequalityImpliesValueEquality(MapEliminator.java:850) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.mapelimination.MapEliminator.replaceSelectStoreTerm(MapEliminator.java:592) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.mapelimination.MapEliminator.replaceStoreTerms(MapEliminator.java:542) at de.uni_freiburg.informatik.ultimate.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:286) at de.uni_freiburg.informatik.ultimate.lassoranker.LassoAnalysis.(LassoAnalysis.java:235) 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:958) 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:476) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.doTerminationAnalysis(BuchiAutomizerObserver.java:145) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.finish(BuchiAutomizerObserver.java:384) 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) [2018-12-02 06:55:46,005 INFO L168 Benchmark]: Toolchain (without parser) took 22284.70 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 290.5 MB). Free memory was 953.3 MB in the beginning and 1.1 GB in the end (delta: -137.8 MB). Peak memory consumption was 441.5 MB. Max. memory is 11.5 GB. [2018-12-02 06:55:46,006 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 979.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 06:55:46,006 INFO L168 Benchmark]: CACSL2BoogieTranslator took 133.77 ms. Allocated memory is still 1.0 GB. Free memory was 953.3 MB in the beginning and 942.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-12-02 06:55:46,006 INFO L168 Benchmark]: Boogie Procedure Inliner took 21.37 ms. Allocated memory is still 1.0 GB. Free memory was 942.6 MB in the beginning and 939.9 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-12-02 06:55:46,006 INFO L168 Benchmark]: Boogie Preprocessor took 46.88 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 105.4 MB). Free memory was 939.9 MB in the beginning and 1.1 GB in the end (delta: -160.5 MB). Peak memory consumption was 13.2 MB. Max. memory is 11.5 GB. [2018-12-02 06:55:46,007 INFO L168 Benchmark]: RCFGBuilder took 158.56 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 18.2 MB). Peak memory consumption was 18.2 MB. Max. memory is 11.5 GB. [2018-12-02 06:55:46,007 INFO L168 Benchmark]: BuchiAutomizer took 21921.43 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 185.1 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -12.3 MB). Peak memory consumption was 461.6 MB. Max. memory is 11.5 GB. [2018-12-02 06:55:46,009 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 979.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 133.77 ms. Allocated memory is still 1.0 GB. Free memory was 953.3 MB in the beginning and 942.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 21.37 ms. Allocated memory is still 1.0 GB. Free memory was 942.6 MB in the beginning and 939.9 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 46.88 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 105.4 MB). Free memory was 939.9 MB in the beginning and 1.1 GB in the end (delta: -160.5 MB). Peak memory consumption was 13.2 MB. Max. memory is 11.5 GB. * RCFGBuilder took 158.56 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 18.2 MB). Peak memory consumption was 18.2 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 21921.43 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 185.1 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -12.3 MB). Peak memory consumption was 461.6 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: - ExceptionOrErrorResult: AssertionError: MapEliminator tries to combine Int and (Array Int Int) de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: AssertionError: MapEliminator tries to combine Int and (Array Int Int): de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.mapelimination.MapEliminator.indexEqualityInequalityImpliesValueEquality(MapEliminator.java:850) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...