./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/termination-memory-alloca/c.08-alloca.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 47ea0209 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ca00bbe-7802-45cf-8c9a-e5551a18caab/bin/uautomizer-AkOaLMaTGY/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ca00bbe-7802-45cf-8c9a-e5551a18caab/bin/uautomizer-AkOaLMaTGY/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ca00bbe-7802-45cf-8c9a-e5551a18caab/bin/uautomizer-AkOaLMaTGY/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ca00bbe-7802-45cf-8c9a-e5551a18caab/bin/uautomizer-AkOaLMaTGY/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-memory-alloca/c.08-alloca.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ca00bbe-7802-45cf-8c9a-e5551a18caab/bin/uautomizer-AkOaLMaTGY/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ca00bbe-7802-45cf-8c9a-e5551a18caab/bin/uautomizer-AkOaLMaTGY --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 461dc838a66b90dbc84e0c687808dbd6d568e1b4ffb694b9909dedb46b2980b4 --- Real Ultimate output --- This is Ultimate 0.2.1-dev-47ea020 [2021-11-07 08:31:17,200 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-07 08:31:17,203 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-07 08:31:17,260 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-07 08:31:17,260 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-07 08:31:17,265 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-07 08:31:17,267 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-07 08:31:17,271 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-07 08:31:17,274 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-07 08:31:17,280 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-07 08:31:17,281 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-07 08:31:17,283 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-07 08:31:17,284 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-07 08:31:17,286 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-07 08:31:17,289 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-07 08:31:17,293 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-07 08:31:17,295 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-07 08:31:17,296 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-07 08:31:17,299 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-07 08:31:17,307 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-07 08:31:17,309 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-07 08:31:17,310 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-07 08:31:17,314 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-07 08:31:17,315 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-07 08:31:17,324 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-07 08:31:17,325 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-07 08:31:17,325 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-07 08:31:17,327 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-07 08:31:17,328 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-07 08:31:17,329 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-07 08:31:17,330 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-07 08:31:17,331 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-07 08:31:17,333 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-07 08:31:17,334 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-07 08:31:17,336 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-07 08:31:17,336 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-07 08:31:17,337 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-07 08:31:17,337 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-07 08:31:17,338 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-07 08:31:17,339 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-07 08:31:17,339 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-07 08:31:17,340 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ca00bbe-7802-45cf-8c9a-e5551a18caab/bin/uautomizer-AkOaLMaTGY/config/svcomp-Termination-64bit-Automizer_Default.epf [2021-11-07 08:31:17,385 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-07 08:31:17,385 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-07 08:31:17,386 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-07 08:31:17,386 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-07 08:31:17,389 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-11-07 08:31:17,389 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-11-07 08:31:17,389 INFO L138 SettingsManager]: * Use SBE=true [2021-11-07 08:31:17,389 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2021-11-07 08:31:17,389 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2021-11-07 08:31:17,390 INFO L138 SettingsManager]: * Use old map elimination=false [2021-11-07 08:31:17,391 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2021-11-07 08:31:17,391 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2021-11-07 08:31:17,391 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2021-11-07 08:31:17,392 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-07 08:31:17,392 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-11-07 08:31:17,392 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-07 08:31:17,392 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-07 08:31:17,392 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2021-11-07 08:31:17,393 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2021-11-07 08:31:17,393 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2021-11-07 08:31:17,393 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-07 08:31:17,393 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2021-11-07 08:31:17,393 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-07 08:31:17,394 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2021-11-07 08:31:17,394 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-07 08:31:17,394 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-11-07 08:31:17,396 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-07 08:31:17,396 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-11-07 08:31:17,396 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-07 08:31:17,397 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2021-11-07 08:31:17,397 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_worker_vcloud-master_on_vcloud-master/run_dir_0ca00bbe-7802-45cf-8c9a-e5551a18caab/bin/uautomizer-AkOaLMaTGY/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_worker_vcloud-master_on_vcloud-master/run_dir_0ca00bbe-7802-45cf-8c9a-e5551a18caab/bin/uautomizer-AkOaLMaTGY Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 461dc838a66b90dbc84e0c687808dbd6d568e1b4ffb694b9909dedb46b2980b4 [2021-11-07 08:31:17,753 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-07 08:31:17,786 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-07 08:31:17,789 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-07 08:31:17,790 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-07 08:31:17,791 INFO L275 PluginConnector]: CDTParser initialized [2021-11-07 08:31:17,792 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ca00bbe-7802-45cf-8c9a-e5551a18caab/bin/uautomizer-AkOaLMaTGY/../../sv-benchmarks/c/termination-memory-alloca/c.08-alloca.i [2021-11-07 08:31:17,870 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ca00bbe-7802-45cf-8c9a-e5551a18caab/bin/uautomizer-AkOaLMaTGY/data/2b24c0b4e/0d21d3a7fb1b40ff9067f639b5c15969/FLAG9feba1370 [2021-11-07 08:31:18,423 INFO L306 CDTParser]: Found 1 translation units. [2021-11-07 08:31:18,424 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ca00bbe-7802-45cf-8c9a-e5551a18caab/sv-benchmarks/c/termination-memory-alloca/c.08-alloca.i [2021-11-07 08:31:18,443 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ca00bbe-7802-45cf-8c9a-e5551a18caab/bin/uautomizer-AkOaLMaTGY/data/2b24c0b4e/0d21d3a7fb1b40ff9067f639b5c15969/FLAG9feba1370 [2021-11-07 08:31:18,699 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ca00bbe-7802-45cf-8c9a-e5551a18caab/bin/uautomizer-AkOaLMaTGY/data/2b24c0b4e/0d21d3a7fb1b40ff9067f639b5c15969 [2021-11-07 08:31:18,703 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-07 08:31:18,706 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-07 08:31:18,710 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-07 08:31:18,710 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-07 08:31:18,714 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-07 08:31:18,715 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 08:31:18" (1/1) ... [2021-11-07 08:31:18,716 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4ad10fac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:31:18, skipping insertion in model container [2021-11-07 08:31:18,716 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 08:31:18" (1/1) ... [2021-11-07 08:31:18,723 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-07 08:31:18,765 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-07 08:31:19,064 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-07 08:31:19,073 INFO L203 MainTranslator]: Completed pre-run [2021-11-07 08:31:19,113 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-07 08:31:19,140 INFO L208 MainTranslator]: Completed translation [2021-11-07 08:31:19,140 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:31:19 WrapperNode [2021-11-07 08:31:19,141 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-07 08:31:19,142 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-07 08:31:19,142 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-07 08:31:19,142 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-07 08:31:19,150 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:31:19" (1/1) ... [2021-11-07 08:31:19,163 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:31:19" (1/1) ... [2021-11-07 08:31:19,183 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-07 08:31:19,184 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-07 08:31:19,184 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-07 08:31:19,185 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-07 08:31:19,193 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:31:19" (1/1) ... [2021-11-07 08:31:19,193 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:31:19" (1/1) ... [2021-11-07 08:31:19,196 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:31:19" (1/1) ... [2021-11-07 08:31:19,196 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:31:19" (1/1) ... [2021-11-07 08:31:19,201 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:31:19" (1/1) ... [2021-11-07 08:31:19,204 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:31:19" (1/1) ... [2021-11-07 08:31:19,206 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:31:19" (1/1) ... [2021-11-07 08:31:19,208 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-07 08:31:19,209 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-07 08:31:19,209 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-07 08:31:19,209 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-07 08:31:19,210 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:31:19" (1/1) ... [2021-11-07 08:31:19,218 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-07 08:31:19,232 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ca00bbe-7802-45cf-8c9a-e5551a18caab/bin/uautomizer-AkOaLMaTGY/z3 [2021-11-07 08:31:19,244 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ca00bbe-7802-45cf-8c9a-e5551a18caab/bin/uautomizer-AkOaLMaTGY/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-07 08:31:19,268 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ca00bbe-7802-45cf-8c9a-e5551a18caab/bin/uautomizer-AkOaLMaTGY/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2021-11-07 08:31:19,297 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-11-07 08:31:19,297 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-11-07 08:31:19,297 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-07 08:31:19,297 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-11-07 08:31:19,298 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-07 08:31:19,298 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-07 08:31:19,590 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-07 08:31:19,590 INFO L299 CfgBuilder]: Removed 8 assume(true) statements. [2021-11-07 08:31:19,592 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 08:31:19 BoogieIcfgContainer [2021-11-07 08:31:19,592 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-07 08:31:19,593 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2021-11-07 08:31:19,593 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2021-11-07 08:31:19,597 INFO L275 PluginConnector]: BuchiAutomizer initialized [2021-11-07 08:31:19,598 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-11-07 08:31:19,598 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 07.11 08:31:18" (1/3) ... [2021-11-07 08:31:19,599 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@28fc39f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 07.11 08:31:19, skipping insertion in model container [2021-11-07 08:31:19,600 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-11-07 08:31:19,600 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:31:19" (2/3) ... [2021-11-07 08:31:19,600 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@28fc39f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 07.11 08:31:19, skipping insertion in model container [2021-11-07 08:31:19,600 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-11-07 08:31:19,600 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 08:31:19" (3/3) ... [2021-11-07 08:31:19,602 INFO L389 chiAutomizerObserver]: Analyzing ICFG c.08-alloca.i [2021-11-07 08:31:19,645 INFO L359 BuchiCegarLoop]: Interprodecural is true [2021-11-07 08:31:19,645 INFO L360 BuchiCegarLoop]: Hoare is false [2021-11-07 08:31:19,645 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2021-11-07 08:31:19,645 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2021-11-07 08:31:19,645 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-11-07 08:31:19,646 INFO L364 BuchiCegarLoop]: Difference is false [2021-11-07 08:31:19,646 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-11-07 08:31:19,646 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2021-11-07 08:31:19,660 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 12 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 11 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 08:31:19,694 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2021-11-07 08:31:19,695 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-11-07 08:31:19,695 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-11-07 08:31:19,701 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-11-07 08:31:19,701 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2021-11-07 08:31:19,701 INFO L425 BuchiCegarLoop]: ======== Iteration 1============ [2021-11-07 08:31:19,702 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 12 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 11 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 08:31:19,704 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2021-11-07 08:31:19,705 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-11-07 08:31:19,705 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-11-07 08:31:19,705 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-11-07 08:31:19,706 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2021-11-07 08:31:19,713 INFO L791 eck$LassoCheckResult]: Stem: 5#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 9#L-1true havoc main_#res;havoc main_#t~nondet11, main_#t~nondet12, main_#t~ret13;test_fun_#in~i, test_fun_#in~j := main_#t~nondet11, main_#t~nondet12;havoc test_fun_#res;havoc test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset, test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset, test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset, test_fun_#t~mem8, test_fun_#t~mem7, test_fun_#t~mem6, test_fun_#t~mem9, test_fun_#t~mem5, test_fun_#t~mem10, test_fun_~i, test_fun_~j, test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, test_fun_~c~0.base, test_fun_~c~0.offset;test_fun_~i := test_fun_#in~i;test_fun_~j := test_fun_#in~j;call test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.allocOnStack(4);test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset;call test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.allocOnStack(4);test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;call test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset := #Ultimate.allocOnStack(4);test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset;call write~int(test_fun_~i, test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4);call write~int(test_fun_~j, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); 6#L555-3true [2021-11-07 08:31:19,714 INFO L793 eck$LassoCheckResult]: Loop: 6#L555-3true call test_fun_#t~mem5 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 11#L555-1true assume !!(test_fun_#t~mem5 >= 0);havoc test_fun_#t~mem5;call write~int(0, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4); 10#L557-3true assume !true; 13#L557-4true call test_fun_#t~mem9 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4);call write~int(test_fun_#t~mem9 - 1, test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4);havoc test_fun_#t~mem9; 6#L555-3true [2021-11-07 08:31:19,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 08:31:19,725 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2021-11-07 08:31:19,734 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 08:31:19,735 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1523201790] [2021-11-07 08:31:19,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 08:31:19,736 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 08:31:19,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-07 08:31:19,941 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-07 08:31:19,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-07 08:31:20,027 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-07 08:31:20,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 08:31:20,031 INFO L85 PathProgramCache]: Analyzing trace with hash 1144360, now seen corresponding path program 1 times [2021-11-07 08:31:20,032 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 08:31:20,033 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1085304100] [2021-11-07 08:31:20,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 08:31:20,033 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 08:31:20,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 08:31:20,109 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 08:31:20,110 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-07 08:31:20,110 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1085304100] [2021-11-07 08:31:20,111 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1085304100] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 08:31:20,111 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 08:31:20,112 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-07 08:31:20,112 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [488688536] [2021-11-07 08:31:20,130 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-11-07 08:31:20,131 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-07 08:31:20,157 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-11-07 08:31:20,158 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-11-07 08:31:20,160 INFO L87 Difference]: Start difference. First operand has 12 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 11 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 08:31:20,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 08:31:20,172 INFO L93 Difference]: Finished difference Result 12 states and 13 transitions. [2021-11-07 08:31:20,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-11-07 08:31:20,175 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 12 states and 13 transitions. [2021-11-07 08:31:20,177 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2021-11-07 08:31:20,180 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 12 states to 7 states and 8 transitions. [2021-11-07 08:31:20,181 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2021-11-07 08:31:20,181 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2021-11-07 08:31:20,182 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 8 transitions. [2021-11-07 08:31:20,183 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-07 08:31:20,183 INFO L681 BuchiCegarLoop]: Abstraction has 7 states and 8 transitions. [2021-11-07 08:31:20,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states and 8 transitions. [2021-11-07 08:31:20,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2021-11-07 08:31:20,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 6 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 08:31:20,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 8 transitions. [2021-11-07 08:31:20,210 INFO L704 BuchiCegarLoop]: Abstraction has 7 states and 8 transitions. [2021-11-07 08:31:20,210 INFO L587 BuchiCegarLoop]: Abstraction has 7 states and 8 transitions. [2021-11-07 08:31:20,210 INFO L425 BuchiCegarLoop]: ======== Iteration 2============ [2021-11-07 08:31:20,211 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7 states and 8 transitions. [2021-11-07 08:31:20,212 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2021-11-07 08:31:20,212 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-11-07 08:31:20,212 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-11-07 08:31:20,213 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-11-07 08:31:20,213 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2021-11-07 08:31:20,213 INFO L791 eck$LassoCheckResult]: Stem: 32#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 33#L-1 havoc main_#res;havoc main_#t~nondet11, main_#t~nondet12, main_#t~ret13;test_fun_#in~i, test_fun_#in~j := main_#t~nondet11, main_#t~nondet12;havoc test_fun_#res;havoc test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset, test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset, test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset, test_fun_#t~mem8, test_fun_#t~mem7, test_fun_#t~mem6, test_fun_#t~mem9, test_fun_#t~mem5, test_fun_#t~mem10, test_fun_~i, test_fun_~j, test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, test_fun_~c~0.base, test_fun_~c~0.offset;test_fun_~i := test_fun_#in~i;test_fun_~j := test_fun_#in~j;call test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.allocOnStack(4);test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset;call test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.allocOnStack(4);test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;call test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset := #Ultimate.allocOnStack(4);test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset;call write~int(test_fun_~i, test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4);call write~int(test_fun_~j, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); 34#L555-3 [2021-11-07 08:31:20,214 INFO L793 eck$LassoCheckResult]: Loop: 34#L555-3 call test_fun_#t~mem5 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 35#L555-1 assume !!(test_fun_#t~mem5 >= 0);havoc test_fun_#t~mem5;call write~int(0, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4); 36#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 37#L557-1 assume !(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6; 38#L557-4 call test_fun_#t~mem9 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4);call write~int(test_fun_#t~mem9 - 1, test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4);havoc test_fun_#t~mem9; 34#L555-3 [2021-11-07 08:31:20,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 08:31:20,214 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2021-11-07 08:31:20,215 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 08:31:20,215 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1652174864] [2021-11-07 08:31:20,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 08:31:20,215 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 08:31:20,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-07 08:31:20,256 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-07 08:31:20,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-07 08:31:20,299 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-07 08:31:20,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 08:31:20,300 INFO L85 PathProgramCache]: Analyzing trace with hash 35468273, now seen corresponding path program 1 times [2021-11-07 08:31:20,300 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 08:31:20,300 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1296763892] [2021-11-07 08:31:20,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 08:31:20,301 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 08:31:20,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-07 08:31:20,326 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-07 08:31:20,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-07 08:31:20,339 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-07 08:31:20,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 08:31:20,339 INFO L85 PathProgramCache]: Analyzing trace with hash 1806907759, now seen corresponding path program 1 times [2021-11-07 08:31:20,340 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 08:31:20,340 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [880256240] [2021-11-07 08:31:20,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 08:31:20,341 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 08:31:20,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-07 08:31:20,361 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-07 08:31:20,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-07 08:31:20,391 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-07 08:31:21,365 INFO L210 LassoAnalysis]: Preferences: [2021-11-07 08:31:21,366 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-11-07 08:31:21,366 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-11-07 08:31:21,366 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-11-07 08:31:21,367 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-11-07 08:31:21,367 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-07 08:31:21,367 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-11-07 08:31:21,367 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-11-07 08:31:21,367 INFO L133 ssoRankerPreferences]: Filename of dumped script: c.08-alloca.i_Iteration2_Lasso [2021-11-07 08:31:21,368 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-11-07 08:31:21,368 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-11-07 08:31:21,390 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-07 08:31:21,395 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-07 08:31:21,397 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-07 08:31:21,399 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-07 08:31:21,403 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-07 08:31:21,406 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-07 08:31:21,408 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-07 08:31:21,411 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-07 08:31:21,413 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-07 08:31:21,415 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-07 08:31:21,418 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-07 08:31:21,829 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-07 08:31:21,832 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-07 08:31:21,838 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-07 08:31:21,840 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-07 08:31:22,254 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-11-07 08:31:22,262 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-11-07 08:31:22,263 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-07 08:31:22,264 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ca00bbe-7802-45cf-8c9a-e5551a18caab/bin/uautomizer-AkOaLMaTGY/z3 [2021-11-07 08:31:22,270 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ca00bbe-7802-45cf-8c9a-e5551a18caab/bin/uautomizer-AkOaLMaTGY/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-07 08:31:22,276 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-11-07 08:31:22,286 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-07 08:31:22,286 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-11-07 08:31:22,286 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-07 08:31:22,287 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-07 08:31:22,287 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-07 08:31:22,290 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-11-07 08:31:22,290 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-11-07 08:31:22,291 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ca00bbe-7802-45cf-8c9a-e5551a18caab/bin/uautomizer-AkOaLMaTGY/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2021-11-07 08:31:22,307 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-07 08:31:22,343 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ca00bbe-7802-45cf-8c9a-e5551a18caab/bin/uautomizer-AkOaLMaTGY/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Ended with exit code 0 [2021-11-07 08:31:22,344 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-07 08:31:22,344 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ca00bbe-7802-45cf-8c9a-e5551a18caab/bin/uautomizer-AkOaLMaTGY/z3 [2021-11-07 08:31:22,345 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ca00bbe-7802-45cf-8c9a-e5551a18caab/bin/uautomizer-AkOaLMaTGY/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-07 08:31:22,351 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ca00bbe-7802-45cf-8c9a-e5551a18caab/bin/uautomizer-AkOaLMaTGY/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2021-11-07 08:31:22,355 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-11-07 08:31:22,364 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-07 08:31:22,365 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-11-07 08:31:22,365 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-07 08:31:22,365 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-07 08:31:22,365 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-07 08:31:22,366 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-11-07 08:31:22,367 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-11-07 08:31:22,382 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-07 08:31:22,404 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ca00bbe-7802-45cf-8c9a-e5551a18caab/bin/uautomizer-AkOaLMaTGY/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Ended with exit code 0 [2021-11-07 08:31:22,407 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-07 08:31:22,407 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ca00bbe-7802-45cf-8c9a-e5551a18caab/bin/uautomizer-AkOaLMaTGY/z3 [2021-11-07 08:31:22,408 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ca00bbe-7802-45cf-8c9a-e5551a18caab/bin/uautomizer-AkOaLMaTGY/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-07 08:31:22,411 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-11-07 08:31:22,420 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-07 08:31:22,420 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-11-07 08:31:22,420 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-07 08:31:22,420 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-07 08:31:22,420 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-07 08:31:22,421 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-11-07 08:31:22,421 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-11-07 08:31:22,426 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ca00bbe-7802-45cf-8c9a-e5551a18caab/bin/uautomizer-AkOaLMaTGY/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2021-11-07 08:31:22,442 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-07 08:31:22,466 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ca00bbe-7802-45cf-8c9a-e5551a18caab/bin/uautomizer-AkOaLMaTGY/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2021-11-07 08:31:22,467 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-07 08:31:22,467 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ca00bbe-7802-45cf-8c9a-e5551a18caab/bin/uautomizer-AkOaLMaTGY/z3 [2021-11-07 08:31:22,468 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ca00bbe-7802-45cf-8c9a-e5551a18caab/bin/uautomizer-AkOaLMaTGY/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-07 08:31:22,468 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ca00bbe-7802-45cf-8c9a-e5551a18caab/bin/uautomizer-AkOaLMaTGY/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2021-11-07 08:31:22,469 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-11-07 08:31:22,476 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-07 08:31:22,477 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-07 08:31:22,477 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-07 08:31:22,477 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-07 08:31:22,483 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-11-07 08:31:22,485 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-11-07 08:31:22,490 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-07 08:31:22,511 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ca00bbe-7802-45cf-8c9a-e5551a18caab/bin/uautomizer-AkOaLMaTGY/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2021-11-07 08:31:22,511 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-07 08:31:22,511 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ca00bbe-7802-45cf-8c9a-e5551a18caab/bin/uautomizer-AkOaLMaTGY/z3 [2021-11-07 08:31:22,512 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ca00bbe-7802-45cf-8c9a-e5551a18caab/bin/uautomizer-AkOaLMaTGY/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-07 08:31:22,515 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-11-07 08:31:22,515 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ca00bbe-7802-45cf-8c9a-e5551a18caab/bin/uautomizer-AkOaLMaTGY/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2021-11-07 08:31:22,522 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-07 08:31:22,523 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-07 08:31:22,523 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-07 08:31:22,523 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-07 08:31:22,528 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-11-07 08:31:22,528 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-11-07 08:31:22,562 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-07 08:31:22,599 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ca00bbe-7802-45cf-8c9a-e5551a18caab/bin/uautomizer-AkOaLMaTGY/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2021-11-07 08:31:22,599 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-07 08:31:22,599 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ca00bbe-7802-45cf-8c9a-e5551a18caab/bin/uautomizer-AkOaLMaTGY/z3 [2021-11-07 08:31:22,603 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ca00bbe-7802-45cf-8c9a-e5551a18caab/bin/uautomizer-AkOaLMaTGY/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-07 08:31:22,608 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ca00bbe-7802-45cf-8c9a-e5551a18caab/bin/uautomizer-AkOaLMaTGY/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2021-11-07 08:31:22,608 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-11-07 08:31:22,618 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-07 08:31:22,618 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-07 08:31:22,618 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-07 08:31:22,619 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-07 08:31:22,621 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-11-07 08:31:22,622 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-11-07 08:31:22,640 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-07 08:31:22,676 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ca00bbe-7802-45cf-8c9a-e5551a18caab/bin/uautomizer-AkOaLMaTGY/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2021-11-07 08:31:22,676 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-07 08:31:22,676 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ca00bbe-7802-45cf-8c9a-e5551a18caab/bin/uautomizer-AkOaLMaTGY/z3 [2021-11-07 08:31:22,677 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ca00bbe-7802-45cf-8c9a-e5551a18caab/bin/uautomizer-AkOaLMaTGY/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-07 08:31:22,686 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ca00bbe-7802-45cf-8c9a-e5551a18caab/bin/uautomizer-AkOaLMaTGY/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2021-11-07 08:31:22,686 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-11-07 08:31:22,696 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-07 08:31:22,697 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-11-07 08:31:22,697 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-07 08:31:22,697 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-07 08:31:22,697 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-07 08:31:22,698 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-11-07 08:31:22,698 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-11-07 08:31:22,714 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-07 08:31:22,733 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ca00bbe-7802-45cf-8c9a-e5551a18caab/bin/uautomizer-AkOaLMaTGY/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2021-11-07 08:31:22,734 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-07 08:31:22,734 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ca00bbe-7802-45cf-8c9a-e5551a18caab/bin/uautomizer-AkOaLMaTGY/z3 [2021-11-07 08:31:22,735 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ca00bbe-7802-45cf-8c9a-e5551a18caab/bin/uautomizer-AkOaLMaTGY/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-07 08:31:22,736 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ca00bbe-7802-45cf-8c9a-e5551a18caab/bin/uautomizer-AkOaLMaTGY/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2021-11-07 08:31:22,737 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-11-07 08:31:22,744 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-07 08:31:22,744 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-11-07 08:31:22,744 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-07 08:31:22,744 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-07 08:31:22,744 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-07 08:31:22,745 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-11-07 08:31:22,745 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-11-07 08:31:22,754 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-07 08:31:22,776 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ca00bbe-7802-45cf-8c9a-e5551a18caab/bin/uautomizer-AkOaLMaTGY/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2021-11-07 08:31:22,776 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-07 08:31:22,776 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ca00bbe-7802-45cf-8c9a-e5551a18caab/bin/uautomizer-AkOaLMaTGY/z3 [2021-11-07 08:31:22,777 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ca00bbe-7802-45cf-8c9a-e5551a18caab/bin/uautomizer-AkOaLMaTGY/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-07 08:31:22,781 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ca00bbe-7802-45cf-8c9a-e5551a18caab/bin/uautomizer-AkOaLMaTGY/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2021-11-07 08:31:22,781 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-11-07 08:31:22,789 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-07 08:31:22,789 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-11-07 08:31:22,789 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-07 08:31:22,789 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-07 08:31:22,789 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-07 08:31:22,790 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-11-07 08:31:22,790 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-11-07 08:31:22,794 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-07 08:31:22,813 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ca00bbe-7802-45cf-8c9a-e5551a18caab/bin/uautomizer-AkOaLMaTGY/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2021-11-07 08:31:22,813 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-07 08:31:22,813 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ca00bbe-7802-45cf-8c9a-e5551a18caab/bin/uautomizer-AkOaLMaTGY/z3 [2021-11-07 08:31:22,814 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ca00bbe-7802-45cf-8c9a-e5551a18caab/bin/uautomizer-AkOaLMaTGY/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-07 08:31:22,818 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ca00bbe-7802-45cf-8c9a-e5551a18caab/bin/uautomizer-AkOaLMaTGY/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2021-11-07 08:31:22,818 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-11-07 08:31:22,825 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-07 08:31:22,825 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-07 08:31:22,825 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-07 08:31:22,825 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-07 08:31:22,827 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-11-07 08:31:22,828 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-11-07 08:31:22,866 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-07 08:31:22,886 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ca00bbe-7802-45cf-8c9a-e5551a18caab/bin/uautomizer-AkOaLMaTGY/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2021-11-07 08:31:22,886 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-07 08:31:22,887 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ca00bbe-7802-45cf-8c9a-e5551a18caab/bin/uautomizer-AkOaLMaTGY/z3 [2021-11-07 08:31:22,887 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ca00bbe-7802-45cf-8c9a-e5551a18caab/bin/uautomizer-AkOaLMaTGY/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-07 08:31:22,888 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ca00bbe-7802-45cf-8c9a-e5551a18caab/bin/uautomizer-AkOaLMaTGY/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2021-11-07 08:31:22,889 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-11-07 08:31:22,896 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-07 08:31:22,896 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-07 08:31:22,896 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-07 08:31:22,896 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-07 08:31:22,901 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-11-07 08:31:22,901 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-11-07 08:31:22,934 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-11-07 08:31:22,967 INFO L443 ModelExtractionUtils]: Simplification made 9 calls to the SMT solver. [2021-11-07 08:31:22,968 INFO L444 ModelExtractionUtils]: 5 out of 16 variables were initially zero. Simplification set additionally 8 variables to zero. [2021-11-07 08:31:22,969 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-07 08:31:22,969 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ca00bbe-7802-45cf-8c9a-e5551a18caab/bin/uautomizer-AkOaLMaTGY/z3 [2021-11-07 08:31:22,971 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ca00bbe-7802-45cf-8c9a-e5551a18caab/bin/uautomizer-AkOaLMaTGY/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-07 08:31:22,982 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-11-07 08:31:22,990 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ca00bbe-7802-45cf-8c9a-e5551a18caab/bin/uautomizer-AkOaLMaTGY/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2021-11-07 08:31:23,021 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2021-11-07 08:31:23,021 INFO L513 LassoAnalysis]: Proved termination. [2021-11-07 08:31:23,022 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_test_fun_~i_ref~0.base) ULTIMATE.start_test_fun_~i_ref~0.offset)_1) = 2*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~i_ref~0.base) ULTIMATE.start_test_fun_~i_ref~0.offset)_1 + 1 Supporting invariants [] [2021-11-07 08:31:23,054 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ca00bbe-7802-45cf-8c9a-e5551a18caab/bin/uautomizer-AkOaLMaTGY/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2021-11-07 08:31:23,126 INFO L297 tatePredicateManager]: 20 out of 20 supporting invariants were superfluous and have been removed [2021-11-07 08:31:23,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 08:31:23,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 08:31:23,198 INFO L263 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 2 conjunts are in the unsatisfiable core [2021-11-07 08:31:23,199 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-07 08:31:23,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 08:31:23,242 INFO L263 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 9 conjunts are in the unsatisfiable core [2021-11-07 08:31:23,243 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-07 08:31:23,350 INFO L354 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2021-11-07 08:31:23,351 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 33 [2021-11-07 08:31:23,427 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ca00bbe-7802-45cf-8c9a-e5551a18caab/bin/uautomizer-AkOaLMaTGY/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Ended with exit code 0 [2021-11-07 08:31:23,561 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 08:31:23,565 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 5 loop predicates [2021-11-07 08:31:23,566 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 7 states and 8 transitions. cyclomatic complexity: 2 Second operand has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 6 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 08:31:23,705 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 7 states and 8 transitions. cyclomatic complexity: 2. Second operand has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 6 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 17 states and 20 transitions. Complement of second has 11 states. [2021-11-07 08:31:23,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 4 non-accepting loop states 1 accepting loop states [2021-11-07 08:31:23,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 6 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 08:31:23,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 7 transitions. [2021-11-07 08:31:23,708 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 7 transitions. Stem has 2 letters. Loop has 5 letters. [2021-11-07 08:31:23,708 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-11-07 08:31:23,709 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 7 transitions. Stem has 7 letters. Loop has 5 letters. [2021-11-07 08:31:23,709 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-11-07 08:31:23,709 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 7 transitions. Stem has 2 letters. Loop has 10 letters. [2021-11-07 08:31:23,709 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-11-07 08:31:23,710 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 17 states and 20 transitions. [2021-11-07 08:31:23,712 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2021-11-07 08:31:23,714 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 17 states to 16 states and 19 transitions. [2021-11-07 08:31:23,714 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2021-11-07 08:31:23,714 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2021-11-07 08:31:23,714 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 19 transitions. [2021-11-07 08:31:23,714 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-11-07 08:31:23,715 INFO L681 BuchiCegarLoop]: Abstraction has 16 states and 19 transitions. [2021-11-07 08:31:23,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states and 19 transitions. [2021-11-07 08:31:23,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2021-11-07 08:31:23,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 1.1875) internal successors, (19), 15 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 08:31:23,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 19 transitions. [2021-11-07 08:31:23,718 INFO L704 BuchiCegarLoop]: Abstraction has 16 states and 19 transitions. [2021-11-07 08:31:23,718 INFO L587 BuchiCegarLoop]: Abstraction has 16 states and 19 transitions. [2021-11-07 08:31:23,718 INFO L425 BuchiCegarLoop]: ======== Iteration 3============ [2021-11-07 08:31:23,718 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 19 transitions. [2021-11-07 08:31:23,719 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2021-11-07 08:31:23,720 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-11-07 08:31:23,720 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-11-07 08:31:23,720 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2021-11-07 08:31:23,720 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-11-07 08:31:23,721 INFO L791 eck$LassoCheckResult]: Stem: 192#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 193#L-1 havoc main_#res;havoc main_#t~nondet11, main_#t~nondet12, main_#t~ret13;test_fun_#in~i, test_fun_#in~j := main_#t~nondet11, main_#t~nondet12;havoc test_fun_#res;havoc test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset, test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset, test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset, test_fun_#t~mem8, test_fun_#t~mem7, test_fun_#t~mem6, test_fun_#t~mem9, test_fun_#t~mem5, test_fun_#t~mem10, test_fun_~i, test_fun_~j, test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, test_fun_~c~0.base, test_fun_~c~0.offset;test_fun_~i := test_fun_#in~i;test_fun_~j := test_fun_#in~j;call test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.allocOnStack(4);test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset;call test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.allocOnStack(4);test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;call test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset := #Ultimate.allocOnStack(4);test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset;call write~int(test_fun_~i, test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4);call write~int(test_fun_~j, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); 203#L555-3 call test_fun_#t~mem5 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 198#L555-1 assume !!(test_fun_#t~mem5 >= 0);havoc test_fun_#t~mem5;call write~int(0, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4); 199#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 200#L557-1 assume !!(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);havoc test_fun_#t~mem8; 204#L557-3 [2021-11-07 08:31:23,721 INFO L793 eck$LassoCheckResult]: Loop: 204#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 207#L557-1 assume !!(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);havoc test_fun_#t~mem8; 204#L557-3 [2021-11-07 08:31:23,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 08:31:23,722 INFO L85 PathProgramCache]: Analyzing trace with hash 889571341, now seen corresponding path program 1 times [2021-11-07 08:31:23,722 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 08:31:23,722 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [540657820] [2021-11-07 08:31:23,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 08:31:23,723 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 08:31:23,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-07 08:31:23,776 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-07 08:31:23,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-07 08:31:23,812 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-07 08:31:23,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 08:31:23,818 INFO L85 PathProgramCache]: Analyzing trace with hash 1510, now seen corresponding path program 1 times [2021-11-07 08:31:23,819 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 08:31:23,819 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [597564170] [2021-11-07 08:31:23,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 08:31:23,823 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 08:31:23,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-07 08:31:23,835 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-07 08:31:23,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-07 08:31:23,844 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-07 08:31:23,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 08:31:23,845 INFO L85 PathProgramCache]: Analyzing trace with hash 179567346, now seen corresponding path program 2 times [2021-11-07 08:31:23,846 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 08:31:23,849 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1858444665] [2021-11-07 08:31:23,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 08:31:23,853 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 08:31:23,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-07 08:31:23,886 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-07 08:31:23,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-07 08:31:23,924 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-07 08:31:25,029 INFO L210 LassoAnalysis]: Preferences: [2021-11-07 08:31:25,030 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-11-07 08:31:25,030 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-11-07 08:31:25,030 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-11-07 08:31:25,030 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-11-07 08:31:25,030 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-07 08:31:25,030 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-11-07 08:31:25,030 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-11-07 08:31:25,030 INFO L133 ssoRankerPreferences]: Filename of dumped script: c.08-alloca.i_Iteration3_Lasso [2021-11-07 08:31:25,030 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-11-07 08:31:25,030 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-11-07 08:31:25,035 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-07 08:31:25,038 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-07 08:31:25,040 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-07 08:31:25,042 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-07 08:31:25,045 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-07 08:31:25,048 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-07 08:31:25,050 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-07 08:31:25,053 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-07 08:31:25,055 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-07 08:31:25,444 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-07 08:31:25,447 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-07 08:31:25,449 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-07 08:31:25,452 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-07 08:31:25,454 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-07 08:31:25,457 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-07 08:31:25,459 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-07 08:31:25,868 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-11-07 08:31:25,868 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-11-07 08:31:25,868 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-07 08:31:25,868 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ca00bbe-7802-45cf-8c9a-e5551a18caab/bin/uautomizer-AkOaLMaTGY/z3 [2021-11-07 08:31:25,870 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ca00bbe-7802-45cf-8c9a-e5551a18caab/bin/uautomizer-AkOaLMaTGY/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-07 08:31:25,875 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-11-07 08:31:25,882 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ca00bbe-7802-45cf-8c9a-e5551a18caab/bin/uautomizer-AkOaLMaTGY/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2021-11-07 08:31:25,883 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-07 08:31:25,883 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-11-07 08:31:25,884 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-07 08:31:25,884 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-07 08:31:25,884 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-07 08:31:25,884 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-11-07 08:31:25,884 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-11-07 08:31:25,885 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-07 08:31:25,918 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ca00bbe-7802-45cf-8c9a-e5551a18caab/bin/uautomizer-AkOaLMaTGY/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Forceful destruction successful, exit code 0 [2021-11-07 08:31:25,918 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-07 08:31:25,918 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ca00bbe-7802-45cf-8c9a-e5551a18caab/bin/uautomizer-AkOaLMaTGY/z3 [2021-11-07 08:31:25,919 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ca00bbe-7802-45cf-8c9a-e5551a18caab/bin/uautomizer-AkOaLMaTGY/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-07 08:31:25,931 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-11-07 08:31:25,939 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-07 08:31:25,940 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-11-07 08:31:25,940 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-07 08:31:25,940 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-07 08:31:25,940 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-07 08:31:25,940 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-11-07 08:31:25,941 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-11-07 08:31:25,950 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ca00bbe-7802-45cf-8c9a-e5551a18caab/bin/uautomizer-AkOaLMaTGY/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2021-11-07 08:31:25,966 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-07 08:31:25,995 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ca00bbe-7802-45cf-8c9a-e5551a18caab/bin/uautomizer-AkOaLMaTGY/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0 [2021-11-07 08:31:25,995 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-07 08:31:25,995 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ca00bbe-7802-45cf-8c9a-e5551a18caab/bin/uautomizer-AkOaLMaTGY/z3 [2021-11-07 08:31:25,996 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ca00bbe-7802-45cf-8c9a-e5551a18caab/bin/uautomizer-AkOaLMaTGY/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-07 08:31:25,998 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ca00bbe-7802-45cf-8c9a-e5551a18caab/bin/uautomizer-AkOaLMaTGY/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2021-11-07 08:31:25,998 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-11-07 08:31:26,005 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-07 08:31:26,005 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-11-07 08:31:26,006 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-07 08:31:26,006 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-07 08:31:26,006 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-07 08:31:26,006 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-11-07 08:31:26,006 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-11-07 08:31:26,012 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-07 08:31:26,031 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ca00bbe-7802-45cf-8c9a-e5551a18caab/bin/uautomizer-AkOaLMaTGY/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Forceful destruction successful, exit code 0 [2021-11-07 08:31:26,031 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-07 08:31:26,031 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ca00bbe-7802-45cf-8c9a-e5551a18caab/bin/uautomizer-AkOaLMaTGY/z3 [2021-11-07 08:31:26,033 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ca00bbe-7802-45cf-8c9a-e5551a18caab/bin/uautomizer-AkOaLMaTGY/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-07 08:31:26,034 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ca00bbe-7802-45cf-8c9a-e5551a18caab/bin/uautomizer-AkOaLMaTGY/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2021-11-07 08:31:26,036 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-11-07 08:31:26,043 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-07 08:31:26,043 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-07 08:31:26,043 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-07 08:31:26,043 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-07 08:31:26,045 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-11-07 08:31:26,046 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-11-07 08:31:26,060 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-07 08:31:26,097 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ca00bbe-7802-45cf-8c9a-e5551a18caab/bin/uautomizer-AkOaLMaTGY/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Forceful destruction successful, exit code 0 [2021-11-07 08:31:26,098 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-07 08:31:26,098 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ca00bbe-7802-45cf-8c9a-e5551a18caab/bin/uautomizer-AkOaLMaTGY/z3 [2021-11-07 08:31:26,099 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ca00bbe-7802-45cf-8c9a-e5551a18caab/bin/uautomizer-AkOaLMaTGY/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-07 08:31:26,107 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ca00bbe-7802-45cf-8c9a-e5551a18caab/bin/uautomizer-AkOaLMaTGY/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2021-11-07 08:31:26,107 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-11-07 08:31:26,115 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-07 08:31:26,116 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-07 08:31:26,116 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-07 08:31:26,116 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-07 08:31:26,118 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-11-07 08:31:26,118 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-11-07 08:31:26,146 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-07 08:31:26,182 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ca00bbe-7802-45cf-8c9a-e5551a18caab/bin/uautomizer-AkOaLMaTGY/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Forceful destruction successful, exit code 0 [2021-11-07 08:31:26,182 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-07 08:31:26,182 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ca00bbe-7802-45cf-8c9a-e5551a18caab/bin/uautomizer-AkOaLMaTGY/z3 [2021-11-07 08:31:26,187 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ca00bbe-7802-45cf-8c9a-e5551a18caab/bin/uautomizer-AkOaLMaTGY/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-07 08:31:26,193 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-11-07 08:31:26,202 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-07 08:31:26,202 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-11-07 08:31:26,202 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-07 08:31:26,203 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-07 08:31:26,203 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-07 08:31:26,203 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-11-07 08:31:26,203 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-11-07 08:31:26,204 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ca00bbe-7802-45cf-8c9a-e5551a18caab/bin/uautomizer-AkOaLMaTGY/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2021-11-07 08:31:26,214 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-07 08:31:26,242 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ca00bbe-7802-45cf-8c9a-e5551a18caab/bin/uautomizer-AkOaLMaTGY/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Forceful destruction successful, exit code 0 [2021-11-07 08:31:26,242 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-07 08:31:26,242 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ca00bbe-7802-45cf-8c9a-e5551a18caab/bin/uautomizer-AkOaLMaTGY/z3 [2021-11-07 08:31:26,243 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ca00bbe-7802-45cf-8c9a-e5551a18caab/bin/uautomizer-AkOaLMaTGY/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-07 08:31:26,244 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ca00bbe-7802-45cf-8c9a-e5551a18caab/bin/uautomizer-AkOaLMaTGY/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2021-11-07 08:31:26,248 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-11-07 08:31:26,255 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-07 08:31:26,255 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-11-07 08:31:26,255 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-07 08:31:26,255 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-07 08:31:26,255 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-07 08:31:26,256 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-11-07 08:31:26,256 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-11-07 08:31:26,258 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-07 08:31:26,281 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ca00bbe-7802-45cf-8c9a-e5551a18caab/bin/uautomizer-AkOaLMaTGY/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Forceful destruction successful, exit code 0 [2021-11-07 08:31:26,281 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-07 08:31:26,281 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ca00bbe-7802-45cf-8c9a-e5551a18caab/bin/uautomizer-AkOaLMaTGY/z3 [2021-11-07 08:31:26,282 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ca00bbe-7802-45cf-8c9a-e5551a18caab/bin/uautomizer-AkOaLMaTGY/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-07 08:31:26,285 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ca00bbe-7802-45cf-8c9a-e5551a18caab/bin/uautomizer-AkOaLMaTGY/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2021-11-07 08:31:26,286 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-11-07 08:31:26,293 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-07 08:31:26,293 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-11-07 08:31:26,293 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-07 08:31:26,293 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-07 08:31:26,293 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-07 08:31:26,293 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-11-07 08:31:26,294 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-11-07 08:31:26,299 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-07 08:31:26,317 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ca00bbe-7802-45cf-8c9a-e5551a18caab/bin/uautomizer-AkOaLMaTGY/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Forceful destruction successful, exit code 0 [2021-11-07 08:31:26,318 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-07 08:31:26,318 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ca00bbe-7802-45cf-8c9a-e5551a18caab/bin/uautomizer-AkOaLMaTGY/z3 [2021-11-07 08:31:26,318 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ca00bbe-7802-45cf-8c9a-e5551a18caab/bin/uautomizer-AkOaLMaTGY/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-07 08:31:26,319 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ca00bbe-7802-45cf-8c9a-e5551a18caab/bin/uautomizer-AkOaLMaTGY/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2021-11-07 08:31:26,320 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-11-07 08:31:26,326 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-07 08:31:26,327 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-07 08:31:26,327 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-07 08:31:26,327 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-07 08:31:26,329 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-11-07 08:31:26,329 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-11-07 08:31:26,362 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-07 08:31:26,388 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ca00bbe-7802-45cf-8c9a-e5551a18caab/bin/uautomizer-AkOaLMaTGY/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Forceful destruction successful, exit code 0 [2021-11-07 08:31:26,388 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-07 08:31:26,388 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ca00bbe-7802-45cf-8c9a-e5551a18caab/bin/uautomizer-AkOaLMaTGY/z3 [2021-11-07 08:31:26,389 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ca00bbe-7802-45cf-8c9a-e5551a18caab/bin/uautomizer-AkOaLMaTGY/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-07 08:31:26,390 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ca00bbe-7802-45cf-8c9a-e5551a18caab/bin/uautomizer-AkOaLMaTGY/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2021-11-07 08:31:26,390 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-11-07 08:31:26,397 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-07 08:31:26,397 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-07 08:31:26,398 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-07 08:31:26,398 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-07 08:31:26,401 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-11-07 08:31:26,402 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-11-07 08:31:26,405 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-07 08:31:26,438 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ca00bbe-7802-45cf-8c9a-e5551a18caab/bin/uautomizer-AkOaLMaTGY/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Forceful destruction successful, exit code 0 [2021-11-07 08:31:26,438 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-07 08:31:26,438 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ca00bbe-7802-45cf-8c9a-e5551a18caab/bin/uautomizer-AkOaLMaTGY/z3 [2021-11-07 08:31:26,439 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ca00bbe-7802-45cf-8c9a-e5551a18caab/bin/uautomizer-AkOaLMaTGY/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-07 08:31:26,441 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-11-07 08:31:26,450 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-07 08:31:26,450 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-07 08:31:26,450 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-07 08:31:26,450 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-07 08:31:26,456 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-11-07 08:31:26,457 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-11-07 08:31:26,488 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ca00bbe-7802-45cf-8c9a-e5551a18caab/bin/uautomizer-AkOaLMaTGY/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2021-11-07 08:31:26,489 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-07 08:31:26,537 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ca00bbe-7802-45cf-8c9a-e5551a18caab/bin/uautomizer-AkOaLMaTGY/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Forceful destruction successful, exit code 0 [2021-11-07 08:31:26,538 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-07 08:31:26,538 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ca00bbe-7802-45cf-8c9a-e5551a18caab/bin/uautomizer-AkOaLMaTGY/z3 [2021-11-07 08:31:26,539 INFO L229 MonitoredProcess]: Starting monitored process 25 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ca00bbe-7802-45cf-8c9a-e5551a18caab/bin/uautomizer-AkOaLMaTGY/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-07 08:31:26,544 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-11-07 08:31:26,553 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-07 08:31:26,553 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-07 08:31:26,553 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-07 08:31:26,553 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-07 08:31:26,555 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-11-07 08:31:26,555 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-11-07 08:31:26,560 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ca00bbe-7802-45cf-8c9a-e5551a18caab/bin/uautomizer-AkOaLMaTGY/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2021-11-07 08:31:26,566 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-07 08:31:26,594 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ca00bbe-7802-45cf-8c9a-e5551a18caab/bin/uautomizer-AkOaLMaTGY/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Forceful destruction successful, exit code 0 [2021-11-07 08:31:26,594 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-07 08:31:26,594 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ca00bbe-7802-45cf-8c9a-e5551a18caab/bin/uautomizer-AkOaLMaTGY/z3 [2021-11-07 08:31:26,595 INFO L229 MonitoredProcess]: Starting monitored process 26 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ca00bbe-7802-45cf-8c9a-e5551a18caab/bin/uautomizer-AkOaLMaTGY/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-07 08:31:26,596 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ca00bbe-7802-45cf-8c9a-e5551a18caab/bin/uautomizer-AkOaLMaTGY/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Waiting until timeout for monitored process [2021-11-07 08:31:26,596 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-11-07 08:31:26,603 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-07 08:31:26,603 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-07 08:31:26,603 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-07 08:31:26,603 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-07 08:31:26,606 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-11-07 08:31:26,606 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-11-07 08:31:26,621 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-07 08:31:26,658 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ca00bbe-7802-45cf-8c9a-e5551a18caab/bin/uautomizer-AkOaLMaTGY/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Forceful destruction successful, exit code 0 [2021-11-07 08:31:26,658 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-07 08:31:26,658 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ca00bbe-7802-45cf-8c9a-e5551a18caab/bin/uautomizer-AkOaLMaTGY/z3 [2021-11-07 08:31:26,659 INFO L229 MonitoredProcess]: Starting monitored process 27 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ca00bbe-7802-45cf-8c9a-e5551a18caab/bin/uautomizer-AkOaLMaTGY/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-07 08:31:26,667 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-11-07 08:31:26,676 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-07 08:31:26,676 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-07 08:31:26,676 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-07 08:31:26,676 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-07 08:31:26,678 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-11-07 08:31:26,678 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-11-07 08:31:26,682 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ca00bbe-7802-45cf-8c9a-e5551a18caab/bin/uautomizer-AkOaLMaTGY/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Waiting until timeout for monitored process [2021-11-07 08:31:26,698 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-07 08:31:26,718 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ca00bbe-7802-45cf-8c9a-e5551a18caab/bin/uautomizer-AkOaLMaTGY/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Ended with exit code 0 [2021-11-07 08:31:26,719 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-07 08:31:26,719 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ca00bbe-7802-45cf-8c9a-e5551a18caab/bin/uautomizer-AkOaLMaTGY/z3 [2021-11-07 08:31:26,719 INFO L229 MonitoredProcess]: Starting monitored process 28 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ca00bbe-7802-45cf-8c9a-e5551a18caab/bin/uautomizer-AkOaLMaTGY/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-07 08:31:26,720 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ca00bbe-7802-45cf-8c9a-e5551a18caab/bin/uautomizer-AkOaLMaTGY/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Waiting until timeout for monitored process [2021-11-07 08:31:26,721 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-11-07 08:31:26,729 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-07 08:31:26,729 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-07 08:31:26,729 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-07 08:31:26,729 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-07 08:31:26,736 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-11-07 08:31:26,737 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-11-07 08:31:26,782 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-07 08:31:26,814 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ca00bbe-7802-45cf-8c9a-e5551a18caab/bin/uautomizer-AkOaLMaTGY/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Forceful destruction successful, exit code 0 [2021-11-07 08:31:26,815 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-07 08:31:26,815 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ca00bbe-7802-45cf-8c9a-e5551a18caab/bin/uautomizer-AkOaLMaTGY/z3 [2021-11-07 08:31:26,816 INFO L229 MonitoredProcess]: Starting monitored process 29 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ca00bbe-7802-45cf-8c9a-e5551a18caab/bin/uautomizer-AkOaLMaTGY/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-07 08:31:26,823 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-11-07 08:31:26,832 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-07 08:31:26,833 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-07 08:31:26,833 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-07 08:31:26,833 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-07 08:31:26,837 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-11-07 08:31:26,838 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-11-07 08:31:26,848 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ca00bbe-7802-45cf-8c9a-e5551a18caab/bin/uautomizer-AkOaLMaTGY/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Waiting until timeout for monitored process [2021-11-07 08:31:26,854 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-11-07 08:31:26,876 INFO L443 ModelExtractionUtils]: Simplification made 12 calls to the SMT solver. [2021-11-07 08:31:26,876 INFO L444 ModelExtractionUtils]: 5 out of 19 variables were initially zero. Simplification set additionally 9 variables to zero. [2021-11-07 08:31:26,876 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-07 08:31:26,876 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ca00bbe-7802-45cf-8c9a-e5551a18caab/bin/uautomizer-AkOaLMaTGY/z3 [2021-11-07 08:31:26,877 INFO L229 MonitoredProcess]: Starting monitored process 30 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ca00bbe-7802-45cf-8c9a-e5551a18caab/bin/uautomizer-AkOaLMaTGY/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-07 08:31:26,879 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-11-07 08:31:26,887 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ca00bbe-7802-45cf-8c9a-e5551a18caab/bin/uautomizer-AkOaLMaTGY/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Waiting until timeout for monitored process [2021-11-07 08:31:26,905 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2021-11-07 08:31:26,905 INFO L513 LassoAnalysis]: Proved termination. [2021-11-07 08:31:26,906 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_test_fun_~j_ref~0.base) ULTIMATE.start_test_fun_~j_ref~0.offset)_2, ULTIMATE.start_test_fun_~i) = -1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~j_ref~0.base) ULTIMATE.start_test_fun_~j_ref~0.offset)_2 + 1*ULTIMATE.start_test_fun_~i Supporting invariants [1*ULTIMATE.start_test_fun_~i - 1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~i_ref~0.base) ULTIMATE.start_test_fun_~i_ref~0.offset)_2 >= 0] [2021-11-07 08:31:26,938 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ca00bbe-7802-45cf-8c9a-e5551a18caab/bin/uautomizer-AkOaLMaTGY/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Forceful destruction successful, exit code 0 [2021-11-07 08:31:27,020 INFO L297 tatePredicateManager]: 23 out of 24 supporting invariants were superfluous and have been removed [2021-11-07 08:31:27,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 08:31:27,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 08:31:27,061 INFO L263 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 22 conjunts are in the unsatisfiable core [2021-11-07 08:31:27,062 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-07 08:31:27,107 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2021-11-07 08:31:27,138 INFO L354 Elim1Store]: treesize reduction 28, result has 49.1 percent of original size [2021-11-07 08:31:27,138 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 59 treesize of output 34 [2021-11-07 08:31:27,231 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ca00bbe-7802-45cf-8c9a-e5551a18caab/bin/uautomizer-AkOaLMaTGY/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Forceful destruction successful, exit code 0 [2021-11-07 08:31:27,343 INFO L354 Elim1Store]: treesize reduction 33, result has 17.5 percent of original size [2021-11-07 08:31:27,343 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 30 treesize of output 32 [2021-11-07 08:31:28,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 08:31:28,162 INFO L263 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 7 conjunts are in the unsatisfiable core [2021-11-07 08:31:28,162 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-07 08:31:28,202 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 08:31:28,203 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.4 stem predicates 2 loop predicates [2021-11-07 08:31:28,203 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 16 states and 19 transitions. cyclomatic complexity: 5 Second operand has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 6 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 08:31:28,296 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 16 states and 19 transitions. cyclomatic complexity: 5. Second operand has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 6 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 31 states and 37 transitions. Complement of second has 11 states. [2021-11-07 08:31:28,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 4 stem states 2 non-accepting loop states 2 accepting loop states [2021-11-07 08:31:28,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 6 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 08:31:28,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 17 transitions. [2021-11-07 08:31:28,297 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 17 transitions. Stem has 6 letters. Loop has 2 letters. [2021-11-07 08:31:28,298 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-11-07 08:31:28,298 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 17 transitions. Stem has 8 letters. Loop has 2 letters. [2021-11-07 08:31:28,298 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-11-07 08:31:28,298 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 17 transitions. Stem has 6 letters. Loop has 4 letters. [2021-11-07 08:31:28,298 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-11-07 08:31:28,298 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 31 states and 37 transitions. [2021-11-07 08:31:28,300 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2021-11-07 08:31:28,301 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 31 states to 30 states and 36 transitions. [2021-11-07 08:31:28,301 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2021-11-07 08:31:28,301 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2021-11-07 08:31:28,301 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 36 transitions. [2021-11-07 08:31:28,301 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-11-07 08:31:28,301 INFO L681 BuchiCegarLoop]: Abstraction has 30 states and 36 transitions. [2021-11-07 08:31:28,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states and 36 transitions. [2021-11-07 08:31:28,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 23. [2021-11-07 08:31:28,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 22 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 08:31:28,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 28 transitions. [2021-11-07 08:31:28,304 INFO L704 BuchiCegarLoop]: Abstraction has 23 states and 28 transitions. [2021-11-07 08:31:28,305 INFO L587 BuchiCegarLoop]: Abstraction has 23 states and 28 transitions. [2021-11-07 08:31:28,305 INFO L425 BuchiCegarLoop]: ======== Iteration 4============ [2021-11-07 08:31:28,305 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 28 transitions. [2021-11-07 08:31:28,306 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2021-11-07 08:31:28,306 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-11-07 08:31:28,306 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-11-07 08:31:28,306 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1] [2021-11-07 08:31:28,306 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2021-11-07 08:31:28,307 INFO L791 eck$LassoCheckResult]: Stem: 402#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 403#L-1 havoc main_#res;havoc main_#t~nondet11, main_#t~nondet12, main_#t~ret13;test_fun_#in~i, test_fun_#in~j := main_#t~nondet11, main_#t~nondet12;havoc test_fun_#res;havoc test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset, test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset, test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset, test_fun_#t~mem8, test_fun_#t~mem7, test_fun_#t~mem6, test_fun_#t~mem9, test_fun_#t~mem5, test_fun_#t~mem10, test_fun_~i, test_fun_~j, test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, test_fun_~c~0.base, test_fun_~c~0.offset;test_fun_~i := test_fun_#in~i;test_fun_~j := test_fun_#in~j;call test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.allocOnStack(4);test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset;call test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.allocOnStack(4);test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;call test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset := #Ultimate.allocOnStack(4);test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset;call write~int(test_fun_~i, test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4);call write~int(test_fun_~j, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); 413#L555-3 call test_fun_#t~mem5 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 419#L555-1 assume !!(test_fun_#t~mem5 >= 0);havoc test_fun_#t~mem5;call write~int(0, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4); 421#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 422#L557-1 assume !!(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);havoc test_fun_#t~mem8; 423#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 420#L557-1 assume !(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6; 417#L557-4 [2021-11-07 08:31:28,307 INFO L793 eck$LassoCheckResult]: Loop: 417#L557-4 call test_fun_#t~mem9 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4);call write~int(test_fun_#t~mem9 - 1, test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4);havoc test_fun_#t~mem9; 404#L555-3 call test_fun_#t~mem5 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 405#L555-1 assume !!(test_fun_#t~mem5 >= 0);havoc test_fun_#t~mem5;call write~int(0, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4); 409#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 410#L557-1 assume !(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6; 417#L557-4 [2021-11-07 08:31:28,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 08:31:28,307 INFO L85 PathProgramCache]: Analyzing trace with hash 179567344, now seen corresponding path program 1 times [2021-11-07 08:31:28,308 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 08:31:28,308 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2055787679] [2021-11-07 08:31:28,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 08:31:28,308 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 08:31:28,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-07 08:31:28,328 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-07 08:31:28,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-07 08:31:28,347 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-07 08:31:28,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 08:31:28,348 INFO L85 PathProgramCache]: Analyzing trace with hash 52861313, now seen corresponding path program 2 times [2021-11-07 08:31:28,348 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 08:31:28,348 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1799556024] [2021-11-07 08:31:28,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 08:31:28,349 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 08:31:28,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-07 08:31:28,355 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-07 08:31:28,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-07 08:31:28,362 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-07 08:31:28,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 08:31:28,363 INFO L85 PathProgramCache]: Analyzing trace with hash -474670094, now seen corresponding path program 1 times [2021-11-07 08:31:28,363 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 08:31:28,363 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1813621889] [2021-11-07 08:31:28,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 08:31:28,364 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 08:31:28,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-07 08:31:28,400 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-07 08:31:28,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-07 08:31:28,445 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-07 08:31:29,638 INFO L210 LassoAnalysis]: Preferences: [2021-11-07 08:31:29,638 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-11-07 08:31:29,638 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-11-07 08:31:29,638 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-11-07 08:31:29,638 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-11-07 08:31:29,638 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-07 08:31:29,639 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-11-07 08:31:29,639 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-11-07 08:31:29,639 INFO L133 ssoRankerPreferences]: Filename of dumped script: c.08-alloca.i_Iteration4_Lasso [2021-11-07 08:31:29,639 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-11-07 08:31:29,639 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-11-07 08:31:29,642 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-07 08:31:30,011 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-07 08:31:30,024 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-07 08:31:30,026 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-07 08:31:30,028 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-07 08:31:30,030 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-07 08:31:30,032 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-07 08:31:30,034 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-07 08:31:30,036 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-07 08:31:30,048 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-07 08:31:30,049 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-07 08:31:30,051 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-07 08:31:30,055 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-07 08:31:30,056 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-07 08:31:30,058 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-07 08:31:30,060 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-07 08:31:30,454 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-11-07 08:31:30,455 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-11-07 08:31:30,455 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-07 08:31:30,455 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ca00bbe-7802-45cf-8c9a-e5551a18caab/bin/uautomizer-AkOaLMaTGY/z3 [2021-11-07 08:31:30,461 INFO L229 MonitoredProcess]: Starting monitored process 31 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ca00bbe-7802-45cf-8c9a-e5551a18caab/bin/uautomizer-AkOaLMaTGY/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-07 08:31:30,466 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ca00bbe-7802-45cf-8c9a-e5551a18caab/bin/uautomizer-AkOaLMaTGY/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Waiting until timeout for monitored process [2021-11-07 08:31:30,466 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-11-07 08:31:30,473 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-07 08:31:30,473 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-07 08:31:30,473 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-07 08:31:30,473 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-07 08:31:30,475 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-11-07 08:31:30,475 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-11-07 08:31:30,477 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-07 08:31:30,496 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ca00bbe-7802-45cf-8c9a-e5551a18caab/bin/uautomizer-AkOaLMaTGY/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Forceful destruction successful, exit code 0 [2021-11-07 08:31:30,496 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-07 08:31:30,497 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ca00bbe-7802-45cf-8c9a-e5551a18caab/bin/uautomizer-AkOaLMaTGY/z3 [2021-11-07 08:31:30,498 INFO L229 MonitoredProcess]: Starting monitored process 32 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ca00bbe-7802-45cf-8c9a-e5551a18caab/bin/uautomizer-AkOaLMaTGY/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-07 08:31:30,498 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ca00bbe-7802-45cf-8c9a-e5551a18caab/bin/uautomizer-AkOaLMaTGY/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Waiting until timeout for monitored process [2021-11-07 08:31:30,499 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-11-07 08:31:30,506 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-07 08:31:30,506 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-07 08:31:30,506 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-07 08:31:30,506 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-07 08:31:30,513 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-11-07 08:31:30,513 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-11-07 08:31:30,523 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-07 08:31:30,545 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ca00bbe-7802-45cf-8c9a-e5551a18caab/bin/uautomizer-AkOaLMaTGY/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Forceful destruction successful, exit code 0 [2021-11-07 08:31:30,546 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-07 08:31:30,546 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ca00bbe-7802-45cf-8c9a-e5551a18caab/bin/uautomizer-AkOaLMaTGY/z3 [2021-11-07 08:31:30,546 INFO L229 MonitoredProcess]: Starting monitored process 33 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ca00bbe-7802-45cf-8c9a-e5551a18caab/bin/uautomizer-AkOaLMaTGY/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-07 08:31:30,549 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ca00bbe-7802-45cf-8c9a-e5551a18caab/bin/uautomizer-AkOaLMaTGY/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Waiting until timeout for monitored process [2021-11-07 08:31:30,549 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-11-07 08:31:30,556 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-07 08:31:30,557 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-07 08:31:30,557 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-07 08:31:30,557 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-07 08:31:30,560 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-11-07 08:31:30,561 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-11-07 08:31:30,567 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-07 08:31:30,586 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ca00bbe-7802-45cf-8c9a-e5551a18caab/bin/uautomizer-AkOaLMaTGY/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Forceful destruction successful, exit code 0 [2021-11-07 08:31:30,586 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-07 08:31:30,586 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ca00bbe-7802-45cf-8c9a-e5551a18caab/bin/uautomizer-AkOaLMaTGY/z3 [2021-11-07 08:31:30,587 INFO L229 MonitoredProcess]: Starting monitored process 34 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ca00bbe-7802-45cf-8c9a-e5551a18caab/bin/uautomizer-AkOaLMaTGY/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-07 08:31:30,587 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ca00bbe-7802-45cf-8c9a-e5551a18caab/bin/uautomizer-AkOaLMaTGY/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Waiting until timeout for monitored process [2021-11-07 08:31:30,588 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-11-07 08:31:30,595 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-07 08:31:30,595 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-07 08:31:30,595 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-07 08:31:30,595 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-07 08:31:30,598 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-11-07 08:31:30,598 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-11-07 08:31:30,605 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-11-07 08:31:30,635 INFO L443 ModelExtractionUtils]: Simplification made 11 calls to the SMT solver. [2021-11-07 08:31:30,636 INFO L444 ModelExtractionUtils]: 6 out of 19 variables were initially zero. Simplification set additionally 11 variables to zero. [2021-11-07 08:31:30,636 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-07 08:31:30,636 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ca00bbe-7802-45cf-8c9a-e5551a18caab/bin/uautomizer-AkOaLMaTGY/z3 [2021-11-07 08:31:30,638 INFO L229 MonitoredProcess]: Starting monitored process 35 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ca00bbe-7802-45cf-8c9a-e5551a18caab/bin/uautomizer-AkOaLMaTGY/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-07 08:31:30,640 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ca00bbe-7802-45cf-8c9a-e5551a18caab/bin/uautomizer-AkOaLMaTGY/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Waiting until timeout for monitored process [2021-11-07 08:31:30,641 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-11-07 08:31:30,648 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2021-11-07 08:31:30,648 INFO L513 LassoAnalysis]: Proved termination. [2021-11-07 08:31:30,649 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_test_fun_~i_ref~0.base) ULTIMATE.start_test_fun_~i_ref~0.offset)_3) = 1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~i_ref~0.base) ULTIMATE.start_test_fun_~i_ref~0.offset)_3 Supporting invariants [] [2021-11-07 08:31:30,671 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ca00bbe-7802-45cf-8c9a-e5551a18caab/bin/uautomizer-AkOaLMaTGY/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Forceful destruction successful, exit code 0 [2021-11-07 08:31:30,735 INFO L297 tatePredicateManager]: 23 out of 23 supporting invariants were superfluous and have been removed [2021-11-07 08:31:30,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 08:31:30,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 08:31:30,768 INFO L263 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 2 conjunts are in the unsatisfiable core [2021-11-07 08:31:30,769 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-07 08:31:30,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 08:31:30,798 INFO L263 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 9 conjunts are in the unsatisfiable core [2021-11-07 08:31:30,799 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-07 08:31:30,807 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-11-07 08:31:30,862 INFO L354 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2021-11-07 08:31:30,863 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 31 [2021-11-07 08:31:30,961 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 08:31:30,961 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 5 loop predicates [2021-11-07 08:31:30,961 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 23 states and 28 transitions. cyclomatic complexity: 8 Second operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 08:31:30,994 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 23 states and 28 transitions. cyclomatic complexity: 8. Second operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 44 states and 52 transitions. Complement of second has 9 states. [2021-11-07 08:31:30,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2021-11-07 08:31:30,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 08:31:30,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 13 transitions. [2021-11-07 08:31:30,996 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 13 transitions. Stem has 8 letters. Loop has 5 letters. [2021-11-07 08:31:30,997 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-11-07 08:31:30,997 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 13 transitions. Stem has 13 letters. Loop has 5 letters. [2021-11-07 08:31:30,997 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-11-07 08:31:30,997 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 13 transitions. Stem has 8 letters. Loop has 10 letters. [2021-11-07 08:31:30,997 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-11-07 08:31:30,998 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 44 states and 52 transitions. [2021-11-07 08:31:30,999 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2021-11-07 08:31:31,001 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 44 states to 34 states and 40 transitions. [2021-11-07 08:31:31,001 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2021-11-07 08:31:31,002 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18 [2021-11-07 08:31:31,002 INFO L73 IsDeterministic]: Start isDeterministic. Operand 34 states and 40 transitions. [2021-11-07 08:31:31,002 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-11-07 08:31:31,002 INFO L681 BuchiCegarLoop]: Abstraction has 34 states and 40 transitions. [2021-11-07 08:31:31,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states and 40 transitions. [2021-11-07 08:31:31,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 29. [2021-11-07 08:31:31,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 29 states have (on average 1.206896551724138) internal successors, (35), 28 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 08:31:31,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 35 transitions. [2021-11-07 08:31:31,006 INFO L704 BuchiCegarLoop]: Abstraction has 29 states and 35 transitions. [2021-11-07 08:31:31,006 INFO L587 BuchiCegarLoop]: Abstraction has 29 states and 35 transitions. [2021-11-07 08:31:31,006 INFO L425 BuchiCegarLoop]: ======== Iteration 5============ [2021-11-07 08:31:31,006 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 29 states and 35 transitions. [2021-11-07 08:31:31,007 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2021-11-07 08:31:31,007 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-11-07 08:31:31,007 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-11-07 08:31:31,007 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1] [2021-11-07 08:31:31,008 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-11-07 08:31:31,008 INFO L791 eck$LassoCheckResult]: Stem: 630#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 631#L-1 havoc main_#res;havoc main_#t~nondet11, main_#t~nondet12, main_#t~ret13;test_fun_#in~i, test_fun_#in~j := main_#t~nondet11, main_#t~nondet12;havoc test_fun_#res;havoc test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset, test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset, test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset, test_fun_#t~mem8, test_fun_#t~mem7, test_fun_#t~mem6, test_fun_#t~mem9, test_fun_#t~mem5, test_fun_#t~mem10, test_fun_~i, test_fun_~j, test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, test_fun_~c~0.base, test_fun_~c~0.offset;test_fun_~i := test_fun_#in~i;test_fun_~j := test_fun_#in~j;call test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.allocOnStack(4);test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset;call test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.allocOnStack(4);test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;call test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset := #Ultimate.allocOnStack(4);test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset;call write~int(test_fun_~i, test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4);call write~int(test_fun_~j, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); 632#L555-3 call test_fun_#t~mem5 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 634#L555-1 assume !!(test_fun_#t~mem5 >= 0);havoc test_fun_#t~mem5;call write~int(0, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4); 639#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 640#L557-1 assume !(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6; 643#L557-4 call test_fun_#t~mem9 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4);call write~int(test_fun_#t~mem9 - 1, test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4);havoc test_fun_#t~mem9; 658#L555-3 call test_fun_#t~mem5 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 641#L555-1 assume !!(test_fun_#t~mem5 >= 0);havoc test_fun_#t~mem5;call write~int(0, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4); 637#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 638#L557-1 assume !!(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);havoc test_fun_#t~mem8; 642#L557-3 [2021-11-07 08:31:31,008 INFO L793 eck$LassoCheckResult]: Loop: 642#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 649#L557-1 assume !!(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);havoc test_fun_#t~mem8; 642#L557-3 [2021-11-07 08:31:31,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 08:31:31,008 INFO L85 PathProgramCache]: Analyzing trace with hash -2087827527, now seen corresponding path program 2 times [2021-11-07 08:31:31,008 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 08:31:31,008 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2053177656] [2021-11-07 08:31:31,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 08:31:31,008 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 08:31:31,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 08:31:31,143 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 08:31:31,143 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-07 08:31:31,143 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2053177656] [2021-11-07 08:31:31,143 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2053177656] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 08:31:31,144 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 08:31:31,144 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-11-07 08:31:31,144 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [90034309] [2021-11-07 08:31:31,144 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-11-07 08:31:31,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 08:31:31,145 INFO L85 PathProgramCache]: Analyzing trace with hash 1510, now seen corresponding path program 2 times [2021-11-07 08:31:31,145 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 08:31:31,145 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1337476136] [2021-11-07 08:31:31,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 08:31:31,145 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 08:31:31,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-07 08:31:31,164 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-07 08:31:31,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-07 08:31:31,168 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-07 08:31:31,223 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ca00bbe-7802-45cf-8c9a-e5551a18caab/bin/uautomizer-AkOaLMaTGY/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Forceful destruction successful, exit code 0 [2021-11-07 08:31:31,261 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-07 08:31:31,261 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-07 08:31:31,262 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2021-11-07 08:31:31,262 INFO L87 Difference]: Start difference. First operand 29 states and 35 transitions. cyclomatic complexity: 10 Second operand has 8 states, 8 states have (on average 1.375) internal successors, (11), 8 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 08:31:31,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 08:31:31,349 INFO L93 Difference]: Finished difference Result 36 states and 39 transitions. [2021-11-07 08:31:31,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-07 08:31:31,350 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 36 states and 39 transitions. [2021-11-07 08:31:31,351 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2021-11-07 08:31:31,352 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 36 states to 22 states and 25 transitions. [2021-11-07 08:31:31,352 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2021-11-07 08:31:31,352 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2021-11-07 08:31:31,352 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 25 transitions. [2021-11-07 08:31:31,352 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-11-07 08:31:31,352 INFO L681 BuchiCegarLoop]: Abstraction has 22 states and 25 transitions. [2021-11-07 08:31:31,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states and 25 transitions. [2021-11-07 08:31:31,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 17. [2021-11-07 08:31:31,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 16 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 08:31:31,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 20 transitions. [2021-11-07 08:31:31,355 INFO L704 BuchiCegarLoop]: Abstraction has 17 states and 20 transitions. [2021-11-07 08:31:31,355 INFO L587 BuchiCegarLoop]: Abstraction has 17 states and 20 transitions. [2021-11-07 08:31:31,355 INFO L425 BuchiCegarLoop]: ======== Iteration 6============ [2021-11-07 08:31:31,355 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 20 transitions. [2021-11-07 08:31:31,355 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2021-11-07 08:31:31,356 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-11-07 08:31:31,356 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-11-07 08:31:31,356 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1] [2021-11-07 08:31:31,356 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1, 1, 1, 1] [2021-11-07 08:31:31,357 INFO L791 eck$LassoCheckResult]: Stem: 712#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 713#L-1 havoc main_#res;havoc main_#t~nondet11, main_#t~nondet12, main_#t~ret13;test_fun_#in~i, test_fun_#in~j := main_#t~nondet11, main_#t~nondet12;havoc test_fun_#res;havoc test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset, test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset, test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset, test_fun_#t~mem8, test_fun_#t~mem7, test_fun_#t~mem6, test_fun_#t~mem9, test_fun_#t~mem5, test_fun_#t~mem10, test_fun_~i, test_fun_~j, test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, test_fun_~c~0.base, test_fun_~c~0.offset;test_fun_~i := test_fun_#in~i;test_fun_~j := test_fun_#in~j;call test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.allocOnStack(4);test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset;call test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.allocOnStack(4);test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;call test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset := #Ultimate.allocOnStack(4);test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset;call write~int(test_fun_~i, test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4);call write~int(test_fun_~j, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); 721#L555-3 call test_fun_#t~mem5 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 727#L555-1 assume !!(test_fun_#t~mem5 >= 0);havoc test_fun_#t~mem5;call write~int(0, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4); 726#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 725#L557-1 assume !!(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);havoc test_fun_#t~mem8; 724#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 719#L557-1 assume !(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6; 723#L557-4 [2021-11-07 08:31:31,357 INFO L793 eck$LassoCheckResult]: Loop: 723#L557-4 call test_fun_#t~mem9 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4);call write~int(test_fun_#t~mem9 - 1, test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4);havoc test_fun_#t~mem9; 714#L555-3 call test_fun_#t~mem5 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 715#L555-1 assume !!(test_fun_#t~mem5 >= 0);havoc test_fun_#t~mem5;call write~int(0, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4); 716#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 717#L557-1 assume !!(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);havoc test_fun_#t~mem8; 722#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 728#L557-1 assume !(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6; 723#L557-4 [2021-11-07 08:31:31,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 08:31:31,357 INFO L85 PathProgramCache]: Analyzing trace with hash 179567344, now seen corresponding path program 2 times [2021-11-07 08:31:31,357 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 08:31:31,357 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1608956010] [2021-11-07 08:31:31,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 08:31:31,358 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 08:31:31,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-07 08:31:31,385 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-07 08:31:31,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-07 08:31:31,428 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-07 08:31:31,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 08:31:31,434 INFO L85 PathProgramCache]: Analyzing trace with hash -739883290, now seen corresponding path program 1 times [2021-11-07 08:31:31,434 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 08:31:31,434 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [782290317] [2021-11-07 08:31:31,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 08:31:31,435 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 08:31:31,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-07 08:31:31,447 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-07 08:31:31,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-07 08:31:31,470 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-07 08:31:31,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 08:31:31,471 INFO L85 PathProgramCache]: Analyzing trace with hash -891424489, now seen corresponding path program 3 times [2021-11-07 08:31:31,471 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 08:31:31,473 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1383190354] [2021-11-07 08:31:31,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 08:31:31,474 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 08:31:31,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 08:31:31,733 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 8 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 08:31:31,733 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-07 08:31:31,733 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1383190354] [2021-11-07 08:31:31,733 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1383190354] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-07 08:31:31,733 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [105748852] [2021-11-07 08:31:31,734 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-07 08:31:31,734 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-07 08:31:31,734 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ca00bbe-7802-45cf-8c9a-e5551a18caab/bin/uautomizer-AkOaLMaTGY/z3 [2021-11-07 08:31:31,735 INFO L229 MonitoredProcess]: Starting monitored process 36 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ca00bbe-7802-45cf-8c9a-e5551a18caab/bin/uautomizer-AkOaLMaTGY/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-07 08:31:31,752 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ca00bbe-7802-45cf-8c9a-e5551a18caab/bin/uautomizer-AkOaLMaTGY/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Waiting until timeout for monitored process [2021-11-07 08:31:31,832 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2021-11-07 08:31:31,832 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-07 08:31:31,834 INFO L263 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 17 conjunts are in the unsatisfiable core [2021-11-07 08:31:31,835 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-07 08:31:31,843 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2021-11-07 08:31:31,862 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-11-07 08:31:31,905 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-11-07 08:31:32,010 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 25 [2021-11-07 08:31:32,069 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2021-11-07 08:31:32,174 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 9 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 08:31:32,174 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [105748852] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-07 08:31:32,174 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-11-07 08:31:32,175 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 19 [2021-11-07 08:31:32,175 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [997741273] [2021-11-07 08:31:32,360 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-07 08:31:32,361 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-11-07 08:31:32,362 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=277, Unknown=0, NotChecked=0, Total=342 [2021-11-07 08:31:32,363 INFO L87 Difference]: Start difference. First operand 17 states and 20 transitions. cyclomatic complexity: 5 Second operand has 19 states, 19 states have (on average 1.4210526315789473) internal successors, (27), 19 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 08:31:32,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 08:31:32,612 INFO L93 Difference]: Finished difference Result 26 states and 29 transitions. [2021-11-07 08:31:32,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-11-07 08:31:32,612 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 26 states and 29 transitions. [2021-11-07 08:31:32,613 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2021-11-07 08:31:32,613 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 26 states to 20 states and 22 transitions. [2021-11-07 08:31:32,613 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2021-11-07 08:31:32,614 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2021-11-07 08:31:32,614 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 22 transitions. [2021-11-07 08:31:32,614 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-11-07 08:31:32,614 INFO L681 BuchiCegarLoop]: Abstraction has 20 states and 22 transitions. [2021-11-07 08:31:32,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 22 transitions. [2021-11-07 08:31:32,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 19. [2021-11-07 08:31:32,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 1.105263157894737) internal successors, (21), 18 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 08:31:32,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 21 transitions. [2021-11-07 08:31:32,616 INFO L704 BuchiCegarLoop]: Abstraction has 19 states and 21 transitions. [2021-11-07 08:31:32,616 INFO L587 BuchiCegarLoop]: Abstraction has 19 states and 21 transitions. [2021-11-07 08:31:32,616 INFO L425 BuchiCegarLoop]: ======== Iteration 7============ [2021-11-07 08:31:32,616 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 21 transitions. [2021-11-07 08:31:32,617 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2021-11-07 08:31:32,617 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-11-07 08:31:32,617 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-11-07 08:31:32,618 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [3, 2, 1, 1, 1, 1, 1] [2021-11-07 08:31:32,618 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [3, 2, 1, 1, 1, 1] [2021-11-07 08:31:32,618 INFO L791 eck$LassoCheckResult]: Stem: 835#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 836#L-1 havoc main_#res;havoc main_#t~nondet11, main_#t~nondet12, main_#t~ret13;test_fun_#in~i, test_fun_#in~j := main_#t~nondet11, main_#t~nondet12;havoc test_fun_#res;havoc test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset, test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset, test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset, test_fun_#t~mem8, test_fun_#t~mem7, test_fun_#t~mem6, test_fun_#t~mem9, test_fun_#t~mem5, test_fun_#t~mem10, test_fun_~i, test_fun_~j, test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, test_fun_~c~0.base, test_fun_~c~0.offset;test_fun_~i := test_fun_#in~i;test_fun_~j := test_fun_#in~j;call test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.allocOnStack(4);test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset;call test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.allocOnStack(4);test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;call test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset := #Ultimate.allocOnStack(4);test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset;call write~int(test_fun_~i, test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4);call write~int(test_fun_~j, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); 837#L555-3 call test_fun_#t~mem5 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 838#L555-1 assume !!(test_fun_#t~mem5 >= 0);havoc test_fun_#t~mem5;call write~int(0, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4); 844#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 843#L557-1 assume !!(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);havoc test_fun_#t~mem8; 839#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 840#L557-1 assume !!(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);havoc test_fun_#t~mem8; 841#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 842#L557-1 assume !(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6; 845#L557-4 [2021-11-07 08:31:32,618 INFO L793 eck$LassoCheckResult]: Loop: 845#L557-4 call test_fun_#t~mem9 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4);call write~int(test_fun_#t~mem9 - 1, test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4);havoc test_fun_#t~mem9; 846#L555-3 call test_fun_#t~mem5 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 853#L555-1 assume !!(test_fun_#t~mem5 >= 0);havoc test_fun_#t~mem5;call write~int(0, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4); 852#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 851#L557-1 assume !!(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);havoc test_fun_#t~mem8; 850#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 849#L557-1 assume !!(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);havoc test_fun_#t~mem8; 847#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 848#L557-1 assume !(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6; 845#L557-4 [2021-11-07 08:31:32,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 08:31:32,618 INFO L85 PathProgramCache]: Analyzing trace with hash 765528213, now seen corresponding path program 3 times [2021-11-07 08:31:32,618 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 08:31:32,618 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1022113154] [2021-11-07 08:31:32,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 08:31:32,619 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 08:31:32,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-07 08:31:32,634 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-07 08:31:32,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-07 08:31:32,650 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-07 08:31:32,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 08:31:32,651 INFO L85 PathProgramCache]: Analyzing trace with hash 1936731915, now seen corresponding path program 2 times [2021-11-07 08:31:32,651 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 08:31:32,651 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [793461109] [2021-11-07 08:31:32,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 08:31:32,651 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 08:31:32,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-07 08:31:32,660 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-07 08:31:32,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-07 08:31:32,670 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-07 08:31:32,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 08:31:32,671 INFO L85 PathProgramCache]: Analyzing trace with hash -1863480073, now seen corresponding path program 4 times [2021-11-07 08:31:32,671 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 08:31:32,671 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1530606383] [2021-11-07 08:31:32,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 08:31:32,671 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 08:31:32,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 08:31:32,933 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 12 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 08:31:32,933 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-07 08:31:32,933 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1530606383] [2021-11-07 08:31:32,933 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1530606383] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-07 08:31:32,933 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [610674655] [2021-11-07 08:31:32,933 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-11-07 08:31:32,933 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-07 08:31:32,933 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ca00bbe-7802-45cf-8c9a-e5551a18caab/bin/uautomizer-AkOaLMaTGY/z3 [2021-11-07 08:31:32,934 INFO L229 MonitoredProcess]: Starting monitored process 37 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ca00bbe-7802-45cf-8c9a-e5551a18caab/bin/uautomizer-AkOaLMaTGY/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-07 08:31:32,966 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ca00bbe-7802-45cf-8c9a-e5551a18caab/bin/uautomizer-AkOaLMaTGY/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Waiting until timeout for monitored process [2021-11-07 08:31:33,066 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-11-07 08:31:33,066 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-07 08:31:33,067 INFO L263 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 19 conjunts are in the unsatisfiable core [2021-11-07 08:31:33,069 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-07 08:31:33,076 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2021-11-07 08:31:33,092 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-11-07 08:31:33,128 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-11-07 08:31:33,164 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-11-07 08:31:33,285 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 25 [2021-11-07 08:31:33,333 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2021-11-07 08:31:33,387 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2021-11-07 08:31:33,522 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 15 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 08:31:33,522 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [610674655] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-07 08:31:33,522 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-11-07 08:31:33,523 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 12] total 25 [2021-11-07 08:31:33,523 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1951836805] [2021-11-07 08:31:33,828 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-07 08:31:33,828 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2021-11-07 08:31:33,829 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=502, Unknown=0, NotChecked=0, Total=600 [2021-11-07 08:31:33,829 INFO L87 Difference]: Start difference. First operand 19 states and 21 transitions. cyclomatic complexity: 4 Second operand has 25 states, 25 states have (on average 1.4) internal successors, (35), 25 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 08:31:34,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 08:31:34,287 INFO L93 Difference]: Finished difference Result 32 states and 35 transitions. [2021-11-07 08:31:34,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-11-07 08:31:34,287 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 32 states and 35 transitions. [2021-11-07 08:31:34,288 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 11 [2021-11-07 08:31:34,289 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 32 states to 24 states and 26 transitions. [2021-11-07 08:31:34,289 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2021-11-07 08:31:34,289 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2021-11-07 08:31:34,289 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 26 transitions. [2021-11-07 08:31:34,289 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-11-07 08:31:34,289 INFO L681 BuchiCegarLoop]: Abstraction has 24 states and 26 transitions. [2021-11-07 08:31:34,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states and 26 transitions. [2021-11-07 08:31:34,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 23. [2021-11-07 08:31:34,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 23 states have (on average 1.0869565217391304) internal successors, (25), 22 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 08:31:34,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 25 transitions. [2021-11-07 08:31:34,292 INFO L704 BuchiCegarLoop]: Abstraction has 23 states and 25 transitions. [2021-11-07 08:31:34,292 INFO L587 BuchiCegarLoop]: Abstraction has 23 states and 25 transitions. [2021-11-07 08:31:34,292 INFO L425 BuchiCegarLoop]: ======== Iteration 8============ [2021-11-07 08:31:34,292 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 25 transitions. [2021-11-07 08:31:34,293 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 11 [2021-11-07 08:31:34,293 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-11-07 08:31:34,293 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-11-07 08:31:34,294 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [4, 3, 1, 1, 1, 1, 1] [2021-11-07 08:31:34,294 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [4, 3, 1, 1, 1, 1] [2021-11-07 08:31:34,294 INFO L791 eck$LassoCheckResult]: Stem: 992#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 993#L-1 havoc main_#res;havoc main_#t~nondet11, main_#t~nondet12, main_#t~ret13;test_fun_#in~i, test_fun_#in~j := main_#t~nondet11, main_#t~nondet12;havoc test_fun_#res;havoc test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset, test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset, test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset, test_fun_#t~mem8, test_fun_#t~mem7, test_fun_#t~mem6, test_fun_#t~mem9, test_fun_#t~mem5, test_fun_#t~mem10, test_fun_~i, test_fun_~j, test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, test_fun_~c~0.base, test_fun_~c~0.offset;test_fun_~i := test_fun_#in~i;test_fun_~j := test_fun_#in~j;call test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.allocOnStack(4);test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset;call test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.allocOnStack(4);test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;call test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset := #Ultimate.allocOnStack(4);test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset;call write~int(test_fun_~i, test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4);call write~int(test_fun_~j, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); 996#L555-3 call test_fun_#t~mem5 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 1014#L555-1 assume !!(test_fun_#t~mem5 >= 0);havoc test_fun_#t~mem5;call write~int(0, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4); 1013#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 1012#L557-1 assume !!(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);havoc test_fun_#t~mem8; 1011#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 1002#L557-1 assume !!(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);havoc test_fun_#t~mem8; 999#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 1000#L557-1 assume !!(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);havoc test_fun_#t~mem8; 1007#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 1004#L557-1 assume !(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6; 1003#L557-4 [2021-11-07 08:31:34,294 INFO L793 eck$LassoCheckResult]: Loop: 1003#L557-4 call test_fun_#t~mem9 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4);call write~int(test_fun_#t~mem9 - 1, test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4);havoc test_fun_#t~mem9; 994#L555-3 call test_fun_#t~mem5 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 995#L555-1 assume !!(test_fun_#t~mem5 >= 0);havoc test_fun_#t~mem5;call write~int(0, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4); 997#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 998#L557-1 assume !!(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);havoc test_fun_#t~mem8; 1001#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 1010#L557-1 assume !!(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);havoc test_fun_#t~mem8; 1009#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 1008#L557-1 assume !!(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);havoc test_fun_#t~mem8; 1005#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 1006#L557-1 assume !(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6; 1003#L557-4 [2021-11-07 08:31:34,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 08:31:34,295 INFO L85 PathProgramCache]: Analyzing trace with hash 1233207546, now seen corresponding path program 4 times [2021-11-07 08:31:34,295 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 08:31:34,295 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1010681789] [2021-11-07 08:31:34,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 08:31:34,296 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 08:31:34,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-07 08:31:34,310 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-07 08:31:34,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-07 08:31:34,326 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-07 08:31:34,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 08:31:34,327 INFO L85 PathProgramCache]: Analyzing trace with hash 1478533616, now seen corresponding path program 3 times [2021-11-07 08:31:34,327 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 08:31:34,328 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [847692881] [2021-11-07 08:31:34,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 08:31:34,328 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 08:31:34,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-07 08:31:34,338 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-07 08:31:34,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-07 08:31:34,349 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-07 08:31:34,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 08:31:34,350 INFO L85 PathProgramCache]: Analyzing trace with hash -1457439913, now seen corresponding path program 5 times [2021-11-07 08:31:34,350 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 08:31:34,350 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [978248252] [2021-11-07 08:31:34,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 08:31:34,350 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 08:31:34,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 08:31:34,721 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 17 proven. 41 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 08:31:34,721 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-07 08:31:34,721 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [978248252] [2021-11-07 08:31:34,722 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [978248252] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-07 08:31:34,722 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1949444793] [2021-11-07 08:31:34,722 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2021-11-07 08:31:34,722 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-07 08:31:34,722 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ca00bbe-7802-45cf-8c9a-e5551a18caab/bin/uautomizer-AkOaLMaTGY/z3 [2021-11-07 08:31:34,723 INFO L229 MonitoredProcess]: Starting monitored process 38 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ca00bbe-7802-45cf-8c9a-e5551a18caab/bin/uautomizer-AkOaLMaTGY/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-07 08:31:34,758 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ca00bbe-7802-45cf-8c9a-e5551a18caab/bin/uautomizer-AkOaLMaTGY/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Waiting until timeout for monitored process [2021-11-07 08:31:34,907 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2021-11-07 08:31:34,907 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-07 08:31:34,908 INFO L263 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 26 conjunts are in the unsatisfiable core [2021-11-07 08:31:34,910 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-07 08:31:34,949 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-11-07 08:31:35,036 INFO L354 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2021-11-07 08:31:35,036 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 38 treesize of output 29 [2021-11-07 08:31:35,113 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 23 [2021-11-07 08:31:35,185 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2021-11-07 08:31:35,363 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 28 [2021-11-07 08:31:35,448 INFO L354 Elim1Store]: treesize reduction 20, result has 37.5 percent of original size [2021-11-07 08:31:35,448 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 33 treesize of output 28 [2021-11-07 08:31:35,524 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 26 [2021-11-07 08:31:35,614 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 26 [2021-11-07 08:31:35,750 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 17 proven. 41 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 08:31:35,751 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1949444793] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-07 08:31:35,751 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-11-07 08:31:35,751 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 15] total 32 [2021-11-07 08:31:35,751 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [172498533] [2021-11-07 08:31:36,116 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-07 08:31:36,116 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2021-11-07 08:31:36,117 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=152, Invalid=840, Unknown=0, NotChecked=0, Total=992 [2021-11-07 08:31:36,117 INFO L87 Difference]: Start difference. First operand 23 states and 25 transitions. cyclomatic complexity: 4 Second operand has 32 states, 32 states have (on average 1.34375) internal successors, (43), 32 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 08:31:36,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 08:31:36,709 INFO L93 Difference]: Finished difference Result 38 states and 41 transitions. [2021-11-07 08:31:36,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-11-07 08:31:36,710 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 38 states and 41 transitions. [2021-11-07 08:31:36,711 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 13 [2021-11-07 08:31:36,711 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 38 states to 28 states and 30 transitions. [2021-11-07 08:31:36,711 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 21 [2021-11-07 08:31:36,711 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 21 [2021-11-07 08:31:36,712 INFO L73 IsDeterministic]: Start isDeterministic. Operand 28 states and 30 transitions. [2021-11-07 08:31:36,712 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-11-07 08:31:36,712 INFO L681 BuchiCegarLoop]: Abstraction has 28 states and 30 transitions. [2021-11-07 08:31:36,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states and 30 transitions. [2021-11-07 08:31:36,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 27. [2021-11-07 08:31:36,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 27 states have (on average 1.0740740740740742) internal successors, (29), 26 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 08:31:36,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 29 transitions. [2021-11-07 08:31:36,715 INFO L704 BuchiCegarLoop]: Abstraction has 27 states and 29 transitions. [2021-11-07 08:31:36,715 INFO L587 BuchiCegarLoop]: Abstraction has 27 states and 29 transitions. [2021-11-07 08:31:36,715 INFO L425 BuchiCegarLoop]: ======== Iteration 9============ [2021-11-07 08:31:36,715 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 29 transitions. [2021-11-07 08:31:36,716 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 13 [2021-11-07 08:31:36,716 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-11-07 08:31:36,716 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-11-07 08:31:36,717 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [5, 4, 1, 1, 1, 1, 1] [2021-11-07 08:31:36,717 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [5, 4, 1, 1, 1, 1] [2021-11-07 08:31:36,717 INFO L791 eck$LassoCheckResult]: Stem: 1178#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 1179#L-1 havoc main_#res;havoc main_#t~nondet11, main_#t~nondet12, main_#t~ret13;test_fun_#in~i, test_fun_#in~j := main_#t~nondet11, main_#t~nondet12;havoc test_fun_#res;havoc test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset, test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset, test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset, test_fun_#t~mem8, test_fun_#t~mem7, test_fun_#t~mem6, test_fun_#t~mem9, test_fun_#t~mem5, test_fun_#t~mem10, test_fun_~i, test_fun_~j, test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, test_fun_~c~0.base, test_fun_~c~0.offset;test_fun_~i := test_fun_#in~i;test_fun_~j := test_fun_#in~j;call test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.allocOnStack(4);test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset;call test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.allocOnStack(4);test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;call test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset := #Ultimate.allocOnStack(4);test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset;call write~int(test_fun_~i, test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4);call write~int(test_fun_~j, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); 1186#L555-3 call test_fun_#t~mem5 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 1187#L555-1 assume !!(test_fun_#t~mem5 >= 0);havoc test_fun_#t~mem5;call write~int(0, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4); 1182#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 1183#L557-1 assume !!(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);havoc test_fun_#t~mem8; 1188#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 1189#L557-1 assume !!(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);havoc test_fun_#t~mem8; 1190#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 1204#L557-1 assume !!(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);havoc test_fun_#t~mem8; 1184#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 1185#L557-1 assume !!(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);havoc test_fun_#t~mem8; 1193#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 1192#L557-1 assume !(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6; 1191#L557-4 [2021-11-07 08:31:36,717 INFO L793 eck$LassoCheckResult]: Loop: 1191#L557-4 call test_fun_#t~mem9 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4);call write~int(test_fun_#t~mem9 - 1, test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4);havoc test_fun_#t~mem9; 1180#L555-3 call test_fun_#t~mem5 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 1181#L555-1 assume !!(test_fun_#t~mem5 >= 0);havoc test_fun_#t~mem5;call write~int(0, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4); 1203#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 1202#L557-1 assume !!(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);havoc test_fun_#t~mem8; 1201#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 1200#L557-1 assume !!(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);havoc test_fun_#t~mem8; 1199#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 1198#L557-1 assume !!(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);havoc test_fun_#t~mem8; 1197#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 1196#L557-1 assume !!(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);havoc test_fun_#t~mem8; 1194#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 1195#L557-1 assume !(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6; 1191#L557-4 [2021-11-07 08:31:36,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 08:31:36,718 INFO L85 PathProgramCache]: Analyzing trace with hash -298519521, now seen corresponding path program 5 times [2021-11-07 08:31:36,718 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 08:31:36,718 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [637989923] [2021-11-07 08:31:36,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 08:31:36,719 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 08:31:36,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-07 08:31:36,734 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-07 08:31:36,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-07 08:31:36,752 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-07 08:31:36,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 08:31:36,753 INFO L85 PathProgramCache]: Analyzing trace with hash -763367531, now seen corresponding path program 4 times [2021-11-07 08:31:36,753 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 08:31:36,753 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1717825914] [2021-11-07 08:31:36,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 08:31:36,754 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 08:31:36,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-07 08:31:36,763 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-07 08:31:36,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-07 08:31:36,774 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-07 08:31:36,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 08:31:36,774 INFO L85 PathProgramCache]: Analyzing trace with hash 1962220599, now seen corresponding path program 6 times [2021-11-07 08:31:36,775 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 08:31:36,775 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1134627878] [2021-11-07 08:31:36,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 08:31:36,775 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 08:31:36,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 08:31:37,228 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 24 proven. 68 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 08:31:37,228 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-07 08:31:37,229 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1134627878] [2021-11-07 08:31:37,229 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1134627878] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-07 08:31:37,229 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [790569245] [2021-11-07 08:31:37,229 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2021-11-07 08:31:37,229 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-07 08:31:37,229 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ca00bbe-7802-45cf-8c9a-e5551a18caab/bin/uautomizer-AkOaLMaTGY/z3 [2021-11-07 08:31:37,230 INFO L229 MonitoredProcess]: Starting monitored process 39 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ca00bbe-7802-45cf-8c9a-e5551a18caab/bin/uautomizer-AkOaLMaTGY/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-07 08:31:37,231 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ca00bbe-7802-45cf-8c9a-e5551a18caab/bin/uautomizer-AkOaLMaTGY/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Waiting until timeout for monitored process [2021-11-07 08:31:37,466 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2021-11-07 08:31:37,466 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-07 08:31:37,468 INFO L263 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 31 conjunts are in the unsatisfiable core [2021-11-07 08:31:37,470 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-07 08:31:37,509 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-11-07 08:31:37,549 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-11-07 08:31:37,588 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-11-07 08:31:37,633 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-11-07 08:31:37,686 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-11-07 08:31:37,812 INFO L354 Elim1Store]: treesize reduction 14, result has 58.8 percent of original size [2021-11-07 08:31:37,812 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 38 treesize of output 37 [2021-11-07 08:31:37,954 INFO L354 Elim1Store]: treesize reduction 12, result has 62.5 percent of original size [2021-11-07 08:31:37,954 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 42 treesize of output 45 [2021-11-07 08:31:38,121 INFO L354 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2021-11-07 08:31:38,121 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 45 treesize of output 32 [2021-11-07 08:31:38,196 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 26 [2021-11-07 08:31:38,303 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 28 [2021-11-07 08:31:38,374 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-11-07 08:31:38,374 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 22 [2021-11-07 08:31:38,413 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 27 proven. 65 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 08:31:38,413 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [790569245] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-07 08:31:38,413 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-11-07 08:31:38,413 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 17] total 38 [2021-11-07 08:31:38,414 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [521137692] [2021-11-07 08:31:39,266 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-07 08:31:39,266 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2021-11-07 08:31:39,267 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=169, Invalid=1237, Unknown=0, NotChecked=0, Total=1406 [2021-11-07 08:31:39,267 INFO L87 Difference]: Start difference. First operand 27 states and 29 transitions. cyclomatic complexity: 4 Second operand has 38 states, 38 states have (on average 1.3421052631578947) internal successors, (51), 38 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 08:31:40,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 08:31:40,045 INFO L93 Difference]: Finished difference Result 44 states and 47 transitions. [2021-11-07 08:31:40,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2021-11-07 08:31:40,046 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 44 states and 47 transitions. [2021-11-07 08:31:40,047 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 15 [2021-11-07 08:31:40,047 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 44 states to 32 states and 34 transitions. [2021-11-07 08:31:40,047 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 [2021-11-07 08:31:40,048 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23 [2021-11-07 08:31:40,048 INFO L73 IsDeterministic]: Start isDeterministic. Operand 32 states and 34 transitions. [2021-11-07 08:31:40,048 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-11-07 08:31:40,048 INFO L681 BuchiCegarLoop]: Abstraction has 32 states and 34 transitions. [2021-11-07 08:31:40,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states and 34 transitions. [2021-11-07 08:31:40,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 31. [2021-11-07 08:31:40,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 31 states have (on average 1.064516129032258) internal successors, (33), 30 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 08:31:40,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 33 transitions. [2021-11-07 08:31:40,051 INFO L704 BuchiCegarLoop]: Abstraction has 31 states and 33 transitions. [2021-11-07 08:31:40,051 INFO L587 BuchiCegarLoop]: Abstraction has 31 states and 33 transitions. [2021-11-07 08:31:40,051 INFO L425 BuchiCegarLoop]: ======== Iteration 10============ [2021-11-07 08:31:40,051 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states and 33 transitions. [2021-11-07 08:31:40,052 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 15 [2021-11-07 08:31:40,052 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-11-07 08:31:40,052 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-11-07 08:31:40,053 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [6, 5, 1, 1, 1, 1, 1] [2021-11-07 08:31:40,053 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [6, 5, 1, 1, 1, 1] [2021-11-07 08:31:40,053 INFO L791 eck$LassoCheckResult]: Stem: 1406#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 1407#L-1 havoc main_#res;havoc main_#t~nondet11, main_#t~nondet12, main_#t~ret13;test_fun_#in~i, test_fun_#in~j := main_#t~nondet11, main_#t~nondet12;havoc test_fun_#res;havoc test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset, test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset, test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset, test_fun_#t~mem8, test_fun_#t~mem7, test_fun_#t~mem6, test_fun_#t~mem9, test_fun_#t~mem5, test_fun_#t~mem10, test_fun_~i, test_fun_~j, test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, test_fun_~c~0.base, test_fun_~c~0.offset;test_fun_~i := test_fun_#in~i;test_fun_~j := test_fun_#in~j;call test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.allocOnStack(4);test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset;call test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.allocOnStack(4);test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;call test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset := #Ultimate.allocOnStack(4);test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset;call write~int(test_fun_~i, test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4);call write~int(test_fun_~j, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); 1408#L555-3 call test_fun_#t~mem5 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 1409#L555-1 assume !!(test_fun_#t~mem5 >= 0);havoc test_fun_#t~mem5;call write~int(0, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4); 1410#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 1411#L557-1 assume !!(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);havoc test_fun_#t~mem8; 1414#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 1415#L557-1 assume !!(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);havoc test_fun_#t~mem8; 1412#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 1413#L557-1 assume !!(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);havoc test_fun_#t~mem8; 1436#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 1434#L557-1 assume !!(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);havoc test_fun_#t~mem8; 1432#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 1420#L557-1 assume !!(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);havoc test_fun_#t~mem8; 1419#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 1418#L557-1 assume !(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6; 1416#L557-4 [2021-11-07 08:31:40,053 INFO L793 eck$LassoCheckResult]: Loop: 1416#L557-4 call test_fun_#t~mem9 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4);call write~int(test_fun_#t~mem9 - 1, test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4);havoc test_fun_#t~mem9; 1417#L555-3 call test_fun_#t~mem5 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 1435#L555-1 assume !!(test_fun_#t~mem5 >= 0);havoc test_fun_#t~mem5;call write~int(0, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4); 1433#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 1431#L557-1 assume !!(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);havoc test_fun_#t~mem8; 1430#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 1429#L557-1 assume !!(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);havoc test_fun_#t~mem8; 1428#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 1427#L557-1 assume !!(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);havoc test_fun_#t~mem8; 1426#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 1425#L557-1 assume !!(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);havoc test_fun_#t~mem8; 1424#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 1423#L557-1 assume !!(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);havoc test_fun_#t~mem8; 1421#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 1422#L557-1 assume !(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6; 1416#L557-4 [2021-11-07 08:31:40,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 08:31:40,054 INFO L85 PathProgramCache]: Analyzing trace with hash 885551620, now seen corresponding path program 6 times [2021-11-07 08:31:40,054 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 08:31:40,054 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [340835083] [2021-11-07 08:31:40,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 08:31:40,054 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 08:31:40,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-07 08:31:40,072 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-07 08:31:40,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-07 08:31:40,092 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-07 08:31:40,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 08:31:40,092 INFO L85 PathProgramCache]: Analyzing trace with hash 843212794, now seen corresponding path program 5 times [2021-11-07 08:31:40,093 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 08:31:40,093 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [269304130] [2021-11-07 08:31:40,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 08:31:40,093 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 08:31:40,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-07 08:31:40,105 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-07 08:31:40,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-07 08:31:40,117 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-07 08:31:40,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 08:31:40,118 INFO L85 PathProgramCache]: Analyzing trace with hash 1845317527, now seen corresponding path program 7 times [2021-11-07 08:31:40,118 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 08:31:40,118 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [285266555] [2021-11-07 08:31:40,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 08:31:40,118 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 08:31:40,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 08:31:40,663 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 33 proven. 101 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 08:31:40,664 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-07 08:31:40,664 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [285266555] [2021-11-07 08:31:40,664 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [285266555] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-07 08:31:40,664 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [141492021] [2021-11-07 08:31:40,664 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2021-11-07 08:31:40,664 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-07 08:31:40,665 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ca00bbe-7802-45cf-8c9a-e5551a18caab/bin/uautomizer-AkOaLMaTGY/z3 [2021-11-07 08:31:40,670 INFO L229 MonitoredProcess]: Starting monitored process 40 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ca00bbe-7802-45cf-8c9a-e5551a18caab/bin/uautomizer-AkOaLMaTGY/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-07 08:31:40,675 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ca00bbe-7802-45cf-8c9a-e5551a18caab/bin/uautomizer-AkOaLMaTGY/z3 -smt2 -in SMTLIB2_COMPLIANT=true (40)] Waiting until timeout for monitored process [2021-11-07 08:31:40,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 08:31:40,862 INFO L263 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 25 conjunts are in the unsatisfiable core [2021-11-07 08:31:40,864 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-07 08:31:40,883 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2021-11-07 08:31:40,908 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-11-07 08:31:40,942 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-11-07 08:31:40,983 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-11-07 08:31:41,014 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-11-07 08:31:41,060 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-11-07 08:31:41,099 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-11-07 08:31:41,231 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 25 [2021-11-07 08:31:41,286 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2021-11-07 08:31:41,339 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2021-11-07 08:31:41,393 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2021-11-07 08:31:41,449 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2021-11-07 08:31:41,502 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2021-11-07 08:31:41,627 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 33 proven. 101 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 08:31:41,627 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [141492021] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-07 08:31:41,627 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-11-07 08:31:41,627 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 18] total 43 [2021-11-07 08:31:41,628 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [850900036] [2021-11-07 08:31:42,596 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-07 08:31:42,597 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2021-11-07 08:31:42,598 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=227, Invalid=1579, Unknown=0, NotChecked=0, Total=1806 [2021-11-07 08:31:42,598 INFO L87 Difference]: Start difference. First operand 31 states and 33 transitions. cyclomatic complexity: 4 Second operand has 43 states, 43 states have (on average 1.372093023255814) internal successors, (59), 43 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 08:31:43,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 08:31:43,527 INFO L93 Difference]: Finished difference Result 50 states and 53 transitions. [2021-11-07 08:31:43,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2021-11-07 08:31:43,527 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 50 states and 53 transitions. [2021-11-07 08:31:43,528 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 17 [2021-11-07 08:31:43,528 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 50 states to 36 states and 38 transitions. [2021-11-07 08:31:43,529 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 25 [2021-11-07 08:31:43,529 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 25 [2021-11-07 08:31:43,529 INFO L73 IsDeterministic]: Start isDeterministic. Operand 36 states and 38 transitions. [2021-11-07 08:31:43,529 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-11-07 08:31:43,529 INFO L681 BuchiCegarLoop]: Abstraction has 36 states and 38 transitions. [2021-11-07 08:31:43,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states and 38 transitions. [2021-11-07 08:31:43,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 35. [2021-11-07 08:31:43,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 35 states have (on average 1.0571428571428572) internal successors, (37), 34 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 08:31:43,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 37 transitions. [2021-11-07 08:31:43,533 INFO L704 BuchiCegarLoop]: Abstraction has 35 states and 37 transitions. [2021-11-07 08:31:43,533 INFO L587 BuchiCegarLoop]: Abstraction has 35 states and 37 transitions. [2021-11-07 08:31:43,533 INFO L425 BuchiCegarLoop]: ======== Iteration 11============ [2021-11-07 08:31:43,533 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 35 states and 37 transitions. [2021-11-07 08:31:43,534 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 17 [2021-11-07 08:31:43,534 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-11-07 08:31:43,534 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-11-07 08:31:43,535 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [7, 6, 1, 1, 1, 1, 1] [2021-11-07 08:31:43,535 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [7, 6, 1, 1, 1, 1] [2021-11-07 08:31:43,535 INFO L791 eck$LassoCheckResult]: Stem: 1671#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 1672#L-1 havoc main_#res;havoc main_#t~nondet11, main_#t~nondet12, main_#t~ret13;test_fun_#in~i, test_fun_#in~j := main_#t~nondet11, main_#t~nondet12;havoc test_fun_#res;havoc test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset, test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset, test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset, test_fun_#t~mem8, test_fun_#t~mem7, test_fun_#t~mem6, test_fun_#t~mem9, test_fun_#t~mem5, test_fun_#t~mem10, test_fun_~i, test_fun_~j, test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, test_fun_~c~0.base, test_fun_~c~0.offset;test_fun_~i := test_fun_#in~i;test_fun_~j := test_fun_#in~j;call test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.allocOnStack(4);test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset;call test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.allocOnStack(4);test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;call test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset := #Ultimate.allocOnStack(4);test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset;call write~int(test_fun_~i, test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4);call write~int(test_fun_~j, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); 1673#L555-3 call test_fun_#t~mem5 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 1674#L555-1 assume !!(test_fun_#t~mem5 >= 0);havoc test_fun_#t~mem5;call write~int(0, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4); 1675#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 1676#L557-1 assume !!(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);havoc test_fun_#t~mem8; 1679#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 1680#L557-1 assume !!(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);havoc test_fun_#t~mem8; 1677#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 1678#L557-1 assume !!(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);havoc test_fun_#t~mem8; 1705#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 1704#L557-1 assume !!(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);havoc test_fun_#t~mem8; 1703#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 1701#L557-1 assume !!(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);havoc test_fun_#t~mem8; 1699#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 1685#L557-1 assume !!(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);havoc test_fun_#t~mem8; 1684#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 1683#L557-1 assume !(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6; 1681#L557-4 [2021-11-07 08:31:43,535 INFO L793 eck$LassoCheckResult]: Loop: 1681#L557-4 call test_fun_#t~mem9 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4);call write~int(test_fun_#t~mem9 - 1, test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4);havoc test_fun_#t~mem9; 1682#L555-3 call test_fun_#t~mem5 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 1702#L555-1 assume !!(test_fun_#t~mem5 >= 0);havoc test_fun_#t~mem5;call write~int(0, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4); 1700#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 1698#L557-1 assume !!(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);havoc test_fun_#t~mem8; 1697#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 1696#L557-1 assume !!(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);havoc test_fun_#t~mem8; 1695#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 1694#L557-1 assume !!(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);havoc test_fun_#t~mem8; 1693#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 1692#L557-1 assume !!(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);havoc test_fun_#t~mem8; 1691#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 1690#L557-1 assume !!(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);havoc test_fun_#t~mem8; 1689#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 1688#L557-1 assume !!(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);havoc test_fun_#t~mem8; 1686#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 1687#L557-1 assume !(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6; 1681#L557-4 [2021-11-07 08:31:43,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 08:31:43,536 INFO L85 PathProgramCache]: Analyzing trace with hash 611584681, now seen corresponding path program 7 times [2021-11-07 08:31:43,536 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 08:31:43,536 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [815626617] [2021-11-07 08:31:43,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 08:31:43,536 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 08:31:43,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-07 08:31:43,562 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-07 08:31:43,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-07 08:31:43,581 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-07 08:31:43,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 08:31:43,582 INFO L85 PathProgramCache]: Analyzing trace with hash -1421321441, now seen corresponding path program 6 times [2021-11-07 08:31:43,582 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 08:31:43,582 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1958667843] [2021-11-07 08:31:43,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 08:31:43,583 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 08:31:43,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-07 08:31:43,597 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-07 08:31:43,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-07 08:31:43,612 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-07 08:31:43,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 08:31:43,613 INFO L85 PathProgramCache]: Analyzing trace with hash 803599735, now seen corresponding path program 8 times [2021-11-07 08:31:43,613 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 08:31:43,613 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2065677190] [2021-11-07 08:31:43,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 08:31:43,614 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 08:31:43,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 08:31:44,234 INFO L134 CoverageAnalysis]: Checked inductivity of 184 backedges. 44 proven. 140 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 08:31:44,234 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-07 08:31:44,234 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2065677190] [2021-11-07 08:31:44,234 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2065677190] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-07 08:31:44,234 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1995264946] [2021-11-07 08:31:44,234 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-11-07 08:31:44,235 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-07 08:31:44,235 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ca00bbe-7802-45cf-8c9a-e5551a18caab/bin/uautomizer-AkOaLMaTGY/z3 [2021-11-07 08:31:44,236 INFO L229 MonitoredProcess]: Starting monitored process 41 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ca00bbe-7802-45cf-8c9a-e5551a18caab/bin/uautomizer-AkOaLMaTGY/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-07 08:31:44,261 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ca00bbe-7802-45cf-8c9a-e5551a18caab/bin/uautomizer-AkOaLMaTGY/z3 -smt2 -in SMTLIB2_COMPLIANT=true (41)] Waiting until timeout for monitored process [2021-11-07 08:31:44,488 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-11-07 08:31:44,489 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-07 08:31:44,490 INFO L263 TraceCheckSpWp]: Trace formula consists of 332 conjuncts, 27 conjunts are in the unsatisfiable core [2021-11-07 08:31:44,498 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-07 08:31:44,504 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2021-11-07 08:31:44,518 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-11-07 08:31:44,565 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-11-07 08:31:44,602 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-11-07 08:31:44,634 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-11-07 08:31:44,680 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-11-07 08:31:44,721 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-11-07 08:31:44,753 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-11-07 08:31:44,867 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 25 [2021-11-07 08:31:44,914 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2021-11-07 08:31:44,961 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2021-11-07 08:31:45,044 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2021-11-07 08:31:45,130 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2021-11-07 08:31:45,193 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2021-11-07 08:31:45,255 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2021-11-07 08:31:45,381 INFO L134 CoverageAnalysis]: Checked inductivity of 184 backedges. 39 proven. 145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 08:31:45,381 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1995264946] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-07 08:31:45,381 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-11-07 08:31:45,381 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 20] total 49 [2021-11-07 08:31:45,381 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1552626119] [2021-11-07 08:31:46,666 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-07 08:31:46,667 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2021-11-07 08:31:46,668 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=284, Invalid=2068, Unknown=0, NotChecked=0, Total=2352 [2021-11-07 08:31:46,668 INFO L87 Difference]: Start difference. First operand 35 states and 37 transitions. cyclomatic complexity: 4 Second operand has 49 states, 49 states have (on average 1.3673469387755102) internal successors, (67), 49 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 08:31:47,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 08:31:47,828 INFO L93 Difference]: Finished difference Result 56 states and 59 transitions. [2021-11-07 08:31:47,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2021-11-07 08:31:47,828 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 56 states and 59 transitions. [2021-11-07 08:31:47,829 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 19 [2021-11-07 08:31:47,829 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 56 states to 40 states and 42 transitions. [2021-11-07 08:31:47,829 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 27 [2021-11-07 08:31:47,830 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 27 [2021-11-07 08:31:47,830 INFO L73 IsDeterministic]: Start isDeterministic. Operand 40 states and 42 transitions. [2021-11-07 08:31:47,830 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-11-07 08:31:47,830 INFO L681 BuchiCegarLoop]: Abstraction has 40 states and 42 transitions. [2021-11-07 08:31:47,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states and 42 transitions. [2021-11-07 08:31:47,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 39. [2021-11-07 08:31:47,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 39 states have (on average 1.0512820512820513) internal successors, (41), 38 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 08:31:47,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 41 transitions. [2021-11-07 08:31:47,833 INFO L704 BuchiCegarLoop]: Abstraction has 39 states and 41 transitions. [2021-11-07 08:31:47,833 INFO L587 BuchiCegarLoop]: Abstraction has 39 states and 41 transitions. [2021-11-07 08:31:47,833 INFO L425 BuchiCegarLoop]: ======== Iteration 12============ [2021-11-07 08:31:47,833 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 39 states and 41 transitions. [2021-11-07 08:31:47,834 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 19 [2021-11-07 08:31:47,834 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-11-07 08:31:47,834 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-11-07 08:31:47,834 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [8, 7, 1, 1, 1, 1, 1] [2021-11-07 08:31:47,835 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [8, 7, 1, 1, 1, 1] [2021-11-07 08:31:47,835 INFO L791 eck$LassoCheckResult]: Stem: 1972#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 1973#L-1 havoc main_#res;havoc main_#t~nondet11, main_#t~nondet12, main_#t~ret13;test_fun_#in~i, test_fun_#in~j := main_#t~nondet11, main_#t~nondet12;havoc test_fun_#res;havoc test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset, test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset, test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset, test_fun_#t~mem8, test_fun_#t~mem7, test_fun_#t~mem6, test_fun_#t~mem9, test_fun_#t~mem5, test_fun_#t~mem10, test_fun_~i, test_fun_~j, test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, test_fun_~c~0.base, test_fun_~c~0.offset;test_fun_~i := test_fun_#in~i;test_fun_~j := test_fun_#in~j;call test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.allocOnStack(4);test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset;call test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.allocOnStack(4);test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;call test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset := #Ultimate.allocOnStack(4);test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset;call write~int(test_fun_~i, test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4);call write~int(test_fun_~j, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); 1976#L555-3 call test_fun_#t~mem5 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 1981#L555-1 assume !!(test_fun_#t~mem5 >= 0);havoc test_fun_#t~mem5;call write~int(0, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4); 1982#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 1983#L557-1 assume !!(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);havoc test_fun_#t~mem8; 1977#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 1978#L557-1 assume !!(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);havoc test_fun_#t~mem8; 1979#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 1980#L557-1 assume !!(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);havoc test_fun_#t~mem8; 1984#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 2010#L557-1 assume !!(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);havoc test_fun_#t~mem8; 2009#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 2008#L557-1 assume !!(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);havoc test_fun_#t~mem8; 2007#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 2006#L557-1 assume !!(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);havoc test_fun_#t~mem8; 2005#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 1990#L557-1 assume !!(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);havoc test_fun_#t~mem8; 1989#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 1986#L557-1 assume !(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6; 1985#L557-4 [2021-11-07 08:31:47,835 INFO L793 eck$LassoCheckResult]: Loop: 1985#L557-4 call test_fun_#t~mem9 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4);call write~int(test_fun_#t~mem9 - 1, test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4);havoc test_fun_#t~mem9; 1974#L555-3 call test_fun_#t~mem5 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 1975#L555-1 assume !!(test_fun_#t~mem5 >= 0);havoc test_fun_#t~mem5;call write~int(0, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4); 2004#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 2003#L557-1 assume !!(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);havoc test_fun_#t~mem8; 2002#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 2001#L557-1 assume !!(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);havoc test_fun_#t~mem8; 2000#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 1999#L557-1 assume !!(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);havoc test_fun_#t~mem8; 1998#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 1997#L557-1 assume !!(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);havoc test_fun_#t~mem8; 1996#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 1995#L557-1 assume !!(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);havoc test_fun_#t~mem8; 1994#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 1993#L557-1 assume !!(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);havoc test_fun_#t~mem8; 1992#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 1991#L557-1 assume !!(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);havoc test_fun_#t~mem8; 1987#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 1988#L557-1 assume !(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6; 1985#L557-4 [2021-11-07 08:31:47,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 08:31:47,835 INFO L85 PathProgramCache]: Analyzing trace with hash -677638642, now seen corresponding path program 8 times [2021-11-07 08:31:47,835 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 08:31:47,836 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1165485858] [2021-11-07 08:31:47,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 08:31:47,836 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 08:31:47,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-07 08:31:47,856 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-07 08:31:47,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-07 08:31:47,878 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-07 08:31:47,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 08:31:47,878 INFO L85 PathProgramCache]: Analyzing trace with hash -90302204, now seen corresponding path program 7 times [2021-11-07 08:31:47,879 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 08:31:47,879 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [52965744] [2021-11-07 08:31:47,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 08:31:47,879 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 08:31:47,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-07 08:31:47,894 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-07 08:31:47,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-07 08:31:47,910 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-07 08:31:47,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 08:31:47,911 INFO L85 PathProgramCache]: Analyzing trace with hash 41102807, now seen corresponding path program 9 times [2021-11-07 08:31:47,911 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 08:31:47,911 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [140448255] [2021-11-07 08:31:47,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 08:31:47,911 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 08:31:47,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 08:31:48,647 INFO L134 CoverageAnalysis]: Checked inductivity of 242 backedges. 57 proven. 185 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 08:31:48,647 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-07 08:31:48,648 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [140448255] [2021-11-07 08:31:48,648 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [140448255] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-07 08:31:48,648 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1386204407] [2021-11-07 08:31:48,648 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-07 08:31:48,648 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-07 08:31:48,648 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ca00bbe-7802-45cf-8c9a-e5551a18caab/bin/uautomizer-AkOaLMaTGY/z3 [2021-11-07 08:31:48,649 INFO L229 MonitoredProcess]: Starting monitored process 42 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ca00bbe-7802-45cf-8c9a-e5551a18caab/bin/uautomizer-AkOaLMaTGY/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-07 08:31:48,650 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ca00bbe-7802-45cf-8c9a-e5551a18caab/bin/uautomizer-AkOaLMaTGY/z3 -smt2 -in SMTLIB2_COMPLIANT=true (42)] Waiting until timeout for monitored process [2021-11-07 08:31:49,122 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2021-11-07 08:31:49,122 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-07 08:31:49,125 INFO L263 TraceCheckSpWp]: Trace formula consists of 368 conjuncts, 28 conjunts are in the unsatisfiable core [2021-11-07 08:31:49,127 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-07 08:31:49,136 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2021-11-07 08:31:49,150 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-11-07 08:31:49,193 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-11-07 08:31:49,232 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-11-07 08:31:49,271 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-11-07 08:31:49,311 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-11-07 08:31:49,350 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-11-07 08:31:49,400 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-11-07 08:31:49,461 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-11-07 08:31:49,598 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 25 [2021-11-07 08:31:49,662 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2021-11-07 08:31:49,718 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2021-11-07 08:31:49,776 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2021-11-07 08:31:49,835 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2021-11-07 08:31:49,897 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2021-11-07 08:31:49,955 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2021-11-07 08:31:50,005 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2021-11-07 08:31:50,055 INFO L354 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2021-11-07 08:31:50,055 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 17 [2021-11-07 08:31:50,086 INFO L134 CoverageAnalysis]: Checked inductivity of 242 backedges. 45 proven. 197 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 08:31:50,086 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1386204407] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-07 08:31:50,086 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-11-07 08:31:50,086 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 22] total 55 [2021-11-07 08:31:50,087 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1811445797] [2021-11-07 08:31:52,216 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-07 08:31:52,216 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2021-11-07 08:31:52,217 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=348, Invalid=2622, Unknown=0, NotChecked=0, Total=2970 [2021-11-07 08:31:52,217 INFO L87 Difference]: Start difference. First operand 39 states and 41 transitions. cyclomatic complexity: 4 Second operand has 55 states, 55 states have (on average 1.3636363636363635) internal successors, (75), 55 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 08:31:53,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 08:31:53,494 INFO L93 Difference]: Finished difference Result 62 states and 65 transitions. [2021-11-07 08:31:53,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2021-11-07 08:31:53,494 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 62 states and 65 transitions. [2021-11-07 08:31:53,495 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 21 [2021-11-07 08:31:53,496 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 62 states to 44 states and 46 transitions. [2021-11-07 08:31:53,496 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 29 [2021-11-07 08:31:53,496 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 29 [2021-11-07 08:31:53,496 INFO L73 IsDeterministic]: Start isDeterministic. Operand 44 states and 46 transitions. [2021-11-07 08:31:53,497 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-11-07 08:31:53,497 INFO L681 BuchiCegarLoop]: Abstraction has 44 states and 46 transitions. [2021-11-07 08:31:53,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states and 46 transitions. [2021-11-07 08:31:53,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 43. [2021-11-07 08:31:53,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 43 states have (on average 1.0465116279069768) internal successors, (45), 42 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 08:31:53,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 45 transitions. [2021-11-07 08:31:53,500 INFO L704 BuchiCegarLoop]: Abstraction has 43 states and 45 transitions. [2021-11-07 08:31:53,500 INFO L587 BuchiCegarLoop]: Abstraction has 43 states and 45 transitions. [2021-11-07 08:31:53,500 INFO L425 BuchiCegarLoop]: ======== Iteration 13============ [2021-11-07 08:31:53,500 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 43 states and 45 transitions. [2021-11-07 08:31:53,501 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 21 [2021-11-07 08:31:53,501 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-11-07 08:31:53,501 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-11-07 08:31:53,502 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [9, 8, 1, 1, 1, 1, 1] [2021-11-07 08:31:53,502 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [9, 8, 1, 1, 1, 1] [2021-11-07 08:31:53,502 INFO L791 eck$LassoCheckResult]: Stem: 2309#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 2310#L-1 havoc main_#res;havoc main_#t~nondet11, main_#t~nondet12, main_#t~ret13;test_fun_#in~i, test_fun_#in~j := main_#t~nondet11, main_#t~nondet12;havoc test_fun_#res;havoc test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset, test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset, test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset, test_fun_#t~mem8, test_fun_#t~mem7, test_fun_#t~mem6, test_fun_#t~mem9, test_fun_#t~mem5, test_fun_#t~mem10, test_fun_~i, test_fun_~j, test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, test_fun_~c~0.base, test_fun_~c~0.offset;test_fun_~i := test_fun_#in~i;test_fun_~j := test_fun_#in~j;call test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.allocOnStack(4);test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset;call test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.allocOnStack(4);test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;call test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset := #Ultimate.allocOnStack(4);test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset;call write~int(test_fun_~i, test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4);call write~int(test_fun_~j, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); 2311#L555-3 call test_fun_#t~mem5 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 2312#L555-1 assume !!(test_fun_#t~mem5 >= 0);havoc test_fun_#t~mem5;call write~int(0, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4); 2318#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 2317#L557-1 assume !!(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);havoc test_fun_#t~mem8; 2313#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 2314#L557-1 assume !!(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);havoc test_fun_#t~mem8; 2315#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 2316#L557-1 assume !!(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);havoc test_fun_#t~mem8; 2351#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 2350#L557-1 assume !!(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);havoc test_fun_#t~mem8; 2349#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 2348#L557-1 assume !!(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);havoc test_fun_#t~mem8; 2347#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 2346#L557-1 assume !!(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);havoc test_fun_#t~mem8; 2345#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 2343#L557-1 assume !!(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);havoc test_fun_#t~mem8; 2341#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 2325#L557-1 assume !!(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);havoc test_fun_#t~mem8; 2324#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 2321#L557-1 assume !(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6; 2319#L557-4 [2021-11-07 08:31:53,502 INFO L793 eck$LassoCheckResult]: Loop: 2319#L557-4 call test_fun_#t~mem9 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4);call write~int(test_fun_#t~mem9 - 1, test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4);havoc test_fun_#t~mem9; 2320#L555-3 call test_fun_#t~mem5 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 2344#L555-1 assume !!(test_fun_#t~mem5 >= 0);havoc test_fun_#t~mem5;call write~int(0, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4); 2342#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 2340#L557-1 assume !!(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);havoc test_fun_#t~mem8; 2339#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 2338#L557-1 assume !!(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);havoc test_fun_#t~mem8; 2337#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 2336#L557-1 assume !!(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);havoc test_fun_#t~mem8; 2335#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 2334#L557-1 assume !!(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);havoc test_fun_#t~mem8; 2333#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 2332#L557-1 assume !!(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);havoc test_fun_#t~mem8; 2331#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 2330#L557-1 assume !!(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);havoc test_fun_#t~mem8; 2329#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 2328#L557-1 assume !!(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);havoc test_fun_#t~mem8; 2327#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 2326#L557-1 assume !!(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);havoc test_fun_#t~mem8; 2322#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 2323#L557-1 assume !(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6; 2319#L557-4 [2021-11-07 08:31:53,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 08:31:53,503 INFO L85 PathProgramCache]: Analyzing trace with hash 1624296499, now seen corresponding path program 9 times [2021-11-07 08:31:53,503 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 08:31:53,503 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1614119276] [2021-11-07 08:31:53,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 08:31:53,504 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 08:31:53,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-07 08:31:53,524 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-07 08:31:53,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-07 08:31:53,546 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-07 08:31:53,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 08:31:53,547 INFO L85 PathProgramCache]: Analyzing trace with hash -881069655, now seen corresponding path program 8 times [2021-11-07 08:31:53,547 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 08:31:53,547 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [439861417] [2021-11-07 08:31:53,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 08:31:53,547 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 08:31:53,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-07 08:31:53,566 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-07 08:31:53,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-07 08:31:53,586 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-07 08:31:53,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 08:31:53,586 INFO L85 PathProgramCache]: Analyzing trace with hash -478078793, now seen corresponding path program 10 times [2021-11-07 08:31:53,587 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 08:31:53,587 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [268834182] [2021-11-07 08:31:53,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 08:31:53,587 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 08:31:53,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 08:31:54,401 INFO L134 CoverageAnalysis]: Checked inductivity of 308 backedges. 72 proven. 236 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 08:31:54,401 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-07 08:31:54,402 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [268834182] [2021-11-07 08:31:54,402 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [268834182] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-07 08:31:54,402 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [925730180] [2021-11-07 08:31:54,402 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-11-07 08:31:54,402 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-07 08:31:54,402 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ca00bbe-7802-45cf-8c9a-e5551a18caab/bin/uautomizer-AkOaLMaTGY/z3 [2021-11-07 08:31:54,403 INFO L229 MonitoredProcess]: Starting monitored process 43 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ca00bbe-7802-45cf-8c9a-e5551a18caab/bin/uautomizer-AkOaLMaTGY/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-07 08:31:54,404 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ca00bbe-7802-45cf-8c9a-e5551a18caab/bin/uautomizer-AkOaLMaTGY/z3 -smt2 -in SMTLIB2_COMPLIANT=true (43)] Waiting until timeout for monitored process [2021-11-07 08:31:54,690 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-11-07 08:31:54,691 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-07 08:31:54,692 INFO L263 TraceCheckSpWp]: Trace formula consists of 404 conjuncts, 31 conjunts are in the unsatisfiable core [2021-11-07 08:31:54,695 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-07 08:31:54,715 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2021-11-07 08:31:54,729 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-11-07 08:31:54,763 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-11-07 08:31:54,795 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-11-07 08:31:54,826 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-11-07 08:31:54,868 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-11-07 08:31:54,921 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-11-07 08:31:54,964 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-11-07 08:31:55,009 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-11-07 08:31:55,054 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-11-07 08:31:55,196 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 25 [2021-11-07 08:31:55,252 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2021-11-07 08:31:55,301 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2021-11-07 08:31:55,356 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2021-11-07 08:31:55,413 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2021-11-07 08:31:55,478 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2021-11-07 08:31:55,535 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2021-11-07 08:31:55,595 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2021-11-07 08:31:55,648 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2021-11-07 08:31:55,769 INFO L134 CoverageAnalysis]: Checked inductivity of 308 backedges. 51 proven. 257 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 08:31:55,769 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [925730180] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-07 08:31:55,769 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-11-07 08:31:55,769 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 24] total 61 [2021-11-07 08:31:55,769 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [265235975] [2021-11-07 08:31:58,803 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-07 08:31:58,804 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2021-11-07 08:31:58,805 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=419, Invalid=3241, Unknown=0, NotChecked=0, Total=3660 [2021-11-07 08:31:58,805 INFO L87 Difference]: Start difference. First operand 43 states and 45 transitions. cyclomatic complexity: 4 Second operand has 61 states, 61 states have (on average 1.360655737704918) internal successors, (83), 61 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 08:32:00,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 08:32:00,230 INFO L93 Difference]: Finished difference Result 68 states and 71 transitions. [2021-11-07 08:32:00,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2021-11-07 08:32:00,230 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 68 states and 71 transitions. [2021-11-07 08:32:00,231 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 23 [2021-11-07 08:32:00,231 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 68 states to 48 states and 50 transitions. [2021-11-07 08:32:00,232 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 31 [2021-11-07 08:32:00,232 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 31 [2021-11-07 08:32:00,232 INFO L73 IsDeterministic]: Start isDeterministic. Operand 48 states and 50 transitions. [2021-11-07 08:32:00,232 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-11-07 08:32:00,232 INFO L681 BuchiCegarLoop]: Abstraction has 48 states and 50 transitions. [2021-11-07 08:32:00,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states and 50 transitions. [2021-11-07 08:32:00,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 47. [2021-11-07 08:32:00,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 47 states have (on average 1.0425531914893618) internal successors, (49), 46 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 08:32:00,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 49 transitions. [2021-11-07 08:32:00,236 INFO L704 BuchiCegarLoop]: Abstraction has 47 states and 49 transitions. [2021-11-07 08:32:00,236 INFO L587 BuchiCegarLoop]: Abstraction has 47 states and 49 transitions. [2021-11-07 08:32:00,236 INFO L425 BuchiCegarLoop]: ======== Iteration 14============ [2021-11-07 08:32:00,236 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 47 states and 49 transitions. [2021-11-07 08:32:00,236 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 23 [2021-11-07 08:32:00,237 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-11-07 08:32:00,237 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-11-07 08:32:00,238 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [10, 9, 1, 1, 1, 1, 1] [2021-11-07 08:32:00,238 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [10, 9, 1, 1, 1, 1] [2021-11-07 08:32:00,238 INFO L791 eck$LassoCheckResult]: Stem: 2682#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 2683#L-1 havoc main_#res;havoc main_#t~nondet11, main_#t~nondet12, main_#t~ret13;test_fun_#in~i, test_fun_#in~j := main_#t~nondet11, main_#t~nondet12;havoc test_fun_#res;havoc test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset, test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset, test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset, test_fun_#t~mem8, test_fun_#t~mem7, test_fun_#t~mem6, test_fun_#t~mem9, test_fun_#t~mem5, test_fun_#t~mem10, test_fun_~i, test_fun_~j, test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, test_fun_~c~0.base, test_fun_~c~0.offset;test_fun_~i := test_fun_#in~i;test_fun_~j := test_fun_#in~j;call test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.allocOnStack(4);test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset;call test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.allocOnStack(4);test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;call test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset := #Ultimate.allocOnStack(4);test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset;call write~int(test_fun_~i, test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4);call write~int(test_fun_~j, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); 2684#L555-3 call test_fun_#t~mem5 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 2685#L555-1 assume !!(test_fun_#t~mem5 >= 0);havoc test_fun_#t~mem5;call write~int(0, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4); 2692#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 2690#L557-1 assume !!(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);havoc test_fun_#t~mem8; 2686#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 2687#L557-1 assume !!(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);havoc test_fun_#t~mem8; 2688#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 2689#L557-1 assume !!(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);havoc test_fun_#t~mem8; 2691#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 2728#L557-1 assume !!(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);havoc test_fun_#t~mem8; 2727#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 2726#L557-1 assume !!(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);havoc test_fun_#t~mem8; 2725#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 2724#L557-1 assume !!(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);havoc test_fun_#t~mem8; 2723#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 2722#L557-1 assume !!(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);havoc test_fun_#t~mem8; 2721#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 2719#L557-1 assume !!(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);havoc test_fun_#t~mem8; 2717#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 2699#L557-1 assume !!(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);havoc test_fun_#t~mem8; 2698#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 2695#L557-1 assume !(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6; 2693#L557-4 [2021-11-07 08:32:00,238 INFO L793 eck$LassoCheckResult]: Loop: 2693#L557-4 call test_fun_#t~mem9 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4);call write~int(test_fun_#t~mem9 - 1, test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4);havoc test_fun_#t~mem9; 2694#L555-3 call test_fun_#t~mem5 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 2720#L555-1 assume !!(test_fun_#t~mem5 >= 0);havoc test_fun_#t~mem5;call write~int(0, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4); 2718#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 2716#L557-1 assume !!(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);havoc test_fun_#t~mem8; 2715#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 2714#L557-1 assume !!(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);havoc test_fun_#t~mem8; 2713#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 2712#L557-1 assume !!(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);havoc test_fun_#t~mem8; 2711#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 2710#L557-1 assume !!(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);havoc test_fun_#t~mem8; 2709#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 2708#L557-1 assume !!(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);havoc test_fun_#t~mem8; 2707#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 2706#L557-1 assume !!(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);havoc test_fun_#t~mem8; 2705#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 2704#L557-1 assume !!(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);havoc test_fun_#t~mem8; 2703#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 2702#L557-1 assume !!(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);havoc test_fun_#t~mem8; 2701#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 2700#L557-1 assume !!(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);havoc test_fun_#t~mem8; 2696#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 2697#L557-1 assume !(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6; 2693#L557-4 [2021-11-07 08:32:00,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 08:32:00,239 INFO L85 PathProgramCache]: Analyzing trace with hash 1875809560, now seen corresponding path program 10 times [2021-11-07 08:32:00,239 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 08:32:00,239 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1199884818] [2021-11-07 08:32:00,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 08:32:00,240 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 08:32:00,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-07 08:32:00,262 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-07 08:32:00,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-07 08:32:00,286 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-07 08:32:00,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 08:32:00,287 INFO L85 PathProgramCache]: Analyzing trace with hash -599378674, now seen corresponding path program 9 times [2021-11-07 08:32:00,287 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 08:32:00,287 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1251380753] [2021-11-07 08:32:00,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 08:32:00,288 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 08:32:00,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-07 08:32:00,333 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-07 08:32:00,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-07 08:32:00,352 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-07 08:32:00,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 08:32:00,353 INFO L85 PathProgramCache]: Analyzing trace with hash 285464087, now seen corresponding path program 11 times [2021-11-07 08:32:00,353 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 08:32:00,353 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2002977047] [2021-11-07 08:32:00,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 08:32:00,354 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 08:32:00,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 08:32:01,312 INFO L134 CoverageAnalysis]: Checked inductivity of 382 backedges. 89 proven. 293 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 08:32:01,312 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-07 08:32:01,312 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2002977047] [2021-11-07 08:32:01,312 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2002977047] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-07 08:32:01,312 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [41661251] [2021-11-07 08:32:01,312 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2021-11-07 08:32:01,313 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-07 08:32:01,313 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ca00bbe-7802-45cf-8c9a-e5551a18caab/bin/uautomizer-AkOaLMaTGY/z3 [2021-11-07 08:32:01,314 INFO L229 MonitoredProcess]: Starting monitored process 44 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ca00bbe-7802-45cf-8c9a-e5551a18caab/bin/uautomizer-AkOaLMaTGY/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-07 08:32:01,335 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ca00bbe-7802-45cf-8c9a-e5551a18caab/bin/uautomizer-AkOaLMaTGY/z3 -smt2 -in SMTLIB2_COMPLIANT=true (44)] Waiting until timeout for monitored process [2021-11-07 08:32:01,961 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2021-11-07 08:32:01,961 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-07 08:32:01,965 INFO L263 TraceCheckSpWp]: Trace formula consists of 440 conjuncts, 38 conjunts are in the unsatisfiable core [2021-11-07 08:32:01,967 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-07 08:32:02,017 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-11-07 08:32:02,059 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-11-07 08:32:02,101 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-11-07 08:32:02,149 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-11-07 08:32:02,191 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-11-07 08:32:02,327 INFO L354 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2021-11-07 08:32:02,327 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 38 treesize of output 29 [2021-11-07 08:32:02,428 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2021-11-07 08:32:02,510 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2021-11-07 08:32:02,602 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2021-11-07 08:32:02,691 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2021-11-07 08:32:02,913 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 28 [2021-11-07 08:32:03,008 INFO L354 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2021-11-07 08:32:03,008 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 33 treesize of output 24 [2021-11-07 08:32:03,101 INFO L354 Elim1Store]: treesize reduction 27, result has 20.6 percent of original size [2021-11-07 08:32:03,101 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 39 treesize of output 26 [2021-11-07 08:32:03,200 INFO L354 Elim1Store]: treesize reduction 27, result has 20.6 percent of original size [2021-11-07 08:32:03,200 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 39 treesize of output 26 [2021-11-07 08:32:03,285 INFO L354 Elim1Store]: treesize reduction 27, result has 20.6 percent of original size [2021-11-07 08:32:03,285 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 39 treesize of output 26 [2021-11-07 08:32:03,373 INFO L354 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2021-11-07 08:32:03,373 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 39 treesize of output 30 [2021-11-07 08:32:03,468 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 26 [2021-11-07 08:32:03,584 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 26 [2021-11-07 08:32:03,701 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 26 [2021-11-07 08:32:03,820 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 26 [2021-11-07 08:32:04,062 INFO L134 CoverageAnalysis]: Checked inductivity of 382 backedges. 49 proven. 333 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 08:32:04,063 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [41661251] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-07 08:32:04,063 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-11-07 08:32:04,063 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 27] total 68 [2021-11-07 08:32:04,063 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [669637258] [2021-11-07 08:32:08,290 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-07 08:32:08,290 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2021-11-07 08:32:08,292 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=563, Invalid=3993, Unknown=0, NotChecked=0, Total=4556 [2021-11-07 08:32:08,292 INFO L87 Difference]: Start difference. First operand 47 states and 49 transitions. cyclomatic complexity: 4 Second operand has 68 states, 68 states have (on average 1.338235294117647) internal successors, (91), 68 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 08:32:09,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 08:32:09,939 INFO L93 Difference]: Finished difference Result 74 states and 77 transitions. [2021-11-07 08:32:09,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2021-11-07 08:32:09,939 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 74 states and 77 transitions. [2021-11-07 08:32:09,940 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 25 [2021-11-07 08:32:09,941 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 74 states to 52 states and 54 transitions. [2021-11-07 08:32:09,941 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 33 [2021-11-07 08:32:09,941 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 33 [2021-11-07 08:32:09,941 INFO L73 IsDeterministic]: Start isDeterministic. Operand 52 states and 54 transitions. [2021-11-07 08:32:09,941 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-11-07 08:32:09,942 INFO L681 BuchiCegarLoop]: Abstraction has 52 states and 54 transitions. [2021-11-07 08:32:09,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states and 54 transitions. [2021-11-07 08:32:09,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 51. [2021-11-07 08:32:09,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 51 states have (on average 1.0392156862745099) internal successors, (53), 50 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 08:32:09,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 53 transitions. [2021-11-07 08:32:09,946 INFO L704 BuchiCegarLoop]: Abstraction has 51 states and 53 transitions. [2021-11-07 08:32:09,946 INFO L587 BuchiCegarLoop]: Abstraction has 51 states and 53 transitions. [2021-11-07 08:32:09,946 INFO L425 BuchiCegarLoop]: ======== Iteration 15============ [2021-11-07 08:32:09,946 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 51 states and 53 transitions. [2021-11-07 08:32:09,946 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 25 [2021-11-07 08:32:09,947 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-11-07 08:32:09,947 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-11-07 08:32:09,947 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [11, 10, 1, 1, 1, 1, 1] [2021-11-07 08:32:09,948 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [11, 10, 1, 1, 1, 1] [2021-11-07 08:32:09,948 INFO L791 eck$LassoCheckResult]: Stem: 3072#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 3073#L-1 havoc main_#res;havoc main_#t~nondet11, main_#t~nondet12, main_#t~ret13;test_fun_#in~i, test_fun_#in~j := main_#t~nondet11, main_#t~nondet12;havoc test_fun_#res;havoc test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset, test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset, test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset, test_fun_#t~mem8, test_fun_#t~mem7, test_fun_#t~mem6, test_fun_#t~mem9, test_fun_#t~mem5, test_fun_#t~mem10, test_fun_~i, test_fun_~j, test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, test_fun_~c~0.base, test_fun_~c~0.offset;test_fun_~i := test_fun_#in~i;test_fun_~j := test_fun_#in~j;call test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.allocOnStack(4);test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset;call test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.allocOnStack(4);test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;call test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset := #Ultimate.allocOnStack(4);test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset;call write~int(test_fun_~i, test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4);call write~int(test_fun_~j, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); 3080#L555-3 call test_fun_#t~mem5 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 3081#L555-1 assume !!(test_fun_#t~mem5 >= 0);havoc test_fun_#t~mem5;call write~int(0, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4); 3082#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 3083#L557-1 assume !!(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);havoc test_fun_#t~mem8; 3076#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 3077#L557-1 assume !!(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);havoc test_fun_#t~mem8; 3078#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 3079#L557-1 assume !!(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);havoc test_fun_#t~mem8; 3084#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 3122#L557-1 assume !!(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);havoc test_fun_#t~mem8; 3121#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 3120#L557-1 assume !!(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);havoc test_fun_#t~mem8; 3119#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 3118#L557-1 assume !!(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);havoc test_fun_#t~mem8; 3117#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 3116#L557-1 assume !!(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);havoc test_fun_#t~mem8; 3115#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 3114#L557-1 assume !!(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);havoc test_fun_#t~mem8; 3113#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 3112#L557-1 assume !!(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);havoc test_fun_#t~mem8; 3111#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 3088#L557-1 assume !!(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);havoc test_fun_#t~mem8; 3087#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 3086#L557-1 assume !(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6; 3085#L557-4 [2021-11-07 08:32:09,948 INFO L793 eck$LassoCheckResult]: Loop: 3085#L557-4 call test_fun_#t~mem9 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4);call write~int(test_fun_#t~mem9 - 1, test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4);havoc test_fun_#t~mem9; 3074#L555-3 call test_fun_#t~mem5 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 3075#L555-1 assume !!(test_fun_#t~mem5 >= 0);havoc test_fun_#t~mem5;call write~int(0, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4); 3110#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 3109#L557-1 assume !!(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);havoc test_fun_#t~mem8; 3108#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 3107#L557-1 assume !!(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);havoc test_fun_#t~mem8; 3106#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 3105#L557-1 assume !!(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);havoc test_fun_#t~mem8; 3104#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 3103#L557-1 assume !!(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);havoc test_fun_#t~mem8; 3102#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 3101#L557-1 assume !!(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);havoc test_fun_#t~mem8; 3100#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 3099#L557-1 assume !!(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);havoc test_fun_#t~mem8; 3098#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 3097#L557-1 assume !!(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);havoc test_fun_#t~mem8; 3096#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 3095#L557-1 assume !!(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);havoc test_fun_#t~mem8; 3094#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 3093#L557-1 assume !!(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);havoc test_fun_#t~mem8; 3092#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 3091#L557-1 assume !!(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);havoc test_fun_#t~mem8; 3089#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 3090#L557-1 assume !(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6; 3085#L557-4 [2021-11-07 08:32:09,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 08:32:09,949 INFO L85 PathProgramCache]: Analyzing trace with hash -1233274691, now seen corresponding path program 11 times [2021-11-07 08:32:09,949 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 08:32:09,949 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1707459355] [2021-11-07 08:32:09,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 08:32:09,949 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 08:32:09,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-07 08:32:09,982 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-07 08:32:10,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-07 08:32:10,012 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-07 08:32:10,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 08:32:10,013 INFO L85 PathProgramCache]: Analyzing trace with hash -477285581, now seen corresponding path program 10 times [2021-11-07 08:32:10,013 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 08:32:10,013 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1251904189] [2021-11-07 08:32:10,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 08:32:10,014 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 08:32:10,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-07 08:32:10,041 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-07 08:32:10,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-07 08:32:10,066 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-07 08:32:10,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 08:32:10,067 INFO L85 PathProgramCache]: Analyzing trace with hash 319260151, now seen corresponding path program 12 times [2021-11-07 08:32:10,067 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 08:32:10,067 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [129757471] [2021-11-07 08:32:10,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 08:32:10,067 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 08:32:10,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 08:32:11,394 INFO L134 CoverageAnalysis]: Checked inductivity of 464 backedges. 108 proven. 356 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 08:32:11,394 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-07 08:32:11,395 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [129757471] [2021-11-07 08:32:11,395 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [129757471] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-07 08:32:11,395 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1551681411] [2021-11-07 08:32:11,395 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2021-11-07 08:32:11,395 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-07 08:32:11,395 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ca00bbe-7802-45cf-8c9a-e5551a18caab/bin/uautomizer-AkOaLMaTGY/z3 [2021-11-07 08:32:11,400 INFO L229 MonitoredProcess]: Starting monitored process 45 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ca00bbe-7802-45cf-8c9a-e5551a18caab/bin/uautomizer-AkOaLMaTGY/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-07 08:32:11,420 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ca00bbe-7802-45cf-8c9a-e5551a18caab/bin/uautomizer-AkOaLMaTGY/z3 -smt2 -in SMTLIB2_COMPLIANT=true (45)] Waiting until timeout for monitored process [2021-11-07 08:32:12,432 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 12 check-sat command(s) [2021-11-07 08:32:12,432 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-07 08:32:12,436 INFO L263 TraceCheckSpWp]: Trace formula consists of 476 conjuncts, 34 conjunts are in the unsatisfiable core [2021-11-07 08:32:12,438 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-07 08:32:12,455 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2021-11-07 08:32:12,470 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-11-07 08:32:12,512 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-11-07 08:32:12,551 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-11-07 08:32:12,592 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-11-07 08:32:12,642 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-11-07 08:32:12,690 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-11-07 08:32:12,734 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-11-07 08:32:12,793 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-11-07 08:32:12,844 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-11-07 08:32:12,890 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-11-07 08:32:12,939 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-11-07 08:32:13,098 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 25 [2021-11-07 08:32:13,162 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2021-11-07 08:32:13,213 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2021-11-07 08:32:13,274 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2021-11-07 08:32:13,342 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2021-11-07 08:32:13,416 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2021-11-07 08:32:13,483 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2021-11-07 08:32:13,555 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2021-11-07 08:32:13,629 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2021-11-07 08:32:13,698 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2021-11-07 08:32:13,757 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2021-11-07 08:32:13,810 INFO L354 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2021-11-07 08:32:13,810 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 17 [2021-11-07 08:32:13,848 INFO L134 CoverageAnalysis]: Checked inductivity of 464 backedges. 63 proven. 401 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 08:32:13,848 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1551681411] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-07 08:32:13,849 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-11-07 08:32:13,849 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 28] total 73 [2021-11-07 08:32:13,849 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1732647265] [2021-11-07 08:32:22,388 WARN L207 SmtUtils]: Spent 8.54 s on a formula simplification. DAG size of input: 202 DAG size of output: 183 [2021-11-07 08:32:22,442 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-07 08:32:22,442 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2021-11-07 08:32:22,444 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=582, Invalid=4674, Unknown=0, NotChecked=0, Total=5256 [2021-11-07 08:32:22,444 INFO L87 Difference]: Start difference. First operand 51 states and 53 transitions. cyclomatic complexity: 4 Second operand has 73 states, 73 states have (on average 1.356164383561644) internal successors, (99), 73 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 08:32:24,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 08:32:24,302 INFO L93 Difference]: Finished difference Result 80 states and 83 transitions. [2021-11-07 08:32:24,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2021-11-07 08:32:24,302 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 80 states and 83 transitions. [2021-11-07 08:32:24,303 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 27 [2021-11-07 08:32:24,303 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 80 states to 56 states and 58 transitions. [2021-11-07 08:32:24,303 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 35 [2021-11-07 08:32:24,303 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 35 [2021-11-07 08:32:24,303 INFO L73 IsDeterministic]: Start isDeterministic. Operand 56 states and 58 transitions. [2021-11-07 08:32:24,304 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-11-07 08:32:24,304 INFO L681 BuchiCegarLoop]: Abstraction has 56 states and 58 transitions. [2021-11-07 08:32:24,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states and 58 transitions. [2021-11-07 08:32:24,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 55. [2021-11-07 08:32:24,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 55 states have (on average 1.0363636363636364) internal successors, (57), 54 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 08:32:24,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 57 transitions. [2021-11-07 08:32:24,307 INFO L704 BuchiCegarLoop]: Abstraction has 55 states and 57 transitions. [2021-11-07 08:32:24,308 INFO L587 BuchiCegarLoop]: Abstraction has 55 states and 57 transitions. [2021-11-07 08:32:24,308 INFO L425 BuchiCegarLoop]: ======== Iteration 16============ [2021-11-07 08:32:24,308 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 55 states and 57 transitions. [2021-11-07 08:32:24,308 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 27 [2021-11-07 08:32:24,308 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-11-07 08:32:24,309 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-11-07 08:32:24,310 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [12, 11, 1, 1, 1, 1, 1] [2021-11-07 08:32:24,310 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [12, 11, 1, 1, 1, 1] [2021-11-07 08:32:24,310 INFO L791 eck$LassoCheckResult]: Stem: 3517#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 3518#L-1 havoc main_#res;havoc main_#t~nondet11, main_#t~nondet12, main_#t~ret13;test_fun_#in~i, test_fun_#in~j := main_#t~nondet11, main_#t~nondet12;havoc test_fun_#res;havoc test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset, test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset, test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset, test_fun_#t~mem8, test_fun_#t~mem7, test_fun_#t~mem6, test_fun_#t~mem9, test_fun_#t~mem5, test_fun_#t~mem10, test_fun_~i, test_fun_~j, test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, test_fun_~c~0.base, test_fun_~c~0.offset;test_fun_~i := test_fun_#in~i;test_fun_~j := test_fun_#in~j;call test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.allocOnStack(4);test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset;call test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.allocOnStack(4);test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;call test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset := #Ultimate.allocOnStack(4);test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset;call write~int(test_fun_~i, test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4);call write~int(test_fun_~j, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); 3519#L555-3 call test_fun_#t~mem5 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 3520#L555-1 assume !!(test_fun_#t~mem5 >= 0);havoc test_fun_#t~mem5;call write~int(0, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4); 3527#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 3525#L557-1 assume !!(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);havoc test_fun_#t~mem8; 3521#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 3522#L557-1 assume !!(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);havoc test_fun_#t~mem8; 3523#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 3524#L557-1 assume !!(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);havoc test_fun_#t~mem8; 3526#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 3571#L557-1 assume !!(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);havoc test_fun_#t~mem8; 3570#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 3569#L557-1 assume !!(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);havoc test_fun_#t~mem8; 3568#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 3567#L557-1 assume !!(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);havoc test_fun_#t~mem8; 3566#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 3565#L557-1 assume !!(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);havoc test_fun_#t~mem8; 3564#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 3563#L557-1 assume !!(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);havoc test_fun_#t~mem8; 3562#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 3561#L557-1 assume !!(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);havoc test_fun_#t~mem8; 3560#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 3558#L557-1 assume !!(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);havoc test_fun_#t~mem8; 3556#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 3534#L557-1 assume !!(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);havoc test_fun_#t~mem8; 3533#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 3530#L557-1 assume !(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6; 3528#L557-4 [2021-11-07 08:32:24,310 INFO L793 eck$LassoCheckResult]: Loop: 3528#L557-4 call test_fun_#t~mem9 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4);call write~int(test_fun_#t~mem9 - 1, test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4);havoc test_fun_#t~mem9; 3529#L555-3 call test_fun_#t~mem5 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 3559#L555-1 assume !!(test_fun_#t~mem5 >= 0);havoc test_fun_#t~mem5;call write~int(0, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4); 3557#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 3555#L557-1 assume !!(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);havoc test_fun_#t~mem8; 3554#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 3553#L557-1 assume !!(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);havoc test_fun_#t~mem8; 3552#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 3551#L557-1 assume !!(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);havoc test_fun_#t~mem8; 3550#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 3549#L557-1 assume !!(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);havoc test_fun_#t~mem8; 3548#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 3547#L557-1 assume !!(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);havoc test_fun_#t~mem8; 3546#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 3545#L557-1 assume !!(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);havoc test_fun_#t~mem8; 3544#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 3543#L557-1 assume !!(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);havoc test_fun_#t~mem8; 3542#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 3541#L557-1 assume !!(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);havoc test_fun_#t~mem8; 3540#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 3539#L557-1 assume !!(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);havoc test_fun_#t~mem8; 3538#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 3537#L557-1 assume !!(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);havoc test_fun_#t~mem8; 3536#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 3535#L557-1 assume !!(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);havoc test_fun_#t~mem8; 3531#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 3532#L557-1 assume !(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6; 3528#L557-4 [2021-11-07 08:32:24,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 08:32:24,311 INFO L85 PathProgramCache]: Analyzing trace with hash 233998114, now seen corresponding path program 12 times [2021-11-07 08:32:24,311 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 08:32:24,311 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [809381090] [2021-11-07 08:32:24,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 08:32:24,311 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 08:32:24,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-07 08:32:24,350 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-07 08:32:24,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-07 08:32:24,378 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-07 08:32:24,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 08:32:24,378 INFO L85 PathProgramCache]: Analyzing trace with hash 890059800, now seen corresponding path program 11 times [2021-11-07 08:32:24,379 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 08:32:24,379 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [895057066] [2021-11-07 08:32:24,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 08:32:24,379 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 08:32:24,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-07 08:32:24,401 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-07 08:32:24,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-07 08:32:24,424 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-07 08:32:24,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 08:32:24,424 INFO L85 PathProgramCache]: Analyzing trace with hash 1169180759, now seen corresponding path program 13 times [2021-11-07 08:32:24,425 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 08:32:24,425 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [573648995] [2021-11-07 08:32:24,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 08:32:24,425 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 08:32:24,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 08:32:25,914 INFO L134 CoverageAnalysis]: Checked inductivity of 554 backedges. 129 proven. 425 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 08:32:25,914 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-07 08:32:25,914 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [573648995] [2021-11-07 08:32:25,914 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [573648995] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-07 08:32:25,914 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [643631883] [2021-11-07 08:32:25,914 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2021-11-07 08:32:25,914 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-07 08:32:25,915 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ca00bbe-7802-45cf-8c9a-e5551a18caab/bin/uautomizer-AkOaLMaTGY/z3 [2021-11-07 08:32:25,916 INFO L229 MonitoredProcess]: Starting monitored process 46 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ca00bbe-7802-45cf-8c9a-e5551a18caab/bin/uautomizer-AkOaLMaTGY/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-07 08:32:25,916 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ca00bbe-7802-45cf-8c9a-e5551a18caab/bin/uautomizer-AkOaLMaTGY/z3 -smt2 -in SMTLIB2_COMPLIANT=true (46)] Waiting until timeout for monitored process [2021-11-07 08:32:26,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 08:32:26,372 INFO L263 TraceCheckSpWp]: Trace formula consists of 512 conjuncts, 37 conjunts are in the unsatisfiable core [2021-11-07 08:32:26,374 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-07 08:32:26,380 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2021-11-07 08:32:26,394 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-11-07 08:32:26,428 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-11-07 08:32:26,478 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-11-07 08:32:26,522 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-11-07 08:32:26,557 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-11-07 08:32:26,602 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-11-07 08:32:26,652 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-11-07 08:32:26,700 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-11-07 08:32:26,746 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-11-07 08:32:26,785 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-11-07 08:32:26,825 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-11-07 08:32:26,875 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-11-07 08:32:27,028 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 25 [2021-11-07 08:32:27,111 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2021-11-07 08:32:27,179 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2021-11-07 08:32:27,248 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2021-11-07 08:32:27,318 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2021-11-07 08:32:27,389 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2021-11-07 08:32:27,462 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2021-11-07 08:32:27,546 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2021-11-07 08:32:27,616 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2021-11-07 08:32:27,693 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2021-11-07 08:32:27,765 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2021-11-07 08:32:27,828 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2021-11-07 08:32:27,978 INFO L134 CoverageAnalysis]: Checked inductivity of 554 backedges. 69 proven. 485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 08:32:27,978 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [643631883] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-07 08:32:27,978 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-11-07 08:32:27,978 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 30] total 79 [2021-11-07 08:32:27,979 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1006713676] [2021-11-07 08:32:36,839 WARN L207 SmtUtils]: Spent 8.86 s on a formula simplification. DAG size of input: 217 DAG size of output: 196 [2021-11-07 08:32:36,892 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-07 08:32:36,892 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2021-11-07 08:32:36,894 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=674, Invalid=5488, Unknown=0, NotChecked=0, Total=6162 [2021-11-07 08:32:36,894 INFO L87 Difference]: Start difference. First operand 55 states and 57 transitions. cyclomatic complexity: 4 Second operand has 79 states, 79 states have (on average 1.3544303797468353) internal successors, (107), 79 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 08:32:39,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 08:32:39,151 INFO L93 Difference]: Finished difference Result 86 states and 89 transitions. [2021-11-07 08:32:39,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2021-11-07 08:32:39,152 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 86 states and 89 transitions. [2021-11-07 08:32:39,153 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 29 [2021-11-07 08:32:39,153 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 86 states to 60 states and 62 transitions. [2021-11-07 08:32:39,153 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 37 [2021-11-07 08:32:39,153 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 37 [2021-11-07 08:32:39,153 INFO L73 IsDeterministic]: Start isDeterministic. Operand 60 states and 62 transitions. [2021-11-07 08:32:39,154 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-11-07 08:32:39,154 INFO L681 BuchiCegarLoop]: Abstraction has 60 states and 62 transitions. [2021-11-07 08:32:39,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states and 62 transitions. [2021-11-07 08:32:39,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 59. [2021-11-07 08:32:39,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 59 states have (on average 1.0338983050847457) internal successors, (61), 58 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 08:32:39,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 61 transitions. [2021-11-07 08:32:39,157 INFO L704 BuchiCegarLoop]: Abstraction has 59 states and 61 transitions. [2021-11-07 08:32:39,157 INFO L587 BuchiCegarLoop]: Abstraction has 59 states and 61 transitions. [2021-11-07 08:32:39,157 INFO L425 BuchiCegarLoop]: ======== Iteration 17============ [2021-11-07 08:32:39,157 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 59 states and 61 transitions. [2021-11-07 08:32:39,157 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 29 [2021-11-07 08:32:39,158 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-11-07 08:32:39,158 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-11-07 08:32:39,167 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [13, 12, 1, 1, 1, 1, 1] [2021-11-07 08:32:39,167 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [13, 12, 1, 1, 1, 1] [2021-11-07 08:32:39,168 INFO L791 eck$LassoCheckResult]: Stem: 3998#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 3999#L-1 havoc main_#res;havoc main_#t~nondet11, main_#t~nondet12, main_#t~ret13;test_fun_#in~i, test_fun_#in~j := main_#t~nondet11, main_#t~nondet12;havoc test_fun_#res;havoc test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset, test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset, test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset, test_fun_#t~mem8, test_fun_#t~mem7, test_fun_#t~mem6, test_fun_#t~mem9, test_fun_#t~mem5, test_fun_#t~mem10, test_fun_~i, test_fun_~j, test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, test_fun_~c~0.base, test_fun_~c~0.offset;test_fun_~i := test_fun_#in~i;test_fun_~j := test_fun_#in~j;call test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.allocOnStack(4);test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset;call test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.allocOnStack(4);test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;call test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset := #Ultimate.allocOnStack(4);test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset;call write~int(test_fun_~i, test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4);call write~int(test_fun_~j, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); 4000#L555-3 call test_fun_#t~mem5 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 4001#L555-1 assume !!(test_fun_#t~mem5 >= 0);havoc test_fun_#t~mem5;call write~int(0, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4); 4008#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 4006#L557-1 assume !!(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);havoc test_fun_#t~mem8; 4002#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 4003#L557-1 assume !!(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);havoc test_fun_#t~mem8; 4004#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 4005#L557-1 assume !!(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);havoc test_fun_#t~mem8; 4007#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 4056#L557-1 assume !!(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);havoc test_fun_#t~mem8; 4055#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 4054#L557-1 assume !!(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);havoc test_fun_#t~mem8; 4053#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 4052#L557-1 assume !!(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);havoc test_fun_#t~mem8; 4051#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 4050#L557-1 assume !!(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);havoc test_fun_#t~mem8; 4049#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 4048#L557-1 assume !!(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);havoc test_fun_#t~mem8; 4047#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 4046#L557-1 assume !!(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);havoc test_fun_#t~mem8; 4045#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 4044#L557-1 assume !!(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);havoc test_fun_#t~mem8; 4043#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 4041#L557-1 assume !!(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);havoc test_fun_#t~mem8; 4039#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 4013#L557-1 assume !!(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);havoc test_fun_#t~mem8; 4012#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 4011#L557-1 assume !(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6; 4009#L557-4 [2021-11-07 08:32:39,168 INFO L793 eck$LassoCheckResult]: Loop: 4009#L557-4 call test_fun_#t~mem9 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4);call write~int(test_fun_#t~mem9 - 1, test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4);havoc test_fun_#t~mem9; 4010#L555-3 call test_fun_#t~mem5 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 4042#L555-1 assume !!(test_fun_#t~mem5 >= 0);havoc test_fun_#t~mem5;call write~int(0, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4); 4040#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 4038#L557-1 assume !!(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);havoc test_fun_#t~mem8; 4037#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 4036#L557-1 assume !!(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);havoc test_fun_#t~mem8; 4035#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 4034#L557-1 assume !!(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);havoc test_fun_#t~mem8; 4033#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 4032#L557-1 assume !!(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);havoc test_fun_#t~mem8; 4031#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 4030#L557-1 assume !!(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);havoc test_fun_#t~mem8; 4029#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 4028#L557-1 assume !!(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);havoc test_fun_#t~mem8; 4027#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 4026#L557-1 assume !!(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);havoc test_fun_#t~mem8; 4025#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 4024#L557-1 assume !!(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);havoc test_fun_#t~mem8; 4023#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 4022#L557-1 assume !!(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);havoc test_fun_#t~mem8; 4021#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 4020#L557-1 assume !!(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);havoc test_fun_#t~mem8; 4019#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 4018#L557-1 assume !!(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);havoc test_fun_#t~mem8; 4017#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 4016#L557-1 assume !!(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);havoc test_fun_#t~mem8; 4014#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 4015#L557-1 assume !(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6; 4009#L557-4 [2021-11-07 08:32:39,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 08:32:39,169 INFO L85 PathProgramCache]: Analyzing trace with hash 1533890631, now seen corresponding path program 13 times [2021-11-07 08:32:39,169 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 08:32:39,169 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1045894943] [2021-11-07 08:32:39,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 08:32:39,169 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 08:32:39,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-07 08:32:39,241 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-07 08:32:39,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-07 08:32:39,287 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-07 08:32:39,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 08:32:39,288 INFO L85 PathProgramCache]: Analyzing trace with hash 648978365, now seen corresponding path program 12 times [2021-11-07 08:32:39,288 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 08:32:39,288 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2083519300] [2021-11-07 08:32:39,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 08:32:39,288 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 08:32:39,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-07 08:32:39,311 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-07 08:32:39,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-07 08:32:39,334 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-07 08:32:39,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 08:32:39,334 INFO L85 PathProgramCache]: Analyzing trace with hash -482722505, now seen corresponding path program 14 times [2021-11-07 08:32:39,334 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 08:32:39,335 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [783465649] [2021-11-07 08:32:39,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 08:32:39,335 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 08:32:39,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 08:32:40,713 INFO L134 CoverageAnalysis]: Checked inductivity of 652 backedges. 152 proven. 500 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 08:32:40,713 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-07 08:32:40,713 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [783465649] [2021-11-07 08:32:40,714 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [783465649] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-07 08:32:40,714 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [476049666] [2021-11-07 08:32:40,714 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-11-07 08:32:40,714 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-07 08:32:40,714 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ca00bbe-7802-45cf-8c9a-e5551a18caab/bin/uautomizer-AkOaLMaTGY/z3 [2021-11-07 08:32:40,722 INFO L229 MonitoredProcess]: Starting monitored process 47 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ca00bbe-7802-45cf-8c9a-e5551a18caab/bin/uautomizer-AkOaLMaTGY/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-07 08:32:40,723 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ca00bbe-7802-45cf-8c9a-e5551a18caab/bin/uautomizer-AkOaLMaTGY/z3 -smt2 -in SMTLIB2_COMPLIANT=true (47)] Waiting until timeout for monitored process [2021-11-07 08:32:41,325 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-11-07 08:32:41,325 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-07 08:32:41,327 INFO L263 TraceCheckSpWp]: Trace formula consists of 548 conjuncts, 39 conjunts are in the unsatisfiable core [2021-11-07 08:32:41,329 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-07 08:32:41,335 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2021-11-07 08:32:41,348 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-11-07 08:32:41,389 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-11-07 08:32:41,423 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-11-07 08:32:41,458 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-11-07 08:32:41,497 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-11-07 08:32:41,535 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-11-07 08:32:41,583 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-11-07 08:32:41,623 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-11-07 08:32:41,671 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-11-07 08:32:41,711 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-11-07 08:32:41,750 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-11-07 08:32:41,792 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-11-07 08:32:41,834 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-11-07 08:32:42,012 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 25 [2021-11-07 08:32:42,091 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2021-11-07 08:32:42,155 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2021-11-07 08:32:42,215 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2021-11-07 08:32:42,271 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2021-11-07 08:32:42,335 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2021-11-07 08:32:42,415 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2021-11-07 08:32:42,483 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2021-11-07 08:32:42,542 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2021-11-07 08:32:42,607 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2021-11-07 08:32:42,674 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2021-11-07 08:32:42,745 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2021-11-07 08:32:42,813 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2021-11-07 08:32:42,950 INFO L134 CoverageAnalysis]: Checked inductivity of 652 backedges. 75 proven. 577 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 08:32:42,950 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [476049666] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-07 08:32:42,950 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-11-07 08:32:42,951 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [55, 32] total 85 [2021-11-07 08:32:42,951 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [634304999] [2021-11-07 08:32:54,469 WARN L207 SmtUtils]: Spent 11.51 s on a formula simplification. DAG size of input: 232 DAG size of output: 209 [2021-11-07 08:32:54,523 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-07 08:32:54,524 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2021-11-07 08:32:54,526 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=773, Invalid=6367, Unknown=0, NotChecked=0, Total=7140 [2021-11-07 08:32:54,526 INFO L87 Difference]: Start difference. First operand 59 states and 61 transitions. cyclomatic complexity: 4 Second operand has 85 states, 85 states have (on average 1.3529411764705883) internal successors, (115), 85 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 08:32:57,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 08:32:57,015 INFO L93 Difference]: Finished difference Result 92 states and 95 transitions. [2021-11-07 08:32:57,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2021-11-07 08:32:57,015 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 92 states and 95 transitions. [2021-11-07 08:32:57,016 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 31 [2021-11-07 08:32:57,017 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 92 states to 64 states and 66 transitions. [2021-11-07 08:32:57,017 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 39 [2021-11-07 08:32:57,017 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 39 [2021-11-07 08:32:57,017 INFO L73 IsDeterministic]: Start isDeterministic. Operand 64 states and 66 transitions. [2021-11-07 08:32:57,018 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-11-07 08:32:57,018 INFO L681 BuchiCegarLoop]: Abstraction has 64 states and 66 transitions. [2021-11-07 08:32:57,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states and 66 transitions. [2021-11-07 08:32:57,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 63. [2021-11-07 08:32:57,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 63 states have (on average 1.0317460317460319) internal successors, (65), 62 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 08:32:57,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 65 transitions. [2021-11-07 08:32:57,021 INFO L704 BuchiCegarLoop]: Abstraction has 63 states and 65 transitions. [2021-11-07 08:32:57,021 INFO L587 BuchiCegarLoop]: Abstraction has 63 states and 65 transitions. [2021-11-07 08:32:57,022 INFO L425 BuchiCegarLoop]: ======== Iteration 18============ [2021-11-07 08:32:57,022 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 63 states and 65 transitions. [2021-11-07 08:32:57,022 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 31 [2021-11-07 08:32:57,022 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-11-07 08:32:57,022 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-11-07 08:32:57,023 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [14, 13, 1, 1, 1, 1, 1] [2021-11-07 08:32:57,024 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [14, 13, 1, 1, 1, 1] [2021-11-07 08:32:57,024 INFO L791 eck$LassoCheckResult]: Stem: 4515#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 4516#L-1 havoc main_#res;havoc main_#t~nondet11, main_#t~nondet12, main_#t~ret13;test_fun_#in~i, test_fun_#in~j := main_#t~nondet11, main_#t~nondet12;havoc test_fun_#res;havoc test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset, test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset, test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset, test_fun_#t~mem8, test_fun_#t~mem7, test_fun_#t~mem6, test_fun_#t~mem9, test_fun_#t~mem5, test_fun_#t~mem10, test_fun_~i, test_fun_~j, test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, test_fun_~c~0.base, test_fun_~c~0.offset;test_fun_~i := test_fun_#in~i;test_fun_~j := test_fun_#in~j;call test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.allocOnStack(4);test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset;call test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.allocOnStack(4);test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;call test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset := #Ultimate.allocOnStack(4);test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset;call write~int(test_fun_~i, test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4);call write~int(test_fun_~j, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); 4517#L555-3 call test_fun_#t~mem5 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 4518#L555-1 assume !!(test_fun_#t~mem5 >= 0);havoc test_fun_#t~mem5;call write~int(0, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4); 4525#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 4523#L557-1 assume !!(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);havoc test_fun_#t~mem8; 4519#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 4520#L557-1 assume !!(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);havoc test_fun_#t~mem8; 4521#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 4522#L557-1 assume !!(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);havoc test_fun_#t~mem8; 4524#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 4577#L557-1 assume !!(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);havoc test_fun_#t~mem8; 4576#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 4575#L557-1 assume !!(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);havoc test_fun_#t~mem8; 4574#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 4573#L557-1 assume !!(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);havoc test_fun_#t~mem8; 4572#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 4571#L557-1 assume !!(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);havoc test_fun_#t~mem8; 4570#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 4569#L557-1 assume !!(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);havoc test_fun_#t~mem8; 4568#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 4567#L557-1 assume !!(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);havoc test_fun_#t~mem8; 4566#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 4565#L557-1 assume !!(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);havoc test_fun_#t~mem8; 4564#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 4563#L557-1 assume !!(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);havoc test_fun_#t~mem8; 4562#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 4560#L557-1 assume !!(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);havoc test_fun_#t~mem8; 4558#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 4532#L557-1 assume !!(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);havoc test_fun_#t~mem8; 4531#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 4528#L557-1 assume !(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6; 4526#L557-4 [2021-11-07 08:32:57,024 INFO L793 eck$LassoCheckResult]: Loop: 4526#L557-4 call test_fun_#t~mem9 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4);call write~int(test_fun_#t~mem9 - 1, test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4);havoc test_fun_#t~mem9; 4527#L555-3 call test_fun_#t~mem5 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 4561#L555-1 assume !!(test_fun_#t~mem5 >= 0);havoc test_fun_#t~mem5;call write~int(0, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4); 4559#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 4557#L557-1 assume !!(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);havoc test_fun_#t~mem8; 4556#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 4555#L557-1 assume !!(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);havoc test_fun_#t~mem8; 4554#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 4553#L557-1 assume !!(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);havoc test_fun_#t~mem8; 4552#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 4551#L557-1 assume !!(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);havoc test_fun_#t~mem8; 4550#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 4549#L557-1 assume !!(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);havoc test_fun_#t~mem8; 4548#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 4547#L557-1 assume !!(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);havoc test_fun_#t~mem8; 4546#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 4545#L557-1 assume !!(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);havoc test_fun_#t~mem8; 4544#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 4543#L557-1 assume !!(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);havoc test_fun_#t~mem8; 4542#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 4541#L557-1 assume !!(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);havoc test_fun_#t~mem8; 4540#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 4539#L557-1 assume !!(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);havoc test_fun_#t~mem8; 4538#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 4537#L557-1 assume !!(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);havoc test_fun_#t~mem8; 4536#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 4535#L557-1 assume !!(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);havoc test_fun_#t~mem8; 4534#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 4533#L557-1 assume !!(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);havoc test_fun_#t~mem8; 4529#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 4530#L557-1 assume !(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6; 4526#L557-4 [2021-11-07 08:32:57,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 08:32:57,025 INFO L85 PathProgramCache]: Analyzing trace with hash 895116332, now seen corresponding path program 14 times [2021-11-07 08:32:57,025 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 08:32:57,025 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [296971215] [2021-11-07 08:32:57,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 08:32:57,025 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 08:32:57,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-07 08:32:57,068 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-07 08:32:57,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-07 08:32:57,101 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-07 08:32:57,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 08:32:57,102 INFO L85 PathProgramCache]: Analyzing trace with hash 897953314, now seen corresponding path program 13 times [2021-11-07 08:32:57,102 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 08:32:57,102 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2126156447] [2021-11-07 08:32:57,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 08:32:57,103 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 08:32:57,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-07 08:32:57,131 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-07 08:32:57,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-07 08:32:57,167 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-07 08:32:57,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 08:32:57,168 INFO L85 PathProgramCache]: Analyzing trace with hash -1913027433, now seen corresponding path program 15 times [2021-11-07 08:32:57,168 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 08:32:57,169 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [129217525] [2021-11-07 08:32:57,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 08:32:57,169 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 08:32:57,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 08:32:58,838 INFO L134 CoverageAnalysis]: Checked inductivity of 758 backedges. 177 proven. 581 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 08:32:58,838 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-07 08:32:58,838 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [129217525] [2021-11-07 08:32:58,838 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [129217525] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-07 08:32:58,838 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [912825307] [2021-11-07 08:32:58,839 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-07 08:32:58,839 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-07 08:32:58,839 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ca00bbe-7802-45cf-8c9a-e5551a18caab/bin/uautomizer-AkOaLMaTGY/z3 [2021-11-07 08:32:58,840 INFO L229 MonitoredProcess]: Starting monitored process 48 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ca00bbe-7802-45cf-8c9a-e5551a18caab/bin/uautomizer-AkOaLMaTGY/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-07 08:32:58,840 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ca00bbe-7802-45cf-8c9a-e5551a18caab/bin/uautomizer-AkOaLMaTGY/z3 -smt2 -in SMTLIB2_COMPLIANT=true (48)] Waiting until timeout for monitored process [2021-11-07 08:33:00,218 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) [2021-11-07 08:33:00,218 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-07 08:33:00,224 INFO L263 TraceCheckSpWp]: Trace formula consists of 584 conjuncts, 48 conjunts are in the unsatisfiable core [2021-11-07 08:33:00,226 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-07 08:33:00,268 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-11-07 08:33:00,315 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-11-07 08:33:00,358 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-11-07 08:33:00,402 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-11-07 08:33:00,447 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-11-07 08:33:00,507 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-11-07 08:33:00,567 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-11-07 08:33:00,613 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-11-07 08:33:00,663 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-11-07 08:33:00,714 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-11-07 08:33:00,766 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-11-07 08:33:00,817 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-11-07 08:33:00,869 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-11-07 08:33:00,936 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-11-07 08:33:01,107 INFO L354 Elim1Store]: treesize reduction 14, result has 58.8 percent of original size [2021-11-07 08:33:01,107 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 38 treesize of output 37 [2021-11-07 08:33:01,218 INFO L354 Elim1Store]: treesize reduction 12, result has 62.5 percent of original size [2021-11-07 08:33:01,219 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 42 treesize of output 45 [2021-11-07 08:33:01,400 INFO L354 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2021-11-07 08:33:01,401 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 45 treesize of output 32 [2021-11-07 08:33:01,526 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 26 [2021-11-07 08:33:01,653 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 26 [2021-11-07 08:33:01,792 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 26 [2021-11-07 08:33:01,935 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 26 [2021-11-07 08:33:02,065 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 26 [2021-11-07 08:33:02,175 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 26 [2021-11-07 08:33:02,300 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 26 [2021-11-07 08:33:02,426 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 26 [2021-11-07 08:33:02,533 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 26 [2021-11-07 08:33:02,635 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 26 [2021-11-07 08:33:02,746 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 26 [2021-11-07 08:33:02,935 INFO L134 CoverageAnalysis]: Checked inductivity of 758 backedges. 81 proven. 677 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 08:33:02,935 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [912825307] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-07 08:33:02,935 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-11-07 08:33:02,935 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [59, 35] total 92 [2021-11-07 08:33:02,936 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [108041561] [2021-11-07 08:33:20,551 WARN L207 SmtUtils]: Spent 17.61 s on a formula simplification. DAG size of input: 247 DAG size of output: 222 [2021-11-07 08:33:20,628 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-07 08:33:20,628 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2021-11-07 08:33:20,631 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=925, Invalid=7447, Unknown=0, NotChecked=0, Total=8372 [2021-11-07 08:33:20,631 INFO L87 Difference]: Start difference. First operand 63 states and 65 transitions. cyclomatic complexity: 4 Second operand has 92 states, 92 states have (on average 1.3369565217391304) internal successors, (123), 92 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 08:33:23,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 08:33:23,689 INFO L93 Difference]: Finished difference Result 98 states and 101 transitions. [2021-11-07 08:33:23,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2021-11-07 08:33:23,689 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 98 states and 101 transitions. [2021-11-07 08:33:23,690 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 33 [2021-11-07 08:33:23,691 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 98 states to 68 states and 70 transitions. [2021-11-07 08:33:23,691 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 41 [2021-11-07 08:33:23,691 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 41 [2021-11-07 08:33:23,691 INFO L73 IsDeterministic]: Start isDeterministic. Operand 68 states and 70 transitions. [2021-11-07 08:33:23,691 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-11-07 08:33:23,691 INFO L681 BuchiCegarLoop]: Abstraction has 68 states and 70 transitions. [2021-11-07 08:33:23,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states and 70 transitions. [2021-11-07 08:33:23,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 67. [2021-11-07 08:33:23,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 67 states have (on average 1.0298507462686568) internal successors, (69), 66 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 08:33:23,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 69 transitions. [2021-11-07 08:33:23,695 INFO L704 BuchiCegarLoop]: Abstraction has 67 states and 69 transitions. [2021-11-07 08:33:23,695 INFO L587 BuchiCegarLoop]: Abstraction has 67 states and 69 transitions. [2021-11-07 08:33:23,695 INFO L425 BuchiCegarLoop]: ======== Iteration 19============ [2021-11-07 08:33:23,695 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 67 states and 69 transitions. [2021-11-07 08:33:23,696 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 33 [2021-11-07 08:33:23,696 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-11-07 08:33:23,696 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-11-07 08:33:23,697 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [15, 14, 1, 1, 1, 1, 1] [2021-11-07 08:33:23,697 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [15, 14, 1, 1, 1, 1] [2021-11-07 08:33:23,697 INFO L791 eck$LassoCheckResult]: Stem: 5049#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 5050#L-1 havoc main_#res;havoc main_#t~nondet11, main_#t~nondet12, main_#t~ret13;test_fun_#in~i, test_fun_#in~j := main_#t~nondet11, main_#t~nondet12;havoc test_fun_#res;havoc test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset, test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset, test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset, test_fun_#t~mem8, test_fun_#t~mem7, test_fun_#t~mem6, test_fun_#t~mem9, test_fun_#t~mem5, test_fun_#t~mem10, test_fun_~i, test_fun_~j, test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, test_fun_~c~0.base, test_fun_~c~0.offset;test_fun_~i := test_fun_#in~i;test_fun_~j := test_fun_#in~j;call test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.allocOnStack(4);test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset;call test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.allocOnStack(4);test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;call test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset := #Ultimate.allocOnStack(4);test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset;call write~int(test_fun_~i, test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4);call write~int(test_fun_~j, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); 5057#L555-3 call test_fun_#t~mem5 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 5058#L555-1 assume !!(test_fun_#t~mem5 >= 0);havoc test_fun_#t~mem5;call write~int(0, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4); 5059#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 5060#L557-1 assume !!(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);havoc test_fun_#t~mem8; 5053#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 5054#L557-1 assume !!(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);havoc test_fun_#t~mem8; 5055#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 5056#L557-1 assume !!(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);havoc test_fun_#t~mem8; 5061#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 5115#L557-1 assume !!(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);havoc test_fun_#t~mem8; 5114#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 5113#L557-1 assume !!(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);havoc test_fun_#t~mem8; 5112#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 5111#L557-1 assume !!(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);havoc test_fun_#t~mem8; 5110#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 5109#L557-1 assume !!(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);havoc test_fun_#t~mem8; 5108#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 5107#L557-1 assume !!(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);havoc test_fun_#t~mem8; 5106#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 5105#L557-1 assume !!(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);havoc test_fun_#t~mem8; 5104#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 5103#L557-1 assume !!(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);havoc test_fun_#t~mem8; 5102#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 5101#L557-1 assume !!(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);havoc test_fun_#t~mem8; 5100#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 5099#L557-1 assume !!(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);havoc test_fun_#t~mem8; 5098#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 5097#L557-1 assume !!(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);havoc test_fun_#t~mem8; 5096#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 5067#L557-1 assume !!(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);havoc test_fun_#t~mem8; 5066#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 5063#L557-1 assume !(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6; 5062#L557-4 [2021-11-07 08:33:23,697 INFO L793 eck$LassoCheckResult]: Loop: 5062#L557-4 call test_fun_#t~mem9 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4);call write~int(test_fun_#t~mem9 - 1, test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4);havoc test_fun_#t~mem9; 5051#L555-3 call test_fun_#t~mem5 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 5052#L555-1 assume !!(test_fun_#t~mem5 >= 0);havoc test_fun_#t~mem5;call write~int(0, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4); 5095#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 5094#L557-1 assume !!(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);havoc test_fun_#t~mem8; 5093#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 5092#L557-1 assume !!(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);havoc test_fun_#t~mem8; 5091#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 5090#L557-1 assume !!(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);havoc test_fun_#t~mem8; 5089#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 5088#L557-1 assume !!(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);havoc test_fun_#t~mem8; 5087#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 5086#L557-1 assume !!(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);havoc test_fun_#t~mem8; 5085#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 5084#L557-1 assume !!(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);havoc test_fun_#t~mem8; 5083#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 5082#L557-1 assume !!(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);havoc test_fun_#t~mem8; 5081#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 5080#L557-1 assume !!(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);havoc test_fun_#t~mem8; 5079#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 5078#L557-1 assume !!(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);havoc test_fun_#t~mem8; 5077#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 5076#L557-1 assume !!(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);havoc test_fun_#t~mem8; 5075#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 5074#L557-1 assume !!(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);havoc test_fun_#t~mem8; 5073#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 5072#L557-1 assume !!(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);havoc test_fun_#t~mem8; 5071#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 5070#L557-1 assume !!(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);havoc test_fun_#t~mem8; 5069#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 5068#L557-1 assume !!(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);havoc test_fun_#t~mem8; 5064#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 5065#L557-1 assume !(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6; 5062#L557-4 [2021-11-07 08:33:23,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 08:33:23,698 INFO L85 PathProgramCache]: Analyzing trace with hash 1213338321, now seen corresponding path program 15 times [2021-11-07 08:33:23,698 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 08:33:23,698 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1620062882] [2021-11-07 08:33:23,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 08:33:23,699 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 08:33:23,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-07 08:33:23,749 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-07 08:33:23,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-07 08:33:23,806 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-07 08:33:23,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 08:33:23,807 INFO L85 PathProgramCache]: Analyzing trace with hash -355289273, now seen corresponding path program 14 times [2021-11-07 08:33:23,807 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 08:33:23,812 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [459557123] [2021-11-07 08:33:23,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 08:33:23,813 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 08:33:23,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-07 08:33:23,843 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-07 08:33:23,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-07 08:33:23,873 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-07 08:33:23,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 08:33:23,874 INFO L85 PathProgramCache]: Analyzing trace with hash 1515863671, now seen corresponding path program 16 times [2021-11-07 08:33:23,874 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 08:33:23,874 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1347978119] [2021-11-07 08:33:23,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 08:33:23,874 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 08:33:23,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 08:33:25,675 INFO L134 CoverageAnalysis]: Checked inductivity of 872 backedges. 204 proven. 668 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 08:33:25,675 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-07 08:33:25,675 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1347978119] [2021-11-07 08:33:25,675 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1347978119] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-07 08:33:25,675 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1994052017] [2021-11-07 08:33:25,675 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-11-07 08:33:25,676 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-07 08:33:25,676 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ca00bbe-7802-45cf-8c9a-e5551a18caab/bin/uautomizer-AkOaLMaTGY/z3 [2021-11-07 08:33:25,677 INFO L229 MonitoredProcess]: Starting monitored process 49 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ca00bbe-7802-45cf-8c9a-e5551a18caab/bin/uautomizer-AkOaLMaTGY/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-07 08:33:25,678 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ca00bbe-7802-45cf-8c9a-e5551a18caab/bin/uautomizer-AkOaLMaTGY/z3 -smt2 -in SMTLIB2_COMPLIANT=true (49)] Waiting until timeout for monitored process [2021-11-07 08:33:26,340 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-11-07 08:33:26,341 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-07 08:33:26,343 INFO L263 TraceCheckSpWp]: Trace formula consists of 620 conjuncts, 43 conjunts are in the unsatisfiable core [2021-11-07 08:33:26,345 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-07 08:33:26,353 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2021-11-07 08:33:26,366 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-11-07 08:33:26,412 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-11-07 08:33:26,454 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-11-07 08:33:26,494 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-11-07 08:33:26,535 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-11-07 08:33:26,584 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-11-07 08:33:26,624 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-11-07 08:33:26,668 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-11-07 08:33:26,716 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-11-07 08:33:26,758 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-11-07 08:33:26,803 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-11-07 08:33:26,846 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-11-07 08:33:26,892 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-11-07 08:33:26,951 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-11-07 08:33:26,999 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-11-07 08:33:27,153 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 25 [2021-11-07 08:33:27,221 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2021-11-07 08:33:27,281 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2021-11-07 08:33:27,341 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2021-11-07 08:33:27,403 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2021-11-07 08:33:27,479 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2021-11-07 08:33:27,547 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2021-11-07 08:33:27,613 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2021-11-07 08:33:27,688 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2021-11-07 08:33:27,754 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2021-11-07 08:33:27,831 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2021-11-07 08:33:27,901 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2021-11-07 08:33:27,986 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2021-11-07 08:33:28,069 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2021-11-07 08:33:28,141 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2021-11-07 08:33:28,301 INFO L134 CoverageAnalysis]: Checked inductivity of 872 backedges. 87 proven. 785 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 08:33:28,302 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1994052017] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-07 08:33:28,302 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-11-07 08:33:28,302 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [63, 36] total 97 [2021-11-07 08:33:28,302 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [954257000] [2021-11-07 08:33:49,003 WARN L207 SmtUtils]: Spent 20.70 s on a formula simplification. DAG size of input: 262 DAG size of output: 235 [2021-11-07 08:33:49,076 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-07 08:33:49,077 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2021-11-07 08:33:49,079 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=992, Invalid=8320, Unknown=0, NotChecked=0, Total=9312 [2021-11-07 08:33:49,079 INFO L87 Difference]: Start difference. First operand 67 states and 69 transitions. cyclomatic complexity: 4 Second operand has 97 states, 97 states have (on average 1.3505154639175259) internal successors, (131), 97 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 08:33:52,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 08:33:52,022 INFO L93 Difference]: Finished difference Result 104 states and 107 transitions. [2021-11-07 08:33:52,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2021-11-07 08:33:52,023 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 104 states and 107 transitions. [2021-11-07 08:33:52,023 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 35 [2021-11-07 08:33:52,024 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 104 states to 72 states and 74 transitions. [2021-11-07 08:33:52,024 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 43 [2021-11-07 08:33:52,025 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 43 [2021-11-07 08:33:52,025 INFO L73 IsDeterministic]: Start isDeterministic. Operand 72 states and 74 transitions. [2021-11-07 08:33:52,025 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-11-07 08:33:52,025 INFO L681 BuchiCegarLoop]: Abstraction has 72 states and 74 transitions. [2021-11-07 08:33:52,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states and 74 transitions. [2021-11-07 08:33:52,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 71. [2021-11-07 08:33:52,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 71 states have (on average 1.028169014084507) internal successors, (73), 70 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 08:33:52,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 73 transitions. [2021-11-07 08:33:52,029 INFO L704 BuchiCegarLoop]: Abstraction has 71 states and 73 transitions. [2021-11-07 08:33:52,029 INFO L587 BuchiCegarLoop]: Abstraction has 71 states and 73 transitions. [2021-11-07 08:33:52,029 INFO L425 BuchiCegarLoop]: ======== Iteration 20============ [2021-11-07 08:33:52,029 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 71 states and 73 transitions. [2021-11-07 08:33:52,029 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 35 [2021-11-07 08:33:52,030 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-11-07 08:33:52,030 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-11-07 08:33:52,030 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [16, 15, 1, 1, 1, 1, 1] [2021-11-07 08:33:52,031 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [16, 15, 1, 1, 1, 1] [2021-11-07 08:33:52,031 INFO L791 eck$LassoCheckResult]: Stem: 5638#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 5639#L-1 havoc main_#res;havoc main_#t~nondet11, main_#t~nondet12, main_#t~ret13;test_fun_#in~i, test_fun_#in~j := main_#t~nondet11, main_#t~nondet12;havoc test_fun_#res;havoc test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset, test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset, test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset, test_fun_#t~mem8, test_fun_#t~mem7, test_fun_#t~mem6, test_fun_#t~mem9, test_fun_#t~mem5, test_fun_#t~mem10, test_fun_~i, test_fun_~j, test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, test_fun_~c~0.base, test_fun_~c~0.offset;test_fun_~i := test_fun_#in~i;test_fun_~j := test_fun_#in~j;call test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.allocOnStack(4);test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset;call test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.allocOnStack(4);test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;call test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset := #Ultimate.allocOnStack(4);test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset;call write~int(test_fun_~i, test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4);call write~int(test_fun_~j, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); 5640#L555-3 call test_fun_#t~mem5 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 5641#L555-1 assume !!(test_fun_#t~mem5 >= 0);havoc test_fun_#t~mem5;call write~int(0, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4); 5648#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 5646#L557-1 assume !!(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);havoc test_fun_#t~mem8; 5642#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 5643#L557-1 assume !!(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);havoc test_fun_#t~mem8; 5644#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 5645#L557-1 assume !!(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);havoc test_fun_#t~mem8; 5647#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 5708#L557-1 assume !!(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);havoc test_fun_#t~mem8; 5707#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 5706#L557-1 assume !!(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);havoc test_fun_#t~mem8; 5705#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 5704#L557-1 assume !!(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);havoc test_fun_#t~mem8; 5703#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 5702#L557-1 assume !!(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);havoc test_fun_#t~mem8; 5701#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 5700#L557-1 assume !!(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);havoc test_fun_#t~mem8; 5699#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 5698#L557-1 assume !!(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);havoc test_fun_#t~mem8; 5697#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 5696#L557-1 assume !!(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);havoc test_fun_#t~mem8; 5695#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 5694#L557-1 assume !!(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);havoc test_fun_#t~mem8; 5693#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 5692#L557-1 assume !!(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);havoc test_fun_#t~mem8; 5691#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 5690#L557-1 assume !!(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);havoc test_fun_#t~mem8; 5689#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 5687#L557-1 assume !!(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);havoc test_fun_#t~mem8; 5685#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 5655#L557-1 assume !!(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);havoc test_fun_#t~mem8; 5654#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 5651#L557-1 assume !(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6; 5649#L557-4 [2021-11-07 08:33:52,031 INFO L793 eck$LassoCheckResult]: Loop: 5649#L557-4 call test_fun_#t~mem9 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4);call write~int(test_fun_#t~mem9 - 1, test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4);havoc test_fun_#t~mem9; 5650#L555-3 call test_fun_#t~mem5 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 5688#L555-1 assume !!(test_fun_#t~mem5 >= 0);havoc test_fun_#t~mem5;call write~int(0, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4); 5686#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 5684#L557-1 assume !!(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);havoc test_fun_#t~mem8; 5683#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 5682#L557-1 assume !!(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);havoc test_fun_#t~mem8; 5681#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 5680#L557-1 assume !!(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);havoc test_fun_#t~mem8; 5679#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 5678#L557-1 assume !!(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);havoc test_fun_#t~mem8; 5677#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 5676#L557-1 assume !!(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);havoc test_fun_#t~mem8; 5675#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 5674#L557-1 assume !!(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);havoc test_fun_#t~mem8; 5673#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 5672#L557-1 assume !!(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);havoc test_fun_#t~mem8; 5671#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 5670#L557-1 assume !!(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);havoc test_fun_#t~mem8; 5669#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 5668#L557-1 assume !!(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);havoc test_fun_#t~mem8; 5667#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 5666#L557-1 assume !!(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);havoc test_fun_#t~mem8; 5665#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 5664#L557-1 assume !!(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);havoc test_fun_#t~mem8; 5663#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 5662#L557-1 assume !!(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);havoc test_fun_#t~mem8; 5661#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 5660#L557-1 assume !!(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);havoc test_fun_#t~mem8; 5659#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 5658#L557-1 assume !!(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);havoc test_fun_#t~mem8; 5657#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 5656#L557-1 assume !!(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);havoc test_fun_#t~mem8; 5652#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 5653#L557-1 assume !(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6; 5649#L557-4 [2021-11-07 08:33:52,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 08:33:52,032 INFO L85 PathProgramCache]: Analyzing trace with hash 2081991734, now seen corresponding path program 16 times [2021-11-07 08:33:52,032 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 08:33:52,032 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [30045267] [2021-11-07 08:33:52,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 08:33:52,032 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 08:33:52,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-07 08:33:52,064 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-07 08:33:52,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-07 08:33:52,094 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-07 08:33:52,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 08:33:52,095 INFO L85 PathProgramCache]: Analyzing trace with hash -2130572500, now seen corresponding path program 15 times [2021-11-07 08:33:52,096 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 08:33:52,096 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2014084198] [2021-11-07 08:33:52,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 08:33:52,096 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 08:33:52,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-07 08:33:52,126 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-07 08:33:52,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-07 08:33:52,187 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-07 08:33:52,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 08:33:52,188 INFO L85 PathProgramCache]: Analyzing trace with hash 1491110615, now seen corresponding path program 17 times [2021-11-07 08:33:52,188 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 08:33:52,188 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1067131906] [2021-11-07 08:33:52,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 08:33:52,188 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 08:33:52,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 08:33:54,171 INFO L134 CoverageAnalysis]: Checked inductivity of 994 backedges. 233 proven. 761 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 08:33:54,171 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-07 08:33:54,171 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1067131906] [2021-11-07 08:33:54,171 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1067131906] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-07 08:33:54,171 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [646925432] [2021-11-07 08:33:54,171 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2021-11-07 08:33:54,171 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-07 08:33:54,172 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ca00bbe-7802-45cf-8c9a-e5551a18caab/bin/uautomizer-AkOaLMaTGY/z3 [2021-11-07 08:33:54,173 INFO L229 MonitoredProcess]: Starting monitored process 50 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ca00bbe-7802-45cf-8c9a-e5551a18caab/bin/uautomizer-AkOaLMaTGY/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-07 08:33:54,174 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ca00bbe-7802-45cf-8c9a-e5551a18caab/bin/uautomizer-AkOaLMaTGY/z3 -smt2 -in SMTLIB2_COMPLIANT=true (50)] Waiting until timeout for monitored process [2021-11-07 08:33:56,064 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 17 check-sat command(s) [2021-11-07 08:33:56,064 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-07 08:33:56,071 INFO L263 TraceCheckSpWp]: Trace formula consists of 656 conjuncts, 49 conjunts are in the unsatisfiable core [2021-11-07 08:33:56,072 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-07 08:33:56,125 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-11-07 08:33:56,177 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-11-07 08:33:56,222 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-11-07 08:33:56,287 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-11-07 08:33:56,349 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-11-07 08:33:56,413 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-11-07 08:33:56,480 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-11-07 08:33:56,546 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-11-07 08:33:56,695 INFO L354 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2021-11-07 08:33:56,695 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 38 treesize of output 29 [2021-11-07 08:33:56,801 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2021-11-07 08:33:56,918 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2021-11-07 08:33:57,023 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2021-11-07 08:33:57,106 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2021-11-07 08:33:57,189 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2021-11-07 08:33:57,269 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2021-11-07 08:33:57,355 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2021-11-07 08:33:57,636 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 28 [2021-11-07 08:33:57,773 INFO L354 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2021-11-07 08:33:57,774 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 33 treesize of output 24 [2021-11-07 08:33:57,931 INFO L354 Elim1Store]: treesize reduction 27, result has 20.6 percent of original size [2021-11-07 08:33:57,931 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 39 treesize of output 26 [2021-11-07 08:33:58,132 INFO L354 Elim1Store]: treesize reduction 27, result has 20.6 percent of original size [2021-11-07 08:33:58,133 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 39 treesize of output 26 [2021-11-07 08:33:58,303 INFO L354 Elim1Store]: treesize reduction 27, result has 20.6 percent of original size [2021-11-07 08:33:58,303 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 39 treesize of output 26 [2021-11-07 08:33:58,492 INFO L354 Elim1Store]: treesize reduction 27, result has 20.6 percent of original size [2021-11-07 08:33:58,493 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 39 treesize of output 26 [2021-11-07 08:33:58,659 INFO L354 Elim1Store]: treesize reduction 27, result has 20.6 percent of original size [2021-11-07 08:33:58,659 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 39 treesize of output 26 [2021-11-07 08:33:58,802 INFO L354 Elim1Store]: treesize reduction 27, result has 20.6 percent of original size [2021-11-07 08:33:58,802 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 39 treesize of output 26 [2021-11-07 08:33:58,931 INFO L354 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2021-11-07 08:33:58,931 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 39 treesize of output 30 [2021-11-07 08:33:59,051 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 26 [2021-11-07 08:33:59,171 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 26 [2021-11-07 08:33:59,296 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 26 [2021-11-07 08:33:59,411 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 26 [2021-11-07 08:33:59,539 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 26 [2021-11-07 08:33:59,669 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 26 [2021-11-07 08:33:59,783 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 26 [2021-11-07 08:33:59,879 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-11-07 08:33:59,879 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 20 [2021-11-07 08:33:59,929 INFO L134 CoverageAnalysis]: Checked inductivity of 994 backedges. 79 proven. 915 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 08:33:59,929 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [646925432] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-07 08:33:59,929 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-11-07 08:33:59,929 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [67, 39] total 104 [2021-11-07 08:33:59,929 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [50537428] [2021-11-07 08:34:27,856 WARN L207 SmtUtils]: Spent 27.92 s on a formula simplification. DAG size of input: 277 DAG size of output: 248 [2021-11-07 08:34:27,931 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-07 08:34:27,932 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 104 interpolants. [2021-11-07 08:34:27,934 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1274, Invalid=9438, Unknown=0, NotChecked=0, Total=10712 [2021-11-07 08:34:27,935 INFO L87 Difference]: Start difference. First operand 71 states and 73 transitions. cyclomatic complexity: 4 Second operand has 104 states, 104 states have (on average 1.3365384615384615) internal successors, (139), 104 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 08:34:30,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 08:34:30,946 INFO L93 Difference]: Finished difference Result 110 states and 113 transitions. [2021-11-07 08:34:30,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2021-11-07 08:34:30,947 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 110 states and 113 transitions. [2021-11-07 08:34:30,947 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 37 [2021-11-07 08:34:30,948 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 110 states to 76 states and 78 transitions. [2021-11-07 08:34:30,948 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 45 [2021-11-07 08:34:30,948 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 45 [2021-11-07 08:34:30,948 INFO L73 IsDeterministic]: Start isDeterministic. Operand 76 states and 78 transitions. [2021-11-07 08:34:30,949 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-11-07 08:34:30,949 INFO L681 BuchiCegarLoop]: Abstraction has 76 states and 78 transitions. [2021-11-07 08:34:30,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states and 78 transitions. [2021-11-07 08:34:30,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 75. [2021-11-07 08:34:30,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 75 states have (on average 1.0266666666666666) internal successors, (77), 74 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 08:34:30,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 77 transitions. [2021-11-07 08:34:30,952 INFO L704 BuchiCegarLoop]: Abstraction has 75 states and 77 transitions. [2021-11-07 08:34:30,952 INFO L587 BuchiCegarLoop]: Abstraction has 75 states and 77 transitions. [2021-11-07 08:34:30,952 INFO L425 BuchiCegarLoop]: ======== Iteration 21============ [2021-11-07 08:34:30,952 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 75 states and 77 transitions. [2021-11-07 08:34:30,952 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 37 [2021-11-07 08:34:30,953 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-11-07 08:34:30,953 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-11-07 08:34:30,953 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [17, 16, 1, 1, 1, 1, 1] [2021-11-07 08:34:30,953 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [17, 16, 1, 1, 1, 1] [2021-11-07 08:34:30,954 INFO L791 eck$LassoCheckResult]: Stem: 6232#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 6233#L-1 havoc main_#res;havoc main_#t~nondet11, main_#t~nondet12, main_#t~ret13;test_fun_#in~i, test_fun_#in~j := main_#t~nondet11, main_#t~nondet12;havoc test_fun_#res;havoc test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset, test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset, test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset, test_fun_#t~mem8, test_fun_#t~mem7, test_fun_#t~mem6, test_fun_#t~mem9, test_fun_#t~mem5, test_fun_#t~mem10, test_fun_~i, test_fun_~j, test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, test_fun_~c~0.base, test_fun_~c~0.offset;test_fun_~i := test_fun_#in~i;test_fun_~j := test_fun_#in~j;call test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.allocOnStack(4);test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset;call test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.allocOnStack(4);test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;call test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset := #Ultimate.allocOnStack(4);test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset;call write~int(test_fun_~i, test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4);call write~int(test_fun_~j, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); 6234#L555-3 call test_fun_#t~mem5 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 6235#L555-1 assume !!(test_fun_#t~mem5 >= 0);havoc test_fun_#t~mem5;call write~int(0, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4); 6242#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 6240#L557-1 assume !!(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);havoc test_fun_#t~mem8; 6236#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 6237#L557-1 assume !!(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);havoc test_fun_#t~mem8; 6238#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 6239#L557-1 assume !!(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);havoc test_fun_#t~mem8; 6241#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 6306#L557-1 assume !!(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);havoc test_fun_#t~mem8; 6305#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 6304#L557-1 assume !!(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);havoc test_fun_#t~mem8; 6303#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 6302#L557-1 assume !!(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);havoc test_fun_#t~mem8; 6301#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 6300#L557-1 assume !!(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);havoc test_fun_#t~mem8; 6299#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 6298#L557-1 assume !!(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);havoc test_fun_#t~mem8; 6297#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 6296#L557-1 assume !!(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);havoc test_fun_#t~mem8; 6295#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 6294#L557-1 assume !!(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);havoc test_fun_#t~mem8; 6293#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 6292#L557-1 assume !!(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);havoc test_fun_#t~mem8; 6291#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 6290#L557-1 assume !!(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);havoc test_fun_#t~mem8; 6289#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 6288#L557-1 assume !!(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);havoc test_fun_#t~mem8; 6287#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 6286#L557-1 assume !!(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);havoc test_fun_#t~mem8; 6285#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 6283#L557-1 assume !!(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);havoc test_fun_#t~mem8; 6281#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 6247#L557-1 assume !!(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);havoc test_fun_#t~mem8; 6246#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 6245#L557-1 assume !(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6; 6243#L557-4 [2021-11-07 08:34:30,954 INFO L793 eck$LassoCheckResult]: Loop: 6243#L557-4 call test_fun_#t~mem9 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4);call write~int(test_fun_#t~mem9 - 1, test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4);havoc test_fun_#t~mem9; 6244#L555-3 call test_fun_#t~mem5 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 6284#L555-1 assume !!(test_fun_#t~mem5 >= 0);havoc test_fun_#t~mem5;call write~int(0, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4); 6282#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 6280#L557-1 assume !!(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);havoc test_fun_#t~mem8; 6279#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 6278#L557-1 assume !!(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);havoc test_fun_#t~mem8; 6277#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 6276#L557-1 assume !!(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);havoc test_fun_#t~mem8; 6275#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 6274#L557-1 assume !!(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);havoc test_fun_#t~mem8; 6273#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 6272#L557-1 assume !!(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);havoc test_fun_#t~mem8; 6271#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 6270#L557-1 assume !!(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);havoc test_fun_#t~mem8; 6269#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 6268#L557-1 assume !!(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);havoc test_fun_#t~mem8; 6267#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 6266#L557-1 assume !!(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);havoc test_fun_#t~mem8; 6265#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 6264#L557-1 assume !!(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);havoc test_fun_#t~mem8; 6263#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 6262#L557-1 assume !!(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);havoc test_fun_#t~mem8; 6261#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 6260#L557-1 assume !!(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);havoc test_fun_#t~mem8; 6259#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 6258#L557-1 assume !!(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);havoc test_fun_#t~mem8; 6257#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 6256#L557-1 assume !!(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);havoc test_fun_#t~mem8; 6255#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 6254#L557-1 assume !!(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);havoc test_fun_#t~mem8; 6253#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 6252#L557-1 assume !!(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);havoc test_fun_#t~mem8; 6251#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 6250#L557-1 assume !!(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);havoc test_fun_#t~mem8; 6248#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 6249#L557-1 assume !(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6; 6243#L557-4 [2021-11-07 08:34:30,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 08:34:30,954 INFO L85 PathProgramCache]: Analyzing trace with hash -660701093, now seen corresponding path program 17 times [2021-11-07 08:34:30,954 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 08:34:30,954 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1109441261] [2021-11-07 08:34:30,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 08:34:30,955 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 08:34:31,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-07 08:34:31,013 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-07 08:34:31,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-07 08:34:31,050 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-07 08:34:31,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 08:34:31,051 INFO L85 PathProgramCache]: Analyzing trace with hash 1219230161, now seen corresponding path program 16 times [2021-11-07 08:34:31,051 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 08:34:31,051 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [103420987] [2021-11-07 08:34:31,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 08:34:31,052 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 08:34:31,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-07 08:34:31,085 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-07 08:34:31,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-07 08:34:31,116 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-07 08:34:31,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 08:34:31,117 INFO L85 PathProgramCache]: Analyzing trace with hash -1607956041, now seen corresponding path program 18 times [2021-11-07 08:34:31,117 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 08:34:31,117 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [166720633] [2021-11-07 08:34:31,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 08:34:31,117 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 08:34:31,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 08:34:33,164 INFO L134 CoverageAnalysis]: Checked inductivity of 1124 backedges. 264 proven. 860 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 08:34:33,164 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-07 08:34:33,164 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [166720633] [2021-11-07 08:34:33,164 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [166720633] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-07 08:34:33,165 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1469776894] [2021-11-07 08:34:33,165 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2021-11-07 08:34:33,165 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-07 08:34:33,165 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ca00bbe-7802-45cf-8c9a-e5551a18caab/bin/uautomizer-AkOaLMaTGY/z3 [2021-11-07 08:34:33,166 INFO L229 MonitoredProcess]: Starting monitored process 51 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ca00bbe-7802-45cf-8c9a-e5551a18caab/bin/uautomizer-AkOaLMaTGY/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-07 08:34:33,167 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ca00bbe-7802-45cf-8c9a-e5551a18caab/bin/uautomizer-AkOaLMaTGY/z3 -smt2 -in SMTLIB2_COMPLIANT=true (51)] Waiting until timeout for monitored process [2021-11-07 08:34:37,797 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 18 check-sat command(s) [2021-11-07 08:34:37,797 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-07 08:34:37,806 INFO L263 TraceCheckSpWp]: Trace formula consists of 692 conjuncts, 51 conjunts are in the unsatisfiable core [2021-11-07 08:34:37,808 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-07 08:34:37,851 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-11-07 08:34:37,895 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-11-07 08:34:37,941 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-11-07 08:34:37,992 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-11-07 08:34:38,044 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-11-07 08:34:38,096 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-11-07 08:34:38,144 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-11-07 08:34:38,197 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-11-07 08:34:38,247 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-11-07 08:34:38,302 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-11-07 08:34:38,355 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-11-07 08:34:38,409 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-11-07 08:34:38,464 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-11-07 08:34:38,530 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-11-07 08:34:38,605 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-11-07 08:34:38,663 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-11-07 08:34:38,720 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-11-07 08:34:38,923 INFO L354 Elim1Store]: treesize reduction 14, result has 58.8 percent of original size [2021-11-07 08:34:38,924 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 38 treesize of output 37 [2021-11-07 08:34:39,041 INFO L354 Elim1Store]: treesize reduction 12, result has 62.5 percent of original size [2021-11-07 08:34:39,042 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 42 treesize of output 45 [2021-11-07 08:34:39,189 INFO L354 Elim1Store]: treesize reduction 14, result has 58.8 percent of original size [2021-11-07 08:34:39,189 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 35 [2021-11-07 08:34:39,353 INFO L354 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2021-11-07 08:34:39,353 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 45 treesize of output 32 [2021-11-07 08:34:39,471 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 26 [2021-11-07 08:34:39,578 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 26 [2021-11-07 08:34:39,720 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 26 [2021-11-07 08:34:39,832 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 26 [2021-11-07 08:34:39,940 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 26 [2021-11-07 08:34:40,050 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 26 [2021-11-07 08:34:40,161 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 26 [2021-11-07 08:34:40,284 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 26 [2021-11-07 08:34:40,396 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 26 [2021-11-07 08:34:40,513 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 26 [2021-11-07 08:34:40,628 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 26 [2021-11-07 08:34:40,745 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 26 [2021-11-07 08:34:40,863 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 26 [2021-11-07 08:34:40,970 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-11-07 08:34:40,970 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 20 [2021-11-07 08:34:41,036 INFO L134 CoverageAnalysis]: Checked inductivity of 1124 backedges. 99 proven. 1025 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 08:34:41,036 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1469776894] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-07 08:34:41,036 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-11-07 08:34:41,037 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [71, 41] total 110 [2021-11-07 08:34:41,037 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [30217104] [2021-11-07 08:35:07,853 WARN L207 SmtUtils]: Spent 26.81 s on a formula simplification. DAG size of input: 292 DAG size of output: 261 [2021-11-07 08:35:07,938 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-07 08:35:07,939 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 110 interpolants. [2021-11-07 08:35:07,940 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1301, Invalid=10689, Unknown=0, NotChecked=0, Total=11990 [2021-11-07 08:35:07,941 INFO L87 Difference]: Start difference. First operand 75 states and 77 transitions. cyclomatic complexity: 4 Second operand has 110 states, 110 states have (on average 1.3363636363636364) internal successors, (147), 110 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 08:35:11,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 08:35:11,442 INFO L93 Difference]: Finished difference Result 116 states and 119 transitions. [2021-11-07 08:35:11,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2021-11-07 08:35:11,443 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 116 states and 119 transitions. [2021-11-07 08:35:11,444 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 39 [2021-11-07 08:35:11,444 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 116 states to 80 states and 82 transitions. [2021-11-07 08:35:11,444 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 47 [2021-11-07 08:35:11,445 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 47 [2021-11-07 08:35:11,445 INFO L73 IsDeterministic]: Start isDeterministic. Operand 80 states and 82 transitions. [2021-11-07 08:35:11,445 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-11-07 08:35:11,445 INFO L681 BuchiCegarLoop]: Abstraction has 80 states and 82 transitions. [2021-11-07 08:35:11,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states and 82 transitions. [2021-11-07 08:35:11,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 79. [2021-11-07 08:35:11,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 79 states have (on average 1.0253164556962024) internal successors, (81), 78 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 08:35:11,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 81 transitions. [2021-11-07 08:35:11,465 INFO L704 BuchiCegarLoop]: Abstraction has 79 states and 81 transitions. [2021-11-07 08:35:11,465 INFO L587 BuchiCegarLoop]: Abstraction has 79 states and 81 transitions. [2021-11-07 08:35:11,465 INFO L425 BuchiCegarLoop]: ======== Iteration 22============ [2021-11-07 08:35:11,465 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 79 states and 81 transitions. [2021-11-07 08:35:11,466 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 39 [2021-11-07 08:35:11,466 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-11-07 08:35:11,466 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-11-07 08:35:11,467 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [18, 17, 1, 1, 1, 1, 1] [2021-11-07 08:35:11,467 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [18, 17, 1, 1, 1, 1] [2021-11-07 08:35:11,467 INFO L791 eck$LassoCheckResult]: Stem: 6870#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 6871#L-1 havoc main_#res;havoc main_#t~nondet11, main_#t~nondet12, main_#t~ret13;test_fun_#in~i, test_fun_#in~j := main_#t~nondet11, main_#t~nondet12;havoc test_fun_#res;havoc test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset, test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset, test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset, test_fun_#t~mem8, test_fun_#t~mem7, test_fun_#t~mem6, test_fun_#t~mem9, test_fun_#t~mem5, test_fun_#t~mem10, test_fun_~i, test_fun_~j, test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, test_fun_~c~0.base, test_fun_~c~0.offset;test_fun_~i := test_fun_#in~i;test_fun_~j := test_fun_#in~j;call test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.allocOnStack(4);test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset;call test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.allocOnStack(4);test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;call test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset := #Ultimate.allocOnStack(4);test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset;call write~int(test_fun_~i, test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4);call write~int(test_fun_~j, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); 6872#L555-3 call test_fun_#t~mem5 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 6873#L555-1 assume !!(test_fun_#t~mem5 >= 0);havoc test_fun_#t~mem5;call write~int(0, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4); 6880#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 6878#L557-1 assume !!(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);havoc test_fun_#t~mem8; 6874#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 6875#L557-1 assume !!(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);havoc test_fun_#t~mem8; 6876#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 6877#L557-1 assume !!(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);havoc test_fun_#t~mem8; 6879#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 6948#L557-1 assume !!(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);havoc test_fun_#t~mem8; 6947#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 6946#L557-1 assume !!(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);havoc test_fun_#t~mem8; 6945#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 6944#L557-1 assume !!(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);havoc test_fun_#t~mem8; 6943#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 6942#L557-1 assume !!(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);havoc test_fun_#t~mem8; 6941#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 6940#L557-1 assume !!(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);havoc test_fun_#t~mem8; 6939#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 6938#L557-1 assume !!(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);havoc test_fun_#t~mem8; 6937#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 6936#L557-1 assume !!(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);havoc test_fun_#t~mem8; 6935#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 6934#L557-1 assume !!(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);havoc test_fun_#t~mem8; 6933#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 6932#L557-1 assume !!(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);havoc test_fun_#t~mem8; 6931#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 6930#L557-1 assume !!(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);havoc test_fun_#t~mem8; 6929#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 6928#L557-1 assume !!(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);havoc test_fun_#t~mem8; 6927#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 6926#L557-1 assume !!(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);havoc test_fun_#t~mem8; 6925#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 6923#L557-1 assume !!(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);havoc test_fun_#t~mem8; 6921#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 6887#L557-1 assume !!(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);havoc test_fun_#t~mem8; 6886#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 6883#L557-1 assume !(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6; 6881#L557-4 [2021-11-07 08:35:11,468 INFO L793 eck$LassoCheckResult]: Loop: 6881#L557-4 call test_fun_#t~mem9 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4);call write~int(test_fun_#t~mem9 - 1, test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4);havoc test_fun_#t~mem9; 6882#L555-3 call test_fun_#t~mem5 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 6924#L555-1 assume !!(test_fun_#t~mem5 >= 0);havoc test_fun_#t~mem5;call write~int(0, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4); 6922#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 6920#L557-1 assume !!(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);havoc test_fun_#t~mem8; 6919#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 6918#L557-1 assume !!(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);havoc test_fun_#t~mem8; 6917#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 6916#L557-1 assume !!(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);havoc test_fun_#t~mem8; 6915#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 6914#L557-1 assume !!(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);havoc test_fun_#t~mem8; 6913#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 6912#L557-1 assume !!(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);havoc test_fun_#t~mem8; 6911#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 6910#L557-1 assume !!(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);havoc test_fun_#t~mem8; 6909#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 6908#L557-1 assume !!(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);havoc test_fun_#t~mem8; 6907#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 6906#L557-1 assume !!(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);havoc test_fun_#t~mem8; 6905#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 6904#L557-1 assume !!(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);havoc test_fun_#t~mem8; 6903#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 6902#L557-1 assume !!(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);havoc test_fun_#t~mem8; 6901#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 6900#L557-1 assume !!(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);havoc test_fun_#t~mem8; 6899#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 6898#L557-1 assume !!(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);havoc test_fun_#t~mem8; 6897#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 6896#L557-1 assume !!(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);havoc test_fun_#t~mem8; 6895#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 6894#L557-1 assume !!(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);havoc test_fun_#t~mem8; 6893#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 6892#L557-1 assume !!(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);havoc test_fun_#t~mem8; 6891#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 6890#L557-1 assume !!(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);havoc test_fun_#t~mem8; 6889#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 6888#L557-1 assume !!(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);havoc test_fun_#t~mem8; 6884#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 6885#L557-1 assume !(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6; 6881#L557-4 [2021-11-07 08:35:11,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 08:35:11,468 INFO L85 PathProgramCache]: Analyzing trace with hash 721411904, now seen corresponding path program 18 times [2021-11-07 08:35:11,468 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 08:35:11,469 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1860790891] [2021-11-07 08:35:11,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 08:35:11,469 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 08:35:11,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-07 08:35:11,506 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-07 08:35:11,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-07 08:35:11,543 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-07 08:35:11,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 08:35:11,544 INFO L85 PathProgramCache]: Analyzing trace with hash -845884618, now seen corresponding path program 17 times [2021-11-07 08:35:11,544 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 08:35:11,544 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [539543197] [2021-11-07 08:35:11,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 08:35:11,544 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 08:35:11,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-07 08:35:11,579 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-07 08:35:11,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-07 08:35:11,611 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-07 08:35:11,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 08:35:11,612 INFO L85 PathProgramCache]: Analyzing trace with hash -689546473, now seen corresponding path program 19 times [2021-11-07 08:35:11,612 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 08:35:11,613 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [361266517] [2021-11-07 08:35:11,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 08:35:11,613 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 08:35:11,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 08:35:13,925 INFO L134 CoverageAnalysis]: Checked inductivity of 1262 backedges. 297 proven. 965 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 08:35:13,925 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-07 08:35:13,925 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [361266517] [2021-11-07 08:35:13,926 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [361266517] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-07 08:35:13,926 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [662249266] [2021-11-07 08:35:13,926 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2021-11-07 08:35:13,926 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-07 08:35:13,926 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ca00bbe-7802-45cf-8c9a-e5551a18caab/bin/uautomizer-AkOaLMaTGY/z3 [2021-11-07 08:35:13,927 INFO L229 MonitoredProcess]: Starting monitored process 52 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ca00bbe-7802-45cf-8c9a-e5551a18caab/bin/uautomizer-AkOaLMaTGY/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-07 08:35:13,928 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ca00bbe-7802-45cf-8c9a-e5551a18caab/bin/uautomizer-AkOaLMaTGY/z3 -smt2 -in SMTLIB2_COMPLIANT=true (52)] Waiting until timeout for monitored process [2021-11-07 08:35:14,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 08:35:14,878 INFO L263 TraceCheckSpWp]: Trace formula consists of 728 conjuncts, 49 conjunts are in the unsatisfiable core [2021-11-07 08:35:14,880 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-07 08:35:14,890 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2021-11-07 08:35:14,906 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-11-07 08:35:14,951 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-11-07 08:35:14,991 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-11-07 08:35:15,062 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-11-07 08:35:15,116 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-11-07 08:35:15,160 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-11-07 08:35:15,204 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-11-07 08:35:15,250 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-11-07 08:35:15,312 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-11-07 08:35:15,370 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-11-07 08:35:15,429 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-11-07 08:35:15,490 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-11-07 08:35:15,552 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-11-07 08:35:15,615 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-11-07 08:35:15,682 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-11-07 08:35:15,746 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-11-07 08:35:15,811 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-11-07 08:35:15,883 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-11-07 08:35:16,112 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 25 [2021-11-07 08:35:16,208 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2021-11-07 08:35:16,295 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2021-11-07 08:35:16,383 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2021-11-07 08:35:16,484 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2021-11-07 08:35:16,578 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2021-11-07 08:35:16,666 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2021-11-07 08:35:16,756 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2021-11-07 08:35:16,853 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2021-11-07 08:35:16,938 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2021-11-07 08:35:17,012 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2021-11-07 08:35:17,093 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2021-11-07 08:35:17,213 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2021-11-07 08:35:17,321 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2021-11-07 08:35:17,438 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2021-11-07 08:35:17,538 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2021-11-07 08:35:17,627 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2021-11-07 08:35:17,708 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2021-11-07 08:35:17,892 INFO L134 CoverageAnalysis]: Checked inductivity of 1262 backedges. 105 proven. 1157 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 08:35:17,892 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [662249266] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-07 08:35:17,892 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-11-07 08:35:17,892 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [75, 42] total 115 [2021-11-07 08:35:17,893 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1170122959] [2021-11-07 08:36:05,771 WARN L207 SmtUtils]: Spent 47.87 s on a formula simplification. DAG size of input: 307 DAG size of output: 274 [2021-11-07 08:36:05,860 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-07 08:36:05,861 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 115 interpolants. [2021-11-07 08:36:05,862 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1373, Invalid=11737, Unknown=0, NotChecked=0, Total=13110 [2021-11-07 08:36:05,863 INFO L87 Difference]: Start difference. First operand 79 states and 81 transitions. cyclomatic complexity: 4 Second operand has 115 states, 115 states have (on average 1.3478260869565217) internal successors, (155), 115 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 08:36:10,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 08:36:10,406 INFO L93 Difference]: Finished difference Result 122 states and 125 transitions. [2021-11-07 08:36:10,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2021-11-07 08:36:10,406 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 122 states and 125 transitions. [2021-11-07 08:36:10,407 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 41 [2021-11-07 08:36:10,408 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 122 states to 84 states and 86 transitions. [2021-11-07 08:36:10,408 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 49 [2021-11-07 08:36:10,408 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 49 [2021-11-07 08:36:10,408 INFO L73 IsDeterministic]: Start isDeterministic. Operand 84 states and 86 transitions. [2021-11-07 08:36:10,409 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-11-07 08:36:10,409 INFO L681 BuchiCegarLoop]: Abstraction has 84 states and 86 transitions. [2021-11-07 08:36:10,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states and 86 transitions. [2021-11-07 08:36:10,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 83. [2021-11-07 08:36:10,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 83 states have (on average 1.0240963855421688) internal successors, (85), 82 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 08:36:10,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 85 transitions. [2021-11-07 08:36:10,412 INFO L704 BuchiCegarLoop]: Abstraction has 83 states and 85 transitions. [2021-11-07 08:36:10,412 INFO L587 BuchiCegarLoop]: Abstraction has 83 states and 85 transitions. [2021-11-07 08:36:10,412 INFO L425 BuchiCegarLoop]: ======== Iteration 23============ [2021-11-07 08:36:10,412 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 83 states and 85 transitions. [2021-11-07 08:36:10,413 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 41 [2021-11-07 08:36:10,413 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-11-07 08:36:10,413 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-11-07 08:36:10,414 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [19, 18, 1, 1, 1, 1, 1] [2021-11-07 08:36:10,414 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [19, 18, 1, 1, 1, 1] [2021-11-07 08:36:10,414 INFO L791 eck$LassoCheckResult]: Stem: 7567#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 7568#L-1 havoc main_#res;havoc main_#t~nondet11, main_#t~nondet12, main_#t~ret13;test_fun_#in~i, test_fun_#in~j := main_#t~nondet11, main_#t~nondet12;havoc test_fun_#res;havoc test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset, test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset, test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset, test_fun_#t~mem8, test_fun_#t~mem7, test_fun_#t~mem6, test_fun_#t~mem9, test_fun_#t~mem5, test_fun_#t~mem10, test_fun_~i, test_fun_~j, test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, test_fun_~c~0.base, test_fun_~c~0.offset;test_fun_~i := test_fun_#in~i;test_fun_~j := test_fun_#in~j;call test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.allocOnStack(4);test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset;call test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.allocOnStack(4);test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;call test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset := #Ultimate.allocOnStack(4);test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset;call write~int(test_fun_~i, test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4);call write~int(test_fun_~j, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); 7569#L555-3 call test_fun_#t~mem5 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 7570#L555-1 assume !!(test_fun_#t~mem5 >= 0);havoc test_fun_#t~mem5;call write~int(0, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4); 7577#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 7575#L557-1 assume !!(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);havoc test_fun_#t~mem8; 7571#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 7572#L557-1 assume !!(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);havoc test_fun_#t~mem8; 7573#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 7574#L557-1 assume !!(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);havoc test_fun_#t~mem8; 7576#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 7649#L557-1 assume !!(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);havoc test_fun_#t~mem8; 7648#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 7647#L557-1 assume !!(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);havoc test_fun_#t~mem8; 7646#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 7645#L557-1 assume !!(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);havoc test_fun_#t~mem8; 7644#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 7643#L557-1 assume !!(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);havoc test_fun_#t~mem8; 7642#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 7641#L557-1 assume !!(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);havoc test_fun_#t~mem8; 7640#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 7639#L557-1 assume !!(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);havoc test_fun_#t~mem8; 7638#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 7637#L557-1 assume !!(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);havoc test_fun_#t~mem8; 7636#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 7635#L557-1 assume !!(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);havoc test_fun_#t~mem8; 7634#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 7633#L557-1 assume !!(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);havoc test_fun_#t~mem8; 7632#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 7631#L557-1 assume !!(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);havoc test_fun_#t~mem8; 7630#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 7629#L557-1 assume !!(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);havoc test_fun_#t~mem8; 7628#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 7627#L557-1 assume !!(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);havoc test_fun_#t~mem8; 7626#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 7625#L557-1 assume !!(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);havoc test_fun_#t~mem8; 7624#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 7622#L557-1 assume !!(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);havoc test_fun_#t~mem8; 7620#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 7582#L557-1 assume !!(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);havoc test_fun_#t~mem8; 7581#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 7580#L557-1 assume !(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6; 7578#L557-4 [2021-11-07 08:36:10,415 INFO L793 eck$LassoCheckResult]: Loop: 7578#L557-4 call test_fun_#t~mem9 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4);call write~int(test_fun_#t~mem9 - 1, test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4);havoc test_fun_#t~mem9; 7579#L555-3 call test_fun_#t~mem5 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 7623#L555-1 assume !!(test_fun_#t~mem5 >= 0);havoc test_fun_#t~mem5;call write~int(0, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4); 7621#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 7619#L557-1 assume !!(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);havoc test_fun_#t~mem8; 7618#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 7617#L557-1 assume !!(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);havoc test_fun_#t~mem8; 7616#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 7615#L557-1 assume !!(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);havoc test_fun_#t~mem8; 7614#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 7613#L557-1 assume !!(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);havoc test_fun_#t~mem8; 7612#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 7611#L557-1 assume !!(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);havoc test_fun_#t~mem8; 7610#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 7609#L557-1 assume !!(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);havoc test_fun_#t~mem8; 7608#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 7607#L557-1 assume !!(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);havoc test_fun_#t~mem8; 7606#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 7605#L557-1 assume !!(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);havoc test_fun_#t~mem8; 7604#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 7603#L557-1 assume !!(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);havoc test_fun_#t~mem8; 7602#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 7601#L557-1 assume !!(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);havoc test_fun_#t~mem8; 7600#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 7599#L557-1 assume !!(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);havoc test_fun_#t~mem8; 7598#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 7597#L557-1 assume !!(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);havoc test_fun_#t~mem8; 7596#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 7595#L557-1 assume !!(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);havoc test_fun_#t~mem8; 7594#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 7593#L557-1 assume !!(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);havoc test_fun_#t~mem8; 7592#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 7591#L557-1 assume !!(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);havoc test_fun_#t~mem8; 7590#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 7589#L557-1 assume !!(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);havoc test_fun_#t~mem8; 7588#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 7587#L557-1 assume !!(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);havoc test_fun_#t~mem8; 7586#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 7585#L557-1 assume !!(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);havoc test_fun_#t~mem8; 7583#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 7584#L557-1 assume !(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6; 7578#L557-4 [2021-11-07 08:36:10,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 08:36:10,415 INFO L85 PathProgramCache]: Analyzing trace with hash 1787107557, now seen corresponding path program 19 times [2021-11-07 08:36:10,415 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 08:36:10,415 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1733190965] [2021-11-07 08:36:10,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 08:36:10,416 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 08:36:10,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-07 08:36:10,456 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-07 08:36:10,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-07 08:36:10,527 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-07 08:36:10,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 08:36:10,528 INFO L85 PathProgramCache]: Analyzing trace with hash -1146296485, now seen corresponding path program 18 times [2021-11-07 08:36:10,529 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 08:36:10,529 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2082906454] [2021-11-07 08:36:10,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 08:36:10,529 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 08:36:10,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-07 08:36:10,567 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-07 08:36:10,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-07 08:36:10,604 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-07 08:36:10,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 08:36:10,605 INFO L85 PathProgramCache]: Analyzing trace with hash 1038491383, now seen corresponding path program 20 times [2021-11-07 08:36:10,605 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 08:36:10,605 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [330724575] [2021-11-07 08:36:10,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 08:36:10,606 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 08:36:10,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 08:36:13,034 INFO L134 CoverageAnalysis]: Checked inductivity of 1408 backedges. 332 proven. 1076 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 08:36:13,034 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-07 08:36:13,034 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [330724575] [2021-11-07 08:36:13,034 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [330724575] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-07 08:36:13,034 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2144354941] [2021-11-07 08:36:13,034 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-11-07 08:36:13,035 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-07 08:36:13,035 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ca00bbe-7802-45cf-8c9a-e5551a18caab/bin/uautomizer-AkOaLMaTGY/z3 [2021-11-07 08:36:13,036 INFO L229 MonitoredProcess]: Starting monitored process 53 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ca00bbe-7802-45cf-8c9a-e5551a18caab/bin/uautomizer-AkOaLMaTGY/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-07 08:36:13,036 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ca00bbe-7802-45cf-8c9a-e5551a18caab/bin/uautomizer-AkOaLMaTGY/z3 -smt2 -in SMTLIB2_COMPLIANT=true (53)] Waiting until timeout for monitored process [2021-11-07 08:36:14,076 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-11-07 08:36:14,076 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-07 08:36:14,079 INFO L263 TraceCheckSpWp]: Trace formula consists of 764 conjuncts, 51 conjunts are in the unsatisfiable core [2021-11-07 08:36:14,082 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-07 08:36:14,094 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2021-11-07 08:36:14,110 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-11-07 08:36:14,169 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-11-07 08:36:14,215 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-11-07 08:36:14,258 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-11-07 08:36:14,302 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-11-07 08:36:14,347 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-11-07 08:36:14,392 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-11-07 08:36:14,449 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-11-07 08:36:14,496 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-11-07 08:36:14,547 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-11-07 08:36:14,594 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-11-07 08:36:14,649 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-11-07 08:36:14,697 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-11-07 08:36:14,749 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-11-07 08:36:14,801 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-11-07 08:36:14,856 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-11-07 08:36:14,909 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-11-07 08:36:14,964 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-11-07 08:36:15,019 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-11-07 08:36:15,227 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 25 [2021-11-07 08:36:15,321 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2021-11-07 08:36:15,393 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2021-11-07 08:36:15,465 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2021-11-07 08:36:15,537 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2021-11-07 08:36:15,611 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2021-11-07 08:36:15,684 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2021-11-07 08:36:15,761 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2021-11-07 08:36:15,839 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2021-11-07 08:36:15,918 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2021-11-07 08:36:16,030 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2021-11-07 08:36:16,180 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2021-11-07 08:36:16,287 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2021-11-07 08:36:16,396 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2021-11-07 08:36:16,520 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2021-11-07 08:36:16,634 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2021-11-07 08:36:16,762 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2021-11-07 08:36:16,871 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2021-11-07 08:36:16,980 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2021-11-07 08:36:17,192 INFO L134 CoverageAnalysis]: Checked inductivity of 1408 backedges. 111 proven. 1297 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 08:36:17,192 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2144354941] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-07 08:36:17,193 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-11-07 08:36:17,193 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [79, 44] total 121 [2021-11-07 08:36:17,193 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [787867425] [2021-11-07 08:37:17,063 WARN L207 SmtUtils]: Spent 59.87 s on a formula simplification. DAG size of input: 322 DAG size of output: 287 [2021-11-07 08:37:17,157 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-07 08:37:17,158 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 121 interpolants. [2021-11-07 08:37:17,159 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1514, Invalid=13006, Unknown=0, NotChecked=0, Total=14520 [2021-11-07 08:37:17,160 INFO L87 Difference]: Start difference. First operand 83 states and 85 transitions. cyclomatic complexity: 4 Second operand has 121 states, 121 states have (on average 1.3471074380165289) internal successors, (163), 121 states have internal predecessors, (163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 08:37:22,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 08:37:22,420 INFO L93 Difference]: Finished difference Result 128 states and 131 transitions. [2021-11-07 08:37:22,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2021-11-07 08:37:22,420 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 128 states and 131 transitions. [2021-11-07 08:37:22,421 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 43 [2021-11-07 08:37:22,422 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 128 states to 88 states and 90 transitions. [2021-11-07 08:37:22,422 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 51 [2021-11-07 08:37:22,423 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 51 [2021-11-07 08:37:22,423 INFO L73 IsDeterministic]: Start isDeterministic. Operand 88 states and 90 transitions. [2021-11-07 08:37:22,423 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-11-07 08:37:22,423 INFO L681 BuchiCegarLoop]: Abstraction has 88 states and 90 transitions. [2021-11-07 08:37:22,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states and 90 transitions. [2021-11-07 08:37:22,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 87. [2021-11-07 08:37:22,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 87 states have (on average 1.0229885057471264) internal successors, (89), 86 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 08:37:22,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 89 transitions. [2021-11-07 08:37:22,427 INFO L704 BuchiCegarLoop]: Abstraction has 87 states and 89 transitions. [2021-11-07 08:37:22,427 INFO L587 BuchiCegarLoop]: Abstraction has 87 states and 89 transitions. [2021-11-07 08:37:22,427 INFO L425 BuchiCegarLoop]: ======== Iteration 24============ [2021-11-07 08:37:22,427 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 87 states and 89 transitions. [2021-11-07 08:37:22,428 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 43 [2021-11-07 08:37:22,428 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-11-07 08:37:22,428 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-11-07 08:37:22,431 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [20, 19, 1, 1, 1, 1, 1] [2021-11-07 08:37:22,432 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [20, 19, 1, 1, 1, 1] [2021-11-07 08:37:22,432 INFO L791 eck$LassoCheckResult]: Stem: 8300#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 8301#L-1 havoc main_#res;havoc main_#t~nondet11, main_#t~nondet12, main_#t~ret13;test_fun_#in~i, test_fun_#in~j := main_#t~nondet11, main_#t~nondet12;havoc test_fun_#res;havoc test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset, test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset, test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset, test_fun_#t~mem8, test_fun_#t~mem7, test_fun_#t~mem6, test_fun_#t~mem9, test_fun_#t~mem5, test_fun_#t~mem10, test_fun_~i, test_fun_~j, test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, test_fun_~c~0.base, test_fun_~c~0.offset;test_fun_~i := test_fun_#in~i;test_fun_~j := test_fun_#in~j;call test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.allocOnStack(4);test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset;call test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.allocOnStack(4);test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;call test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset := #Ultimate.allocOnStack(4);test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset;call write~int(test_fun_~i, test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4);call write~int(test_fun_~j, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); 8302#L555-3 call test_fun_#t~mem5 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 8303#L555-1 assume !!(test_fun_#t~mem5 >= 0);havoc test_fun_#t~mem5;call write~int(0, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4); 8310#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 8308#L557-1 assume !!(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);havoc test_fun_#t~mem8; 8304#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 8305#L557-1 assume !!(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);havoc test_fun_#t~mem8; 8306#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 8307#L557-1 assume !!(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);havoc test_fun_#t~mem8; 8309#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 8386#L557-1 assume !!(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);havoc test_fun_#t~mem8; 8385#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 8384#L557-1 assume !!(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);havoc test_fun_#t~mem8; 8383#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 8382#L557-1 assume !!(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);havoc test_fun_#t~mem8; 8381#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 8380#L557-1 assume !!(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);havoc test_fun_#t~mem8; 8379#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 8378#L557-1 assume !!(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);havoc test_fun_#t~mem8; 8377#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 8376#L557-1 assume !!(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);havoc test_fun_#t~mem8; 8375#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 8374#L557-1 assume !!(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);havoc test_fun_#t~mem8; 8373#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 8372#L557-1 assume !!(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);havoc test_fun_#t~mem8; 8371#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 8370#L557-1 assume !!(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);havoc test_fun_#t~mem8; 8369#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 8368#L557-1 assume !!(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);havoc test_fun_#t~mem8; 8367#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 8366#L557-1 assume !!(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);havoc test_fun_#t~mem8; 8365#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 8364#L557-1 assume !!(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);havoc test_fun_#t~mem8; 8363#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 8362#L557-1 assume !!(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);havoc test_fun_#t~mem8; 8361#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 8360#L557-1 assume !!(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);havoc test_fun_#t~mem8; 8359#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 8357#L557-1 assume !!(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);havoc test_fun_#t~mem8; 8355#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 8317#L557-1 assume !!(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);havoc test_fun_#t~mem8; 8316#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 8313#L557-1 assume !(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6; 8311#L557-4 [2021-11-07 08:37:22,432 INFO L793 eck$LassoCheckResult]: Loop: 8311#L557-4 call test_fun_#t~mem9 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4);call write~int(test_fun_#t~mem9 - 1, test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4);havoc test_fun_#t~mem9; 8312#L555-3 call test_fun_#t~mem5 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 8358#L555-1 assume !!(test_fun_#t~mem5 >= 0);havoc test_fun_#t~mem5;call write~int(0, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4); 8356#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 8354#L557-1 assume !!(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);havoc test_fun_#t~mem8; 8353#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 8352#L557-1 assume !!(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);havoc test_fun_#t~mem8; 8351#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 8350#L557-1 assume !!(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);havoc test_fun_#t~mem8; 8349#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 8348#L557-1 assume !!(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);havoc test_fun_#t~mem8; 8347#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 8346#L557-1 assume !!(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);havoc test_fun_#t~mem8; 8345#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 8344#L557-1 assume !!(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);havoc test_fun_#t~mem8; 8343#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 8342#L557-1 assume !!(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);havoc test_fun_#t~mem8; 8341#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 8340#L557-1 assume !!(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);havoc test_fun_#t~mem8; 8339#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 8338#L557-1 assume !!(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);havoc test_fun_#t~mem8; 8337#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 8336#L557-1 assume !!(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);havoc test_fun_#t~mem8; 8335#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 8334#L557-1 assume !!(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);havoc test_fun_#t~mem8; 8333#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 8332#L557-1 assume !!(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);havoc test_fun_#t~mem8; 8331#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 8330#L557-1 assume !!(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);havoc test_fun_#t~mem8; 8329#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 8328#L557-1 assume !!(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);havoc test_fun_#t~mem8; 8327#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 8326#L557-1 assume !!(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);havoc test_fun_#t~mem8; 8325#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 8324#L557-1 assume !!(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);havoc test_fun_#t~mem8; 8323#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 8322#L557-1 assume !!(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);havoc test_fun_#t~mem8; 8321#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 8320#L557-1 assume !!(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);havoc test_fun_#t~mem8; 8319#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 8318#L557-1 assume !!(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);havoc test_fun_#t~mem8; 8314#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 8315#L557-1 assume !(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6; 8311#L557-4 [2021-11-07 08:37:22,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 08:37:22,432 INFO L85 PathProgramCache]: Analyzing trace with hash -576553654, now seen corresponding path program 20 times [2021-11-07 08:37:22,433 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 08:37:22,433 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [748535287] [2021-11-07 08:37:22,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 08:37:22,433 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 08:37:22,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-07 08:37:22,552 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-07 08:37:22,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-07 08:37:22,646 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-07 08:37:22,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 08:37:22,647 INFO L85 PathProgramCache]: Analyzing trace with hash -2079291840, now seen corresponding path program 19 times [2021-11-07 08:37:22,647 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 08:37:22,647 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1764708521] [2021-11-07 08:37:22,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 08:37:22,647 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 08:37:22,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-07 08:37:22,801 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-07 08:37:22,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-07 08:37:22,893 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-07 08:37:22,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 08:37:22,893 INFO L85 PathProgramCache]: Analyzing trace with hash 973862231, now seen corresponding path program 21 times [2021-11-07 08:37:22,894 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 08:37:22,894 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1099802860] [2021-11-07 08:37:22,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 08:37:22,894 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 08:37:23,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 08:37:26,132 INFO L134 CoverageAnalysis]: Checked inductivity of 1562 backedges. 369 proven. 1193 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 08:37:26,132 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-07 08:37:26,133 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1099802860] [2021-11-07 08:37:26,133 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1099802860] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-07 08:37:26,133 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1099365564] [2021-11-07 08:37:26,133 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-07 08:37:26,133 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-07 08:37:26,133 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ca00bbe-7802-45cf-8c9a-e5551a18caab/bin/uautomizer-AkOaLMaTGY/z3 [2021-11-07 08:37:26,155 INFO L229 MonitoredProcess]: Starting monitored process 54 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ca00bbe-7802-45cf-8c9a-e5551a18caab/bin/uautomizer-AkOaLMaTGY/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-07 08:37:26,156 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ca00bbe-7802-45cf-8c9a-e5551a18caab/bin/uautomizer-AkOaLMaTGY/z3 -smt2 -in SMTLIB2_COMPLIANT=true (54)] Waiting until timeout for monitored process [2021-11-07 08:37:31,151 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 21 check-sat command(s) [2021-11-07 08:37:31,152 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-07 08:37:31,170 INFO L263 TraceCheckSpWp]: Trace formula consists of 800 conjuncts, 52 conjunts are in the unsatisfiable core [2021-11-07 08:37:31,173 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-07 08:37:31,182 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2021-11-07 08:37:31,202 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-11-07 08:37:31,274 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-11-07 08:37:31,347 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-11-07 08:37:31,420 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-11-07 08:37:31,494 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-11-07 08:37:31,568 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-11-07 08:37:31,634 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-11-07 08:37:31,690 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-11-07 08:37:31,750 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-11-07 08:37:31,812 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-11-07 08:37:31,872 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-11-07 08:37:31,933 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-11-07 08:37:31,998 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-11-07 08:37:32,085 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-11-07 08:37:32,155 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-11-07 08:37:32,238 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-11-07 08:37:32,301 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-11-07 08:37:32,362 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-11-07 08:37:32,428 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-11-07 08:37:32,497 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-11-07 08:37:32,716 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 25 [2021-11-07 08:37:32,811 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2021-11-07 08:37:32,898 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2021-11-07 08:37:32,982 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2021-11-07 08:37:33,066 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2021-11-07 08:37:33,163 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2021-11-07 08:37:33,259 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2021-11-07 08:37:33,352 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2021-11-07 08:37:33,443 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2021-11-07 08:37:33,540 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2021-11-07 08:37:33,640 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2021-11-07 08:37:33,732 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2021-11-07 08:37:33,824 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2021-11-07 08:37:33,927 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2021-11-07 08:37:34,032 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2021-11-07 08:37:34,136 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2021-11-07 08:37:34,245 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2021-11-07 08:37:34,364 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2021-11-07 08:37:34,469 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2021-11-07 08:37:34,577 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2021-11-07 08:37:34,682 INFO L354 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2021-11-07 08:37:34,682 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 17 [2021-11-07 08:37:34,751 INFO L134 CoverageAnalysis]: Checked inductivity of 1562 backedges. 117 proven. 1445 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 08:37:34,752 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1099365564] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-07 08:37:34,752 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-11-07 08:37:34,752 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [83, 46] total 127 [2021-11-07 08:37:34,752 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2065283195] [2021-11-07 08:38:38,876 WARN L207 SmtUtils]: Spent 1.07 m on a formula simplification. DAG size of input: 337 DAG size of output: 300 [2021-11-07 08:38:38,969 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-07 08:38:38,970 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 127 interpolants. [2021-11-07 08:38:38,975 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1662, Invalid=14340, Unknown=0, NotChecked=0, Total=16002 [2021-11-07 08:38:38,976 INFO L87 Difference]: Start difference. First operand 87 states and 89 transitions. cyclomatic complexity: 4 Second operand has 127 states, 127 states have (on average 1.3464566929133859) internal successors, (171), 127 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 08:38:44,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 08:38:44,403 INFO L93 Difference]: Finished difference Result 134 states and 137 transitions. [2021-11-07 08:38:44,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2021-11-07 08:38:44,403 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 134 states and 137 transitions. [2021-11-07 08:38:44,405 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 45 [2021-11-07 08:38:44,406 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 134 states to 92 states and 94 transitions. [2021-11-07 08:38:44,406 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 53 [2021-11-07 08:38:44,406 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 53 [2021-11-07 08:38:44,406 INFO L73 IsDeterministic]: Start isDeterministic. Operand 92 states and 94 transitions. [2021-11-07 08:38:44,407 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-11-07 08:38:44,407 INFO L681 BuchiCegarLoop]: Abstraction has 92 states and 94 transitions. [2021-11-07 08:38:44,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states and 94 transitions. [2021-11-07 08:38:44,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 91. [2021-11-07 08:38:44,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 91 states have (on average 1.021978021978022) internal successors, (93), 90 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 08:38:44,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 93 transitions. [2021-11-07 08:38:44,410 INFO L704 BuchiCegarLoop]: Abstraction has 91 states and 93 transitions. [2021-11-07 08:38:44,410 INFO L587 BuchiCegarLoop]: Abstraction has 91 states and 93 transitions. [2021-11-07 08:38:44,410 INFO L425 BuchiCegarLoop]: ======== Iteration 25============ [2021-11-07 08:38:44,411 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 91 states and 93 transitions. [2021-11-07 08:38:44,411 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 45 [2021-11-07 08:38:44,411 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-11-07 08:38:44,411 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-11-07 08:38:44,412 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [21, 20, 1, 1, 1, 1, 1] [2021-11-07 08:38:44,413 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [21, 20, 1, 1, 1, 1] [2021-11-07 08:38:44,413 INFO L791 eck$LassoCheckResult]: Stem: 9069#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 9070#L-1 havoc main_#res;havoc main_#t~nondet11, main_#t~nondet12, main_#t~ret13;test_fun_#in~i, test_fun_#in~j := main_#t~nondet11, main_#t~nondet12;havoc test_fun_#res;havoc test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset, test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset, test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset, test_fun_#t~mem8, test_fun_#t~mem7, test_fun_#t~mem6, test_fun_#t~mem9, test_fun_#t~mem5, test_fun_#t~mem10, test_fun_~i, test_fun_~j, test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, test_fun_~c~0.base, test_fun_~c~0.offset;test_fun_~i := test_fun_#in~i;test_fun_~j := test_fun_#in~j;call test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.allocOnStack(4);test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset;call test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.allocOnStack(4);test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;call test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset := #Ultimate.allocOnStack(4);test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset;call write~int(test_fun_~i, test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4);call write~int(test_fun_~j, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); 9071#L555-3 call test_fun_#t~mem5 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 9072#L555-1 assume !!(test_fun_#t~mem5 >= 0);havoc test_fun_#t~mem5;call write~int(0, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4); 9079#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 9077#L557-1 assume !!(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);havoc test_fun_#t~mem8; 9073#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 9074#L557-1 assume !!(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);havoc test_fun_#t~mem8; 9075#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 9076#L557-1 assume !!(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);havoc test_fun_#t~mem8; 9078#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 9159#L557-1 assume !!(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);havoc test_fun_#t~mem8; 9158#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 9157#L557-1 assume !!(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);havoc test_fun_#t~mem8; 9156#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 9155#L557-1 assume !!(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);havoc test_fun_#t~mem8; 9154#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 9153#L557-1 assume !!(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);havoc test_fun_#t~mem8; 9152#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 9151#L557-1 assume !!(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);havoc test_fun_#t~mem8; 9150#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 9149#L557-1 assume !!(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);havoc test_fun_#t~mem8; 9148#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 9147#L557-1 assume !!(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);havoc test_fun_#t~mem8; 9146#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 9145#L557-1 assume !!(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);havoc test_fun_#t~mem8; 9144#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 9143#L557-1 assume !!(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);havoc test_fun_#t~mem8; 9142#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 9141#L557-1 assume !!(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);havoc test_fun_#t~mem8; 9140#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 9139#L557-1 assume !!(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);havoc test_fun_#t~mem8; 9138#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 9137#L557-1 assume !!(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);havoc test_fun_#t~mem8; 9136#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 9135#L557-1 assume !!(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);havoc test_fun_#t~mem8; 9134#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 9133#L557-1 assume !!(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);havoc test_fun_#t~mem8; 9132#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 9131#L557-1 assume !!(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);havoc test_fun_#t~mem8; 9130#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 9128#L557-1 assume !!(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);havoc test_fun_#t~mem8; 9126#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 9084#L557-1 assume !!(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);havoc test_fun_#t~mem8; 9083#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 9082#L557-1 assume !(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6; 9080#L557-4 [2021-11-07 08:38:44,413 INFO L793 eck$LassoCheckResult]: Loop: 9080#L557-4 call test_fun_#t~mem9 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4);call write~int(test_fun_#t~mem9 - 1, test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4);havoc test_fun_#t~mem9; 9081#L555-3 call test_fun_#t~mem5 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 9129#L555-1 assume !!(test_fun_#t~mem5 >= 0);havoc test_fun_#t~mem5;call write~int(0, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4); 9127#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 9125#L557-1 assume !!(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);havoc test_fun_#t~mem8; 9124#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 9123#L557-1 assume !!(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);havoc test_fun_#t~mem8; 9122#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 9121#L557-1 assume !!(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);havoc test_fun_#t~mem8; 9120#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 9119#L557-1 assume !!(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);havoc test_fun_#t~mem8; 9118#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 9117#L557-1 assume !!(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);havoc test_fun_#t~mem8; 9116#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 9115#L557-1 assume !!(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);havoc test_fun_#t~mem8; 9114#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 9113#L557-1 assume !!(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);havoc test_fun_#t~mem8; 9112#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 9111#L557-1 assume !!(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);havoc test_fun_#t~mem8; 9110#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 9109#L557-1 assume !!(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);havoc test_fun_#t~mem8; 9108#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 9107#L557-1 assume !!(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);havoc test_fun_#t~mem8; 9106#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 9105#L557-1 assume !!(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);havoc test_fun_#t~mem8; 9104#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 9103#L557-1 assume !!(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);havoc test_fun_#t~mem8; 9102#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 9101#L557-1 assume !!(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);havoc test_fun_#t~mem8; 9100#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 9099#L557-1 assume !!(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);havoc test_fun_#t~mem8; 9098#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 9097#L557-1 assume !!(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);havoc test_fun_#t~mem8; 9096#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 9095#L557-1 assume !!(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);havoc test_fun_#t~mem8; 9094#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 9093#L557-1 assume !!(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);havoc test_fun_#t~mem8; 9092#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 9091#L557-1 assume !!(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);havoc test_fun_#t~mem8; 9090#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 9089#L557-1 assume !!(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);havoc test_fun_#t~mem8; 9088#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 9087#L557-1 assume !!(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);havoc test_fun_#t~mem8; 9085#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 9086#L557-1 assume !(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6; 9080#L557-4 [2021-11-07 08:38:44,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 08:38:44,414 INFO L85 PathProgramCache]: Analyzing trace with hash -17277841, now seen corresponding path program 21 times [2021-11-07 08:38:44,414 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 08:38:44,414 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [395660988] [2021-11-07 08:38:44,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 08:38:44,415 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 08:38:44,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-07 08:38:44,472 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-07 08:38:44,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-07 08:38:44,521 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-07 08:38:44,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 08:38:44,522 INFO L85 PathProgramCache]: Analyzing trace with hash -1039663131, now seen corresponding path program 20 times [2021-11-07 08:38:44,522 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 08:38:44,522 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1270677104] [2021-11-07 08:38:44,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 08:38:44,522 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 08:38:44,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-07 08:38:44,570 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-07 08:38:44,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-07 08:38:44,619 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-07 08:38:44,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 08:38:44,620 INFO L85 PathProgramCache]: Analyzing trace with hash 1582562871, now seen corresponding path program 22 times [2021-11-07 08:38:44,620 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 08:38:44,620 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [747669152] [2021-11-07 08:38:44,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 08:38:44,620 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 08:38:44,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 08:38:48,016 INFO L134 CoverageAnalysis]: Checked inductivity of 1724 backedges. 408 proven. 1316 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 08:38:48,016 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-07 08:38:48,016 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [747669152] [2021-11-07 08:38:48,017 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [747669152] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-07 08:38:48,017 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [107783242] [2021-11-07 08:38:48,017 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-11-07 08:38:48,017 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-07 08:38:48,017 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ca00bbe-7802-45cf-8c9a-e5551a18caab/bin/uautomizer-AkOaLMaTGY/z3 [2021-11-07 08:38:48,022 INFO L229 MonitoredProcess]: Starting monitored process 55 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ca00bbe-7802-45cf-8c9a-e5551a18caab/bin/uautomizer-AkOaLMaTGY/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-07 08:38:48,054 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ca00bbe-7802-45cf-8c9a-e5551a18caab/bin/uautomizer-AkOaLMaTGY/z3 -smt2 -in SMTLIB2_COMPLIANT=true (55)] Waiting until timeout for monitored process [2021-11-07 08:38:49,825 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-11-07 08:38:49,825 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-07 08:38:49,829 INFO L263 TraceCheckSpWp]: Trace formula consists of 836 conjuncts, 55 conjunts are in the unsatisfiable core [2021-11-07 08:38:49,831 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-07 08:38:49,837 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2021-11-07 08:38:49,853 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-11-07 08:38:49,907 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-11-07 08:38:49,961 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-11-07 08:38:50,017 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-11-07 08:38:50,076 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-11-07 08:38:50,133 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-11-07 08:38:50,191 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-11-07 08:38:50,248 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-11-07 08:38:50,308 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-11-07 08:38:50,370 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-11-07 08:38:50,435 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-11-07 08:38:50,516 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-11-07 08:38:50,583 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-11-07 08:38:50,649 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-11-07 08:38:50,714 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-11-07 08:38:50,782 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-11-07 08:38:50,849 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-11-07 08:38:50,930 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-11-07 08:38:51,016 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-11-07 08:38:51,103 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-11-07 08:38:51,177 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-11-07 08:38:51,417 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 25 [2021-11-07 08:38:51,525 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2021-11-07 08:38:51,615 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2021-11-07 08:38:51,707 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2021-11-07 08:38:51,800 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2021-11-07 08:38:51,895 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2021-11-07 08:38:51,993 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2021-11-07 08:38:52,102 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2021-11-07 08:38:52,204 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2021-11-07 08:38:52,301 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2021-11-07 08:38:52,389 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2021-11-07 08:38:52,494 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2021-11-07 08:38:52,598 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2021-11-07 08:38:52,707 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2021-11-07 08:38:52,815 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2021-11-07 08:38:52,916 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2021-11-07 08:38:53,038 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2021-11-07 08:38:53,136 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2021-11-07 08:38:53,245 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2021-11-07 08:38:53,360 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2021-11-07 08:38:53,474 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2021-11-07 08:38:53,692 INFO L134 CoverageAnalysis]: Checked inductivity of 1724 backedges. 123 proven. 1601 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 08:38:53,692 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [107783242] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-07 08:38:53,692 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-11-07 08:38:53,692 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [87, 48] total 133 [2021-11-07 08:38:53,692 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1836926189] [2021-11-07 08:40:13,372 WARN L207 SmtUtils]: Spent 1.33 m on a formula simplification. DAG size of input: 352 DAG size of output: 313 [2021-11-07 08:40:13,493 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-07 08:40:13,493 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 133 interpolants. [2021-11-07 08:40:13,494 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1817, Invalid=15739, Unknown=0, NotChecked=0, Total=17556 [2021-11-07 08:40:13,494 INFO L87 Difference]: Start difference. First operand 91 states and 93 transitions. cyclomatic complexity: 4 Second operand has 133 states, 133 states have (on average 1.3458646616541354) internal successors, (179), 133 states have internal predecessors, (179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 08:40:20,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 08:40:20,258 INFO L93 Difference]: Finished difference Result 140 states and 143 transitions. [2021-11-07 08:40:20,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2021-11-07 08:40:20,258 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 140 states and 143 transitions. [2021-11-07 08:40:20,260 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 47 [2021-11-07 08:40:20,261 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 140 states to 96 states and 98 transitions. [2021-11-07 08:40:20,261 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 55 [2021-11-07 08:40:20,261 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 55 [2021-11-07 08:40:20,261 INFO L73 IsDeterministic]: Start isDeterministic. Operand 96 states and 98 transitions. [2021-11-07 08:40:20,262 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-11-07 08:40:20,262 INFO L681 BuchiCegarLoop]: Abstraction has 96 states and 98 transitions. [2021-11-07 08:40:20,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states and 98 transitions. [2021-11-07 08:40:20,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 95. [2021-11-07 08:40:20,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 95 states have (on average 1.0210526315789474) internal successors, (97), 94 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 08:40:20,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 97 transitions. [2021-11-07 08:40:20,265 INFO L704 BuchiCegarLoop]: Abstraction has 95 states and 97 transitions. [2021-11-07 08:40:20,265 INFO L587 BuchiCegarLoop]: Abstraction has 95 states and 97 transitions. [2021-11-07 08:40:20,265 INFO L425 BuchiCegarLoop]: ======== Iteration 26============ [2021-11-07 08:40:20,265 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 95 states and 97 transitions. [2021-11-07 08:40:20,266 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 47 [2021-11-07 08:40:20,266 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-11-07 08:40:20,266 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-11-07 08:40:20,267 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [22, 21, 1, 1, 1, 1, 1] [2021-11-07 08:40:20,268 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [22, 21, 1, 1, 1, 1] [2021-11-07 08:40:20,268 INFO L791 eck$LassoCheckResult]: Stem: 9874#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 9875#L-1 havoc main_#res;havoc main_#t~nondet11, main_#t~nondet12, main_#t~ret13;test_fun_#in~i, test_fun_#in~j := main_#t~nondet11, main_#t~nondet12;havoc test_fun_#res;havoc test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset, test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset, test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset, test_fun_#t~mem8, test_fun_#t~mem7, test_fun_#t~mem6, test_fun_#t~mem9, test_fun_#t~mem5, test_fun_#t~mem10, test_fun_~i, test_fun_~j, test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, test_fun_~c~0.base, test_fun_~c~0.offset;test_fun_~i := test_fun_#in~i;test_fun_~j := test_fun_#in~j;call test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.allocOnStack(4);test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset;call test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.allocOnStack(4);test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;call test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset := #Ultimate.allocOnStack(4);test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset;call write~int(test_fun_~i, test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4);call write~int(test_fun_~j, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); 9876#L555-3 call test_fun_#t~mem5 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 9877#L555-1 assume !!(test_fun_#t~mem5 >= 0);havoc test_fun_#t~mem5;call write~int(0, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4); 9884#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 9882#L557-1 assume !!(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);havoc test_fun_#t~mem8; 9878#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 9879#L557-1 assume !!(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);havoc test_fun_#t~mem8; 9880#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 9881#L557-1 assume !!(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);havoc test_fun_#t~mem8; 9883#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 9968#L557-1 assume !!(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);havoc test_fun_#t~mem8; 9967#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 9966#L557-1 assume !!(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);havoc test_fun_#t~mem8; 9965#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 9964#L557-1 assume !!(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);havoc test_fun_#t~mem8; 9963#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 9962#L557-1 assume !!(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);havoc test_fun_#t~mem8; 9961#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 9960#L557-1 assume !!(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);havoc test_fun_#t~mem8; 9959#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 9958#L557-1 assume !!(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);havoc test_fun_#t~mem8; 9957#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 9956#L557-1 assume !!(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);havoc test_fun_#t~mem8; 9955#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 9954#L557-1 assume !!(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);havoc test_fun_#t~mem8; 9953#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 9952#L557-1 assume !!(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);havoc test_fun_#t~mem8; 9951#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 9950#L557-1 assume !!(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);havoc test_fun_#t~mem8; 9949#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 9948#L557-1 assume !!(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);havoc test_fun_#t~mem8; 9947#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 9946#L557-1 assume !!(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);havoc test_fun_#t~mem8; 9945#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 9944#L557-1 assume !!(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);havoc test_fun_#t~mem8; 9943#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 9942#L557-1 assume !!(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);havoc test_fun_#t~mem8; 9941#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 9940#L557-1 assume !!(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);havoc test_fun_#t~mem8; 9939#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 9938#L557-1 assume !!(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);havoc test_fun_#t~mem8; 9937#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 9935#L557-1 assume !!(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);havoc test_fun_#t~mem8; 9933#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 9891#L557-1 assume !!(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);havoc test_fun_#t~mem8; 9890#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 9887#L557-1 assume !(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6; 9885#L557-4 [2021-11-07 08:40:20,268 INFO L793 eck$LassoCheckResult]: Loop: 9885#L557-4 call test_fun_#t~mem9 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4);call write~int(test_fun_#t~mem9 - 1, test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4);havoc test_fun_#t~mem9; 9886#L555-3 call test_fun_#t~mem5 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 9936#L555-1 assume !!(test_fun_#t~mem5 >= 0);havoc test_fun_#t~mem5;call write~int(0, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4); 9934#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 9932#L557-1 assume !!(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);havoc test_fun_#t~mem8; 9931#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 9930#L557-1 assume !!(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);havoc test_fun_#t~mem8; 9929#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 9928#L557-1 assume !!(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);havoc test_fun_#t~mem8; 9927#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 9926#L557-1 assume !!(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);havoc test_fun_#t~mem8; 9925#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 9924#L557-1 assume !!(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);havoc test_fun_#t~mem8; 9923#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 9922#L557-1 assume !!(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);havoc test_fun_#t~mem8; 9921#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 9920#L557-1 assume !!(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);havoc test_fun_#t~mem8; 9919#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 9918#L557-1 assume !!(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);havoc test_fun_#t~mem8; 9917#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 9916#L557-1 assume !!(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);havoc test_fun_#t~mem8; 9915#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 9914#L557-1 assume !!(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);havoc test_fun_#t~mem8; 9913#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 9912#L557-1 assume !!(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);havoc test_fun_#t~mem8; 9911#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 9910#L557-1 assume !!(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);havoc test_fun_#t~mem8; 9909#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 9908#L557-1 assume !!(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);havoc test_fun_#t~mem8; 9907#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 9906#L557-1 assume !!(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);havoc test_fun_#t~mem8; 9905#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 9904#L557-1 assume !!(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);havoc test_fun_#t~mem8; 9903#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 9902#L557-1 assume !!(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);havoc test_fun_#t~mem8; 9901#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 9900#L557-1 assume !!(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);havoc test_fun_#t~mem8; 9899#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 9898#L557-1 assume !!(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);havoc test_fun_#t~mem8; 9897#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 9896#L557-1 assume !!(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);havoc test_fun_#t~mem8; 9895#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 9894#L557-1 assume !!(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);havoc test_fun_#t~mem8; 9893#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 9892#L557-1 assume !!(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);havoc test_fun_#t~mem8; 9888#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 9889#L557-1 assume !(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6; 9885#L557-4 [2021-11-07 08:40:20,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 08:40:20,269 INFO L85 PathProgramCache]: Analyzing trace with hash 575866452, now seen corresponding path program 22 times [2021-11-07 08:40:20,269 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 08:40:20,269 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1333643742] [2021-11-07 08:40:20,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 08:40:20,270 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 08:40:20,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-07 08:40:20,328 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-07 08:40:20,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-07 08:40:20,385 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-07 08:40:20,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 08:40:20,386 INFO L85 PathProgramCache]: Analyzing trace with hash 1611113546, now seen corresponding path program 21 times [2021-11-07 08:40:20,386 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 08:40:20,386 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1433466446] [2021-11-07 08:40:20,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 08:40:20,387 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 08:40:20,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-07 08:40:20,578 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-07 08:40:20,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-07 08:40:20,702 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-07 08:40:20,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 08:40:20,703 INFO L85 PathProgramCache]: Analyzing trace with hash -170763881, now seen corresponding path program 23 times [2021-11-07 08:40:20,703 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 08:40:20,703 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1023918572] [2021-11-07 08:40:20,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 08:40:20,704 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 08:40:20,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 08:40:24,261 INFO L134 CoverageAnalysis]: Checked inductivity of 1894 backedges. 449 proven. 1445 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 08:40:24,261 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-07 08:40:24,261 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1023918572] [2021-11-07 08:40:24,262 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1023918572] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-07 08:40:24,262 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [715189168] [2021-11-07 08:40:24,262 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2021-11-07 08:40:24,262 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-07 08:40:24,262 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ca00bbe-7802-45cf-8c9a-e5551a18caab/bin/uautomizer-AkOaLMaTGY/z3 [2021-11-07 08:40:24,264 INFO L229 MonitoredProcess]: Starting monitored process 56 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ca00bbe-7802-45cf-8c9a-e5551a18caab/bin/uautomizer-AkOaLMaTGY/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-07 08:40:24,265 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ca00bbe-7802-45cf-8c9a-e5551a18caab/bin/uautomizer-AkOaLMaTGY/z3 -smt2 -in SMTLIB2_COMPLIANT=true (56)] Waiting until timeout for monitored process [2021-11-07 08:40:30,424 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 23 check-sat command(s) [2021-11-07 08:40:30,424 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-07 08:40:30,437 INFO L263 TraceCheckSpWp]: Trace formula consists of 872 conjuncts, 62 conjunts are in the unsatisfiable core [2021-11-07 08:40:30,440 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-07 08:40:30,517 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-11-07 08:40:30,606 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-11-07 08:40:30,706 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-11-07 08:40:30,788 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-11-07 08:40:30,873 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-11-07 08:40:30,952 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-11-07 08:40:31,026 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-11-07 08:40:31,087 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-11-07 08:40:31,154 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-11-07 08:40:31,219 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-11-07 08:40:31,300 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-11-07 08:40:31,447 INFO L354 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2021-11-07 08:40:31,447 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 38 treesize of output 29 [2021-11-07 08:40:31,553 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 23 [2021-11-07 08:40:31,664 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2021-11-07 08:40:31,772 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2021-11-07 08:40:31,879 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2021-11-07 08:40:31,995 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2021-11-07 08:40:32,099 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2021-11-07 08:40:32,206 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2021-11-07 08:40:32,314 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2021-11-07 08:40:32,436 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2021-11-07 08:40:32,547 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2021-11-07 08:40:32,876 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 28 [2021-11-07 08:40:33,024 INFO L354 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2021-11-07 08:40:33,025 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 33 treesize of output 24 [2021-11-07 08:40:33,160 INFO L354 Elim1Store]: treesize reduction 27, result has 20.6 percent of original size [2021-11-07 08:40:33,160 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 39 treesize of output 26 [2021-11-07 08:40:33,306 INFO L354 Elim1Store]: treesize reduction 27, result has 20.6 percent of original size [2021-11-07 08:40:33,306 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 39 treesize of output 26 [2021-11-07 08:40:33,449 INFO L354 Elim1Store]: treesize reduction 27, result has 20.6 percent of original size [2021-11-07 08:40:33,449 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 39 treesize of output 26 [2021-11-07 08:40:33,596 INFO L354 Elim1Store]: treesize reduction 27, result has 20.6 percent of original size [2021-11-07 08:40:33,596 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 39 treesize of output 26 [2021-11-07 08:40:33,740 INFO L354 Elim1Store]: treesize reduction 27, result has 20.6 percent of original size [2021-11-07 08:40:33,740 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 39 treesize of output 26 [2021-11-07 08:40:33,880 INFO L354 Elim1Store]: treesize reduction 27, result has 20.6 percent of original size [2021-11-07 08:40:33,881 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 39 treesize of output 26 [2021-11-07 08:40:34,043 INFO L354 Elim1Store]: treesize reduction 27, result has 20.6 percent of original size [2021-11-07 08:40:34,043 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 39 treesize of output 26 [2021-11-07 08:40:34,198 INFO L354 Elim1Store]: treesize reduction 27, result has 20.6 percent of original size [2021-11-07 08:40:34,198 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 39 treesize of output 26 [2021-11-07 08:40:34,350 INFO L354 Elim1Store]: treesize reduction 27, result has 20.6 percent of original size [2021-11-07 08:40:34,350 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 39 treesize of output 26 [2021-11-07 08:40:34,499 INFO L354 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2021-11-07 08:40:34,500 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 39 treesize of output 30 [2021-11-07 08:40:34,720 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 26 [2021-11-07 08:40:34,934 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 26 [2021-11-07 08:40:35,133 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 26 [2021-11-07 08:40:35,344 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 26 [2021-11-07 08:40:35,589 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 26 [2021-11-07 08:40:35,798 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 26 [2021-11-07 08:40:36,023 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 26 [2021-11-07 08:40:36,217 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 26 [2021-11-07 08:40:36,418 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 26 [2021-11-07 08:40:36,584 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 26 [2021-11-07 08:40:36,881 INFO L134 CoverageAnalysis]: Checked inductivity of 1894 backedges. 109 proven. 1785 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 08:40:36,881 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [715189168] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-07 08:40:36,881 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-11-07 08:40:36,881 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [91, 51] total 140 [2021-11-07 08:40:36,881 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [324961840] [2021-11-07 08:42:17,891 WARN L207 SmtUtils]: Spent 1.68 m on a formula simplification. DAG size of input: 367 DAG size of output: 326 [2021-11-07 08:42:17,995 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-07 08:42:17,995 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 140 interpolants. [2021-11-07 08:42:17,996 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=2282, Invalid=17178, Unknown=0, NotChecked=0, Total=19460 [2021-11-07 08:42:17,997 INFO L87 Difference]: Start difference. First operand 95 states and 97 transitions. cyclomatic complexity: 4 Second operand has 140 states, 140 states have (on average 1.3357142857142856) internal successors, (187), 140 states have internal predecessors, (187), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 08:42:24,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 08:42:24,860 INFO L93 Difference]: Finished difference Result 146 states and 149 transitions. [2021-11-07 08:42:24,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2021-11-07 08:42:24,860 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 146 states and 149 transitions. [2021-11-07 08:42:24,861 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 49 [2021-11-07 08:42:24,863 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 146 states to 100 states and 102 transitions. [2021-11-07 08:42:24,863 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 57 [2021-11-07 08:42:24,863 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 57 [2021-11-07 08:42:24,863 INFO L73 IsDeterministic]: Start isDeterministic. Operand 100 states and 102 transitions. [2021-11-07 08:42:24,863 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-11-07 08:42:24,864 INFO L681 BuchiCegarLoop]: Abstraction has 100 states and 102 transitions. [2021-11-07 08:42:24,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states and 102 transitions. [2021-11-07 08:42:24,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 99. [2021-11-07 08:42:24,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 99 states have (on average 1.02020202020202) internal successors, (101), 98 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 08:42:24,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 101 transitions. [2021-11-07 08:42:24,867 INFO L704 BuchiCegarLoop]: Abstraction has 99 states and 101 transitions. [2021-11-07 08:42:24,867 INFO L587 BuchiCegarLoop]: Abstraction has 99 states and 101 transitions. [2021-11-07 08:42:24,867 INFO L425 BuchiCegarLoop]: ======== Iteration 27============ [2021-11-07 08:42:24,868 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 99 states and 101 transitions. [2021-11-07 08:42:24,868 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 49 [2021-11-07 08:42:24,868 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-11-07 08:42:24,869 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-11-07 08:42:24,870 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [23, 22, 1, 1, 1, 1, 1] [2021-11-07 08:42:24,870 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [23, 22, 1, 1, 1, 1] [2021-11-07 08:42:24,870 INFO L791 eck$LassoCheckResult]: Stem: 10672#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 10673#L-1 havoc main_#res;havoc main_#t~nondet11, main_#t~nondet12, main_#t~ret13;test_fun_#in~i, test_fun_#in~j := main_#t~nondet11, main_#t~nondet12;havoc test_fun_#res;havoc test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset, test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset, test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset, test_fun_#t~mem8, test_fun_#t~mem7, test_fun_#t~mem6, test_fun_#t~mem9, test_fun_#t~mem5, test_fun_#t~mem10, test_fun_~i, test_fun_~j, test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, test_fun_~c~0.base, test_fun_~c~0.offset;test_fun_~i := test_fun_#in~i;test_fun_~j := test_fun_#in~j;call test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.allocOnStack(4);test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset;call test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.allocOnStack(4);test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;call test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset := #Ultimate.allocOnStack(4);test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset;call write~int(test_fun_~i, test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4);call write~int(test_fun_~j, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); 10674#L555-3 call test_fun_#t~mem5 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 10675#L555-1 assume !!(test_fun_#t~mem5 >= 0);havoc test_fun_#t~mem5;call write~int(0, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4); 10682#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 10680#L557-1 assume !!(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);havoc test_fun_#t~mem8; 10676#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 10677#L557-1 assume !!(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);havoc test_fun_#t~mem8; 10678#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 10679#L557-1 assume !!(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);havoc test_fun_#t~mem8; 10681#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 10770#L557-1 assume !!(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);havoc test_fun_#t~mem8; 10769#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 10768#L557-1 assume !!(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);havoc test_fun_#t~mem8; 10767#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 10766#L557-1 assume !!(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);havoc test_fun_#t~mem8; 10765#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 10764#L557-1 assume !!(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);havoc test_fun_#t~mem8; 10763#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 10762#L557-1 assume !!(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);havoc test_fun_#t~mem8; 10761#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 10760#L557-1 assume !!(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);havoc test_fun_#t~mem8; 10759#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 10758#L557-1 assume !!(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);havoc test_fun_#t~mem8; 10757#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 10756#L557-1 assume !!(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);havoc test_fun_#t~mem8; 10755#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 10754#L557-1 assume !!(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);havoc test_fun_#t~mem8; 10753#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 10752#L557-1 assume !!(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);havoc test_fun_#t~mem8; 10751#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 10750#L557-1 assume !!(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);havoc test_fun_#t~mem8; 10749#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 10748#L557-1 assume !!(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);havoc test_fun_#t~mem8; 10747#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 10746#L557-1 assume !!(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);havoc test_fun_#t~mem8; 10745#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 10744#L557-1 assume !!(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);havoc test_fun_#t~mem8; 10743#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 10742#L557-1 assume !!(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);havoc test_fun_#t~mem8; 10741#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 10740#L557-1 assume !!(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);havoc test_fun_#t~mem8; 10739#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 10738#L557-1 assume !!(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);havoc test_fun_#t~mem8; 10737#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 10735#L557-1 assume !!(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);havoc test_fun_#t~mem8; 10733#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 10687#L557-1 assume !!(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);havoc test_fun_#t~mem8; 10686#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 10685#L557-1 assume !(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6; 10683#L557-4 [2021-11-07 08:42:24,871 INFO L793 eck$LassoCheckResult]: Loop: 10683#L557-4 call test_fun_#t~mem9 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4);call write~int(test_fun_#t~mem9 - 1, test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4);havoc test_fun_#t~mem9; 10684#L555-3 call test_fun_#t~mem5 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 10736#L555-1 assume !!(test_fun_#t~mem5 >= 0);havoc test_fun_#t~mem5;call write~int(0, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4); 10734#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 10732#L557-1 assume !!(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);havoc test_fun_#t~mem8; 10731#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 10730#L557-1 assume !!(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);havoc test_fun_#t~mem8; 10729#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 10728#L557-1 assume !!(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);havoc test_fun_#t~mem8; 10727#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 10726#L557-1 assume !!(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);havoc test_fun_#t~mem8; 10725#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 10724#L557-1 assume !!(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);havoc test_fun_#t~mem8; 10723#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 10722#L557-1 assume !!(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);havoc test_fun_#t~mem8; 10721#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 10720#L557-1 assume !!(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);havoc test_fun_#t~mem8; 10719#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 10718#L557-1 assume !!(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);havoc test_fun_#t~mem8; 10717#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 10716#L557-1 assume !!(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);havoc test_fun_#t~mem8; 10715#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 10714#L557-1 assume !!(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);havoc test_fun_#t~mem8; 10713#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 10712#L557-1 assume !!(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);havoc test_fun_#t~mem8; 10711#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 10710#L557-1 assume !!(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);havoc test_fun_#t~mem8; 10709#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 10708#L557-1 assume !!(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);havoc test_fun_#t~mem8; 10707#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 10706#L557-1 assume !!(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);havoc test_fun_#t~mem8; 10705#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 10704#L557-1 assume !!(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);havoc test_fun_#t~mem8; 10703#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 10702#L557-1 assume !!(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);havoc test_fun_#t~mem8; 10701#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 10700#L557-1 assume !!(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);havoc test_fun_#t~mem8; 10699#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 10698#L557-1 assume !!(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);havoc test_fun_#t~mem8; 10697#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 10696#L557-1 assume !!(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);havoc test_fun_#t~mem8; 10695#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 10694#L557-1 assume !!(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);havoc test_fun_#t~mem8; 10693#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 10692#L557-1 assume !!(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);havoc test_fun_#t~mem8; 10691#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 10690#L557-1 assume !!(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);havoc test_fun_#t~mem8; 10688#L557-3 call test_fun_#t~mem7 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); 10689#L557-1 assume !(test_fun_#t~mem7 <= test_fun_#t~mem6 - 1);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6; 10683#L557-4 [2021-11-07 08:42:24,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 08:42:24,871 INFO L85 PathProgramCache]: Analyzing trace with hash -643118343, now seen corresponding path program 23 times [2021-11-07 08:42:24,872 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 08:42:24,872 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1548692544] [2021-11-07 08:42:24,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 08:42:24,872 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 08:42:24,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-07 08:42:24,976 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-07 08:42:25,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-07 08:42:25,033 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-07 08:42:25,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 08:42:25,034 INFO L85 PathProgramCache]: Analyzing trace with hash 2091893615, now seen corresponding path program 22 times [2021-11-07 08:42:25,034 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 08:42:25,035 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [273322184] [2021-11-07 08:42:25,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 08:42:25,035 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 08:42:25,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-07 08:42:25,114 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-07 08:42:25,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-07 08:42:25,244 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-07 08:42:25,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 08:42:25,259 INFO L85 PathProgramCache]: Analyzing trace with hash 229844855, now seen corresponding path program 24 times [2021-11-07 08:42:25,259 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 08:42:25,259 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2118773583] [2021-11-07 08:42:25,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 08:42:25,260 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 08:42:25,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 08:42:30,159 INFO L134 CoverageAnalysis]: Checked inductivity of 2072 backedges. 492 proven. 1580 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 08:42:30,160 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-07 08:42:30,160 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2118773583] [2021-11-07 08:42:30,160 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2118773583] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-07 08:42:30,160 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [208466780] [2021-11-07 08:42:30,160 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2021-11-07 08:42:30,165 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-07 08:42:30,165 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ca00bbe-7802-45cf-8c9a-e5551a18caab/bin/uautomizer-AkOaLMaTGY/z3 [2021-11-07 08:42:30,170 INFO L229 MonitoredProcess]: Starting monitored process 57 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ca00bbe-7802-45cf-8c9a-e5551a18caab/bin/uautomizer-AkOaLMaTGY/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-07 08:42:30,197 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ca00bbe-7802-45cf-8c9a-e5551a18caab/bin/uautomizer-AkOaLMaTGY/z3 -smt2 -in SMTLIB2_COMPLIANT=true (57)] Waiting until timeout for monitored process [2021-11-07 08:42:41,125 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 24 check-sat command(s) [2021-11-07 08:42:41,126 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-07 08:42:41,147 INFO L263 TraceCheckSpWp]: Trace formula consists of 908 conjuncts, 58 conjunts are in the unsatisfiable core [2021-11-07 08:42:41,149 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-07 08:42:41,156 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2021-11-07 08:42:41,174 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-11-07 08:42:41,230 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-11-07 08:42:41,283 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-11-07 08:42:41,338 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-11-07 08:42:41,416 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-11-07 08:42:41,473 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-11-07 08:42:41,529 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-11-07 08:42:41,587 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-11-07 08:42:41,647 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-11-07 08:42:41,710 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-11-07 08:42:41,765 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-11-07 08:42:41,829 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-11-07 08:42:41,891 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-11-07 08:42:41,972 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-11-07 08:42:42,041 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-11-07 08:42:42,108 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-11-07 08:42:42,176 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-11-07 08:42:42,241 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-11-07 08:42:42,309 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-11-07 08:42:42,389 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-11-07 08:42:42,467 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-11-07 08:42:42,543 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-11-07 08:42:42,625 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-11-07 08:42:42,963 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 25 [2021-11-07 08:42:43,106 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2021-11-07 08:42:43,225 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2021-11-07 08:42:43,348 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2021-11-07 08:42:43,480 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2021-11-07 08:42:43,609 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2021-11-07 08:42:43,739 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2021-11-07 08:42:43,879 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2021-11-07 08:42:44,005 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2021-11-07 08:42:44,130 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2021-11-07 08:42:44,265 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2021-11-07 08:42:44,393 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2021-11-07 08:42:44,502 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2021-11-07 08:42:44,609 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2021-11-07 08:42:44,719 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2021-11-07 08:42:44,844 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2021-11-07 08:42:44,966 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2021-11-07 08:42:45,074 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2021-11-07 08:42:45,185 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2021-11-07 08:42:45,294 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2021-11-07 08:42:45,419 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2021-11-07 08:42:45,530 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2021-11-07 08:42:45,638 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2021-11-07 08:42:45,749 INFO L354 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2021-11-07 08:42:45,749 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 17 [2021-11-07 08:42:45,817 INFO L134 CoverageAnalysis]: Checked inductivity of 2072 backedges. 135 proven. 1937 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 08:42:45,818 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [208466780] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-07 08:42:45,818 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-11-07 08:42:45,818 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [95, 52] total 145 [2021-11-07 08:42:45,818 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [131943943]