./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/loops/invert_string-3.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version a4ecdabc Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_a79dd090-33a4-40c1-9430-3ac868ca5229/bin/uautomizer/data/config -Xmx15G -Xms4m -jar /tmp/vcloud-vcloud-master/worker/run_dir_a79dd090-33a4-40c1-9430-3ac868ca5229/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_a79dd090-33a4-40c1-9430-3ac868ca5229/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_a79dd090-33a4-40c1-9430-3ac868ca5229/bin/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/loops/invert_string-3.c -s /tmp/vcloud-vcloud-master/worker/run_dir_a79dd090-33a4-40c1-9430-3ac868ca5229/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_a79dd090-33a4-40c1-9430-3ac868ca5229/bin/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash e0ffc577d494a5308847d196b5326d78dd21a5a9 ......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Using bit-precise analysis No suitable file found in config dir /tmp/vcloud-vcloud-master/worker/run_dir_a79dd090-33a4-40c1-9430-3ac868ca5229/bin/uautomizer/config using search string *Termination*32bit*_Bitvector*.epf No suitable settings file found using Termination*32bit*_Bitvector ERROR: UNSUPPORTED PROPERTY Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: AssertionError: MapEliminator tries to combine Int and (Array Int Int) --- Real Ultimate output --- This is Ultimate 0.2.0-a4ecdab [2020-11-29 19:17:00,811 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-11-29 19:17:00,823 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-11-29 19:17:00,882 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-11-29 19:17:00,883 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-11-29 19:17:00,888 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-11-29 19:17:00,892 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-11-29 19:17:00,902 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-11-29 19:17:00,906 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-11-29 19:17:00,910 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-11-29 19:17:00,911 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-11-29 19:17:00,914 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-11-29 19:17:00,914 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-11-29 19:17:00,923 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-11-29 19:17:00,925 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-11-29 19:17:00,927 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-11-29 19:17:00,929 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-11-29 19:17:00,932 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-11-29 19:17:00,934 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-11-29 19:17:00,941 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-11-29 19:17:00,948 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-11-29 19:17:00,949 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-11-29 19:17:00,951 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-11-29 19:17:00,952 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-11-29 19:17:00,959 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-11-29 19:17:00,960 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-11-29 19:17:00,960 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-11-29 19:17:00,963 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-11-29 19:17:00,964 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-11-29 19:17:00,965 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-11-29 19:17:00,970 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-11-29 19:17:00,971 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-11-29 19:17:00,972 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-11-29 19:17:00,973 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-11-29 19:17:00,974 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-11-29 19:17:00,974 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-11-29 19:17:00,975 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-11-29 19:17:00,976 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-11-29 19:17:00,976 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-11-29 19:17:00,977 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-11-29 19:17:00,978 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-11-29 19:17:00,979 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_a79dd090-33a4-40c1-9430-3ac868ca5229/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2020-11-29 19:17:01,002 INFO L113 SettingsManager]: Loading preferences was successful [2020-11-29 19:17:01,003 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-11-29 19:17:01,004 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-11-29 19:17:01,004 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-11-29 19:17:01,004 INFO L138 SettingsManager]: * Use SBE=true [2020-11-29 19:17:01,005 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-11-29 19:17:01,005 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2020-11-29 19:17:01,005 INFO L138 SettingsManager]: * Use old map elimination=false [2020-11-29 19:17:01,005 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2020-11-29 19:17:01,005 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2020-11-29 19:17:01,006 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-11-29 19:17:01,006 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-11-29 19:17:01,006 INFO L138 SettingsManager]: * sizeof long=4 [2020-11-29 19:17:01,006 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-11-29 19:17:01,006 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-11-29 19:17:01,007 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-11-29 19:17:01,007 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-11-29 19:17:01,007 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2020-11-29 19:17:01,007 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2020-11-29 19:17:01,007 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2020-11-29 19:17:01,007 INFO L138 SettingsManager]: * sizeof long double=12 [2020-11-29 19:17:01,008 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-11-29 19:17:01,008 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-11-29 19:17:01,008 INFO L138 SettingsManager]: * Use constant arrays=true [2020-11-29 19:17:01,008 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2020-11-29 19:17:01,008 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-11-29 19:17:01,009 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-11-29 19:17:01,009 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-11-29 19:17:01,009 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-11-29 19:17:01,009 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-11-29 19:17:01,009 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-11-29 19:17:01,010 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2020-11-29 19:17:01,011 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2020-11-29 19:17:01,011 INFO L138 SettingsManager]: * TransformationType=MODULO_NEIGHBOR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud-vcloud-master/worker/run_dir_a79dd090-33a4-40c1-9430-3ac868ca5229/bin/uautomizer/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/run_dir_a79dd090-33a4-40c1-9430-3ac868ca5229/bin/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> e0ffc577d494a5308847d196b5326d78dd21a5a9 [2020-11-29 19:17:01,269 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-11-29 19:17:01,299 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-11-29 19:17:01,304 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-11-29 19:17:01,305 INFO L271 PluginConnector]: Initializing CDTParser... [2020-11-29 19:17:01,306 INFO L275 PluginConnector]: CDTParser initialized [2020-11-29 19:17:01,308 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_a79dd090-33a4-40c1-9430-3ac868ca5229/bin/uautomizer/../../sv-benchmarks/c/loops/invert_string-3.c [2020-11-29 19:17:01,388 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_a79dd090-33a4-40c1-9430-3ac868ca5229/bin/uautomizer/data/cefe978a2/d51a426068694cc59f6086c1d7425fe3/FLAG513f96f55 [2020-11-29 19:17:01,921 INFO L306 CDTParser]: Found 1 translation units. [2020-11-29 19:17:01,922 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_a79dd090-33a4-40c1-9430-3ac868ca5229/sv-benchmarks/c/loops/invert_string-3.c [2020-11-29 19:17:01,928 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_a79dd090-33a4-40c1-9430-3ac868ca5229/bin/uautomizer/data/cefe978a2/d51a426068694cc59f6086c1d7425fe3/FLAG513f96f55 [2020-11-29 19:17:02,305 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_a79dd090-33a4-40c1-9430-3ac868ca5229/bin/uautomizer/data/cefe978a2/d51a426068694cc59f6086c1d7425fe3 [2020-11-29 19:17:02,307 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-11-29 19:17:02,309 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-11-29 19:17:02,312 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-11-29 19:17:02,312 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-11-29 19:17:02,320 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-11-29 19:17:02,321 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 07:17:02" (1/1) ... [2020-11-29 19:17:02,323 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@78001495 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:17:02, skipping insertion in model container [2020-11-29 19:17:02,323 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 07:17:02" (1/1) ... [2020-11-29 19:17:02,335 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-11-29 19:17:02,357 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-11-29 19:17:02,576 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-29 19:17:02,586 INFO L203 MainTranslator]: Completed pre-run [2020-11-29 19:17:02,610 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-29 19:17:02,628 INFO L208 MainTranslator]: Completed translation [2020-11-29 19:17:02,628 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:17:02 WrapperNode [2020-11-29 19:17:02,628 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-11-29 19:17:02,630 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-11-29 19:17:02,630 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-11-29 19:17:02,630 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-11-29 19:17:02,640 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:17:02" (1/1) ... [2020-11-29 19:17:02,649 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:17:02" (1/1) ... [2020-11-29 19:17:02,674 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-11-29 19:17:02,675 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-11-29 19:17:02,675 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-11-29 19:17:02,675 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-11-29 19:17:02,686 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:17:02" (1/1) ... [2020-11-29 19:17:02,686 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:17:02" (1/1) ... [2020-11-29 19:17:02,689 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:17:02" (1/1) ... [2020-11-29 19:17:02,689 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:17:02" (1/1) ... [2020-11-29 19:17:02,697 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:17:02" (1/1) ... [2020-11-29 19:17:02,702 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:17:02" (1/1) ... [2020-11-29 19:17:02,703 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:17:02" (1/1) ... [2020-11-29 19:17:02,706 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-11-29 19:17:02,707 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-11-29 19:17:02,707 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-11-29 19:17:02,708 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-11-29 19:17:02,713 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:17:02" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a79dd090-33a4-40c1-9430-3ac868ca5229/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-29 19:17:02,816 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-11-29 19:17:02,817 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-11-29 19:17:02,817 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-11-29 19:17:02,818 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-11-29 19:17:02,818 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-11-29 19:17:02,818 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-11-29 19:17:02,818 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-11-29 19:17:03,204 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-11-29 19:17:03,206 INFO L298 CfgBuilder]: Removed 11 assume(true) statements. [2020-11-29 19:17:03,221 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 07:17:03 BoogieIcfgContainer [2020-11-29 19:17:03,222 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-11-29 19:17:03,223 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-11-29 19:17:03,223 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-11-29 19:17:03,227 INFO L275 PluginConnector]: BuchiAutomizer initialized [2020-11-29 19:17:03,243 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-11-29 19:17:03,243 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 29.11 07:17:02" (1/3) ... [2020-11-29 19:17:03,245 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@131dd121 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.11 07:17:03, skipping insertion in model container [2020-11-29 19:17:03,245 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-11-29 19:17:03,245 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:17:02" (2/3) ... [2020-11-29 19:17:03,245 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@131dd121 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.11 07:17:03, skipping insertion in model container [2020-11-29 19:17:03,246 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-11-29 19:17:03,246 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 07:17:03" (3/3) ... [2020-11-29 19:17:03,247 INFO L373 chiAutomizerObserver]: Analyzing ICFG invert_string-3.c [2020-11-29 19:17:03,333 INFO L359 BuchiCegarLoop]: Interprodecural is true [2020-11-29 19:17:03,333 INFO L360 BuchiCegarLoop]: Hoare is false [2020-11-29 19:17:03,333 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-11-29 19:17:03,333 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-11-29 19:17:03,333 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-11-29 19:17:03,334 INFO L364 BuchiCegarLoop]: Difference is false [2020-11-29 19:17:03,334 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-11-29 19:17:03,334 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-11-29 19:17:03,355 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states. [2020-11-29 19:17:03,381 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2020-11-29 19:17:03,381 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-29 19:17:03,382 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-29 19:17:03,389 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-11-29 19:17:03,389 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-11-29 19:17:03,389 INFO L427 BuchiCegarLoop]: ======== Iteration 1============ [2020-11-29 19:17:03,389 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states. [2020-11-29 19:17:03,393 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2020-11-29 19:17:03,394 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-29 19:17:03,394 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-29 19:17:03,395 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-11-29 19:17:03,396 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-11-29 19:17:03,404 INFO L794 eck$LassoCheckResult]: Stem: 11#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(18);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 10#L-1true havoc main_#res;havoc main_#t~nondet8, main_#t~post7, main_#t~mem10, main_#t~post11, main_#t~post9, main_#t~mem13, main_#t~mem14, main_#t~post15, main_#t~post12, main_~max~0, main_~#str1~0.base, main_~#str1~0.offset, main_~#str2~0.base, main_~#str2~0.offset, main_~i~0, main_~j~0;main_~max~0 := 5;call main_~#str1~0.base, main_~#str1~0.offset := #Ultimate.allocOnStack((if main_~max~0 % 4294967296 % 4294967296 <= 2147483647 then main_~max~0 % 4294967296 % 4294967296 else main_~max~0 % 4294967296 % 4294967296 - 4294967296));call main_~#str2~0.base, main_~#str2~0.offset := #Ultimate.allocOnStack((if main_~max~0 % 4294967296 % 4294967296 <= 2147483647 then main_~max~0 % 4294967296 % 4294967296 else main_~max~0 % 4294967296 % 4294967296 - 4294967296));havoc main_~i~0;havoc main_~j~0;main_~i~0 := 0; 3#L18-3true [2020-11-29 19:17:03,405 INFO L796 eck$LassoCheckResult]: Loop: 3#L18-3true assume !!(main_~i~0 % 4294967296 < main_~max~0 % 4294967296);call write~int(main_#t~nondet8, main_~#str1~0.base, main_~#str1~0.offset + main_~i~0, 1);havoc main_#t~nondet8; 4#L18-2true main_#t~post7 := main_~i~0;main_~i~0 := 1 + main_#t~post7;havoc main_#t~post7; 3#L18-3true [2020-11-29 19:17:03,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 19:17:03,421 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2020-11-29 19:17:03,443 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 19:17:03,444 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2089834640] [2020-11-29 19:17:03,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 19:17:03,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 19:17:03,649 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 19:17:03,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 19:17:03,705 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 19:17:03,737 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-29 19:17:03,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 19:17:03,742 INFO L82 PathProgramCache]: Analyzing trace with hash 1283, now seen corresponding path program 1 times [2020-11-29 19:17:03,742 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 19:17:03,743 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1700955691] [2020-11-29 19:17:03,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 19:17:03,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 19:17:03,763 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 19:17:03,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 19:17:03,772 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 19:17:03,776 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-29 19:17:03,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 19:17:03,778 INFO L82 PathProgramCache]: Analyzing trace with hash 925765, now seen corresponding path program 1 times [2020-11-29 19:17:03,778 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 19:17:03,778 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [3720251] [2020-11-29 19:17:03,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 19:17:03,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 19:17:03,814 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 19:17:03,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 19:17:03,842 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 19:17:03,849 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-29 19:17:04,033 WARN L193 SmtUtils]: Spent 124.00 ms on a formula simplification that was a NOOP. DAG size: 30 [2020-11-29 19:17:04,520 WARN L193 SmtUtils]: Spent 483.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 83 [2020-11-29 19:17:04,936 WARN L193 SmtUtils]: Spent 393.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 74 [2020-11-29 19:17:04,959 INFO L210 LassoAnalysis]: Preferences: [2020-11-29 19:17:04,959 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-11-29 19:17:04,960 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-11-29 19:17:04,960 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-11-29 19:17:04,960 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-11-29 19:17:04,960 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-29 19:17:04,960 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-11-29 19:17:04,961 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-11-29 19:17:04,961 INFO L133 ssoRankerPreferences]: Filename of dumped script: invert_string-3.c_Iteration1_Lasso [2020-11-29 19:17:04,961 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-11-29 19:17:04,961 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-11-29 19:17:04,999 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-29 19:17:05,013 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-29 19:17:05,020 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-29 19:17:05,029 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-29 19:17:05,033 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-29 19:17:05,037 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-29 19:17:05,374 WARN L193 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 57 [2020-11-29 19:17:05,430 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-29 19:17:05,433 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-29 19:17:05,436 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-29 19:17:05,443 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-29 19:17:05,449 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-29 19:17:05,452 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-29 19:17:05,459 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-29 19:17:05,463 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-29 19:17:05,467 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-29 19:17:05,470 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-29 19:17:06,049 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-11-29 19:17:06,056 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a79dd090-33a4-40c1-9430-3ac868ca5229/bin/uautomizer/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-11-29 19:17:06,063 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-11-29 19:17:06,066 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-29 19:17:06,066 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-11-29 19:17:06,067 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-29 19:17:06,067 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-29 19:17:06,067 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-29 19:17:06,074 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-11-29 19:17:06,075 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-11-29 19:17:06,079 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a79dd090-33a4-40c1-9430-3ac868ca5229/bin/uautomizer/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-11-29 19:17:06,129 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-11-29 19:17:06,131 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-29 19:17:06,131 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-29 19:17:06,132 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-29 19:17:06,132 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-29 19:17:06,136 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-11-29 19:17:06,136 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-29 19:17:06,141 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a79dd090-33a4-40c1-9430-3ac868ca5229/bin/uautomizer/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-11-29 19:17:06,185 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-11-29 19:17:06,187 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-29 19:17:06,187 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-29 19:17:06,188 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-29 19:17:06,188 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-29 19:17:06,192 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-11-29 19:17:06,192 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-29 19:17:06,210 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a79dd090-33a4-40c1-9430-3ac868ca5229/bin/uautomizer/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-29 19:17:06,241 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-11-29 19:17:06,244 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-29 19:17:06,244 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-11-29 19:17:06,244 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-29 19:17:06,244 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-29 19:17:06,244 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-29 19:17:06,245 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-11-29 19:17:06,245 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-11-29 19:17:06,251 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a79dd090-33a4-40c1-9430-3ac868ca5229/bin/uautomizer/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-29 19:17:06,284 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-11-29 19:17:06,285 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-29 19:17:06,285 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-11-29 19:17:06,286 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-29 19:17:06,286 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-29 19:17:06,286 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-29 19:17:06,287 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-11-29 19:17:06,287 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-11-29 19:17:06,289 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a79dd090-33a4-40c1-9430-3ac868ca5229/bin/uautomizer/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-29 19:17:06,318 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-11-29 19:17:06,320 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-29 19:17:06,320 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-29 19:17:06,320 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-29 19:17:06,320 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-29 19:17:06,324 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-11-29 19:17:06,324 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-11-29 19:17:06,331 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a79dd090-33a4-40c1-9430-3ac868ca5229/bin/uautomizer/z3 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-29 19:17:06,382 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-11-29 19:17:06,384 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-29 19:17:06,385 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-29 19:17:06,385 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-29 19:17:06,385 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-29 19:17:06,395 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-11-29 19:17:06,395 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-11-29 19:17:06,414 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a79dd090-33a4-40c1-9430-3ac868ca5229/bin/uautomizer/z3 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-11-29 19:17:06,461 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-11-29 19:17:06,463 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-29 19:17:06,463 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-11-29 19:17:06,464 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-29 19:17:06,464 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-29 19:17:06,464 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-29 19:17:06,465 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-11-29 19:17:06,465 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-29 19:17:06,467 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a79dd090-33a4-40c1-9430-3ac868ca5229/bin/uautomizer/z3 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-29 19:17:06,512 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-11-29 19:17:06,514 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-29 19:17:06,514 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-29 19:17:06,514 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-29 19:17:06,514 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-29 19:17:06,518 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-11-29 19:17:06,518 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-11-29 19:17:06,528 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a79dd090-33a4-40c1-9430-3ac868ca5229/bin/uautomizer/z3 Starting monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-11-29 19:17:06,573 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-11-29 19:17:06,575 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-29 19:17:06,575 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-29 19:17:06,575 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-29 19:17:06,576 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-29 19:17:06,579 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-11-29 19:17:06,580 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-29 19:17:06,585 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a79dd090-33a4-40c1-9430-3ac868ca5229/bin/uautomizer/z3 Starting monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-11-29 19:17:06,633 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-11-29 19:17:06,635 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-29 19:17:06,635 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-29 19:17:06,635 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-29 19:17:06,635 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-29 19:17:06,640 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-11-29 19:17:06,641 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-29 19:17:06,646 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a79dd090-33a4-40c1-9430-3ac868ca5229/bin/uautomizer/z3 Starting monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-11-29 19:17:06,695 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-11-29 19:17:06,698 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-29 19:17:06,698 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-29 19:17:06,698 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-29 19:17:06,698 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-29 19:17:06,707 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-11-29 19:17:06,708 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-29 19:17:06,716 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a79dd090-33a4-40c1-9430-3ac868ca5229/bin/uautomizer/z3 Starting monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-29 19:17:06,743 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-11-29 19:17:06,745 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-29 19:17:06,745 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-29 19:17:06,745 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-29 19:17:06,746 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-29 19:17:06,749 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-11-29 19:17:06,749 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-11-29 19:17:06,754 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a79dd090-33a4-40c1-9430-3ac868ca5229/bin/uautomizer/z3 Starting monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-29 19:17:06,801 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-11-29 19:17:06,803 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-29 19:17:06,803 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-29 19:17:06,803 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-29 19:17:06,803 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-29 19:17:06,809 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-11-29 19:17:06,809 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-11-29 19:17:06,820 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a79dd090-33a4-40c1-9430-3ac868ca5229/bin/uautomizer/z3 Starting monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-29 19:17:06,868 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-11-29 19:17:06,870 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-29 19:17:06,870 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-29 19:17:06,870 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-29 19:17:06,870 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-29 19:17:06,873 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-11-29 19:17:06,873 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-11-29 19:17:06,877 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a79dd090-33a4-40c1-9430-3ac868ca5229/bin/uautomizer/z3 Starting monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-29 19:17:06,926 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-11-29 19:17:06,928 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-29 19:17:06,928 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-11-29 19:17:06,928 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-29 19:17:06,928 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-29 19:17:06,929 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-29 19:17:06,929 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-11-29 19:17:06,929 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-11-29 19:17:06,931 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a79dd090-33a4-40c1-9430-3ac868ca5229/bin/uautomizer/z3 Starting monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-29 19:17:06,959 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-11-29 19:17:06,961 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-29 19:17:06,961 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-29 19:17:06,961 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-29 19:17:06,961 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-29 19:17:06,963 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-11-29 19:17:06,963 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-11-29 19:17:06,966 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a79dd090-33a4-40c1-9430-3ac868ca5229/bin/uautomizer/z3 Starting monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-29 19:17:06,992 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-11-29 19:17:06,993 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-29 19:17:06,994 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-29 19:17:06,994 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-29 19:17:06,994 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-29 19:17:06,997 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-11-29 19:17:06,997 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-11-29 19:17:07,018 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a79dd090-33a4-40c1-9430-3ac868ca5229/bin/uautomizer/z3 Starting monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-29 19:17:07,055 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-11-29 19:17:07,057 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-29 19:17:07,057 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-29 19:17:07,057 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-29 19:17:07,057 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-29 19:17:07,069 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-11-29 19:17:07,070 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-11-29 19:17:07,089 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-11-29 19:17:07,258 INFO L443 ModelExtractionUtils]: Simplification made 14 calls to the SMT solver. [2020-11-29 19:17:07,258 INFO L444 ModelExtractionUtils]: 3 out of 22 variables were initially zero. Simplification set additionally 15 variables to zero. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a79dd090-33a4-40c1-9430-3ac868ca5229/bin/uautomizer/z3 Starting monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-11-29 19:17:07,267 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... Waiting until toolchain timeout for monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-29 19:17:07,270 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2020-11-29 19:17:07,271 INFO L510 LassoAnalysis]: Proved termination. [2020-11-29 19:17:07,271 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0, v_rep(select #length ULTIMATE.start_main_~#str1~0.base)_1) = -1*ULTIMATE.start_main_~i~0 + 1*v_rep(select #length ULTIMATE.start_main_~#str1~0.base)_1 Supporting invariants [1*ULTIMATE.start_main_~#str1~0.offset >= 0] [2020-11-29 19:17:07,385 INFO L297 tatePredicateManager]: 16 out of 17 supporting invariants were superfluous and have been removed [2020-11-29 19:17:07,397 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-11-29 19:17:07,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 19:17:07,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:17:07,475 INFO L263 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 3 conjunts are in the unsatisfiable core [2020-11-29 19:17:07,476 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-29 19:17:07,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:17:07,498 INFO L263 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 5 conjunts are in the unsatisfiable core [2020-11-29 19:17:07,499 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-29 19:17:07,521 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 19:17:07,544 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2020-11-29 19:17:07,545 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 18 states. Second operand 3 states. [2020-11-29 19:17:07,640 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 18 states.. Second operand 3 states. Result 35 states and 49 transitions. Complement of second has 8 states. [2020-11-29 19:17:07,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2020-11-29 19:17:07,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-11-29 19:17:07,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 24 transitions. [2020-11-29 19:17:07,648 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 24 transitions. Stem has 2 letters. Loop has 2 letters. [2020-11-29 19:17:07,648 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-11-29 19:17:07,648 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 24 transitions. Stem has 4 letters. Loop has 2 letters. [2020-11-29 19:17:07,649 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-11-29 19:17:07,649 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 24 transitions. Stem has 2 letters. Loop has 4 letters. [2020-11-29 19:17:07,649 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-11-29 19:17:07,650 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 35 states and 49 transitions. [2020-11-29 19:17:07,660 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2020-11-29 19:17:07,664 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 35 states to 15 states and 20 transitions. [2020-11-29 19:17:07,666 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2020-11-29 19:17:07,666 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2020-11-29 19:17:07,667 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 20 transitions. [2020-11-29 19:17:07,669 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-11-29 19:17:07,669 INFO L691 BuchiCegarLoop]: Abstraction has 15 states and 20 transitions. [2020-11-29 19:17:07,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states and 20 transitions. [2020-11-29 19:17:07,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2020-11-29 19:17:07,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2020-11-29 19:17:07,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 20 transitions. [2020-11-29 19:17:07,704 INFO L714 BuchiCegarLoop]: Abstraction has 15 states and 20 transitions. [2020-11-29 19:17:07,704 INFO L594 BuchiCegarLoop]: Abstraction has 15 states and 20 transitions. [2020-11-29 19:17:07,704 INFO L427 BuchiCegarLoop]: ======== Iteration 2============ [2020-11-29 19:17:07,704 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 20 transitions. [2020-11-29 19:17:07,707 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2020-11-29 19:17:07,707 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-29 19:17:07,707 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-29 19:17:07,708 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2020-11-29 19:17:07,708 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-11-29 19:17:07,708 INFO L794 eck$LassoCheckResult]: Stem: 177#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(18);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 176#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~post7, main_#t~mem10, main_#t~post11, main_#t~post9, main_#t~mem13, main_#t~mem14, main_#t~post15, main_#t~post12, main_~max~0, main_~#str1~0.base, main_~#str1~0.offset, main_~#str2~0.base, main_~#str2~0.offset, main_~i~0, main_~j~0;main_~max~0 := 5;call main_~#str1~0.base, main_~#str1~0.offset := #Ultimate.allocOnStack((if main_~max~0 % 4294967296 % 4294967296 <= 2147483647 then main_~max~0 % 4294967296 % 4294967296 else main_~max~0 % 4294967296 % 4294967296 - 4294967296));call main_~#str2~0.base, main_~#str2~0.offset := #Ultimate.allocOnStack((if main_~max~0 % 4294967296 % 4294967296 <= 2147483647 then main_~max~0 % 4294967296 % 4294967296 else main_~max~0 % 4294967296 % 4294967296 - 4294967296));havoc main_~i~0;havoc main_~j~0;main_~i~0 := 0; 166#L18-3 assume !(main_~i~0 % 4294967296 < main_~max~0 % 4294967296); 167#L18-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); 179#L26-3 [2020-11-29 19:17:07,709 INFO L796 eck$LassoCheckResult]: Loop: 179#L26-3 assume !!(main_~i~0 >= 0);call main_#t~mem10 := read~int(main_~#str1~0.base, main_~#str1~0.offset + main_~i~0, 1);call write~int(main_#t~mem10, main_~#str2~0.base, main_~#str2~0.offset + main_~j~0, 1);havoc main_#t~mem10;main_#t~post11 := main_~j~0;main_~j~0 := 1 + main_#t~post11;havoc main_#t~post11; 180#L26-2 main_#t~post9 := main_~i~0;main_~i~0 := main_#t~post9 - 1;havoc main_#t~post9; 179#L26-3 [2020-11-29 19:17:07,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 19:17:07,710 INFO L82 PathProgramCache]: Analyzing trace with hash 925707, now seen corresponding path program 1 times [2020-11-29 19:17:07,710 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 19:17:07,711 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1302825239] [2020-11-29 19:17:07,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 19:17:07,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:17:08,030 WARN L193 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 22 [2020-11-29 19:17:08,046 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 19:17:08,047 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1302825239] [2020-11-29 19:17:08,048 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 19:17:08,048 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-29 19:17:08,048 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1876675100] [2020-11-29 19:17:08,052 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-11-29 19:17:08,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 19:17:08,053 INFO L82 PathProgramCache]: Analyzing trace with hash 1731, now seen corresponding path program 1 times [2020-11-29 19:17:08,053 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 19:17:08,053 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1976766660] [2020-11-29 19:17:08,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 19:17:08,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 19:17:08,065 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 19:17:08,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 19:17:08,071 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 19:17:08,074 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-29 19:17:08,152 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 19:17:08,154 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-29 19:17:08,155 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-29 19:17:08,156 INFO L87 Difference]: Start difference. First operand 15 states and 20 transitions. cyclomatic complexity: 8 Second operand 3 states. [2020-11-29 19:17:08,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 19:17:08,199 INFO L93 Difference]: Finished difference Result 15 states and 17 transitions. [2020-11-29 19:17:08,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-29 19:17:08,200 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 15 states and 17 transitions. [2020-11-29 19:17:08,201 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2020-11-29 19:17:08,202 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 15 states to 14 states and 16 transitions. [2020-11-29 19:17:08,202 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2020-11-29 19:17:08,202 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2020-11-29 19:17:08,202 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 16 transitions. [2020-11-29 19:17:08,202 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-11-29 19:17:08,202 INFO L691 BuchiCegarLoop]: Abstraction has 14 states and 16 transitions. [2020-11-29 19:17:08,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states and 16 transitions. [2020-11-29 19:17:08,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 13. [2020-11-29 19:17:08,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2020-11-29 19:17:08,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 15 transitions. [2020-11-29 19:17:08,204 INFO L714 BuchiCegarLoop]: Abstraction has 13 states and 15 transitions. [2020-11-29 19:17:08,204 INFO L594 BuchiCegarLoop]: Abstraction has 13 states and 15 transitions. [2020-11-29 19:17:08,204 INFO L427 BuchiCegarLoop]: ======== Iteration 3============ [2020-11-29 19:17:08,204 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 15 transitions. [2020-11-29 19:17:08,205 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2020-11-29 19:17:08,205 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-29 19:17:08,205 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-29 19:17:08,206 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2020-11-29 19:17:08,206 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-11-29 19:17:08,206 INFO L794 eck$LassoCheckResult]: Stem: 207#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(18);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 202#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~post7, main_#t~mem10, main_#t~post11, main_#t~post9, main_#t~mem13, main_#t~mem14, main_#t~post15, main_#t~post12, main_~max~0, main_~#str1~0.base, main_~#str1~0.offset, main_~#str2~0.base, main_~#str2~0.offset, main_~i~0, main_~j~0;main_~max~0 := 5;call main_~#str1~0.base, main_~#str1~0.offset := #Ultimate.allocOnStack((if main_~max~0 % 4294967296 % 4294967296 <= 2147483647 then main_~max~0 % 4294967296 % 4294967296 else main_~max~0 % 4294967296 % 4294967296 - 4294967296));call main_~#str2~0.base, main_~#str2~0.offset := #Ultimate.allocOnStack((if main_~max~0 % 4294967296 % 4294967296 <= 2147483647 then main_~max~0 % 4294967296 % 4294967296 else main_~max~0 % 4294967296 % 4294967296 - 4294967296));havoc main_~i~0;havoc main_~j~0;main_~i~0 := 0; 203#L18-3 assume !!(main_~i~0 % 4294967296 < main_~max~0 % 4294967296);call write~int(main_#t~nondet8, main_~#str1~0.base, main_~#str1~0.offset + main_~i~0, 1);havoc main_#t~nondet8; 204#L18-2 main_#t~post7 := main_~i~0;main_~i~0 := 1 + main_#t~post7;havoc main_#t~post7; 205#L18-3 assume !(main_~i~0 % 4294967296 < main_~max~0 % 4294967296); 206#L18-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); 212#L26-3 [2020-11-29 19:17:08,206 INFO L796 eck$LassoCheckResult]: Loop: 212#L26-3 assume !!(main_~i~0 >= 0);call main_#t~mem10 := read~int(main_~#str1~0.base, main_~#str1~0.offset + main_~i~0, 1);call write~int(main_#t~mem10, main_~#str2~0.base, main_~#str2~0.offset + main_~j~0, 1);havoc main_#t~mem10;main_#t~post11 := main_~j~0;main_~j~0 := 1 + main_#t~post11;havoc main_#t~post11; 213#L26-2 main_#t~post9 := main_~i~0;main_~i~0 := main_#t~post9 - 1;havoc main_#t~post9; 212#L26-3 [2020-11-29 19:17:08,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 19:17:08,207 INFO L82 PathProgramCache]: Analyzing trace with hash 889660429, now seen corresponding path program 1 times [2020-11-29 19:17:08,207 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 19:17:08,207 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1471824372] [2020-11-29 19:17:08,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 19:17:08,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:17:08,344 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 19:17:08,345 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1471824372] [2020-11-29 19:17:08,345 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [985217294] [2020-11-29 19:17:08,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a79dd090-33a4-40c1-9430-3ac868ca5229/bin/uautomizer/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-29 19:17:08,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:17:08,394 INFO L263 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 8 conjunts are in the unsatisfiable core [2020-11-29 19:17:08,395 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-29 19:17:08,451 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 19:17:08,451 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-29 19:17:08,451 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2020-11-29 19:17:08,452 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [383066165] [2020-11-29 19:17:08,452 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-11-29 19:17:08,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 19:17:08,453 INFO L82 PathProgramCache]: Analyzing trace with hash 1731, now seen corresponding path program 2 times [2020-11-29 19:17:08,453 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 19:17:08,453 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [626695736] [2020-11-29 19:17:08,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 19:17:08,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 19:17:08,468 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 19:17:08,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 19:17:08,477 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 19:17:08,483 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-29 19:17:08,558 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 19:17:08,559 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-29 19:17:08,559 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2020-11-29 19:17:08,559 INFO L87 Difference]: Start difference. First operand 13 states and 15 transitions. cyclomatic complexity: 5 Second operand 6 states. [2020-11-29 19:17:08,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 19:17:08,658 INFO L93 Difference]: Finished difference Result 16 states and 18 transitions. [2020-11-29 19:17:08,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-29 19:17:08,659 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 16 states and 18 transitions. [2020-11-29 19:17:08,660 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2020-11-29 19:17:08,661 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 16 states to 16 states and 18 transitions. [2020-11-29 19:17:08,661 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2020-11-29 19:17:08,661 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2020-11-29 19:17:08,662 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 18 transitions. [2020-11-29 19:17:08,662 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-11-29 19:17:08,662 INFO L691 BuchiCegarLoop]: Abstraction has 16 states and 18 transitions. [2020-11-29 19:17:08,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states and 18 transitions. [2020-11-29 19:17:08,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 15. [2020-11-29 19:17:08,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2020-11-29 19:17:08,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 17 transitions. [2020-11-29 19:17:08,664 INFO L714 BuchiCegarLoop]: Abstraction has 15 states and 17 transitions. [2020-11-29 19:17:08,664 INFO L594 BuchiCegarLoop]: Abstraction has 15 states and 17 transitions. [2020-11-29 19:17:08,664 INFO L427 BuchiCegarLoop]: ======== Iteration 4============ [2020-11-29 19:17:08,664 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 17 transitions. [2020-11-29 19:17:08,665 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2020-11-29 19:17:08,665 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-29 19:17:08,665 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-29 19:17:08,669 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1] [2020-11-29 19:17:08,669 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-11-29 19:17:08,669 INFO L794 eck$LassoCheckResult]: Stem: 260#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(18);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 255#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~post7, main_#t~mem10, main_#t~post11, main_#t~post9, main_#t~mem13, main_#t~mem14, main_#t~post15, main_#t~post12, main_~max~0, main_~#str1~0.base, main_~#str1~0.offset, main_~#str2~0.base, main_~#str2~0.offset, main_~i~0, main_~j~0;main_~max~0 := 5;call main_~#str1~0.base, main_~#str1~0.offset := #Ultimate.allocOnStack((if main_~max~0 % 4294967296 % 4294967296 <= 2147483647 then main_~max~0 % 4294967296 % 4294967296 else main_~max~0 % 4294967296 % 4294967296 - 4294967296));call main_~#str2~0.base, main_~#str2~0.offset := #Ultimate.allocOnStack((if main_~max~0 % 4294967296 % 4294967296 <= 2147483647 then main_~max~0 % 4294967296 % 4294967296 else main_~max~0 % 4294967296 % 4294967296 - 4294967296));havoc main_~i~0;havoc main_~j~0;main_~i~0 := 0; 256#L18-3 assume !!(main_~i~0 % 4294967296 < main_~max~0 % 4294967296);call write~int(main_#t~nondet8, main_~#str1~0.base, main_~#str1~0.offset + main_~i~0, 1);havoc main_#t~nondet8; 257#L18-2 main_#t~post7 := main_~i~0;main_~i~0 := 1 + main_#t~post7;havoc main_#t~post7; 258#L18-3 assume !!(main_~i~0 % 4294967296 < main_~max~0 % 4294967296);call write~int(main_#t~nondet8, main_~#str1~0.base, main_~#str1~0.offset + main_~i~0, 1);havoc main_#t~nondet8; 259#L18-2 main_#t~post7 := main_~i~0;main_~i~0 := 1 + main_#t~post7;havoc main_#t~post7; 269#L18-3 assume !(main_~i~0 % 4294967296 < main_~max~0 % 4294967296); 267#L18-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); 265#L26-3 [2020-11-29 19:17:08,670 INFO L796 eck$LassoCheckResult]: Loop: 265#L26-3 assume !!(main_~i~0 >= 0);call main_#t~mem10 := read~int(main_~#str1~0.base, main_~#str1~0.offset + main_~i~0, 1);call write~int(main_#t~mem10, main_~#str2~0.base, main_~#str2~0.offset + main_~j~0, 1);havoc main_#t~mem10;main_#t~post11 := main_~j~0;main_~j~0 := 1 + main_#t~post11;havoc main_#t~post11; 266#L26-2 main_#t~post9 := main_~i~0;main_~i~0 := main_#t~post9 - 1;havoc main_#t~post9; 265#L26-3 [2020-11-29 19:17:08,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 19:17:08,670 INFO L82 PathProgramCache]: Analyzing trace with hash 265236367, now seen corresponding path program 2 times [2020-11-29 19:17:08,671 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 19:17:08,671 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1730129139] [2020-11-29 19:17:08,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 19:17:08,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:17:08,905 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 19:17:08,905 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1730129139] [2020-11-29 19:17:08,905 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [144792003] [2020-11-29 19:17:08,906 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a79dd090-33a4-40c1-9430-3ac868ca5229/bin/uautomizer/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-29 19:17:08,969 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-11-29 19:17:08,969 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-11-29 19:17:08,970 INFO L263 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 9 conjunts are in the unsatisfiable core [2020-11-29 19:17:08,972 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-29 19:17:09,053 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 19:17:09,053 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-29 19:17:09,053 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 8 [2020-11-29 19:17:09,054 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [238912292] [2020-11-29 19:17:09,054 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-11-29 19:17:09,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 19:17:09,055 INFO L82 PathProgramCache]: Analyzing trace with hash 1731, now seen corresponding path program 3 times [2020-11-29 19:17:09,055 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 19:17:09,055 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2050636555] [2020-11-29 19:17:09,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 19:17:09,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 19:17:09,060 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 19:17:09,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 19:17:09,080 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 19:17:09,083 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-29 19:17:09,163 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 19:17:09,164 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-11-29 19:17:09,164 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2020-11-29 19:17:09,165 INFO L87 Difference]: Start difference. First operand 15 states and 17 transitions. cyclomatic complexity: 5 Second operand 8 states. [2020-11-29 19:17:09,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 19:17:09,271 INFO L93 Difference]: Finished difference Result 18 states and 20 transitions. [2020-11-29 19:17:09,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-29 19:17:09,272 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 18 states and 20 transitions. [2020-11-29 19:17:09,274 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2020-11-29 19:17:09,276 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 18 states to 18 states and 20 transitions. [2020-11-29 19:17:09,276 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2020-11-29 19:17:09,277 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2020-11-29 19:17:09,277 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 20 transitions. [2020-11-29 19:17:09,277 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-11-29 19:17:09,277 INFO L691 BuchiCegarLoop]: Abstraction has 18 states and 20 transitions. [2020-11-29 19:17:09,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 20 transitions. [2020-11-29 19:17:09,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 17. [2020-11-29 19:17:09,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2020-11-29 19:17:09,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 19 transitions. [2020-11-29 19:17:09,280 INFO L714 BuchiCegarLoop]: Abstraction has 17 states and 19 transitions. [2020-11-29 19:17:09,280 INFO L594 BuchiCegarLoop]: Abstraction has 17 states and 19 transitions. [2020-11-29 19:17:09,280 INFO L427 BuchiCegarLoop]: ======== Iteration 5============ [2020-11-29 19:17:09,280 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 19 transitions. [2020-11-29 19:17:09,281 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2020-11-29 19:17:09,281 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-29 19:17:09,282 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-29 19:17:09,282 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 1, 1, 1, 1] [2020-11-29 19:17:09,282 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-11-29 19:17:09,283 INFO L794 eck$LassoCheckResult]: Stem: 325#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(18);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 320#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~post7, main_#t~mem10, main_#t~post11, main_#t~post9, main_#t~mem13, main_#t~mem14, main_#t~post15, main_#t~post12, main_~max~0, main_~#str1~0.base, main_~#str1~0.offset, main_~#str2~0.base, main_~#str2~0.offset, main_~i~0, main_~j~0;main_~max~0 := 5;call main_~#str1~0.base, main_~#str1~0.offset := #Ultimate.allocOnStack((if main_~max~0 % 4294967296 % 4294967296 <= 2147483647 then main_~max~0 % 4294967296 % 4294967296 else main_~max~0 % 4294967296 % 4294967296 - 4294967296));call main_~#str2~0.base, main_~#str2~0.offset := #Ultimate.allocOnStack((if main_~max~0 % 4294967296 % 4294967296 <= 2147483647 then main_~max~0 % 4294967296 % 4294967296 else main_~max~0 % 4294967296 % 4294967296 - 4294967296));havoc main_~i~0;havoc main_~j~0;main_~i~0 := 0; 321#L18-3 assume !!(main_~i~0 % 4294967296 < main_~max~0 % 4294967296);call write~int(main_#t~nondet8, main_~#str1~0.base, main_~#str1~0.offset + main_~i~0, 1);havoc main_#t~nondet8; 322#L18-2 main_#t~post7 := main_~i~0;main_~i~0 := 1 + main_#t~post7;havoc main_#t~post7; 323#L18-3 assume !!(main_~i~0 % 4294967296 < main_~max~0 % 4294967296);call write~int(main_#t~nondet8, main_~#str1~0.base, main_~#str1~0.offset + main_~i~0, 1);havoc main_#t~nondet8; 324#L18-2 main_#t~post7 := main_~i~0;main_~i~0 := 1 + main_#t~post7;havoc main_#t~post7; 326#L18-3 assume !!(main_~i~0 % 4294967296 < main_~max~0 % 4294967296);call write~int(main_#t~nondet8, main_~#str1~0.base, main_~#str1~0.offset + main_~i~0, 1);havoc main_#t~nondet8; 336#L18-2 main_#t~post7 := main_~i~0;main_~i~0 := 1 + main_#t~post7;havoc main_#t~post7; 335#L18-3 assume !(main_~i~0 % 4294967296 < main_~max~0 % 4294967296); 333#L18-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); 331#L26-3 [2020-11-29 19:17:09,283 INFO L796 eck$LassoCheckResult]: Loop: 331#L26-3 assume !!(main_~i~0 >= 0);call main_#t~mem10 := read~int(main_~#str1~0.base, main_~#str1~0.offset + main_~i~0, 1);call write~int(main_#t~mem10, main_~#str2~0.base, main_~#str2~0.offset + main_~j~0, 1);havoc main_#t~mem10;main_#t~post11 := main_~j~0;main_~j~0 := 1 + main_#t~post11;havoc main_#t~post11; 332#L26-2 main_#t~post9 := main_~i~0;main_~i~0 := main_#t~post9 - 1;havoc main_#t~post9; 331#L26-3 [2020-11-29 19:17:09,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 19:17:09,284 INFO L82 PathProgramCache]: Analyzing trace with hash 1489134225, now seen corresponding path program 3 times [2020-11-29 19:17:09,284 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 19:17:09,284 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [300926125] [2020-11-29 19:17:09,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 19:17:09,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:17:09,522 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 19:17:09,522 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [300926125] [2020-11-29 19:17:09,523 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [611337427] [2020-11-29 19:17:09,523 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a79dd090-33a4-40c1-9430-3ac868ca5229/bin/uautomizer/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-29 19:17:09,588 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2020-11-29 19:17:09,588 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-11-29 19:17:09,590 INFO L263 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 11 conjunts are in the unsatisfiable core [2020-11-29 19:17:09,591 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-29 19:17:09,733 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 19:17:09,734 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-29 19:17:09,734 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 9 [2020-11-29 19:17:09,734 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [263920894] [2020-11-29 19:17:09,734 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-11-29 19:17:09,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 19:17:09,735 INFO L82 PathProgramCache]: Analyzing trace with hash 1731, now seen corresponding path program 4 times [2020-11-29 19:17:09,735 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 19:17:09,735 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1887056458] [2020-11-29 19:17:09,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 19:17:09,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 19:17:09,747 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 19:17:09,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 19:17:09,755 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 19:17:09,758 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-29 19:17:09,840 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 19:17:09,841 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-11-29 19:17:09,841 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2020-11-29 19:17:09,841 INFO L87 Difference]: Start difference. First operand 17 states and 19 transitions. cyclomatic complexity: 5 Second operand 9 states. [2020-11-29 19:17:09,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 19:17:09,983 INFO L93 Difference]: Finished difference Result 20 states and 22 transitions. [2020-11-29 19:17:09,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-29 19:17:09,984 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 20 states and 22 transitions. [2020-11-29 19:17:09,985 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2020-11-29 19:17:09,985 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 20 states to 20 states and 22 transitions. [2020-11-29 19:17:09,985 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2020-11-29 19:17:09,985 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2020-11-29 19:17:09,986 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 22 transitions. [2020-11-29 19:17:09,986 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-11-29 19:17:09,986 INFO L691 BuchiCegarLoop]: Abstraction has 20 states and 22 transitions. [2020-11-29 19:17:09,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 22 transitions. [2020-11-29 19:17:09,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 19. [2020-11-29 19:17:09,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2020-11-29 19:17:09,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 21 transitions. [2020-11-29 19:17:09,988 INFO L714 BuchiCegarLoop]: Abstraction has 19 states and 21 transitions. [2020-11-29 19:17:09,988 INFO L594 BuchiCegarLoop]: Abstraction has 19 states and 21 transitions. [2020-11-29 19:17:09,988 INFO L427 BuchiCegarLoop]: ======== Iteration 6============ [2020-11-29 19:17:09,988 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 21 transitions. [2020-11-29 19:17:09,989 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2020-11-29 19:17:09,989 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-29 19:17:09,989 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-29 19:17:09,994 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 1, 1, 1, 1] [2020-11-29 19:17:09,994 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-11-29 19:17:09,995 INFO L794 eck$LassoCheckResult]: Stem: 402#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(18);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 400#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~post7, main_#t~mem10, main_#t~post11, main_#t~post9, main_#t~mem13, main_#t~mem14, main_#t~post15, main_#t~post12, main_~max~0, main_~#str1~0.base, main_~#str1~0.offset, main_~#str2~0.base, main_~#str2~0.offset, main_~i~0, main_~j~0;main_~max~0 := 5;call main_~#str1~0.base, main_~#str1~0.offset := #Ultimate.allocOnStack((if main_~max~0 % 4294967296 % 4294967296 <= 2147483647 then main_~max~0 % 4294967296 % 4294967296 else main_~max~0 % 4294967296 % 4294967296 - 4294967296));call main_~#str2~0.base, main_~#str2~0.offset := #Ultimate.allocOnStack((if main_~max~0 % 4294967296 % 4294967296 <= 2147483647 then main_~max~0 % 4294967296 % 4294967296 else main_~max~0 % 4294967296 % 4294967296 - 4294967296));havoc main_~i~0;havoc main_~j~0;main_~i~0 := 0; 396#L18-3 assume !!(main_~i~0 % 4294967296 < main_~max~0 % 4294967296);call write~int(main_#t~nondet8, main_~#str1~0.base, main_~#str1~0.offset + main_~i~0, 1);havoc main_#t~nondet8; 397#L18-2 main_#t~post7 := main_~i~0;main_~i~0 := 1 + main_#t~post7;havoc main_#t~post7; 398#L18-3 assume !!(main_~i~0 % 4294967296 < main_~max~0 % 4294967296);call write~int(main_#t~nondet8, main_~#str1~0.base, main_~#str1~0.offset + main_~i~0, 1);havoc main_#t~nondet8; 399#L18-2 main_#t~post7 := main_~i~0;main_~i~0 := 1 + main_#t~post7;havoc main_#t~post7; 401#L18-3 assume !!(main_~i~0 % 4294967296 < main_~max~0 % 4294967296);call write~int(main_#t~nondet8, main_~#str1~0.base, main_~#str1~0.offset + main_~i~0, 1);havoc main_#t~nondet8; 414#L18-2 main_#t~post7 := main_~i~0;main_~i~0 := 1 + main_#t~post7;havoc main_#t~post7; 413#L18-3 assume !!(main_~i~0 % 4294967296 < main_~max~0 % 4294967296);call write~int(main_#t~nondet8, main_~#str1~0.base, main_~#str1~0.offset + main_~i~0, 1);havoc main_#t~nondet8; 412#L18-2 main_#t~post7 := main_~i~0;main_~i~0 := 1 + main_#t~post7;havoc main_#t~post7; 411#L18-3 assume !(main_~i~0 % 4294967296 < main_~max~0 % 4294967296); 409#L18-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); 407#L26-3 [2020-11-29 19:17:09,995 INFO L796 eck$LassoCheckResult]: Loop: 407#L26-3 assume !!(main_~i~0 >= 0);call main_#t~mem10 := read~int(main_~#str1~0.base, main_~#str1~0.offset + main_~i~0, 1);call write~int(main_#t~mem10, main_~#str2~0.base, main_~#str2~0.offset + main_~j~0, 1);havoc main_#t~mem10;main_#t~post11 := main_~j~0;main_~j~0 := 1 + main_#t~post11;havoc main_#t~post11; 408#L26-2 main_#t~post9 := main_~i~0;main_~i~0 := main_#t~post9 - 1;havoc main_#t~post9; 407#L26-3 [2020-11-29 19:17:09,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 19:17:09,996 INFO L82 PathProgramCache]: Analyzing trace with hash 833936659, now seen corresponding path program 4 times [2020-11-29 19:17:09,996 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 19:17:09,996 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [381353290] [2020-11-29 19:17:09,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 19:17:10,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:17:10,241 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 19:17:10,241 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [381353290] [2020-11-29 19:17:10,241 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [760126383] [2020-11-29 19:17:10,241 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a79dd090-33a4-40c1-9430-3ac868ca5229/bin/uautomizer/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-29 19:17:10,299 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2020-11-29 19:17:10,300 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-11-29 19:17:10,301 INFO L263 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 14 conjunts are in the unsatisfiable core [2020-11-29 19:17:10,302 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-29 19:17:10,411 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 19:17:10,411 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-29 19:17:10,411 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2020-11-29 19:17:10,412 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [389456372] [2020-11-29 19:17:10,412 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-11-29 19:17:10,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 19:17:10,412 INFO L82 PathProgramCache]: Analyzing trace with hash 1731, now seen corresponding path program 5 times [2020-11-29 19:17:10,413 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 19:17:10,413 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2086082187] [2020-11-29 19:17:10,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 19:17:10,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 19:17:10,417 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 19:17:10,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 19:17:10,430 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 19:17:10,432 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-29 19:17:10,499 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 19:17:10,499 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-11-29 19:17:10,500 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2020-11-29 19:17:10,500 INFO L87 Difference]: Start difference. First operand 19 states and 21 transitions. cyclomatic complexity: 5 Second operand 12 states. [2020-11-29 19:17:10,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 19:17:10,687 INFO L93 Difference]: Finished difference Result 22 states and 24 transitions. [2020-11-29 19:17:10,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-11-29 19:17:10,687 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 22 states and 24 transitions. [2020-11-29 19:17:10,688 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2020-11-29 19:17:10,689 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 22 states to 22 states and 24 transitions. [2020-11-29 19:17:10,689 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2020-11-29 19:17:10,689 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2020-11-29 19:17:10,689 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 24 transitions. [2020-11-29 19:17:10,689 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-11-29 19:17:10,689 INFO L691 BuchiCegarLoop]: Abstraction has 22 states and 24 transitions. [2020-11-29 19:17:10,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states and 24 transitions. [2020-11-29 19:17:10,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 21. [2020-11-29 19:17:10,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2020-11-29 19:17:10,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 23 transitions. [2020-11-29 19:17:10,692 INFO L714 BuchiCegarLoop]: Abstraction has 21 states and 23 transitions. [2020-11-29 19:17:10,692 INFO L594 BuchiCegarLoop]: Abstraction has 21 states and 23 transitions. [2020-11-29 19:17:10,692 INFO L427 BuchiCegarLoop]: ======== Iteration 7============ [2020-11-29 19:17:10,692 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 23 transitions. [2020-11-29 19:17:10,693 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2020-11-29 19:17:10,693 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-29 19:17:10,693 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-29 19:17:10,693 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 1, 1, 1, 1] [2020-11-29 19:17:10,693 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-11-29 19:17:10,694 INFO L794 eck$LassoCheckResult]: Stem: 490#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(18);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 485#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~post7, main_#t~mem10, main_#t~post11, main_#t~post9, main_#t~mem13, main_#t~mem14, main_#t~post15, main_#t~post12, main_~max~0, main_~#str1~0.base, main_~#str1~0.offset, main_~#str2~0.base, main_~#str2~0.offset, main_~i~0, main_~j~0;main_~max~0 := 5;call main_~#str1~0.base, main_~#str1~0.offset := #Ultimate.allocOnStack((if main_~max~0 % 4294967296 % 4294967296 <= 2147483647 then main_~max~0 % 4294967296 % 4294967296 else main_~max~0 % 4294967296 % 4294967296 - 4294967296));call main_~#str2~0.base, main_~#str2~0.offset := #Ultimate.allocOnStack((if main_~max~0 % 4294967296 % 4294967296 <= 2147483647 then main_~max~0 % 4294967296 % 4294967296 else main_~max~0 % 4294967296 % 4294967296 - 4294967296));havoc main_~i~0;havoc main_~j~0;main_~i~0 := 0; 486#L18-3 assume !!(main_~i~0 % 4294967296 < main_~max~0 % 4294967296);call write~int(main_#t~nondet8, main_~#str1~0.base, main_~#str1~0.offset + main_~i~0, 1);havoc main_#t~nondet8; 487#L18-2 main_#t~post7 := main_~i~0;main_~i~0 := 1 + main_#t~post7;havoc main_#t~post7; 488#L18-3 assume !!(main_~i~0 % 4294967296 < main_~max~0 % 4294967296);call write~int(main_#t~nondet8, main_~#str1~0.base, main_~#str1~0.offset + main_~i~0, 1);havoc main_#t~nondet8; 489#L18-2 main_#t~post7 := main_~i~0;main_~i~0 := 1 + main_#t~post7;havoc main_#t~post7; 491#L18-3 assume !!(main_~i~0 % 4294967296 < main_~max~0 % 4294967296);call write~int(main_#t~nondet8, main_~#str1~0.base, main_~#str1~0.offset + main_~i~0, 1);havoc main_#t~nondet8; 505#L18-2 main_#t~post7 := main_~i~0;main_~i~0 := 1 + main_#t~post7;havoc main_#t~post7; 504#L18-3 assume !!(main_~i~0 % 4294967296 < main_~max~0 % 4294967296);call write~int(main_#t~nondet8, main_~#str1~0.base, main_~#str1~0.offset + main_~i~0, 1);havoc main_#t~nondet8; 503#L18-2 main_#t~post7 := main_~i~0;main_~i~0 := 1 + main_#t~post7;havoc main_#t~post7; 502#L18-3 assume !!(main_~i~0 % 4294967296 < main_~max~0 % 4294967296);call write~int(main_#t~nondet8, main_~#str1~0.base, main_~#str1~0.offset + main_~i~0, 1);havoc main_#t~nondet8; 501#L18-2 main_#t~post7 := main_~i~0;main_~i~0 := 1 + main_#t~post7;havoc main_#t~post7; 500#L18-3 assume !(main_~i~0 % 4294967296 < main_~max~0 % 4294967296); 499#L18-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); 496#L26-3 [2020-11-29 19:17:10,694 INFO L796 eck$LassoCheckResult]: Loop: 496#L26-3 assume !!(main_~i~0 >= 0);call main_#t~mem10 := read~int(main_~#str1~0.base, main_~#str1~0.offset + main_~i~0, 1);call write~int(main_#t~mem10, main_~#str2~0.base, main_~#str2~0.offset + main_~j~0, 1);havoc main_#t~mem10;main_#t~post11 := main_~j~0;main_~j~0 := 1 + main_#t~post11;havoc main_#t~post11; 497#L26-2 main_#t~post9 := main_~i~0;main_~i~0 := main_#t~post9 - 1;havoc main_#t~post9; 496#L26-3 [2020-11-29 19:17:10,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 19:17:10,695 INFO L82 PathProgramCache]: Analyzing trace with hash -1745699051, now seen corresponding path program 5 times [2020-11-29 19:17:10,695 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 19:17:10,696 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [213962345] [2020-11-29 19:17:10,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 19:17:10,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 19:17:10,720 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 19:17:10,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 19:17:10,743 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 19:17:10,750 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-29 19:17:10,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 19:17:10,751 INFO L82 PathProgramCache]: Analyzing trace with hash 1731, now seen corresponding path program 6 times [2020-11-29 19:17:10,751 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 19:17:10,752 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [834310813] [2020-11-29 19:17:10,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 19:17:10,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 19:17:10,756 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 19:17:10,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 19:17:10,760 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 19:17:10,762 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-29 19:17:10,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 19:17:10,763 INFO L82 PathProgramCache]: Analyzing trace with hash 1715425495, now seen corresponding path program 1 times [2020-11-29 19:17:10,763 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 19:17:10,763 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [261153006] [2020-11-29 19:17:10,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 19:17:10,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 19:17:10,786 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 19:17:10,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 19:17:10,808 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 19:17:10,815 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-29 19:17:13,218 WARN L193 SmtUtils]: Spent 2.31 s on a formula simplification. DAG size of input: 193 DAG size of output: 156 [2020-11-29 19:17:13,250 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 19:17:14,640 WARN L193 SmtUtils]: Spent 1.31 s on a formula simplification. DAG size of input: 204 DAG size of output: 114 [2020-11-29 19:17:14,662 INFO L210 LassoAnalysis]: Preferences: [2020-11-29 19:17:14,662 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-11-29 19:17:14,662 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-11-29 19:17:14,662 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-11-29 19:17:14,662 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-11-29 19:17:14,662 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-29 19:17:14,663 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-11-29 19:17:14,663 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-11-29 19:17:14,663 INFO L133 ssoRankerPreferences]: Filename of dumped script: invert_string-3.c_Iteration7_Lasso [2020-11-29 19:17:14,663 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-11-29 19:17:14,663 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-11-29 19:17:14,667 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-29 19:17:14,676 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-29 19:17:14,680 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-29 19:17:15,123 WARN L193 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 70 [2020-11-29 19:17:15,180 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-29 19:17:15,183 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-29 19:17:15,186 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-29 19:17:15,190 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-29 19:17:15,192 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-29 19:17:15,205 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-29 19:17:15,207 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-29 19:17:15,210 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-29 19:17:15,212 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-29 19:17:15,240 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-29 19:17:15,244 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-29 19:17:15,248 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-29 19:17:15,454 WARN L193 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 55 [2020-11-29 19:17:15,814 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-11-29 19:17:15,815 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a79dd090-33a4-40c1-9430-3ac868ca5229/bin/uautomizer/z3 Starting monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-11-29 19:17:15,824 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-11-29 19:17:15,825 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-29 19:17:15,826 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-29 19:17:15,826 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-29 19:17:15,826 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-29 19:17:15,828 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-11-29 19:17:15,828 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-29 19:17:15,832 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a79dd090-33a4-40c1-9430-3ac868ca5229/bin/uautomizer/z3 Starting monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-11-29 19:17:15,871 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-11-29 19:17:15,873 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-29 19:17:15,873 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-11-29 19:17:15,873 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-29 19:17:15,873 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-29 19:17:15,873 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-29 19:17:15,874 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-11-29 19:17:15,874 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-29 19:17:15,877 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a79dd090-33a4-40c1-9430-3ac868ca5229/bin/uautomizer/z3 Starting monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-11-29 19:17:15,914 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-11-29 19:17:15,916 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-29 19:17:15,916 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-29 19:17:15,916 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-29 19:17:15,916 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-29 19:17:15,919 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-11-29 19:17:15,919 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-29 19:17:15,923 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a79dd090-33a4-40c1-9430-3ac868ca5229/bin/uautomizer/z3 Starting monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-11-29 19:17:15,961 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-11-29 19:17:15,964 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-29 19:17:15,964 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-29 19:17:15,964 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-29 19:17:15,964 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-29 19:17:15,977 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-11-29 19:17:15,978 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-29 19:17:15,982 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a79dd090-33a4-40c1-9430-3ac868ca5229/bin/uautomizer/z3 Starting monitored process 30 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-11-29 19:17:16,019 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-11-29 19:17:16,021 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-29 19:17:16,021 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-29 19:17:16,021 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-29 19:17:16,021 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-29 19:17:16,023 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-11-29 19:17:16,024 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 30 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-29 19:17:16,027 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a79dd090-33a4-40c1-9430-3ac868ca5229/bin/uautomizer/z3 Starting monitored process 31 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-11-29 19:17:16,066 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-11-29 19:17:16,070 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-29 19:17:16,070 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-29 19:17:16,070 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-29 19:17:16,070 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-29 19:17:16,087 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-11-29 19:17:16,087 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 31 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-29 19:17:16,105 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-11-29 19:17:16,148 INFO L443 ModelExtractionUtils]: Simplification made 12 calls to the SMT solver. [2020-11-29 19:17:16,148 INFO L444 ModelExtractionUtils]: 13 out of 28 variables were initially zero. Simplification set additionally 9 variables to zero. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a79dd090-33a4-40c1-9430-3ac868ca5229/bin/uautomizer/z3 Starting monitored process 32 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 32 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-29 19:17:16,151 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-11-29 19:17:16,153 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2020-11-29 19:17:16,154 INFO L510 LassoAnalysis]: Proved termination. [2020-11-29 19:17:16,154 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~j~0, v_rep(select #length ULTIMATE.start_main_~#str1~0.base)_2) = -1*ULTIMATE.start_main_~j~0 + 6442450943*v_rep(select #length ULTIMATE.start_main_~#str1~0.base)_2 Supporting invariants [-3*ULTIMATE.start_main_~i~0 - 2*ULTIMATE.start_main_~j~0 + 12884901885 >= 0] [2020-11-29 19:17:16,239 INFO L297 tatePredicateManager]: 16 out of 17 supporting invariants were superfluous and have been removed [2020-11-29 19:17:16,241 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-11-29 19:17:16,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 19:17:16,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:17:16,328 INFO L263 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 6 conjunts are in the unsatisfiable core [2020-11-29 19:17:16,329 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-29 19:17:16,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:17:16,351 WARN L261 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 9 conjunts are in the unsatisfiable core [2020-11-29 19:17:16,351 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-29 19:17:16,388 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 19:17:16,388 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 [2020-11-29 19:17:16,388 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 21 states and 23 transitions. cyclomatic complexity: 5 Second operand 4 states. [2020-11-29 19:17:16,467 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 21 states and 23 transitions. cyclomatic complexity: 5. Second operand 4 states. Result 26 states and 30 transitions. Complement of second has 7 states. [2020-11-29 19:17:16,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 1 non-accepting loop states 2 accepting loop states [2020-11-29 19:17:16,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-11-29 19:17:16,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 8 transitions. [2020-11-29 19:17:16,470 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 8 transitions. Stem has 14 letters. Loop has 2 letters. [2020-11-29 19:17:16,470 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-11-29 19:17:16,471 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2020-11-29 19:17:16,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 19:17:16,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:17:16,543 INFO L263 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 4 conjunts are in the unsatisfiable core [2020-11-29 19:17:16,545 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-29 19:17:16,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:17:16,556 WARN L261 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 9 conjunts are in the unsatisfiable core [2020-11-29 19:17:16,558 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-29 19:17:16,587 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 19:17:16,587 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 2 loop predicates [2020-11-29 19:17:16,587 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 21 states and 23 transitions. cyclomatic complexity: 5 Second operand 3 states. [2020-11-29 19:17:16,636 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 21 states and 23 transitions. cyclomatic complexity: 5. Second operand 3 states. Result 24 states and 29 transitions. Complement of second has 7 states. [2020-11-29 19:17:16,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2020-11-29 19:17:16,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-11-29 19:17:16,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 9 transitions. [2020-11-29 19:17:16,639 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 9 transitions. Stem has 14 letters. Loop has 2 letters. [2020-11-29 19:17:16,640 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-11-29 19:17:16,640 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 9 transitions. Stem has 16 letters. Loop has 2 letters. [2020-11-29 19:17:16,640 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-11-29 19:17:16,640 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 9 transitions. Stem has 14 letters. Loop has 4 letters. [2020-11-29 19:17:16,640 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-11-29 19:17:16,640 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 24 states and 29 transitions. [2020-11-29 19:17:16,641 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-11-29 19:17:16,642 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 24 states to 22 states and 25 transitions. [2020-11-29 19:17:16,642 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2020-11-29 19:17:16,642 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2020-11-29 19:17:16,642 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 25 transitions. [2020-11-29 19:17:16,642 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-11-29 19:17:16,642 INFO L691 BuchiCegarLoop]: Abstraction has 22 states and 25 transitions. [2020-11-29 19:17:16,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states and 25 transitions. [2020-11-29 19:17:16,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2020-11-29 19:17:16,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2020-11-29 19:17:16,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 25 transitions. [2020-11-29 19:17:16,644 INFO L714 BuchiCegarLoop]: Abstraction has 22 states and 25 transitions. [2020-11-29 19:17:16,644 INFO L594 BuchiCegarLoop]: Abstraction has 22 states and 25 transitions. [2020-11-29 19:17:16,645 INFO L427 BuchiCegarLoop]: ======== Iteration 8============ [2020-11-29 19:17:16,645 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 25 transitions. [2020-11-29 19:17:16,645 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-11-29 19:17:16,645 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-29 19:17:16,645 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-29 19:17:16,648 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 1, 1, 1, 1, 1, 1] [2020-11-29 19:17:16,648 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-11-29 19:17:16,649 INFO L794 eck$LassoCheckResult]: Stem: 770#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(18);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 769#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~post7, main_#t~mem10, main_#t~post11, main_#t~post9, main_#t~mem13, main_#t~mem14, main_#t~post15, main_#t~post12, main_~max~0, main_~#str1~0.base, main_~#str1~0.offset, main_~#str2~0.base, main_~#str2~0.offset, main_~i~0, main_~j~0;main_~max~0 := 5;call main_~#str1~0.base, main_~#str1~0.offset := #Ultimate.allocOnStack((if main_~max~0 % 4294967296 % 4294967296 <= 2147483647 then main_~max~0 % 4294967296 % 4294967296 else main_~max~0 % 4294967296 % 4294967296 - 4294967296));call main_~#str2~0.base, main_~#str2~0.offset := #Ultimate.allocOnStack((if main_~max~0 % 4294967296 % 4294967296 <= 2147483647 then main_~max~0 % 4294967296 % 4294967296 else main_~max~0 % 4294967296 % 4294967296 - 4294967296));havoc main_~i~0;havoc main_~j~0;main_~i~0 := 0; 765#L18-3 assume !!(main_~i~0 % 4294967296 < main_~max~0 % 4294967296);call write~int(main_#t~nondet8, main_~#str1~0.base, main_~#str1~0.offset + main_~i~0, 1);havoc main_#t~nondet8; 766#L18-2 main_#t~post7 := main_~i~0;main_~i~0 := 1 + main_#t~post7;havoc main_#t~post7; 767#L18-3 assume !!(main_~i~0 % 4294967296 < main_~max~0 % 4294967296);call write~int(main_#t~nondet8, main_~#str1~0.base, main_~#str1~0.offset + main_~i~0, 1);havoc main_#t~nondet8; 768#L18-2 main_#t~post7 := main_~i~0;main_~i~0 := 1 + main_#t~post7;havoc main_#t~post7; 786#L18-3 assume !!(main_~i~0 % 4294967296 < main_~max~0 % 4294967296);call write~int(main_#t~nondet8, main_~#str1~0.base, main_~#str1~0.offset + main_~i~0, 1);havoc main_#t~nondet8; 785#L18-2 main_#t~post7 := main_~i~0;main_~i~0 := 1 + main_#t~post7;havoc main_#t~post7; 784#L18-3 assume !!(main_~i~0 % 4294967296 < main_~max~0 % 4294967296);call write~int(main_#t~nondet8, main_~#str1~0.base, main_~#str1~0.offset + main_~i~0, 1);havoc main_#t~nondet8; 783#L18-2 main_#t~post7 := main_~i~0;main_~i~0 := 1 + main_#t~post7;havoc main_#t~post7; 782#L18-3 assume !!(main_~i~0 % 4294967296 < main_~max~0 % 4294967296);call write~int(main_#t~nondet8, main_~#str1~0.base, main_~#str1~0.offset + main_~i~0, 1);havoc main_#t~nondet8; 781#L18-2 main_#t~post7 := main_~i~0;main_~i~0 := 1 + main_#t~post7;havoc main_#t~post7; 780#L18-3 assume !(main_~i~0 % 4294967296 < main_~max~0 % 4294967296); 778#L18-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); 775#L26-3 assume !(main_~i~0 >= 0); 771#L26-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; 772#L32-3 [2020-11-29 19:17:16,657 INFO L796 eck$LassoCheckResult]: Loop: 772#L32-3 assume !!(main_~i~0 % 4294967296 < main_~max~0 % 4294967296);call main_#t~mem13 := read~int(main_~#str1~0.base, main_~#str1~0.offset + main_~i~0, 1);call main_#t~mem14 := read~int(main_~#str2~0.base, main_~#str2~0.offset + main_~j~0, 1);__VERIFIER_assert_#in~cond := (if main_#t~mem13 == main_#t~mem14 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 773#L6 assume !(0 == __VERIFIER_assert_~cond); 774#L6-2 havoc main_#t~mem13;havoc main_#t~mem14;main_#t~post15 := main_~j~0;main_~j~0 := main_#t~post15 - 1;havoc main_#t~post15; 779#L32-2 main_#t~post12 := main_~i~0;main_~i~0 := 1 + main_#t~post12;havoc main_#t~post12; 772#L32-3 [2020-11-29 19:17:16,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 19:17:16,658 INFO L82 PathProgramCache]: Analyzing trace with hash 1715425437, now seen corresponding path program 1 times [2020-11-29 19:17:16,658 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 19:17:16,658 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1561736778] [2020-11-29 19:17:16,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 19:17:16,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:17:16,766 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2020-11-29 19:17:16,766 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1561736778] [2020-11-29 19:17:16,766 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 19:17:16,766 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-29 19:17:16,766 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [212840305] [2020-11-29 19:17:16,766 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-11-29 19:17:16,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 19:17:16,767 INFO L82 PathProgramCache]: Analyzing trace with hash 2102348, now seen corresponding path program 1 times [2020-11-29 19:17:16,767 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 19:17:16,767 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1928125677] [2020-11-29 19:17:16,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 19:17:16,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 19:17:16,772 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 19:17:16,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 19:17:16,784 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 19:17:16,788 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-29 19:17:16,964 WARN L193 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 47 [2020-11-29 19:17:16,965 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 19:17:16,965 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-29 19:17:16,965 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-29 19:17:16,966 INFO L87 Difference]: Start difference. First operand 22 states and 25 transitions. cyclomatic complexity: 6 Second operand 4 states. [2020-11-29 19:17:17,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 19:17:17,003 INFO L93 Difference]: Finished difference Result 22 states and 24 transitions. [2020-11-29 19:17:17,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-29 19:17:17,003 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 22 states and 24 transitions. [2020-11-29 19:17:17,004 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-11-29 19:17:17,004 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 22 states to 22 states and 24 transitions. [2020-11-29 19:17:17,004 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2020-11-29 19:17:17,004 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2020-11-29 19:17:17,004 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 24 transitions. [2020-11-29 19:17:17,005 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-11-29 19:17:17,005 INFO L691 BuchiCegarLoop]: Abstraction has 22 states and 24 transitions. [2020-11-29 19:17:17,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states and 24 transitions. [2020-11-29 19:17:17,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2020-11-29 19:17:17,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2020-11-29 19:17:17,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 24 transitions. [2020-11-29 19:17:17,007 INFO L714 BuchiCegarLoop]: Abstraction has 22 states and 24 transitions. [2020-11-29 19:17:17,007 INFO L594 BuchiCegarLoop]: Abstraction has 22 states and 24 transitions. [2020-11-29 19:17:17,007 INFO L427 BuchiCegarLoop]: ======== Iteration 9============ [2020-11-29 19:17:17,007 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 24 transitions. [2020-11-29 19:17:17,007 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-11-29 19:17:17,008 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-29 19:17:17,008 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-29 19:17:17,008 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 19:17:17,008 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-11-29 19:17:17,008 INFO L794 eck$LassoCheckResult]: Stem: 823#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(18);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 822#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~post7, main_#t~mem10, main_#t~post11, main_#t~post9, main_#t~mem13, main_#t~mem14, main_#t~post15, main_#t~post12, main_~max~0, main_~#str1~0.base, main_~#str1~0.offset, main_~#str2~0.base, main_~#str2~0.offset, main_~i~0, main_~j~0;main_~max~0 := 5;call main_~#str1~0.base, main_~#str1~0.offset := #Ultimate.allocOnStack((if main_~max~0 % 4294967296 % 4294967296 <= 2147483647 then main_~max~0 % 4294967296 % 4294967296 else main_~max~0 % 4294967296 % 4294967296 - 4294967296));call main_~#str2~0.base, main_~#str2~0.offset := #Ultimate.allocOnStack((if main_~max~0 % 4294967296 % 4294967296 <= 2147483647 then main_~max~0 % 4294967296 % 4294967296 else main_~max~0 % 4294967296 % 4294967296 - 4294967296));havoc main_~i~0;havoc main_~j~0;main_~i~0 := 0; 818#L18-3 assume !!(main_~i~0 % 4294967296 < main_~max~0 % 4294967296);call write~int(main_#t~nondet8, main_~#str1~0.base, main_~#str1~0.offset + main_~i~0, 1);havoc main_#t~nondet8; 819#L18-2 main_#t~post7 := main_~i~0;main_~i~0 := 1 + main_#t~post7;havoc main_#t~post7; 820#L18-3 assume !!(main_~i~0 % 4294967296 < main_~max~0 % 4294967296);call write~int(main_#t~nondet8, main_~#str1~0.base, main_~#str1~0.offset + main_~i~0, 1);havoc main_#t~nondet8; 821#L18-2 main_#t~post7 := main_~i~0;main_~i~0 := 1 + main_#t~post7;havoc main_#t~post7; 839#L18-3 assume !!(main_~i~0 % 4294967296 < main_~max~0 % 4294967296);call write~int(main_#t~nondet8, main_~#str1~0.base, main_~#str1~0.offset + main_~i~0, 1);havoc main_#t~nondet8; 838#L18-2 main_#t~post7 := main_~i~0;main_~i~0 := 1 + main_#t~post7;havoc main_#t~post7; 837#L18-3 assume !!(main_~i~0 % 4294967296 < main_~max~0 % 4294967296);call write~int(main_#t~nondet8, main_~#str1~0.base, main_~#str1~0.offset + main_~i~0, 1);havoc main_#t~nondet8; 836#L18-2 main_#t~post7 := main_~i~0;main_~i~0 := 1 + main_#t~post7;havoc main_#t~post7; 835#L18-3 assume !!(main_~i~0 % 4294967296 < main_~max~0 % 4294967296);call write~int(main_#t~nondet8, main_~#str1~0.base, main_~#str1~0.offset + main_~i~0, 1);havoc main_#t~nondet8; 834#L18-2 main_#t~post7 := main_~i~0;main_~i~0 := 1 + main_#t~post7;havoc main_#t~post7; 833#L18-3 assume !(main_~i~0 % 4294967296 < main_~max~0 % 4294967296); 831#L18-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); 828#L26-3 assume !!(main_~i~0 >= 0);call main_#t~mem10 := read~int(main_~#str1~0.base, main_~#str1~0.offset + main_~i~0, 1);call write~int(main_#t~mem10, main_~#str2~0.base, main_~#str2~0.offset + main_~j~0, 1);havoc main_#t~mem10;main_#t~post11 := main_~j~0;main_~j~0 := 1 + main_#t~post11;havoc main_#t~post11; 829#L26-2 main_#t~post9 := main_~i~0;main_~i~0 := main_#t~post9 - 1;havoc main_#t~post9; 830#L26-3 assume !(main_~i~0 >= 0); 824#L26-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; 825#L32-3 [2020-11-29 19:17:17,009 INFO L796 eck$LassoCheckResult]: Loop: 825#L32-3 assume !!(main_~i~0 % 4294967296 < main_~max~0 % 4294967296);call main_#t~mem13 := read~int(main_~#str1~0.base, main_~#str1~0.offset + main_~i~0, 1);call main_#t~mem14 := read~int(main_~#str2~0.base, main_~#str2~0.offset + main_~j~0, 1);__VERIFIER_assert_#in~cond := (if main_#t~mem13 == main_#t~mem14 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 826#L6 assume !(0 == __VERIFIER_assert_~cond); 827#L6-2 havoc main_#t~mem13;havoc main_#t~mem14;main_#t~post15 := main_~j~0;main_~j~0 := main_#t~post15 - 1;havoc main_#t~post15; 832#L32-2 main_#t~post12 := main_~i~0;main_~i~0 := 1 + main_#t~post12;havoc main_#t~post12; 825#L32-3 [2020-11-29 19:17:17,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 19:17:17,009 INFO L82 PathProgramCache]: Analyzing trace with hash -743540257, now seen corresponding path program 1 times [2020-11-29 19:17:17,009 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 19:17:17,009 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [270882373] [2020-11-29 19:17:17,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 19:17:17,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:17:17,097 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2020-11-29 19:17:17,097 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [270882373] [2020-11-29 19:17:17,097 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1012861633] [2020-11-29 19:17:17,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a79dd090-33a4-40c1-9430-3ac868ca5229/bin/uautomizer/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-29 19:17:17,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:17:17,164 INFO L263 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 8 conjunts are in the unsatisfiable core [2020-11-29 19:17:17,165 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-29 19:17:17,207 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2020-11-29 19:17:17,207 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-29 19:17:17,207 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2020-11-29 19:17:17,208 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1227020972] [2020-11-29 19:17:17,208 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-11-29 19:17:17,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 19:17:17,208 INFO L82 PathProgramCache]: Analyzing trace with hash 2102348, now seen corresponding path program 2 times [2020-11-29 19:17:17,209 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 19:17:17,209 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1372824345] [2020-11-29 19:17:17,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 19:17:17,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 19:17:17,215 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 19:17:17,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 19:17:17,220 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 19:17:17,223 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-29 19:17:17,361 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 19:17:17,362 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-11-29 19:17:17,362 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2020-11-29 19:17:17,362 INFO L87 Difference]: Start difference. First operand 22 states and 24 transitions. cyclomatic complexity: 5 Second operand 8 states. [2020-11-29 19:17:17,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 19:17:17,526 INFO L93 Difference]: Finished difference Result 25 states and 27 transitions. [2020-11-29 19:17:17,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-29 19:17:17,527 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 25 states and 27 transitions. [2020-11-29 19:17:17,528 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-11-29 19:17:17,528 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 25 states to 25 states and 27 transitions. [2020-11-29 19:17:17,528 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2020-11-29 19:17:17,528 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2020-11-29 19:17:17,528 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25 states and 27 transitions. [2020-11-29 19:17:17,529 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-11-29 19:17:17,529 INFO L691 BuchiCegarLoop]: Abstraction has 25 states and 27 transitions. [2020-11-29 19:17:17,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states and 27 transitions. [2020-11-29 19:17:17,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 24. [2020-11-29 19:17:17,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2020-11-29 19:17:17,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 26 transitions. [2020-11-29 19:17:17,531 INFO L714 BuchiCegarLoop]: Abstraction has 24 states and 26 transitions. [2020-11-29 19:17:17,531 INFO L594 BuchiCegarLoop]: Abstraction has 24 states and 26 transitions. [2020-11-29 19:17:17,531 INFO L427 BuchiCegarLoop]: ======== Iteration 10============ [2020-11-29 19:17:17,531 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 26 transitions. [2020-11-29 19:17:17,532 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-11-29 19:17:17,532 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-29 19:17:17,532 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-29 19:17:17,532 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 2, 2, 1, 1, 1, 1, 1, 1] [2020-11-29 19:17:17,532 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-11-29 19:17:17,534 INFO L794 eck$LassoCheckResult]: Stem: 938#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(18);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 933#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~post7, main_#t~mem10, main_#t~post11, main_#t~post9, main_#t~mem13, main_#t~mem14, main_#t~post15, main_#t~post12, main_~max~0, main_~#str1~0.base, main_~#str1~0.offset, main_~#str2~0.base, main_~#str2~0.offset, main_~i~0, main_~j~0;main_~max~0 := 5;call main_~#str1~0.base, main_~#str1~0.offset := #Ultimate.allocOnStack((if main_~max~0 % 4294967296 % 4294967296 <= 2147483647 then main_~max~0 % 4294967296 % 4294967296 else main_~max~0 % 4294967296 % 4294967296 - 4294967296));call main_~#str2~0.base, main_~#str2~0.offset := #Ultimate.allocOnStack((if main_~max~0 % 4294967296 % 4294967296 <= 2147483647 then main_~max~0 % 4294967296 % 4294967296 else main_~max~0 % 4294967296 % 4294967296 - 4294967296));havoc main_~i~0;havoc main_~j~0;main_~i~0 := 0; 934#L18-3 assume !!(main_~i~0 % 4294967296 < main_~max~0 % 4294967296);call write~int(main_#t~nondet8, main_~#str1~0.base, main_~#str1~0.offset + main_~i~0, 1);havoc main_#t~nondet8; 935#L18-2 main_#t~post7 := main_~i~0;main_~i~0 := 1 + main_#t~post7;havoc main_#t~post7; 936#L18-3 assume !!(main_~i~0 % 4294967296 < main_~max~0 % 4294967296);call write~int(main_#t~nondet8, main_~#str1~0.base, main_~#str1~0.offset + main_~i~0, 1);havoc main_#t~nondet8; 937#L18-2 main_#t~post7 := main_~i~0;main_~i~0 := 1 + main_#t~post7;havoc main_#t~post7; 956#L18-3 assume !!(main_~i~0 % 4294967296 < main_~max~0 % 4294967296);call write~int(main_#t~nondet8, main_~#str1~0.base, main_~#str1~0.offset + main_~i~0, 1);havoc main_#t~nondet8; 955#L18-2 main_#t~post7 := main_~i~0;main_~i~0 := 1 + main_#t~post7;havoc main_#t~post7; 954#L18-3 assume !!(main_~i~0 % 4294967296 < main_~max~0 % 4294967296);call write~int(main_#t~nondet8, main_~#str1~0.base, main_~#str1~0.offset + main_~i~0, 1);havoc main_#t~nondet8; 953#L18-2 main_#t~post7 := main_~i~0;main_~i~0 := 1 + main_#t~post7;havoc main_#t~post7; 952#L18-3 assume !!(main_~i~0 % 4294967296 < main_~max~0 % 4294967296);call write~int(main_#t~nondet8, main_~#str1~0.base, main_~#str1~0.offset + main_~i~0, 1);havoc main_#t~nondet8; 951#L18-2 main_#t~post7 := main_~i~0;main_~i~0 := 1 + main_#t~post7;havoc main_#t~post7; 950#L18-3 assume !(main_~i~0 % 4294967296 < main_~max~0 % 4294967296); 947#L18-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); 943#L26-3 assume !!(main_~i~0 >= 0);call main_#t~mem10 := read~int(main_~#str1~0.base, main_~#str1~0.offset + main_~i~0, 1);call write~int(main_#t~mem10, main_~#str2~0.base, main_~#str2~0.offset + main_~j~0, 1);havoc main_#t~mem10;main_#t~post11 := main_~j~0;main_~j~0 := 1 + main_#t~post11;havoc main_#t~post11; 944#L26-2 main_#t~post9 := main_~i~0;main_~i~0 := main_#t~post9 - 1;havoc main_#t~post9; 945#L26-3 assume !!(main_~i~0 >= 0);call main_#t~mem10 := read~int(main_~#str1~0.base, main_~#str1~0.offset + main_~i~0, 1);call write~int(main_#t~mem10, main_~#str2~0.base, main_~#str2~0.offset + main_~j~0, 1);havoc main_#t~mem10;main_#t~post11 := main_~j~0;main_~j~0 := 1 + main_#t~post11;havoc main_#t~post11; 946#L26-2 main_#t~post9 := main_~i~0;main_~i~0 := main_#t~post9 - 1;havoc main_#t~post9; 949#L26-3 assume !(main_~i~0 >= 0); 939#L26-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; 940#L32-3 [2020-11-29 19:17:17,534 INFO L796 eck$LassoCheckResult]: Loop: 940#L32-3 assume !!(main_~i~0 % 4294967296 < main_~max~0 % 4294967296);call main_#t~mem13 := read~int(main_~#str1~0.base, main_~#str1~0.offset + main_~i~0, 1);call main_#t~mem14 := read~int(main_~#str2~0.base, main_~#str2~0.offset + main_~j~0, 1);__VERIFIER_assert_#in~cond := (if main_#t~mem13 == main_#t~mem14 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 941#L6 assume !(0 == __VERIFIER_assert_~cond); 942#L6-2 havoc main_#t~mem13;havoc main_#t~mem14;main_#t~post15 := main_~j~0;main_~j~0 := main_#t~post15 - 1;havoc main_#t~post15; 948#L32-2 main_#t~post12 := main_~i~0;main_~i~0 := 1 + main_#t~post12;havoc main_#t~post12; 940#L32-3 [2020-11-29 19:17:17,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 19:17:17,535 INFO L82 PathProgramCache]: Analyzing trace with hash -1577559391, now seen corresponding path program 2 times [2020-11-29 19:17:17,535 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 19:17:17,535 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1797272143] [2020-11-29 19:17:17,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 19:17:17,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:17:17,706 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2020-11-29 19:17:17,706 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1797272143] [2020-11-29 19:17:17,707 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [842838419] [2020-11-29 19:17:17,707 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a79dd090-33a4-40c1-9430-3ac868ca5229/bin/uautomizer/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-29 19:17:17,781 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-11-29 19:17:17,781 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-11-29 19:17:17,782 INFO L263 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 11 conjunts are in the unsatisfiable core [2020-11-29 19:17:17,784 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-29 19:17:17,883 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2020-11-29 19:17:17,883 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-29 19:17:17,883 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 10 [2020-11-29 19:17:17,883 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1248602473] [2020-11-29 19:17:17,884 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-11-29 19:17:17,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 19:17:17,884 INFO L82 PathProgramCache]: Analyzing trace with hash 2102348, now seen corresponding path program 3 times [2020-11-29 19:17:17,884 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 19:17:17,884 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1019678760] [2020-11-29 19:17:17,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 19:17:17,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 19:17:17,889 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 19:17:17,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 19:17:17,905 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 19:17:17,907 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-29 19:17:18,073 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 19:17:18,073 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-11-29 19:17:18,074 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2020-11-29 19:17:18,074 INFO L87 Difference]: Start difference. First operand 24 states and 26 transitions. cyclomatic complexity: 5 Second operand 10 states. [2020-11-29 19:17:18,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 19:17:18,173 INFO L93 Difference]: Finished difference Result 27 states and 29 transitions. [2020-11-29 19:17:18,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-11-29 19:17:18,174 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 27 states and 29 transitions. [2020-11-29 19:17:18,174 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-11-29 19:17:18,175 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 27 states to 27 states and 29 transitions. [2020-11-29 19:17:18,175 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2020-11-29 19:17:18,175 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2020-11-29 19:17:18,175 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 29 transitions. [2020-11-29 19:17:18,175 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-11-29 19:17:18,175 INFO L691 BuchiCegarLoop]: Abstraction has 27 states and 29 transitions. [2020-11-29 19:17:18,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states and 29 transitions. [2020-11-29 19:17:18,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 26. [2020-11-29 19:17:18,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2020-11-29 19:17:18,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 28 transitions. [2020-11-29 19:17:18,178 INFO L714 BuchiCegarLoop]: Abstraction has 26 states and 28 transitions. [2020-11-29 19:17:18,179 INFO L594 BuchiCegarLoop]: Abstraction has 26 states and 28 transitions. [2020-11-29 19:17:18,179 INFO L427 BuchiCegarLoop]: ======== Iteration 11============ [2020-11-29 19:17:18,179 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 26 states and 28 transitions. [2020-11-29 19:17:18,179 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-11-29 19:17:18,180 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-29 19:17:18,180 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-29 19:17:18,180 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 3, 3, 1, 1, 1, 1, 1, 1] [2020-11-29 19:17:18,181 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-11-29 19:17:18,181 INFO L794 eck$LassoCheckResult]: Stem: 1067#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(18);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 1062#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~post7, main_#t~mem10, main_#t~post11, main_#t~post9, main_#t~mem13, main_#t~mem14, main_#t~post15, main_#t~post12, main_~max~0, main_~#str1~0.base, main_~#str1~0.offset, main_~#str2~0.base, main_~#str2~0.offset, main_~i~0, main_~j~0;main_~max~0 := 5;call main_~#str1~0.base, main_~#str1~0.offset := #Ultimate.allocOnStack((if main_~max~0 % 4294967296 % 4294967296 <= 2147483647 then main_~max~0 % 4294967296 % 4294967296 else main_~max~0 % 4294967296 % 4294967296 - 4294967296));call main_~#str2~0.base, main_~#str2~0.offset := #Ultimate.allocOnStack((if main_~max~0 % 4294967296 % 4294967296 <= 2147483647 then main_~max~0 % 4294967296 % 4294967296 else main_~max~0 % 4294967296 % 4294967296 - 4294967296));havoc main_~i~0;havoc main_~j~0;main_~i~0 := 0; 1063#L18-3 assume !!(main_~i~0 % 4294967296 < main_~max~0 % 4294967296);call write~int(main_#t~nondet8, main_~#str1~0.base, main_~#str1~0.offset + main_~i~0, 1);havoc main_#t~nondet8; 1064#L18-2 main_#t~post7 := main_~i~0;main_~i~0 := 1 + main_#t~post7;havoc main_#t~post7; 1065#L18-3 assume !!(main_~i~0 % 4294967296 < main_~max~0 % 4294967296);call write~int(main_#t~nondet8, main_~#str1~0.base, main_~#str1~0.offset + main_~i~0, 1);havoc main_#t~nondet8; 1066#L18-2 main_#t~post7 := main_~i~0;main_~i~0 := 1 + main_#t~post7;havoc main_#t~post7; 1087#L18-3 assume !!(main_~i~0 % 4294967296 < main_~max~0 % 4294967296);call write~int(main_#t~nondet8, main_~#str1~0.base, main_~#str1~0.offset + main_~i~0, 1);havoc main_#t~nondet8; 1086#L18-2 main_#t~post7 := main_~i~0;main_~i~0 := 1 + main_#t~post7;havoc main_#t~post7; 1085#L18-3 assume !!(main_~i~0 % 4294967296 < main_~max~0 % 4294967296);call write~int(main_#t~nondet8, main_~#str1~0.base, main_~#str1~0.offset + main_~i~0, 1);havoc main_#t~nondet8; 1084#L18-2 main_#t~post7 := main_~i~0;main_~i~0 := 1 + main_#t~post7;havoc main_#t~post7; 1083#L18-3 assume !!(main_~i~0 % 4294967296 < main_~max~0 % 4294967296);call write~int(main_#t~nondet8, main_~#str1~0.base, main_~#str1~0.offset + main_~i~0, 1);havoc main_#t~nondet8; 1082#L18-2 main_#t~post7 := main_~i~0;main_~i~0 := 1 + main_#t~post7;havoc main_#t~post7; 1081#L18-3 assume !(main_~i~0 % 4294967296 < main_~max~0 % 4294967296); 1077#L18-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); 1072#L26-3 assume !!(main_~i~0 >= 0);call main_#t~mem10 := read~int(main_~#str1~0.base, main_~#str1~0.offset + main_~i~0, 1);call write~int(main_#t~mem10, main_~#str2~0.base, main_~#str2~0.offset + main_~j~0, 1);havoc main_#t~mem10;main_#t~post11 := main_~j~0;main_~j~0 := 1 + main_#t~post11;havoc main_#t~post11; 1073#L26-2 main_#t~post9 := main_~i~0;main_~i~0 := main_#t~post9 - 1;havoc main_#t~post9; 1074#L26-3 assume !!(main_~i~0 >= 0);call main_#t~mem10 := read~int(main_~#str1~0.base, main_~#str1~0.offset + main_~i~0, 1);call write~int(main_#t~mem10, main_~#str2~0.base, main_~#str2~0.offset + main_~j~0, 1);havoc main_#t~mem10;main_#t~post11 := main_~j~0;main_~j~0 := 1 + main_#t~post11;havoc main_#t~post11; 1075#L26-2 main_#t~post9 := main_~i~0;main_~i~0 := main_#t~post9 - 1;havoc main_#t~post9; 1076#L26-3 assume !!(main_~i~0 >= 0);call main_#t~mem10 := read~int(main_~#str1~0.base, main_~#str1~0.offset + main_~i~0, 1);call write~int(main_#t~mem10, main_~#str2~0.base, main_~#str2~0.offset + main_~j~0, 1);havoc main_#t~mem10;main_#t~post11 := main_~j~0;main_~j~0 := 1 + main_#t~post11;havoc main_#t~post11; 1080#L26-2 main_#t~post9 := main_~i~0;main_~i~0 := main_#t~post9 - 1;havoc main_#t~post9; 1079#L26-3 assume !(main_~i~0 >= 0); 1068#L26-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; 1069#L32-3 [2020-11-29 19:17:18,181 INFO L796 eck$LassoCheckResult]: Loop: 1069#L32-3 assume !!(main_~i~0 % 4294967296 < main_~max~0 % 4294967296);call main_#t~mem13 := read~int(main_~#str1~0.base, main_~#str1~0.offset + main_~i~0, 1);call main_#t~mem14 := read~int(main_~#str2~0.base, main_~#str2~0.offset + main_~j~0, 1);__VERIFIER_assert_#in~cond := (if main_#t~mem13 == main_#t~mem14 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 1070#L6 assume !(0 == __VERIFIER_assert_~cond); 1071#L6-2 havoc main_#t~mem13;havoc main_#t~mem14;main_#t~post15 := main_~j~0;main_~j~0 := main_#t~post15 - 1;havoc main_#t~post15; 1078#L32-2 main_#t~post12 := main_~i~0;main_~i~0 := 1 + main_#t~post12;havoc main_#t~post12; 1069#L32-3 [2020-11-29 19:17:18,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 19:17:18,181 INFO L82 PathProgramCache]: Analyzing trace with hash 88937187, now seen corresponding path program 3 times [2020-11-29 19:17:18,181 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 19:17:18,182 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1809169609] [2020-11-29 19:17:18,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 19:17:18,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:17:18,293 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2020-11-29 19:17:18,294 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1809169609] [2020-11-29 19:17:18,294 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2066655690] [2020-11-29 19:17:18,294 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a79dd090-33a4-40c1-9430-3ac868ca5229/bin/uautomizer/z3 Starting monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-29 19:17:18,378 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2020-11-29 19:17:18,378 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-11-29 19:17:18,379 INFO L263 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 13 conjunts are in the unsatisfiable core [2020-11-29 19:17:18,381 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-29 19:17:18,450 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2020-11-29 19:17:18,450 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-29 19:17:18,450 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 11 [2020-11-29 19:17:18,450 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1476943702] [2020-11-29 19:17:18,451 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-11-29 19:17:18,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 19:17:18,451 INFO L82 PathProgramCache]: Analyzing trace with hash 2102348, now seen corresponding path program 4 times [2020-11-29 19:17:18,451 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 19:17:18,451 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [829492289] [2020-11-29 19:17:18,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 19:17:18,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 19:17:18,456 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 19:17:18,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 19:17:18,466 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 19:17:18,469 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-29 19:17:18,579 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 19:17:18,579 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-11-29 19:17:18,579 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2020-11-29 19:17:18,579 INFO L87 Difference]: Start difference. First operand 26 states and 28 transitions. cyclomatic complexity: 5 Second operand 11 states. [2020-11-29 19:17:18,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 19:17:18,753 INFO L93 Difference]: Finished difference Result 29 states and 31 transitions. [2020-11-29 19:17:18,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-11-29 19:17:18,753 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 29 states and 31 transitions. [2020-11-29 19:17:18,754 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-11-29 19:17:18,754 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 29 states to 29 states and 31 transitions. [2020-11-29 19:17:18,754 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2020-11-29 19:17:18,755 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2020-11-29 19:17:18,755 INFO L73 IsDeterministic]: Start isDeterministic. Operand 29 states and 31 transitions. [2020-11-29 19:17:18,755 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-11-29 19:17:18,755 INFO L691 BuchiCegarLoop]: Abstraction has 29 states and 31 transitions. [2020-11-29 19:17:18,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states and 31 transitions. [2020-11-29 19:17:18,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 28. [2020-11-29 19:17:18,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2020-11-29 19:17:18,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 30 transitions. [2020-11-29 19:17:18,757 INFO L714 BuchiCegarLoop]: Abstraction has 28 states and 30 transitions. [2020-11-29 19:17:18,757 INFO L594 BuchiCegarLoop]: Abstraction has 28 states and 30 transitions. [2020-11-29 19:17:18,757 INFO L427 BuchiCegarLoop]: ======== Iteration 12============ [2020-11-29 19:17:18,757 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 30 transitions. [2020-11-29 19:17:18,758 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-11-29 19:17:18,758 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-29 19:17:18,758 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-29 19:17:18,759 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 4, 4, 1, 1, 1, 1, 1, 1] [2020-11-29 19:17:18,759 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-11-29 19:17:18,759 INFO L794 eck$LassoCheckResult]: Stem: 1209#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(18);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 1204#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~post7, main_#t~mem10, main_#t~post11, main_#t~post9, main_#t~mem13, main_#t~mem14, main_#t~post15, main_#t~post12, main_~max~0, main_~#str1~0.base, main_~#str1~0.offset, main_~#str2~0.base, main_~#str2~0.offset, main_~i~0, main_~j~0;main_~max~0 := 5;call main_~#str1~0.base, main_~#str1~0.offset := #Ultimate.allocOnStack((if main_~max~0 % 4294967296 % 4294967296 <= 2147483647 then main_~max~0 % 4294967296 % 4294967296 else main_~max~0 % 4294967296 % 4294967296 - 4294967296));call main_~#str2~0.base, main_~#str2~0.offset := #Ultimate.allocOnStack((if main_~max~0 % 4294967296 % 4294967296 <= 2147483647 then main_~max~0 % 4294967296 % 4294967296 else main_~max~0 % 4294967296 % 4294967296 - 4294967296));havoc main_~i~0;havoc main_~j~0;main_~i~0 := 0; 1205#L18-3 assume !!(main_~i~0 % 4294967296 < main_~max~0 % 4294967296);call write~int(main_#t~nondet8, main_~#str1~0.base, main_~#str1~0.offset + main_~i~0, 1);havoc main_#t~nondet8; 1206#L18-2 main_#t~post7 := main_~i~0;main_~i~0 := 1 + main_#t~post7;havoc main_#t~post7; 1207#L18-3 assume !!(main_~i~0 % 4294967296 < main_~max~0 % 4294967296);call write~int(main_#t~nondet8, main_~#str1~0.base, main_~#str1~0.offset + main_~i~0, 1);havoc main_#t~nondet8; 1208#L18-2 main_#t~post7 := main_~i~0;main_~i~0 := 1 + main_#t~post7;havoc main_#t~post7; 1228#L18-3 assume !!(main_~i~0 % 4294967296 < main_~max~0 % 4294967296);call write~int(main_#t~nondet8, main_~#str1~0.base, main_~#str1~0.offset + main_~i~0, 1);havoc main_#t~nondet8; 1227#L18-2 main_#t~post7 := main_~i~0;main_~i~0 := 1 + main_#t~post7;havoc main_#t~post7; 1226#L18-3 assume !!(main_~i~0 % 4294967296 < main_~max~0 % 4294967296);call write~int(main_#t~nondet8, main_~#str1~0.base, main_~#str1~0.offset + main_~i~0, 1);havoc main_#t~nondet8; 1225#L18-2 main_#t~post7 := main_~i~0;main_~i~0 := 1 + main_#t~post7;havoc main_#t~post7; 1224#L18-3 assume !!(main_~i~0 % 4294967296 < main_~max~0 % 4294967296);call write~int(main_#t~nondet8, main_~#str1~0.base, main_~#str1~0.offset + main_~i~0, 1);havoc main_#t~nondet8; 1223#L18-2 main_#t~post7 := main_~i~0;main_~i~0 := 1 + main_#t~post7;havoc main_#t~post7; 1222#L18-3 assume !(main_~i~0 % 4294967296 < main_~max~0 % 4294967296); 1218#L18-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); 1214#L26-3 assume !!(main_~i~0 >= 0);call main_#t~mem10 := read~int(main_~#str1~0.base, main_~#str1~0.offset + main_~i~0, 1);call write~int(main_#t~mem10, main_~#str2~0.base, main_~#str2~0.offset + main_~j~0, 1);havoc main_#t~mem10;main_#t~post11 := main_~j~0;main_~j~0 := 1 + main_#t~post11;havoc main_#t~post11; 1215#L26-2 main_#t~post9 := main_~i~0;main_~i~0 := main_#t~post9 - 1;havoc main_#t~post9; 1216#L26-3 assume !!(main_~i~0 >= 0);call main_#t~mem10 := read~int(main_~#str1~0.base, main_~#str1~0.offset + main_~i~0, 1);call write~int(main_#t~mem10, main_~#str2~0.base, main_~#str2~0.offset + main_~j~0, 1);havoc main_#t~mem10;main_#t~post11 := main_~j~0;main_~j~0 := 1 + main_#t~post11;havoc main_#t~post11; 1217#L26-2 main_#t~post9 := main_~i~0;main_~i~0 := main_#t~post9 - 1;havoc main_#t~post9; 1231#L26-3 assume !!(main_~i~0 >= 0);call main_#t~mem10 := read~int(main_~#str1~0.base, main_~#str1~0.offset + main_~i~0, 1);call write~int(main_#t~mem10, main_~#str2~0.base, main_~#str2~0.offset + main_~j~0, 1);havoc main_#t~mem10;main_#t~post11 := main_~j~0;main_~j~0 := 1 + main_#t~post11;havoc main_#t~post11; 1230#L26-2 main_#t~post9 := main_~i~0;main_~i~0 := main_#t~post9 - 1;havoc main_#t~post9; 1229#L26-3 assume !!(main_~i~0 >= 0);call main_#t~mem10 := read~int(main_~#str1~0.base, main_~#str1~0.offset + main_~i~0, 1);call write~int(main_#t~mem10, main_~#str2~0.base, main_~#str2~0.offset + main_~j~0, 1);havoc main_#t~mem10;main_#t~post11 := main_~j~0;main_~j~0 := 1 + main_#t~post11;havoc main_#t~post11; 1221#L26-2 main_#t~post9 := main_~i~0;main_~i~0 := main_#t~post9 - 1;havoc main_#t~post9; 1220#L26-3 assume !(main_~i~0 >= 0); 1210#L26-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#L32-3 [2020-11-29 19:17:18,759 INFO L796 eck$LassoCheckResult]: Loop: 1211#L32-3 assume !!(main_~i~0 % 4294967296 < main_~max~0 % 4294967296);call main_#t~mem13 := read~int(main_~#str1~0.base, main_~#str1~0.offset + main_~i~0, 1);call main_#t~mem14 := read~int(main_~#str2~0.base, main_~#str2~0.offset + main_~j~0, 1);__VERIFIER_assert_#in~cond := (if main_#t~mem13 == main_#t~mem14 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 1212#L6 assume !(0 == __VERIFIER_assert_~cond); 1213#L6-2 havoc main_#t~mem13;havoc main_#t~mem14;main_#t~post15 := main_~j~0;main_~j~0 := main_#t~post15 - 1;havoc main_#t~post15; 1219#L32-2 main_#t~post12 := main_~i~0;main_~i~0 := 1 + main_#t~post12;havoc main_#t~post12; 1211#L32-3 [2020-11-29 19:17:18,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 19:17:18,760 INFO L82 PathProgramCache]: Analyzing trace with hash -430652763, now seen corresponding path program 4 times [2020-11-29 19:17:18,760 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 19:17:18,760 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [305720450] [2020-11-29 19:17:18,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 19:17:18,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:17:18,950 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2020-11-29 19:17:18,950 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [305720450] [2020-11-29 19:17:18,950 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [14780401] [2020-11-29 19:17:18,950 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a79dd090-33a4-40c1-9430-3ac868ca5229/bin/uautomizer/z3 Starting monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-29 19:17:19,030 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2020-11-29 19:17:19,030 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-11-29 19:17:19,031 INFO L263 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 18 conjunts are in the unsatisfiable core [2020-11-29 19:17:19,032 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-29 19:17:19,117 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2020-11-29 19:17:19,117 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-29 19:17:19,117 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10] total 15 [2020-11-29 19:17:19,117 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1391538962] [2020-11-29 19:17:19,118 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-11-29 19:17:19,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 19:17:19,118 INFO L82 PathProgramCache]: Analyzing trace with hash 2102348, now seen corresponding path program 5 times [2020-11-29 19:17:19,119 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 19:17:19,119 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [455775449] [2020-11-29 19:17:19,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 19:17:19,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 19:17:19,123 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 19:17:19,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 19:17:19,150 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 19:17:19,152 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-29 19:17:19,266 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 19:17:19,267 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-11-29 19:17:19,267 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=146, Unknown=0, NotChecked=0, Total=210 [2020-11-29 19:17:19,267 INFO L87 Difference]: Start difference. First operand 28 states and 30 transitions. cyclomatic complexity: 5 Second operand 15 states. [2020-11-29 19:17:19,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 19:17:19,554 INFO L93 Difference]: Finished difference Result 46 states and 48 transitions. [2020-11-29 19:17:19,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-11-29 19:17:19,554 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 46 states and 48 transitions. [2020-11-29 19:17:19,555 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-11-29 19:17:19,556 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 46 states to 46 states and 48 transitions. [2020-11-29 19:17:19,556 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 26 [2020-11-29 19:17:19,556 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 26 [2020-11-29 19:17:19,556 INFO L73 IsDeterministic]: Start isDeterministic. Operand 46 states and 48 transitions. [2020-11-29 19:17:19,556 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-11-29 19:17:19,556 INFO L691 BuchiCegarLoop]: Abstraction has 46 states and 48 transitions. [2020-11-29 19:17:19,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states and 48 transitions. [2020-11-29 19:17:19,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 30. [2020-11-29 19:17:19,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2020-11-29 19:17:19,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 32 transitions. [2020-11-29 19:17:19,559 INFO L714 BuchiCegarLoop]: Abstraction has 30 states and 32 transitions. [2020-11-29 19:17:19,559 INFO L594 BuchiCegarLoop]: Abstraction has 30 states and 32 transitions. [2020-11-29 19:17:19,559 INFO L427 BuchiCegarLoop]: ======== Iteration 13============ [2020-11-29 19:17:19,559 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 30 states and 32 transitions. [2020-11-29 19:17:19,559 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-11-29 19:17:19,560 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-29 19:17:19,560 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-29 19:17:19,560 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 5, 5, 1, 1, 1, 1, 1, 1] [2020-11-29 19:17:19,560 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-11-29 19:17:19,561 INFO L794 eck$LassoCheckResult]: Stem: 1388#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(18);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 1383#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~post7, main_#t~mem10, main_#t~post11, main_#t~post9, main_#t~mem13, main_#t~mem14, main_#t~post15, main_#t~post12, main_~max~0, main_~#str1~0.base, main_~#str1~0.offset, main_~#str2~0.base, main_~#str2~0.offset, main_~i~0, main_~j~0;main_~max~0 := 5;call main_~#str1~0.base, main_~#str1~0.offset := #Ultimate.allocOnStack((if main_~max~0 % 4294967296 % 4294967296 <= 2147483647 then main_~max~0 % 4294967296 % 4294967296 else main_~max~0 % 4294967296 % 4294967296 - 4294967296));call main_~#str2~0.base, main_~#str2~0.offset := #Ultimate.allocOnStack((if main_~max~0 % 4294967296 % 4294967296 <= 2147483647 then main_~max~0 % 4294967296 % 4294967296 else main_~max~0 % 4294967296 % 4294967296 - 4294967296));havoc main_~i~0;havoc main_~j~0;main_~i~0 := 0; 1384#L18-3 assume !!(main_~i~0 % 4294967296 < main_~max~0 % 4294967296);call write~int(main_#t~nondet8, main_~#str1~0.base, main_~#str1~0.offset + main_~i~0, 1);havoc main_#t~nondet8; 1385#L18-2 main_#t~post7 := main_~i~0;main_~i~0 := 1 + main_#t~post7;havoc main_#t~post7; 1386#L18-3 assume !!(main_~i~0 % 4294967296 < main_~max~0 % 4294967296);call write~int(main_#t~nondet8, main_~#str1~0.base, main_~#str1~0.offset + main_~i~0, 1);havoc main_#t~nondet8; 1387#L18-2 main_#t~post7 := main_~i~0;main_~i~0 := 1 + main_#t~post7;havoc main_#t~post7; 1412#L18-3 assume !!(main_~i~0 % 4294967296 < main_~max~0 % 4294967296);call write~int(main_#t~nondet8, main_~#str1~0.base, main_~#str1~0.offset + main_~i~0, 1);havoc main_#t~nondet8; 1410#L18-2 main_#t~post7 := main_~i~0;main_~i~0 := 1 + main_#t~post7;havoc main_#t~post7; 1408#L18-3 assume !!(main_~i~0 % 4294967296 < main_~max~0 % 4294967296);call write~int(main_#t~nondet8, main_~#str1~0.base, main_~#str1~0.offset + main_~i~0, 1);havoc main_#t~nondet8; 1406#L18-2 main_#t~post7 := main_~i~0;main_~i~0 := 1 + main_#t~post7;havoc main_#t~post7; 1404#L18-3 assume !!(main_~i~0 % 4294967296 < main_~max~0 % 4294967296);call write~int(main_#t~nondet8, main_~#str1~0.base, main_~#str1~0.offset + main_~i~0, 1);havoc main_#t~nondet8; 1402#L18-2 main_#t~post7 := main_~i~0;main_~i~0 := 1 + main_#t~post7;havoc main_#t~post7; 1401#L18-3 assume !(main_~i~0 % 4294967296 < main_~max~0 % 4294967296); 1398#L18-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); 1393#L26-3 assume !!(main_~i~0 >= 0);call main_#t~mem10 := read~int(main_~#str1~0.base, main_~#str1~0.offset + main_~i~0, 1);call write~int(main_#t~mem10, main_~#str2~0.base, main_~#str2~0.offset + main_~j~0, 1);havoc main_#t~mem10;main_#t~post11 := main_~j~0;main_~j~0 := 1 + main_#t~post11;havoc main_#t~post11; 1394#L26-2 main_#t~post9 := main_~i~0;main_~i~0 := main_#t~post9 - 1;havoc main_#t~post9; 1395#L26-3 assume !!(main_~i~0 >= 0);call main_#t~mem10 := read~int(main_~#str1~0.base, main_~#str1~0.offset + main_~i~0, 1);call write~int(main_#t~mem10, main_~#str2~0.base, main_~#str2~0.offset + main_~j~0, 1);havoc main_#t~mem10;main_#t~post11 := main_~j~0;main_~j~0 := 1 + main_#t~post11;havoc main_#t~post11; 1396#L26-2 main_#t~post9 := main_~i~0;main_~i~0 := main_#t~post9 - 1;havoc main_#t~post9; 1411#L26-3 assume !!(main_~i~0 >= 0);call main_#t~mem10 := read~int(main_~#str1~0.base, main_~#str1~0.offset + main_~i~0, 1);call write~int(main_#t~mem10, main_~#str2~0.base, main_~#str2~0.offset + main_~j~0, 1);havoc main_#t~mem10;main_#t~post11 := main_~j~0;main_~j~0 := 1 + main_#t~post11;havoc main_#t~post11; 1409#L26-2 main_#t~post9 := main_~i~0;main_~i~0 := main_#t~post9 - 1;havoc main_#t~post9; 1407#L26-3 assume !!(main_~i~0 >= 0);call main_#t~mem10 := read~int(main_~#str1~0.base, main_~#str1~0.offset + main_~i~0, 1);call write~int(main_#t~mem10, main_~#str2~0.base, main_~#str2~0.offset + main_~j~0, 1);havoc main_#t~mem10;main_#t~post11 := main_~j~0;main_~j~0 := 1 + main_#t~post11;havoc main_#t~post11; 1405#L26-2 main_#t~post9 := main_~i~0;main_~i~0 := main_#t~post9 - 1;havoc main_#t~post9; 1403#L26-3 assume !!(main_~i~0 >= 0);call main_#t~mem10 := read~int(main_~#str1~0.base, main_~#str1~0.offset + main_~i~0, 1);call write~int(main_#t~mem10, main_~#str2~0.base, main_~#str2~0.offset + main_~j~0, 1);havoc main_#t~mem10;main_#t~post11 := main_~j~0;main_~j~0 := 1 + main_#t~post11;havoc main_#t~post11; 1400#L26-2 main_#t~post9 := main_~i~0;main_~i~0 := main_#t~post9 - 1;havoc main_#t~post9; 1399#L26-3 assume !(main_~i~0 >= 0); 1389#L26-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; 1390#L32-3 [2020-11-29 19:17:19,561 INFO L796 eck$LassoCheckResult]: Loop: 1390#L32-3 assume !!(main_~i~0 % 4294967296 < main_~max~0 % 4294967296);call main_#t~mem13 := read~int(main_~#str1~0.base, main_~#str1~0.offset + main_~i~0, 1);call main_#t~mem14 := read~int(main_~#str2~0.base, main_~#str2~0.offset + main_~j~0, 1);__VERIFIER_assert_#in~cond := (if main_#t~mem13 == main_#t~mem14 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 1391#L6 assume !(0 == __VERIFIER_assert_~cond); 1392#L6-2 havoc main_#t~mem13;havoc main_#t~mem14;main_#t~post15 := main_~j~0;main_~j~0 := main_#t~post15 - 1;havoc main_#t~post15; 1397#L32-2 main_#t~post12 := main_~i~0;main_~i~0 := 1 + main_#t~post12;havoc main_#t~post12; 1390#L32-3 [2020-11-29 19:17:19,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 19:17:19,561 INFO L82 PathProgramCache]: Analyzing trace with hash -1540388377, now seen corresponding path program 5 times [2020-11-29 19:17:19,561 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 19:17:19,561 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1555590644] [2020-11-29 19:17:19,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 19:17:19,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 19:17:19,601 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 19:17:19,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 19:17:19,656 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 19:17:19,663 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-29 19:17:19,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 19:17:19,674 INFO L82 PathProgramCache]: Analyzing trace with hash 2102348, now seen corresponding path program 6 times [2020-11-29 19:17:19,674 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 19:17:19,674 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1567029686] [2020-11-29 19:17:19,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 19:17:19,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 19:17:19,684 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 19:17:19,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 19:17:19,691 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 19:17:19,704 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-29 19:17:19,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 19:17:19,709 INFO L82 PathProgramCache]: Analyzing trace with hash -1945355470, now seen corresponding path program 1 times [2020-11-29 19:17:19,709 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 19:17:19,709 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1175620867] [2020-11-29 19:17:19,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 19:17:19,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 19:17:19,750 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 19:17:19,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 19:17:19,779 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 19:17:19,790 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-29 19:17:19,959 WARN L193 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 47 [2020-11-29 19:17:30,754 WARN L193 SmtUtils]: Spent 10.79 s on a formula simplification. DAG size of input: 312 DAG size of output: 232 [2020-11-29 19:17:30,774 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 1] term [2020-11-29 19:17:30,774 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 19:17:30,777 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 19:17:30,778 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 19:17:30,781 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 19:17:30,786 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 19:17:30,798 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 19:17:30,804 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 19:18:12,639 WARN L193 SmtUtils]: Spent 41.80 s on a formula simplification. DAG size of input: 308 DAG size of output: 144 [2020-11-29 19:18:12,643 INFO L210 LassoAnalysis]: Preferences: [2020-11-29 19:18:12,643 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-11-29 19:18:12,643 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-11-29 19:18:12,643 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-11-29 19:18:12,643 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-11-29 19:18:12,643 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-29 19:18:12,643 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-11-29 19:18:12,643 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-11-29 19:18:12,643 INFO L133 ssoRankerPreferences]: Filename of dumped script: invert_string-3.c_Iteration13_Lasso [2020-11-29 19:18:12,643 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-11-29 19:18:12,643 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-11-29 19:18:12,647 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-29 19:18:12,653 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-29 19:18:12,657 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-29 19:18:12,660 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-29 19:18:12,663 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-29 19:18:12,666 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-29 19:18:12,683 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-29 19:18:12,687 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-29 19:18:12,690 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-29 19:18:13,932 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer has thrown an exception: java.lang.AssertionError: MapEliminator tries to combine Int and (Array Int Int) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.mapelimination.MapEliminator.indexEqualityInequalityImpliesValueEquality(MapEliminator.java:850) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.mapelimination.MapEliminator.replaceSelectStoreTerm(MapEliminator.java:592) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.mapelimination.MapEliminator.replaceStoreTerms(MapEliminator.java:542) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.mapelimination.MapEliminator.getRewrittenTransFormula(MapEliminator.java:330) at de.uni_freiburg.informatik.ultimate.lassoranker.preprocessors.MapEliminationLassoPreprocessor.process(MapEliminationLassoPreprocessor.java:109) at de.uni_freiburg.informatik.ultimate.lassoranker.variables.LassoBuilder.applyPreprocessor(LassoBuilder.java:154) at de.uni_freiburg.informatik.ultimate.lassoranker.variables.LassoBuilder.preprocess(LassoBuilder.java:262) at de.uni_freiburg.informatik.ultimate.lassoranker.LassoAnalysis.preprocess(LassoAnalysis.java:278) at de.uni_freiburg.informatik.ultimate.lassoranker.LassoAnalysis.(LassoAnalysis.java:229) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.synthesize(LassoCheck.java:612) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.access$16(LassoCheck.java:539) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.checkLassoTermination(LassoCheck.java:957) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.(LassoCheck.java:865) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.(LassoCheck.java:251) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiCegarLoop.iterate(BuchiCegarLoop.java:461) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.doTerminationAnalysis(BuchiAutomizerObserver.java:141) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.finish(BuchiAutomizerObserver.java:382) 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:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2020-11-29 19:18:13,935 INFO L168 Benchmark]: Toolchain (without parser) took 71626.33 ms. Allocated memory was 77.6 MB in the beginning and 207.6 MB in the end (delta: 130.0 MB). Free memory was 47.1 MB in the beginning and 172.2 MB in the end (delta: -125.1 MB). Peak memory consumption was 115.5 MB. Max. memory is 16.1 GB. [2020-11-29 19:18:13,936 INFO L168 Benchmark]: CDTParser took 0.80 ms. Allocated memory is still 77.6 MB. Free memory is still 43.5 MB. There was no memory consumed. Max. memory is 16.1 GB. [2020-11-29 19:18:13,936 INFO L168 Benchmark]: CACSL2BoogieTranslator took 317.09 ms. Allocated memory was 77.6 MB in the beginning and 94.4 MB in the end (delta: 16.8 MB). Free memory was 46.9 MB in the beginning and 70.9 MB in the end (delta: -24.0 MB). Peak memory consumption was 9.2 MB. Max. memory is 16.1 GB. [2020-11-29 19:18:13,936 INFO L168 Benchmark]: Boogie Procedure Inliner took 44.33 ms. Allocated memory is still 94.4 MB. Free memory was 70.9 MB in the beginning and 69.3 MB in the end (delta: 1.6 MB). There was no memory consumed. Max. memory is 16.1 GB. [2020-11-29 19:18:13,937 INFO L168 Benchmark]: Boogie Preprocessor took 31.22 ms. Allocated memory is still 94.4 MB. Free memory was 69.3 MB in the beginning and 68.1 MB in the end (delta: 1.2 MB). There was no memory consumed. Max. memory is 16.1 GB. [2020-11-29 19:18:13,937 INFO L168 Benchmark]: RCFGBuilder took 514.86 ms. Allocated memory is still 94.4 MB. Free memory was 67.8 MB in the beginning and 53.7 MB in the end (delta: 14.2 MB). Peak memory consumption was 16.8 MB. Max. memory is 16.1 GB. [2020-11-29 19:18:13,937 INFO L168 Benchmark]: BuchiAutomizer took 70711.49 ms. Allocated memory was 94.4 MB in the beginning and 207.6 MB in the end (delta: 113.2 MB). Free memory was 53.4 MB in the beginning and 172.2 MB in the end (delta: -118.7 MB). Peak memory consumption was 108.4 MB. Max. memory is 16.1 GB. [2020-11-29 19:18:13,939 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.80 ms. Allocated memory is still 77.6 MB. Free memory is still 43.5 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 317.09 ms. Allocated memory was 77.6 MB in the beginning and 94.4 MB in the end (delta: 16.8 MB). Free memory was 46.9 MB in the beginning and 70.9 MB in the end (delta: -24.0 MB). Peak memory consumption was 9.2 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 44.33 ms. Allocated memory is still 94.4 MB. Free memory was 70.9 MB in the beginning and 69.3 MB in the end (delta: 1.6 MB). There was no memory consumed. Max. memory is 16.1 GB. * Boogie Preprocessor took 31.22 ms. Allocated memory is still 94.4 MB. Free memory was 69.3 MB in the beginning and 68.1 MB in the end (delta: 1.2 MB). There was no memory consumed. Max. memory is 16.1 GB. * RCFGBuilder took 514.86 ms. Allocated memory is still 94.4 MB. Free memory was 67.8 MB in the beginning and 53.7 MB in the end (delta: 14.2 MB). Peak memory consumption was 16.8 MB. Max. memory is 16.1 GB. * BuchiAutomizer took 70711.49 ms. Allocated memory was 94.4 MB in the beginning and 207.6 MB in the end (delta: 113.2 MB). Free memory was 53.4 MB in the beginning and 172.2 MB in the end (delta: -118.7 MB). Peak memory consumption was 108.4 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: - ExceptionOrErrorResult: AssertionError: MapEliminator tries to combine Int and (Array Int Int) de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: AssertionError: MapEliminator tries to combine Int and (Array Int Int): de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.mapelimination.MapEliminator.indexEqualityInequalityImpliesValueEquality(MapEliminator.java:850) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...