./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/list-ext2-properties/simple_search_value-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0e0057cc Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b4455af-77a1-41f8-877d-ab34b38e20d9/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b4455af-77a1-41f8-877d-ab34b38e20d9/bin/uautomizer-verify-BQ2R08f2Ya/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b4455af-77a1-41f8-877d-ab34b38e20d9/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b4455af-77a1-41f8-877d-ab34b38e20d9/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerReach.xml -i ../../sv-benchmarks/c/list-ext2-properties/simple_search_value-2.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b4455af-77a1-41f8-877d-ab34b38e20d9/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b4455af-77a1-41f8-877d-ab34b38e20d9/bin/uautomizer-verify-BQ2R08f2Ya --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash a622ae6de889131f2da5147d62f9f380917f72e1547f77059c8208bcfb6e8bd0 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-29 06:55:58,309 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-29 06:55:58,382 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b4455af-77a1-41f8-877d-ab34b38e20d9/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-29 06:55:58,388 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-29 06:55:58,388 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-29 06:55:58,414 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-29 06:55:58,414 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-29 06:55:58,415 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-29 06:55:58,416 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-29 06:55:58,416 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-29 06:55:58,417 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-29 06:55:58,417 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-29 06:55:58,418 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-29 06:55:58,418 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-29 06:55:58,419 INFO L153 SettingsManager]: * Use SBE=true [2023-11-29 06:55:58,420 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-29 06:55:58,420 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-29 06:55:58,421 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-29 06:55:58,421 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-29 06:55:58,422 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-29 06:55:58,422 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-29 06:55:58,423 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-29 06:55:58,423 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-29 06:55:58,424 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-29 06:55:58,424 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-29 06:55:58,425 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-29 06:55:58,425 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-29 06:55:58,426 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-29 06:55:58,426 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-29 06:55:58,426 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-29 06:55:58,427 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-29 06:55:58,427 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 06:55:58,428 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-29 06:55:58,428 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-29 06:55:58,428 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-29 06:55:58,429 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-29 06:55:58,429 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-29 06:55:58,429 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-29 06:55:58,429 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-29 06:55:58,429 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-29 06:55:58,430 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-29 06:55:58,430 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-29 06:55:58,430 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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_2b4455af-77a1-41f8-877d-ab34b38e20d9/bin/uautomizer-verify-BQ2R08f2Ya/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_2b4455af-77a1-41f8-877d-ab34b38e20d9/bin/uautomizer-verify-BQ2R08f2Ya Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness 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(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> a622ae6de889131f2da5147d62f9f380917f72e1547f77059c8208bcfb6e8bd0 [2023-11-29 06:55:58,682 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-29 06:55:58,706 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-29 06:55:58,709 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-29 06:55:58,710 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-29 06:55:58,711 INFO L274 PluginConnector]: CDTParser initialized [2023-11-29 06:55:58,712 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b4455af-77a1-41f8-877d-ab34b38e20d9/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/list-ext2-properties/simple_search_value-2.i [2023-11-29 06:56:01,622 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-29 06:56:01,875 INFO L384 CDTParser]: Found 1 translation units. [2023-11-29 06:56:01,875 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b4455af-77a1-41f8-877d-ab34b38e20d9/sv-benchmarks/c/list-ext2-properties/simple_search_value-2.i [2023-11-29 06:56:01,890 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b4455af-77a1-41f8-877d-ab34b38e20d9/bin/uautomizer-verify-BQ2R08f2Ya/data/f3001d296/783fb2e041544628b9953764da6f03bc/FLAG3b85b7048 [2023-11-29 06:56:01,903 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b4455af-77a1-41f8-877d-ab34b38e20d9/bin/uautomizer-verify-BQ2R08f2Ya/data/f3001d296/783fb2e041544628b9953764da6f03bc [2023-11-29 06:56:01,905 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-29 06:56:01,906 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-29 06:56:01,907 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-29 06:56:01,907 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-29 06:56:01,911 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-29 06:56:01,912 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 06:56:01" (1/1) ... [2023-11-29 06:56:01,913 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@391a87a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:56:01, skipping insertion in model container [2023-11-29 06:56:01,913 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 06:56:01" (1/1) ... [2023-11-29 06:56:01,952 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 06:56:02,187 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b4455af-77a1-41f8-877d-ab34b38e20d9/sv-benchmarks/c/list-ext2-properties/simple_search_value-2.i[23220,23233] [2023-11-29 06:56:02,192 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 06:56:02,200 INFO L202 MainTranslator]: Completed pre-run [2023-11-29 06:56:02,237 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b4455af-77a1-41f8-877d-ab34b38e20d9/sv-benchmarks/c/list-ext2-properties/simple_search_value-2.i[23220,23233] [2023-11-29 06:56:02,239 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 06:56:02,264 INFO L206 MainTranslator]: Completed translation [2023-11-29 06:56:02,265 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:56:02 WrapperNode [2023-11-29 06:56:02,265 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-29 06:56:02,266 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-29 06:56:02,266 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-29 06:56:02,266 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-29 06:56:02,271 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:56:02" (1/1) ... [2023-11-29 06:56:02,284 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:56:02" (1/1) ... [2023-11-29 06:56:02,302 INFO L138 Inliner]: procedures = 122, calls = 18, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 70 [2023-11-29 06:56:02,302 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-29 06:56:02,303 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-29 06:56:02,303 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-29 06:56:02,303 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-29 06:56:02,311 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:56:02" (1/1) ... [2023-11-29 06:56:02,311 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:56:02" (1/1) ... [2023-11-29 06:56:02,314 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:56:02" (1/1) ... [2023-11-29 06:56:02,328 INFO L175 MemorySlicer]: Split 10 memory accesses to 2 slices as follows [2, 8]. 80 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 4 writes are split as follows [0, 4]. [2023-11-29 06:56:02,328 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:56:02" (1/1) ... [2023-11-29 06:56:02,328 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:56:02" (1/1) ... [2023-11-29 06:56:02,335 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:56:02" (1/1) ... [2023-11-29 06:56:02,338 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:56:02" (1/1) ... [2023-11-29 06:56:02,340 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:56:02" (1/1) ... [2023-11-29 06:56:02,341 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:56:02" (1/1) ... [2023-11-29 06:56:02,344 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-29 06:56:02,345 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-29 06:56:02,345 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-29 06:56:02,345 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-29 06:56:02,346 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:56:02" (1/1) ... [2023-11-29 06:56:02,352 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 06:56:02,361 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b4455af-77a1-41f8-877d-ab34b38e20d9/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 06:56:02,372 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b4455af-77a1-41f8-877d-ab34b38e20d9/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-29 06:56:02,399 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b4455af-77a1-41f8-877d-ab34b38e20d9/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-29 06:56:02,418 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2023-11-29 06:56:02,418 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2023-11-29 06:56:02,418 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2023-11-29 06:56:02,418 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2023-11-29 06:56:02,419 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2023-11-29 06:56:02,419 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2023-11-29 06:56:02,419 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-29 06:56:02,419 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-29 06:56:02,419 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2023-11-29 06:56:02,419 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2023-11-29 06:56:02,419 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2023-11-29 06:56:02,420 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2023-11-29 06:56:02,420 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-29 06:56:02,420 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-11-29 06:56:02,420 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-29 06:56:02,420 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-29 06:56:02,518 INFO L241 CfgBuilder]: Building ICFG [2023-11-29 06:56:02,520 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-29 06:56:02,568 INFO L775 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2023-11-29 06:56:02,689 INFO L282 CfgBuilder]: Performing block encoding [2023-11-29 06:56:02,712 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-29 06:56:02,712 INFO L309 CfgBuilder]: Removed 2 assume(true) statements. [2023-11-29 06:56:02,713 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 06:56:02 BoogieIcfgContainer [2023-11-29 06:56:02,713 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-29 06:56:02,716 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-29 06:56:02,716 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-29 06:56:02,720 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-29 06:56:02,720 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.11 06:56:01" (1/3) ... [2023-11-29 06:56:02,721 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20b6c517 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 06:56:02, skipping insertion in model container [2023-11-29 06:56:02,721 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:56:02" (2/3) ... [2023-11-29 06:56:02,721 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20b6c517 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 06:56:02, skipping insertion in model container [2023-11-29 06:56:02,721 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 06:56:02" (3/3) ... [2023-11-29 06:56:02,723 INFO L112 eAbstractionObserver]: Analyzing ICFG simple_search_value-2.i [2023-11-29 06:56:02,738 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-29 06:56:02,739 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-29 06:56:02,782 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-29 06:56:02,789 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@707d1ca9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-29 06:56:02,790 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-29 06:56:02,794 INFO L276 IsEmpty]: Start isEmpty. Operand has 23 states, 19 states have (on average 1.5789473684210527) internal successors, (30), 21 states have internal predecessors, (30), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:56:02,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2023-11-29 06:56:02,803 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 06:56:02,803 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 06:56:02,804 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 06:56:02,810 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:56:02,810 INFO L85 PathProgramCache]: Analyzing trace with hash 357278617, now seen corresponding path program 1 times [2023-11-29 06:56:02,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:56:02,821 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2060636900] [2023-11-29 06:56:02,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:56:02,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:56:02,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:56:03,001 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 06:56:03,001 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 06:56:03,002 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2060636900] [2023-11-29 06:56:03,002 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2060636900] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:56:03,003 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:56:03,003 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 06:56:03,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [8870509] [2023-11-29 06:56:03,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:56:03,010 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-29 06:56:03,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 06:56:03,041 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-29 06:56:03,041 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-29 06:56:03,043 INFO L87 Difference]: Start difference. First operand has 23 states, 19 states have (on average 1.5789473684210527) internal successors, (30), 21 states have internal predecessors, (30), 2 states have call successors, (2), 1 states have call predecessors, (2), 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 4.0) internal successors, (8), 2 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) [2023-11-29 06:56:03,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:56:03,064 INFO L93 Difference]: Finished difference Result 34 states and 47 transitions. [2023-11-29 06:56:03,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-29 06:56:03,067 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 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) Word has length 8 [2023-11-29 06:56:03,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 06:56:03,074 INFO L225 Difference]: With dead ends: 34 [2023-11-29 06:56:03,074 INFO L226 Difference]: Without dead ends: 17 [2023-11-29 06:56:03,076 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-29 06:56:03,080 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 06:56:03,081 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 27 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 06:56:03,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2023-11-29 06:56:03,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2023-11-29 06:56:03,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 16 states have (on average 1.3125) internal successors, (21), 16 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) [2023-11-29 06:56:03,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 21 transitions. [2023-11-29 06:56:03,108 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 21 transitions. Word has length 8 [2023-11-29 06:56:03,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 06:56:03,109 INFO L495 AbstractCegarLoop]: Abstraction has 17 states and 21 transitions. [2023-11-29 06:56:03,109 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 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) [2023-11-29 06:56:03,109 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 21 transitions. [2023-11-29 06:56:03,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-11-29 06:56:03,110 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 06:56:03,110 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 06:56:03,110 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-29 06:56:03,111 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 06:56:03,111 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:56:03,111 INFO L85 PathProgramCache]: Analyzing trace with hash 1991764778, now seen corresponding path program 1 times [2023-11-29 06:56:03,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:56:03,112 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [507668510] [2023-11-29 06:56:03,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:56:03,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:56:03,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:56:03,188 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 06:56:03,189 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 06:56:03,189 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [507668510] [2023-11-29 06:56:03,189 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [507668510] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:56:03,189 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:56:03,189 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 06:56:03,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1433757245] [2023-11-29 06:56:03,190 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:56:03,191 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 06:56:03,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 06:56:03,192 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 06:56:03,192 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 06:56:03,193 INFO L87 Difference]: Start difference. First operand 17 states and 21 transitions. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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) [2023-11-29 06:56:03,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:56:03,209 INFO L93 Difference]: Finished difference Result 27 states and 34 transitions. [2023-11-29 06:56:03,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 06:56:03,210 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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) Word has length 10 [2023-11-29 06:56:03,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 06:56:03,211 INFO L225 Difference]: With dead ends: 27 [2023-11-29 06:56:03,211 INFO L226 Difference]: Without dead ends: 18 [2023-11-29 06:56:03,211 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 06:56:03,213 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 0 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 06:56:03,214 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 34 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 06:56:03,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2023-11-29 06:56:03,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2023-11-29 06:56:03,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 17 states have internal predecessors, (22), 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) [2023-11-29 06:56:03,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 22 transitions. [2023-11-29 06:56:03,219 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 22 transitions. Word has length 10 [2023-11-29 06:56:03,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 06:56:03,220 INFO L495 AbstractCegarLoop]: Abstraction has 18 states and 22 transitions. [2023-11-29 06:56:03,220 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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) [2023-11-29 06:56:03,220 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 22 transitions. [2023-11-29 06:56:03,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-11-29 06:56:03,221 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 06:56:03,221 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 06:56:03,221 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-29 06:56:03,222 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 06:56:03,222 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:56:03,222 INFO L85 PathProgramCache]: Analyzing trace with hash 2049023080, now seen corresponding path program 1 times [2023-11-29 06:56:03,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:56:03,223 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [381148019] [2023-11-29 06:56:03,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:56:03,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:56:03,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:56:03,367 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 06:56:03,367 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 06:56:03,368 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [381148019] [2023-11-29 06:56:03,368 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [381148019] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:56:03,368 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:56:03,368 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 06:56:03,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1461700450] [2023-11-29 06:56:03,369 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:56:03,369 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 06:56:03,370 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 06:56:03,370 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 06:56:03,371 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 06:56:03,371 INFO L87 Difference]: Start difference. First operand 18 states and 22 transitions. Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 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) [2023-11-29 06:56:03,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:56:03,420 INFO L93 Difference]: Finished difference Result 38 states and 47 transitions. [2023-11-29 06:56:03,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 06:56:03,421 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 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) Word has length 10 [2023-11-29 06:56:03,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 06:56:03,422 INFO L225 Difference]: With dead ends: 38 [2023-11-29 06:56:03,423 INFO L226 Difference]: Without dead ends: 23 [2023-11-29 06:56:03,423 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-29 06:56:03,425 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 5 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 06:56:03,426 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 45 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 06:56:03,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2023-11-29 06:56:03,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 20. [2023-11-29 06:56:03,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 19 states have (on average 1.263157894736842) internal successors, (24), 19 states have internal predecessors, (24), 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) [2023-11-29 06:56:03,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 24 transitions. [2023-11-29 06:56:03,432 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 24 transitions. Word has length 10 [2023-11-29 06:56:03,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 06:56:03,432 INFO L495 AbstractCegarLoop]: Abstraction has 20 states and 24 transitions. [2023-11-29 06:56:03,432 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 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) [2023-11-29 06:56:03,432 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 24 transitions. [2023-11-29 06:56:03,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-11-29 06:56:03,433 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 06:56:03,433 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 06:56:03,433 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-29 06:56:03,434 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 06:56:03,434 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:56:03,435 INFO L85 PathProgramCache]: Analyzing trace with hash 1438995548, now seen corresponding path program 1 times [2023-11-29 06:56:03,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:56:03,435 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [599955109] [2023-11-29 06:56:03,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:56:03,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:56:03,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:56:03,568 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-29 06:56:03,569 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 06:56:03,569 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [599955109] [2023-11-29 06:56:03,569 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [599955109] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:56:03,569 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:56:03,569 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 06:56:03,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [549674248] [2023-11-29 06:56:03,570 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:56:03,570 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 06:56:03,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 06:56:03,571 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 06:56:03,571 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 06:56:03,571 INFO L87 Difference]: Start difference. First operand 20 states and 24 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 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) [2023-11-29 06:56:03,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:56:03,613 INFO L93 Difference]: Finished difference Result 31 states and 37 transitions. [2023-11-29 06:56:03,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 06:56:03,614 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 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) Word has length 15 [2023-11-29 06:56:03,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 06:56:03,615 INFO L225 Difference]: With dead ends: 31 [2023-11-29 06:56:03,615 INFO L226 Difference]: Without dead ends: 28 [2023-11-29 06:56:03,615 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-29 06:56:03,617 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 28 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 06:56:03,618 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 23 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 06:56:03,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2023-11-29 06:56:03,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 21. [2023-11-29 06:56:03,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 20 states have (on average 1.25) internal successors, (25), 20 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) [2023-11-29 06:56:03,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2023-11-29 06:56:03,623 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 25 transitions. Word has length 15 [2023-11-29 06:56:03,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 06:56:03,624 INFO L495 AbstractCegarLoop]: Abstraction has 21 states and 25 transitions. [2023-11-29 06:56:03,624 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 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) [2023-11-29 06:56:03,624 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2023-11-29 06:56:03,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2023-11-29 06:56:03,625 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 06:56:03,625 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 06:56:03,625 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-29 06:56:03,625 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 06:56:03,626 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:56:03,626 INFO L85 PathProgramCache]: Analyzing trace with hash -1477352526, now seen corresponding path program 1 times [2023-11-29 06:56:03,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:56:03,627 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [607270711] [2023-11-29 06:56:03,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:56:03,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:56:03,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:56:03,752 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-29 06:56:03,753 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 06:56:03,753 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [607270711] [2023-11-29 06:56:03,753 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [607270711] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 06:56:03,753 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [376094544] [2023-11-29 06:56:03,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:56:03,754 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 06:56:03,754 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b4455af-77a1-41f8-877d-ab34b38e20d9/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 06:56:03,756 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b4455af-77a1-41f8-877d-ab34b38e20d9/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 06:56:03,764 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b4455af-77a1-41f8-877d-ab34b38e20d9/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-29 06:56:03,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:56:03,881 INFO L262 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-29 06:56:03,886 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 06:56:03,933 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-29 06:56:03,933 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 06:56:03,964 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-29 06:56:03,965 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [376094544] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 06:56:03,965 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 06:56:03,965 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2023-11-29 06:56:03,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1752321223] [2023-11-29 06:56:03,965 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 06:56:03,966 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-29 06:56:03,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 06:56:03,967 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-29 06:56:03,967 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2023-11-29 06:56:03,967 INFO L87 Difference]: Start difference. First operand 21 states and 25 transitions. Second operand has 8 states, 8 states have (on average 4.125) internal successors, (33), 8 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) [2023-11-29 06:56:04,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:56:04,055 INFO L93 Difference]: Finished difference Result 55 states and 66 transitions. [2023-11-29 06:56:04,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-29 06:56:04,056 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.125) internal successors, (33), 8 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) Word has length 20 [2023-11-29 06:56:04,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 06:56:04,057 INFO L225 Difference]: With dead ends: 55 [2023-11-29 06:56:04,057 INFO L226 Difference]: Without dead ends: 39 [2023-11-29 06:56:04,058 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=80, Unknown=0, NotChecked=0, Total=132 [2023-11-29 06:56:04,059 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 12 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 06:56:04,059 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 74 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 06:56:04,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2023-11-29 06:56:04,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 36. [2023-11-29 06:56:04,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 35 states have (on average 1.1428571428571428) internal successors, (40), 35 states have internal predecessors, (40), 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) [2023-11-29 06:56:04,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 40 transitions. [2023-11-29 06:56:04,066 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 40 transitions. Word has length 20 [2023-11-29 06:56:04,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 06:56:04,066 INFO L495 AbstractCegarLoop]: Abstraction has 36 states and 40 transitions. [2023-11-29 06:56:04,066 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.125) internal successors, (33), 8 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) [2023-11-29 06:56:04,067 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 40 transitions. [2023-11-29 06:56:04,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2023-11-29 06:56:04,068 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 06:56:04,068 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 06:56:04,076 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b4455af-77a1-41f8-877d-ab34b38e20d9/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-29 06:56:04,268 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b4455af-77a1-41f8-877d-ab34b38e20d9/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 06:56:04,269 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 06:56:04,269 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:56:04,269 INFO L85 PathProgramCache]: Analyzing trace with hash 1302450726, now seen corresponding path program 2 times [2023-11-29 06:56:04,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:56:04,269 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [960852950] [2023-11-29 06:56:04,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:56:04,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:56:04,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:56:04,484 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 4 proven. 38 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-29 06:56:04,485 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 06:56:04,485 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [960852950] [2023-11-29 06:56:04,485 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [960852950] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 06:56:04,485 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1469595304] [2023-11-29 06:56:04,485 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-29 06:56:04,485 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 06:56:04,486 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b4455af-77a1-41f8-877d-ab34b38e20d9/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 06:56:04,490 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b4455af-77a1-41f8-877d-ab34b38e20d9/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 06:56:04,492 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b4455af-77a1-41f8-877d-ab34b38e20d9/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-29 06:56:04,657 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-29 06:56:04,657 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 06:56:04,659 INFO L262 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 7 conjunts are in the unsatisfiable core [2023-11-29 06:56:04,662 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 06:56:04,719 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 4 proven. 38 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-29 06:56:04,719 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 06:56:04,839 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 4 proven. 38 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-29 06:56:04,840 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1469595304] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 06:56:04,840 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 06:56:04,840 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 14 [2023-11-29 06:56:04,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1202077817] [2023-11-29 06:56:04,840 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 06:56:04,841 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-11-29 06:56:04,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 06:56:04,842 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-11-29 06:56:04,842 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=102, Unknown=0, NotChecked=0, Total=182 [2023-11-29 06:56:04,843 INFO L87 Difference]: Start difference. First operand 36 states and 40 transitions. Second operand has 14 states, 14 states have (on average 4.5) internal successors, (63), 14 states have internal predecessors, (63), 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) [2023-11-29 06:56:05,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:56:05,066 INFO L93 Difference]: Finished difference Result 85 states and 99 transitions. [2023-11-29 06:56:05,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-11-29 06:56:05,067 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.5) internal successors, (63), 14 states have internal predecessors, (63), 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) Word has length 35 [2023-11-29 06:56:05,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 06:56:05,069 INFO L225 Difference]: With dead ends: 85 [2023-11-29 06:56:05,069 INFO L226 Difference]: Without dead ends: 69 [2023-11-29 06:56:05,070 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=211, Invalid=341, Unknown=0, NotChecked=0, Total=552 [2023-11-29 06:56:05,071 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 18 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 06:56:05,071 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 80 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 06:56:05,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2023-11-29 06:56:05,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 66. [2023-11-29 06:56:05,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 65 states have (on average 1.0769230769230769) internal successors, (70), 65 states have internal predecessors, (70), 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) [2023-11-29 06:56:05,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 70 transitions. [2023-11-29 06:56:05,083 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 70 transitions. Word has length 35 [2023-11-29 06:56:05,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 06:56:05,083 INFO L495 AbstractCegarLoop]: Abstraction has 66 states and 70 transitions. [2023-11-29 06:56:05,084 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.5) internal successors, (63), 14 states have internal predecessors, (63), 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) [2023-11-29 06:56:05,084 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 70 transitions. [2023-11-29 06:56:05,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2023-11-29 06:56:05,086 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 06:56:05,086 INFO L195 NwaCegarLoop]: trace histogram [11, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 06:56:05,092 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b4455af-77a1-41f8-877d-ab34b38e20d9/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-11-29 06:56:05,290 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b4455af-77a1-41f8-877d-ab34b38e20d9/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 06:56:05,291 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 06:56:05,291 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:56:05,291 INFO L85 PathProgramCache]: Analyzing trace with hash -2036934490, now seen corresponding path program 3 times [2023-11-29 06:56:05,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:56:05,292 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1016662068] [2023-11-29 06:56:05,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:56:05,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:56:05,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:56:09,686 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 1 proven. 129 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2023-11-29 06:56:09,686 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 06:56:09,686 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1016662068] [2023-11-29 06:56:09,686 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1016662068] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 06:56:09,687 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1605541803] [2023-11-29 06:56:09,687 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-29 06:56:09,687 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 06:56:09,687 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b4455af-77a1-41f8-877d-ab34b38e20d9/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 06:56:09,688 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b4455af-77a1-41f8-877d-ab34b38e20d9/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 06:56:09,694 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b4455af-77a1-41f8-877d-ab34b38e20d9/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-29 06:56:18,232 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2023-11-29 06:56:18,232 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 06:56:18,246 INFO L262 TraceCheckSpWp]: Trace formula consists of 552 conjuncts, 133 conjunts are in the unsatisfiable core [2023-11-29 06:56:18,257 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 06:56:18,293 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-29 06:56:18,393 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2023-11-29 06:56:18,394 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 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 19 treesize of output 16 [2023-11-29 06:56:18,472 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-29 06:56:18,562 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2023-11-29 06:56:18,562 INFO L378 Elim1Store]: Elim1 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 32 treesize of output 23 [2023-11-29 06:56:18,605 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2023-11-29 06:56:18,606 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 19 treesize of output 16 [2023-11-29 06:56:18,695 INFO L349 Elim1Store]: treesize reduction 31, result has 18.4 percent of original size [2023-11-29 06:56:18,695 INFO L378 Elim1Store]: Elim1 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 75 treesize of output 53 [2023-11-29 06:56:18,834 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2023-11-29 06:56:18,834 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 19 treesize of output 16 [2023-11-29 06:56:18,861 INFO L349 Elim1Store]: treesize reduction 36, result has 29.4 percent of original size [2023-11-29 06:56:18,861 INFO L378 Elim1Store]: Elim1 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 52 treesize of output 47 [2023-11-29 06:56:18,876 INFO L378 Elim1Store]: Elim1 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 16 treesize of output 8 [2023-11-29 06:56:19,022 INFO L349 Elim1Store]: treesize reduction 36, result has 29.4 percent of original size [2023-11-29 06:56:19,023 INFO L378 Elim1Store]: Elim1 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 61 treesize of output 54 [2023-11-29 06:56:19,123 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-29 06:56:19,124 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-11-29 06:56:19,142 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-11-29 06:56:19,142 INFO L378 Elim1Store]: Elim1 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 1 case distinctions, treesize of input 25 treesize of output 22 [2023-11-29 06:56:19,148 INFO L378 Elim1Store]: Elim1 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 13 treesize of output 9 [2023-11-29 06:56:19,257 INFO L349 Elim1Store]: treesize reduction 17, result has 39.3 percent of original size [2023-11-29 06:56:19,258 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 25 [2023-11-29 06:56:19,476 INFO L349 Elim1Store]: treesize reduction 36, result has 29.4 percent of original size [2023-11-29 06:56:19,477 INFO L378 Elim1Store]: Elim1 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 3 case distinctions, treesize of input 74 treesize of output 64 [2023-11-29 06:56:19,489 INFO L378 Elim1Store]: Elim1 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 18 treesize of output 12 [2023-11-29 06:56:19,578 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 18 [2023-11-29 06:56:19,653 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-11-29 06:56:19,653 INFO L378 Elim1Store]: Elim1 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 25 treesize of output 22 [2023-11-29 06:56:19,661 INFO L378 Elim1Store]: Elim1 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 13 treesize of output 9 [2023-11-29 06:56:19,778 INFO L349 Elim1Store]: treesize reduction 17, result has 39.3 percent of original size [2023-11-29 06:56:19,778 INFO L378 Elim1Store]: Elim1 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 1 case distinctions, treesize of input 37 treesize of output 25 [2023-11-29 06:56:19,857 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-11-29 06:56:19,857 INFO L378 Elim1Store]: Elim1 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 17 treesize of output 16 [2023-11-29 06:56:19,941 INFO L349 Elim1Store]: treesize reduction 17, result has 39.3 percent of original size [2023-11-29 06:56:19,941 INFO L378 Elim1Store]: Elim1 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 1 case distinctions, treesize of input 28 treesize of output 20 [2023-11-29 06:56:20,020 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-11-29 06:56:20,020 INFO L378 Elim1Store]: Elim1 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 17 treesize of output 16 [2023-11-29 06:56:20,068 INFO L349 Elim1Store]: treesize reduction 17, result has 39.3 percent of original size [2023-11-29 06:56:20,069 INFO L378 Elim1Store]: Elim1 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 1 case distinctions, treesize of input 28 treesize of output 20 [2023-11-29 06:56:20,145 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-11-29 06:56:20,146 INFO L378 Elim1Store]: Elim1 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 17 treesize of output 16 [2023-11-29 06:56:20,156 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-29 06:56:20,246 INFO L349 Elim1Store]: treesize reduction 17, result has 39.3 percent of original size [2023-11-29 06:56:20,246 INFO L378 Elim1Store]: Elim1 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 1 case distinctions, treesize of input 28 treesize of output 20 [2023-11-29 06:56:20,435 INFO L349 Elim1Store]: treesize reduction 24, result has 52.9 percent of original size [2023-11-29 06:56:20,436 INFO L378 Elim1Store]: Elim1 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 3 case distinctions, treesize of input 68 treesize of output 72 [2023-11-29 06:56:20,460 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 06:56:20,461 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 51 treesize of output 73 [2023-11-29 06:56:20,686 INFO L378 Elim1Store]: Elim1 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 38 treesize of output 32 [2023-11-29 06:56:20,704 INFO L378 Elim1Store]: Elim1 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 18 treesize of output 12 [2023-11-29 06:56:20,734 INFO L378 Elim1Store]: Elim1 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 78 treesize of output 66 [2023-11-29 06:56:20,912 INFO L349 Elim1Store]: treesize reduction 17, result has 39.3 percent of original size [2023-11-29 06:56:20,912 INFO L378 Elim1Store]: Elim1 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 1 case distinctions, treesize of input 54 treesize of output 46 [2023-11-29 06:56:21,181 INFO L349 Elim1Store]: treesize reduction 40, result has 27.3 percent of original size [2023-11-29 06:56:21,182 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 90 treesize of output 86 [2023-11-29 06:56:21,189 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 1 [2023-11-29 06:56:21,312 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 06:56:21,312 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 88 treesize of output 108 [2023-11-29 06:56:21,986 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 06:56:21,986 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 103 treesize of output 135 [2023-11-29 06:56:22,103 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 26 proven. 219 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2023-11-29 06:56:22,103 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 06:56:22,224 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 06:56:22,224 INFO L378 Elim1Store]: Elim1 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 44 [2023-11-29 06:56:22,242 INFO L378 Elim1Store]: Elim1 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 125 treesize of output 119 [2023-11-29 06:56:22,539 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 06:56:22,540 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 25 [2023-11-29 06:56:22,911 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 06:56:22,912 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 95 treesize of output 94 [2023-11-29 06:56:22,924 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 06:56:22,924 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 105 treesize of output 110 [2023-11-29 06:56:22,968 INFO L378 Elim1Store]: Elim1 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 12 treesize of output 10 [2023-11-29 06:56:22,985 INFO L378 Elim1Store]: Elim1 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 12 treesize of output 10 [2023-11-29 06:56:23,034 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) (.cse3 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4))) (and (forall ((v_arrayElimArr_2 (Array Int Int))) (let ((.cse1 (select v_arrayElimArr_2 .cse3))) (or (forall ((v_prenex_8 (Array Int Int)) (|ULTIMATE.start_main_~p~0#1.base| Int) (v_prenex_7 (Array Int Int))) (let ((.cse0 (select v_prenex_7 4))) (or (= .cse0 0) (= .cse0 .cse1) (not (= (select (select (store (store (store |c_#memory_$Pointer$#1.base| |ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_2) .cse1 v_prenex_7) .cse0 v_prenex_8) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) 0)) (= .cse0 |c_ULTIMATE.start_main_~a~0#1.base|)))) (= .cse1 0)))) (or (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (forall ((v_arrayElimArr_2 (Array Int Int)) (|ULTIMATE.start_main_~p~0#1.base| Int) (v_arrayElimArr_1 (Array Int Int)) (v_ArrVal_597 (Array Int Int))) (let ((.cse5 (select v_arrayElimArr_1 4)) (.cse4 (select v_arrayElimArr_2 .cse3))) (or (not (= (select (select (store (store (store |c_#memory_$Pointer$#1.base| |ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_2) .cse4 v_arrayElimArr_1) .cse5 v_ArrVal_597) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) 0)) (= .cse5 0) (= .cse4 .cse5) (= .cse4 0))))))) is different from false [2023-11-29 06:56:23,170 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base|) (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4) |c_ULTIMATE.start_main_~t~0#1.base|))) (.cse3 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) (.cse4 (+ |c_ULTIMATE.start_main_~t~0#1.offset| 4))) (and (or (forall ((v_arrayElimArr_2 (Array Int Int)) (v_arrayElimArr_1 (Array Int Int)) (v_subst_2 Int) (v_ArrVal_597 (Array Int Int))) (let ((.cse0 (select v_arrayElimArr_2 .cse4)) (.cse1 (select v_arrayElimArr_1 4))) (or (= .cse0 .cse1) (= .cse1 0) (= .cse0 0) (not (= (select (select (store (store (store .cse2 v_subst_2 v_arrayElimArr_2) .cse0 v_arrayElimArr_1) .cse1 v_ArrVal_597) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3) 0))))) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0)) (forall ((v_arrayElimArr_2 (Array Int Int))) (let ((.cse6 (select v_arrayElimArr_2 .cse4))) (or (forall ((v_prenex_8 (Array Int Int)) (v_subst_1 Int) (v_prenex_7 (Array Int Int))) (let ((.cse5 (select v_prenex_7 4))) (or (= .cse5 0) (not (= (select (select (store (store (store .cse2 v_subst_1 v_arrayElimArr_2) .cse6 v_prenex_7) .cse5 v_prenex_8) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3) 0)) (= .cse5 .cse6) (= .cse5 |c_ULTIMATE.start_main_~a~0#1.base|)))) (= .cse6 0)))))) is different from false [2023-11-29 06:56:23,244 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 06:56:23,244 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 107 treesize of output 106 [2023-11-29 06:56:23,328 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)) (.cse3 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (and (or (forall ((v_arrayElimArr_2 (Array Int Int)) (|ULTIMATE.start_main_~p~0#1.base| Int) (v_arrayElimArr_1 (Array Int Int)) (v_arrayElimArr_3 (Array Int Int)) (v_subst_2 Int) (v_ArrVal_597 (Array Int Int))) (let ((.cse1 (select v_arrayElimArr_1 4)) (.cse2 (select v_arrayElimArr_2 4))) (or (= (select v_arrayElimArr_3 .cse0) 0) (= .cse1 0) (not (= (select (select (store (store (store (store |c_#memory_$Pointer$#1.base| |ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_3) v_subst_2 v_arrayElimArr_2) .cse2 v_arrayElimArr_1) .cse1 v_ArrVal_597) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3) 0)) (= .cse2 .cse1) (= .cse2 0)))) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0)) (forall ((v_arrayElimArr_3 (Array Int Int))) (or (= (select v_arrayElimArr_3 .cse0) 0) (forall ((v_prenex_8 (Array Int Int)) (|ULTIMATE.start_main_~p~0#1.base| Int) (v_prenex_12 (Array Int Int)) (v_subst_1 Int) (v_prenex_7 (Array Int Int))) (let ((.cse5 (select v_prenex_12 4)) (.cse4 (select v_prenex_7 4))) (or (= .cse4 0) (not (= (select (select (store (store (store (store |c_#memory_$Pointer$#1.base| |ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_3) v_subst_1 v_prenex_12) .cse5 v_prenex_7) .cse4 v_prenex_8) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3) 0)) (= .cse4 |c_ULTIMATE.start_main_~a~0#1.base|) (= .cse5 0) (= .cse5 .cse4)))))))) is different from false [2023-11-29 06:56:24,061 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 06:56:24,061 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 123 treesize of output 122 [2023-11-29 06:56:24,179 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)) (.cse3 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (and (forall ((v_arrayElimArr_4 (Array Int Int))) (or (= (select v_arrayElimArr_4 .cse0) 0) (forall ((v_prenex_8 (Array Int Int)) (|ULTIMATE.start_main_~p~0#1.base| Int) (v_prenex_14 (Array Int Int)) (v_prenex_12 (Array Int Int)) (v_subst_3 Int) (v_subst_1 Int) (v_prenex_7 (Array Int Int))) (let ((.cse2 (select v_prenex_12 4)) (.cse1 (select v_prenex_7 4))) (or (= .cse1 0) (not (= (select (select (store (store (store (store (store |c_#memory_$Pointer$#1.base| |ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_4) v_subst_3 v_prenex_14) v_subst_1 v_prenex_12) .cse2 v_prenex_7) .cse1 v_prenex_8) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3) 0)) (= (select v_prenex_14 4) 0) (= .cse1 |c_ULTIMATE.start_main_~a~0#1.base|) (= .cse2 0) (= .cse2 .cse1)))))) (or (forall ((v_arrayElimArr_2 (Array Int Int)) (|ULTIMATE.start_main_~p~0#1.base| Int) (v_arrayElimArr_1 (Array Int Int)) (v_arrayElimArr_4 (Array Int Int)) (v_arrayElimArr_3 (Array Int Int)) (v_subst_4 Int) (v_subst_2 Int) (v_ArrVal_597 (Array Int Int))) (let ((.cse5 (select v_arrayElimArr_1 4)) (.cse4 (select v_arrayElimArr_2 4))) (or (= (select v_arrayElimArr_4 .cse0) 0) (not (= (select (select (store (store (store (store (store |c_#memory_$Pointer$#1.base| |ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_4) v_subst_4 v_arrayElimArr_3) v_subst_2 v_arrayElimArr_2) .cse4 v_arrayElimArr_1) .cse5 v_ArrVal_597) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3) 0)) (= .cse5 0) (= .cse4 .cse5) (= .cse4 0) (= (select v_arrayElimArr_3 4) 0)))) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0)))) is different from false [2023-11-29 06:56:25,054 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 06:56:25,055 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 139 treesize of output 138 [2023-11-29 06:56:30,838 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (and (forall ((v_arrayElimArr_5 (Array Int Int)) (v_ArrVal_580 (Array Int Int))) (or (= (select v_arrayElimArr_5 4) 0) (forall ((v_prenex_8 (Array Int Int)) (v_subst_7 Int) (v_prenex_14 (Array Int Int)) (v_subst_5 Int) (v_prenex_12 (Array Int Int)) (v_subst_3 Int) (v_subst_1 Int) (v_prenex_16 (Array Int Int)) (v_prenex_7 (Array Int Int))) (let ((.cse0 (select v_prenex_12 4)) (.cse1 (select v_prenex_7 4))) (or (not (= (select (select (store (store (store (store (store (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_580) v_subst_7 v_arrayElimArr_5) v_subst_5 v_prenex_16) v_subst_3 v_prenex_14) v_subst_1 v_prenex_12) .cse0 v_prenex_7) .cse1 v_prenex_8) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) 0)) (= .cse1 0) (= (select v_prenex_16 4) 0) (= (select v_prenex_14 4) 0) (= .cse1 |c_ULTIMATE.start_main_~a~0#1.base|) (= .cse0 0) (= .cse0 .cse1)))))) (or (forall ((v_arrayElimArr_5 (Array Int Int)) (v_arrayElimArr_2 (Array Int Int)) (v_arrayElimArr_1 (Array Int Int)) (v_ArrVal_580 (Array Int Int)) (v_subst_8 Int) (v_arrayElimArr_4 (Array Int Int)) (v_arrayElimArr_3 (Array Int Int)) (v_subst_6 Int) (v_subst_4 Int) (v_subst_2 Int) (v_ArrVal_597 (Array Int Int))) (let ((.cse4 (select v_arrayElimArr_1 4)) (.cse3 (select v_arrayElimArr_2 4))) (or (not (= (select (select (store (store (store (store (store (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_580) v_subst_8 v_arrayElimArr_5) v_subst_6 v_arrayElimArr_4) v_subst_4 v_arrayElimArr_3) v_subst_2 v_arrayElimArr_2) .cse3 v_arrayElimArr_1) .cse4 v_ArrVal_597) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) 0)) (= (select v_arrayElimArr_5 4) 0) (= .cse4 0) (= .cse3 .cse4) (= (select v_arrayElimArr_4 4) 0) (= .cse3 0) (= (select v_arrayElimArr_3 4) 0)))) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0)))) is different from false [2023-11-29 06:56:31,779 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 06:56:31,780 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 161 treesize of output 160 [2023-11-29 06:56:39,584 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 06:56:39,584 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 233 treesize of output 262 [2023-11-29 06:56:39,903 INFO L349 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2023-11-29 06:56:39,904 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 126 treesize of output 84 [2023-11-29 06:56:45,365 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 06:56:45,365 INFO L378 Elim1Store]: Elim1 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 60 treesize of output 61 [2023-11-29 06:56:45,374 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 06:56:45,527 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 06:56:45,534 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 352915521 treesize of output 352718918 [2023-11-29 06:56:47,460 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 06:56:47,461 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 10788 treesize of output 9766 [2023-11-29 06:56:47,670 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 06:56:47,671 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 9757 treesize of output 8225 [2023-11-29 06:56:47,907 INFO L378 Elim1Store]: Elim1 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 8210 treesize of output 8202 [2023-11-29 06:56:48,121 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 06:56:48,121 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 8226 treesize of output 8182 [2023-11-29 06:56:48,329 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 06:56:48,330 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 8194 treesize of output 7674 [2023-11-29 06:56:48,555 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 06:56:48,556 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 7644 treesize of output 7394 [2023-11-29 06:56:48,789 INFO L378 Elim1Store]: Elim1 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 7382 treesize of output 7350 [2023-11-29 06:56:49,023 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 06:56:49,024 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 7356 treesize of output 7298 [2023-11-29 06:56:49,258 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 06:56:49,258 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 7292 treesize of output 7170 [2023-11-29 06:56:55,199 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 06:56:55,199 INFO L378 Elim1Store]: Elim1 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 60 treesize of output 61 [2023-11-29 06:58:54,217 WARN L320 FreeRefinementEngine]: Global settings require throwing the following exception [2023-11-29 06:58:54,229 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b4455af-77a1-41f8-877d-ab34b38e20d9/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2023-11-29 06:58:54,417 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b4455af-77a1-41f8-877d-ab34b38e20d9/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 06:58:54,418 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: line 175083 column 7: canceled at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminate(DualJunctionSaa.java:192) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne3(DualJunctionSaa.java:172) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne2(DualJunctionSaa.java:151) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne1(DualJunctionSaa.java:140) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne0(DualJunctionSaa.java:124) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne(DualJunctionSaa.java:108) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryExhaustivelyToEliminate(DualJunctionSaa.java:93) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminate(DualJunctionSaa.java:88) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToEliminateOne(QuantifierPusher.java:543) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.applyNewEliminationTechniquesExhaustively(QuantifierPusher.java:522) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.applyDualJunctionEliminationTechniques(QuantifierPusher.java:515) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:326) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:189) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:209) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:100) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:84) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:297) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:283) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.PartialQuantifierElimination.eliminate(PartialQuantifierElimination.java:51) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:238) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:420) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:399) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:271) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:341) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:184) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:110) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: line 175083 column 7: canceled at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1511) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:701) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:383) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:258) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseSuccess(Executor.java:277) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.push(Scriptor.java:133) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.arrays.DiffWrapperScript.push(DiffWrapperScript.java:90) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.push(WrapperScript.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.scripttransfer.HistoryRecordingScript.push(HistoryRecordingScript.java:107) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.push(WrapperScript.java:148) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.UndoableWrapperScript.push(UndoableWrapperScript.java:54) at de.uni_freiburg.informatik.ultimate.logic.Util.checkSat(Util.java:48) at de.uni_freiburg.informatik.ultimate.logic.simplification.SimplifyDDA.getRedundancy(SimplifyDDA.java:620) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.simplify.SimplifyDDAWithTimeout.getRedundancy(SimplifyDDAWithTimeout.java:120) at de.uni_freiburg.informatik.ultimate.logic.simplification.SimplifyDDA$Simplifier.walk(SimplifyDDA.java:370) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:115) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:106) at de.uni_freiburg.informatik.ultimate.logic.simplification.SimplifyDDA.simplifyOnce(SimplifyDDA.java:649) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.simplify.SimplifyDDAWithTimeout.getSimplifiedTerm(SimplifyDDAWithTimeout.java:180) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplify(SmtUtils.java:230) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplifyWithStatistics(SmtUtils.java:324) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1(Elim1Store.java:346) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.ElimStorePlain.applyComplexEliminationRules(ElimStorePlain.java:227) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminate(DualJunctionSaa.java:190) ... 55 more [2023-11-29 06:58:54,422 INFO L158 Benchmark]: Toolchain (without parser) took 172515.72ms. Allocated memory was 161.5MB in the beginning and 15.4GB in the end (delta: 15.3GB). Free memory was 128.6MB in the beginning and 9.3GB in the end (delta: -9.2GB). Peak memory consumption was 6.3GB. Max. memory is 16.1GB. [2023-11-29 06:58:54,422 INFO L158 Benchmark]: CDTParser took 0.23ms. Allocated memory is still 161.5MB. Free memory is still 128.3MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-29 06:58:54,422 INFO L158 Benchmark]: CACSL2BoogieTranslator took 357.80ms. Allocated memory is still 161.5MB. Free memory was 128.6MB in the beginning and 111.8MB in the end (delta: 16.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2023-11-29 06:58:54,422 INFO L158 Benchmark]: Boogie Procedure Inliner took 37.00ms. Allocated memory is still 161.5MB. Free memory was 111.8MB in the beginning and 109.7MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-29 06:58:54,422 INFO L158 Benchmark]: Boogie Preprocessor took 41.12ms. Allocated memory is still 161.5MB. Free memory was 109.7MB in the beginning and 107.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-29 06:58:54,423 INFO L158 Benchmark]: RCFGBuilder took 368.03ms. Allocated memory is still 161.5MB. Free memory was 107.7MB in the beginning and 93.0MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2023-11-29 06:58:54,423 INFO L158 Benchmark]: TraceAbstraction took 171705.38ms. Allocated memory was 161.5MB in the beginning and 15.4GB in the end (delta: 15.3GB). Free memory was 92.4MB in the beginning and 9.3GB in the end (delta: -9.2GB). Peak memory consumption was 6.3GB. Max. memory is 16.1GB. [2023-11-29 06:58:54,424 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.23ms. Allocated memory is still 161.5MB. Free memory is still 128.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 357.80ms. Allocated memory is still 161.5MB. Free memory was 128.6MB in the beginning and 111.8MB in the end (delta: 16.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 37.00ms. Allocated memory is still 161.5MB. Free memory was 111.8MB in the beginning and 109.7MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 41.12ms. Allocated memory is still 161.5MB. Free memory was 109.7MB in the beginning and 107.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 368.03ms. Allocated memory is still 161.5MB. Free memory was 107.7MB in the beginning and 93.0MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 171705.38ms. Allocated memory was 161.5MB in the beginning and 15.4GB in the end (delta: 15.3GB). Free memory was 92.4MB in the beginning and 9.3GB in the end (delta: -9.2GB). Peak memory consumption was 6.3GB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: line 175083 column 7: canceled de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: line 175083 column 7: canceled: de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminate(DualJunctionSaa.java:192) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2023-11-29 06:58:54,630 WARN L435 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b4455af-77a1-41f8-877d-ab34b38e20d9/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forcibly destroying the process [2023-11-29 06:58:54,720 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b4455af-77a1-41f8-877d-ab34b38e20d9/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 137 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b4455af-77a1-41f8-877d-ab34b38e20d9/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b4455af-77a1-41f8-877d-ab34b38e20d9/bin/uautomizer-verify-BQ2R08f2Ya/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b4455af-77a1-41f8-877d-ab34b38e20d9/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b4455af-77a1-41f8-877d-ab34b38e20d9/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerReach.xml -i ../../sv-benchmarks/c/list-ext2-properties/simple_search_value-2.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b4455af-77a1-41f8-877d-ab34b38e20d9/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b4455af-77a1-41f8-877d-ab34b38e20d9/bin/uautomizer-verify-BQ2R08f2Ya --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash a622ae6de889131f2da5147d62f9f380917f72e1547f77059c8208bcfb6e8bd0 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-29 06:58:57,088 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-29 06:58:57,156 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b4455af-77a1-41f8-877d-ab34b38e20d9/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2023-11-29 06:58:57,171 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-29 06:58:57,171 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-29 06:58:57,199 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-29 06:58:57,200 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-29 06:58:57,200 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-29 06:58:57,201 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-29 06:58:57,202 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-29 06:58:57,202 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-29 06:58:57,203 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-29 06:58:57,204 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-29 06:58:57,204 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-29 06:58:57,205 INFO L153 SettingsManager]: * Use SBE=true [2023-11-29 06:58:57,206 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-29 06:58:57,206 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-29 06:58:57,207 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-29 06:58:57,207 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-29 06:58:57,208 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-29 06:58:57,209 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-29 06:58:57,209 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-29 06:58:57,210 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-29 06:58:57,210 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-29 06:58:57,211 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-11-29 06:58:57,211 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-11-29 06:58:57,211 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-29 06:58:57,212 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-29 06:58:57,212 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-29 06:58:57,213 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-29 06:58:57,213 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-29 06:58:57,213 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-29 06:58:57,214 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-29 06:58:57,214 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 06:58:57,214 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-29 06:58:57,215 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-29 06:58:57,215 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-29 06:58:57,215 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-11-29 06:58:57,215 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-11-29 06:58:57,216 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-29 06:58:57,216 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-29 06:58:57,216 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-29 06:58:57,216 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-29 06:58:57,217 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-29 06:58:57,217 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-11-29 06:58:57,217 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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_2b4455af-77a1-41f8-877d-ab34b38e20d9/bin/uautomizer-verify-BQ2R08f2Ya/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_2b4455af-77a1-41f8-877d-ab34b38e20d9/bin/uautomizer-verify-BQ2R08f2Ya Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness 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(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> a622ae6de889131f2da5147d62f9f380917f72e1547f77059c8208bcfb6e8bd0 [2023-11-29 06:58:57,495 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-29 06:58:57,516 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-29 06:58:57,518 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-29 06:58:57,519 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-29 06:58:57,520 INFO L274 PluginConnector]: CDTParser initialized [2023-11-29 06:58:57,521 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b4455af-77a1-41f8-877d-ab34b38e20d9/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/list-ext2-properties/simple_search_value-2.i [2023-11-29 06:59:00,272 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-29 06:59:00,534 INFO L384 CDTParser]: Found 1 translation units. [2023-11-29 06:59:00,535 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b4455af-77a1-41f8-877d-ab34b38e20d9/sv-benchmarks/c/list-ext2-properties/simple_search_value-2.i [2023-11-29 06:59:00,551 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b4455af-77a1-41f8-877d-ab34b38e20d9/bin/uautomizer-verify-BQ2R08f2Ya/data/ed8ae868a/a8b11f75ee1b440588b925bf56d67e0c/FLAG19c32a638 [2023-11-29 06:59:00,567 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b4455af-77a1-41f8-877d-ab34b38e20d9/bin/uautomizer-verify-BQ2R08f2Ya/data/ed8ae868a/a8b11f75ee1b440588b925bf56d67e0c [2023-11-29 06:59:00,570 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-29 06:59:00,572 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-29 06:59:00,574 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-29 06:59:00,574 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-29 06:59:00,580 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-29 06:59:00,580 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 06:59:00" (1/1) ... [2023-11-29 06:59:00,582 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@533919f4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:59:00, skipping insertion in model container [2023-11-29 06:59:00,582 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 06:59:00" (1/1) ... [2023-11-29 06:59:00,624 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 06:59:00,904 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b4455af-77a1-41f8-877d-ab34b38e20d9/sv-benchmarks/c/list-ext2-properties/simple_search_value-2.i[23220,23233] [2023-11-29 06:59:00,909 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 06:59:00,923 INFO L202 MainTranslator]: Completed pre-run [2023-11-29 06:59:00,958 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b4455af-77a1-41f8-877d-ab34b38e20d9/sv-benchmarks/c/list-ext2-properties/simple_search_value-2.i[23220,23233] [2023-11-29 06:59:00,960 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 06:59:01,013 INFO L206 MainTranslator]: Completed translation [2023-11-29 06:59:01,013 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:59:01 WrapperNode [2023-11-29 06:59:01,014 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-29 06:59:01,015 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-29 06:59:01,015 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-29 06:59:01,015 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-29 06:59:01,023 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:59:01" (1/1) ... [2023-11-29 06:59:01,040 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:59:01" (1/1) ... [2023-11-29 06:59:01,062 INFO L138 Inliner]: procedures = 125, calls = 18, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 70 [2023-11-29 06:59:01,062 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-29 06:59:01,063 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-29 06:59:01,063 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-29 06:59:01,064 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-29 06:59:01,077 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:59:01" (1/1) ... [2023-11-29 06:59:01,077 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:59:01" (1/1) ... [2023-11-29 06:59:01,081 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:59:01" (1/1) ... [2023-11-29 06:59:01,096 INFO L175 MemorySlicer]: Split 10 memory accesses to 2 slices as follows [2, 8]. 80 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 4 writes are split as follows [0, 4]. [2023-11-29 06:59:01,096 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:59:01" (1/1) ... [2023-11-29 06:59:01,097 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:59:01" (1/1) ... [2023-11-29 06:59:01,106 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:59:01" (1/1) ... [2023-11-29 06:59:01,111 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:59:01" (1/1) ... [2023-11-29 06:59:01,113 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:59:01" (1/1) ... [2023-11-29 06:59:01,115 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:59:01" (1/1) ... [2023-11-29 06:59:01,120 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-29 06:59:01,121 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-29 06:59:01,122 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-29 06:59:01,122 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-29 06:59:01,123 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:59:01" (1/1) ... [2023-11-29 06:59:01,129 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 06:59:01,145 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b4455af-77a1-41f8-877d-ab34b38e20d9/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 06:59:01,157 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b4455af-77a1-41f8-877d-ab34b38e20d9/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-29 06:59:01,164 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b4455af-77a1-41f8-877d-ab34b38e20d9/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-29 06:59:01,189 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2023-11-29 06:59:01,189 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2023-11-29 06:59:01,189 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2023-11-29 06:59:01,190 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2023-11-29 06:59:01,190 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-29 06:59:01,190 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-29 06:59:01,190 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2023-11-29 06:59:01,190 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2023-11-29 06:59:01,190 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2023-11-29 06:59:01,190 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2023-11-29 06:59:01,190 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2023-11-29 06:59:01,191 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2023-11-29 06:59:01,191 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-11-29 06:59:01,191 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2023-11-29 06:59:01,191 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-29 06:59:01,191 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-29 06:59:01,295 INFO L241 CfgBuilder]: Building ICFG [2023-11-29 06:59:01,297 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-29 06:59:01,350 INFO L775 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2023-11-29 06:59:01,524 INFO L282 CfgBuilder]: Performing block encoding [2023-11-29 06:59:01,552 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-29 06:59:01,553 INFO L309 CfgBuilder]: Removed 2 assume(true) statements. [2023-11-29 06:59:01,554 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 06:59:01 BoogieIcfgContainer [2023-11-29 06:59:01,554 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-29 06:59:01,557 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-29 06:59:01,558 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-29 06:59:01,561 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-29 06:59:01,561 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.11 06:59:00" (1/3) ... [2023-11-29 06:59:01,562 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f6c8cce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 06:59:01, skipping insertion in model container [2023-11-29 06:59:01,562 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:59:01" (2/3) ... [2023-11-29 06:59:01,563 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f6c8cce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 06:59:01, skipping insertion in model container [2023-11-29 06:59:01,563 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 06:59:01" (3/3) ... [2023-11-29 06:59:01,564 INFO L112 eAbstractionObserver]: Analyzing ICFG simple_search_value-2.i [2023-11-29 06:59:01,585 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-29 06:59:01,585 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-29 06:59:01,640 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-29 06:59:01,648 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@4b2d614a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-29 06:59:01,648 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-29 06:59:01,653 INFO L276 IsEmpty]: Start isEmpty. Operand has 23 states, 19 states have (on average 1.5789473684210527) internal successors, (30), 21 states have internal predecessors, (30), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:59:01,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2023-11-29 06:59:01,660 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 06:59:01,661 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 06:59:01,662 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 06:59:01,667 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:59:01,668 INFO L85 PathProgramCache]: Analyzing trace with hash 357278617, now seen corresponding path program 1 times [2023-11-29 06:59:01,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 06:59:01,682 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [867237166] [2023-11-29 06:59:01,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:59:01,683 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 06:59:01,683 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b4455af-77a1-41f8-877d-ab34b38e20d9/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 06:59:01,686 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b4455af-77a1-41f8-877d-ab34b38e20d9/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 06:59:01,687 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b4455af-77a1-41f8-877d-ab34b38e20d9/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2023-11-29 06:59:01,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:59:01,800 INFO L262 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 1 conjunts are in the unsatisfiable core [2023-11-29 06:59:01,804 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 06:59:01,845 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 06:59:01,845 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 06:59:01,846 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 06:59:01,846 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [867237166] [2023-11-29 06:59:01,847 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [867237166] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:59:01,847 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:59:01,848 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 06:59:01,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1097982060] [2023-11-29 06:59:01,850 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:59:01,855 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-29 06:59:01,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 06:59:01,886 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-29 06:59:01,887 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-29 06:59:01,889 INFO L87 Difference]: Start difference. First operand has 23 states, 19 states have (on average 1.5789473684210527) internal successors, (30), 21 states have internal predecessors, (30), 2 states have call successors, (2), 1 states have call predecessors, (2), 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 4.0) internal successors, (8), 2 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) [2023-11-29 06:59:01,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:59:01,914 INFO L93 Difference]: Finished difference Result 34 states and 47 transitions. [2023-11-29 06:59:01,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-29 06:59:01,917 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 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) Word has length 8 [2023-11-29 06:59:01,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 06:59:01,924 INFO L225 Difference]: With dead ends: 34 [2023-11-29 06:59:01,924 INFO L226 Difference]: Without dead ends: 17 [2023-11-29 06:59:01,927 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-29 06:59:01,932 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 06:59:01,933 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 27 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 06:59:01,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2023-11-29 06:59:01,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2023-11-29 06:59:01,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 16 states have (on average 1.3125) internal successors, (21), 16 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) [2023-11-29 06:59:01,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 21 transitions. [2023-11-29 06:59:01,968 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 21 transitions. Word has length 8 [2023-11-29 06:59:01,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 06:59:01,969 INFO L495 AbstractCegarLoop]: Abstraction has 17 states and 21 transitions. [2023-11-29 06:59:01,969 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 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) [2023-11-29 06:59:01,969 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 21 transitions. [2023-11-29 06:59:01,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-11-29 06:59:01,970 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 06:59:01,970 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 06:59:01,975 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b4455af-77a1-41f8-877d-ab34b38e20d9/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2023-11-29 06:59:02,171 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b4455af-77a1-41f8-877d-ab34b38e20d9/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 06:59:02,172 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 06:59:02,172 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:59:02,172 INFO L85 PathProgramCache]: Analyzing trace with hash 1991764778, now seen corresponding path program 1 times [2023-11-29 06:59:02,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 06:59:02,173 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1345653271] [2023-11-29 06:59:02,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:59:02,174 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 06:59:02,174 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b4455af-77a1-41f8-877d-ab34b38e20d9/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 06:59:02,175 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b4455af-77a1-41f8-877d-ab34b38e20d9/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 06:59:02,177 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b4455af-77a1-41f8-877d-ab34b38e20d9/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2023-11-29 06:59:02,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:59:02,247 INFO L262 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-29 06:59:02,249 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 06:59:02,289 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 06:59:02,290 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 06:59:02,290 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 06:59:02,290 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1345653271] [2023-11-29 06:59:02,291 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1345653271] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:59:02,291 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:59:02,291 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 06:59:02,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [353938301] [2023-11-29 06:59:02,292 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:59:02,293 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 06:59:02,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 06:59:02,294 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 06:59:02,294 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 06:59:02,295 INFO L87 Difference]: Start difference. First operand 17 states and 21 transitions. Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 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) [2023-11-29 06:59:02,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:59:02,386 INFO L93 Difference]: Finished difference Result 37 states and 48 transitions. [2023-11-29 06:59:02,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 06:59:02,388 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 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) Word has length 10 [2023-11-29 06:59:02,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 06:59:02,389 INFO L225 Difference]: With dead ends: 37 [2023-11-29 06:59:02,389 INFO L226 Difference]: Without dead ends: 23 [2023-11-29 06:59:02,389 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-29 06:59:02,391 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 4 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 06:59:02,391 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 45 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 06:59:02,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2023-11-29 06:59:02,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 20. [2023-11-29 06:59:02,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 19 states have (on average 1.263157894736842) internal successors, (24), 19 states have internal predecessors, (24), 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) [2023-11-29 06:59:02,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 24 transitions. [2023-11-29 06:59:02,397 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 24 transitions. Word has length 10 [2023-11-29 06:59:02,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 06:59:02,397 INFO L495 AbstractCegarLoop]: Abstraction has 20 states and 24 transitions. [2023-11-29 06:59:02,398 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 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) [2023-11-29 06:59:02,398 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 24 transitions. [2023-11-29 06:59:02,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-11-29 06:59:02,398 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 06:59:02,399 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 06:59:02,401 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b4455af-77a1-41f8-877d-ab34b38e20d9/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2023-11-29 06:59:02,599 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b4455af-77a1-41f8-877d-ab34b38e20d9/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 06:59:02,599 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 06:59:02,600 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:59:02,600 INFO L85 PathProgramCache]: Analyzing trace with hash 1438995548, now seen corresponding path program 1 times [2023-11-29 06:59:02,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 06:59:02,601 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1813132974] [2023-11-29 06:59:02,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:59:02,601 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 06:59:02,601 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b4455af-77a1-41f8-877d-ab34b38e20d9/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 06:59:02,602 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b4455af-77a1-41f8-877d-ab34b38e20d9/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 06:59:02,603 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b4455af-77a1-41f8-877d-ab34b38e20d9/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2023-11-29 06:59:02,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:59:02,711 INFO L262 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-29 06:59:02,713 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 06:59:02,749 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 06:59:02,749 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 06:59:02,801 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 06:59:02,801 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 06:59:02,802 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1813132974] [2023-11-29 06:59:02,802 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1813132974] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 06:59:02,802 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 06:59:02,802 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2023-11-29 06:59:02,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1638621980] [2023-11-29 06:59:02,803 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 06:59:02,803 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-29 06:59:02,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 06:59:02,804 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-29 06:59:02,804 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-11-29 06:59:02,805 INFO L87 Difference]: Start difference. First operand 20 states and 24 transitions. Second operand has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 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) [2023-11-29 06:59:03,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:59:03,070 INFO L93 Difference]: Finished difference Result 53 states and 64 transitions. [2023-11-29 06:59:03,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-29 06:59:03,072 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 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) Word has length 15 [2023-11-29 06:59:03,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 06:59:03,073 INFO L225 Difference]: With dead ends: 53 [2023-11-29 06:59:03,074 INFO L226 Difference]: Without dead ends: 38 [2023-11-29 06:59:03,074 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=82, Unknown=0, NotChecked=0, Total=132 [2023-11-29 06:59:03,075 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 16 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-29 06:59:03,086 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 63 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-29 06:59:03,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2023-11-29 06:59:03,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 35. [2023-11-29 06:59:03,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 34 states have (on average 1.1470588235294117) internal successors, (39), 34 states have internal predecessors, (39), 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) [2023-11-29 06:59:03,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 39 transitions. [2023-11-29 06:59:03,093 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 39 transitions. Word has length 15 [2023-11-29 06:59:03,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 06:59:03,093 INFO L495 AbstractCegarLoop]: Abstraction has 35 states and 39 transitions. [2023-11-29 06:59:03,094 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 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) [2023-11-29 06:59:03,094 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2023-11-29 06:59:03,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2023-11-29 06:59:03,095 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 06:59:03,095 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 06:59:03,098 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b4455af-77a1-41f8-877d-ab34b38e20d9/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2023-11-29 06:59:03,295 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b4455af-77a1-41f8-877d-ab34b38e20d9/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 06:59:03,296 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 06:59:03,296 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:59:03,296 INFO L85 PathProgramCache]: Analyzing trace with hash -813781656, now seen corresponding path program 2 times [2023-11-29 06:59:03,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 06:59:03,297 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [992254282] [2023-11-29 06:59:03,297 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-29 06:59:03,297 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 06:59:03,297 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b4455af-77a1-41f8-877d-ab34b38e20d9/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 06:59:03,298 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b4455af-77a1-41f8-877d-ab34b38e20d9/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 06:59:03,299 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b4455af-77a1-41f8-877d-ab34b38e20d9/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2023-11-29 06:59:03,384 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-11-29 06:59:03,384 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 06:59:03,386 INFO L262 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-29 06:59:03,388 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 06:59:03,457 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2023-11-29 06:59:03,457 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 06:59:03,457 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 06:59:03,458 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [992254282] [2023-11-29 06:59:03,458 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [992254282] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:59:03,458 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:59:03,458 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 06:59:03,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1791840051] [2023-11-29 06:59:03,459 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:59:03,460 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 06:59:03,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 06:59:03,461 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 06:59:03,461 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 06:59:03,461 INFO L87 Difference]: Start difference. First operand 35 states and 39 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 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) [2023-11-29 06:59:03,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:59:03,566 INFO L93 Difference]: Finished difference Result 43 states and 49 transitions. [2023-11-29 06:59:03,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 06:59:03,567 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 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) Word has length 30 [2023-11-29 06:59:03,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 06:59:03,568 INFO L225 Difference]: With dead ends: 43 [2023-11-29 06:59:03,568 INFO L226 Difference]: Without dead ends: 40 [2023-11-29 06:59:03,568 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-29 06:59:03,569 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 28 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 06:59:03,570 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 23 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 06:59:03,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2023-11-29 06:59:03,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 36. [2023-11-29 06:59:03,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 35 states have (on average 1.1428571428571428) internal successors, (40), 35 states have internal predecessors, (40), 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) [2023-11-29 06:59:03,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 40 transitions. [2023-11-29 06:59:03,578 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 40 transitions. Word has length 30 [2023-11-29 06:59:03,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 06:59:03,578 INFO L495 AbstractCegarLoop]: Abstraction has 36 states and 40 transitions. [2023-11-29 06:59:03,579 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 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) [2023-11-29 06:59:03,579 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 40 transitions. [2023-11-29 06:59:03,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2023-11-29 06:59:03,580 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 06:59:03,580 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 06:59:03,587 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b4455af-77a1-41f8-877d-ab34b38e20d9/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2023-11-29 06:59:03,780 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b4455af-77a1-41f8-877d-ab34b38e20d9/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 06:59:03,781 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 06:59:03,781 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:59:03,781 INFO L85 PathProgramCache]: Analyzing trace with hash 1302450726, now seen corresponding path program 1 times [2023-11-29 06:59:03,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 06:59:03,782 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2043481827] [2023-11-29 06:59:03,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:59:03,782 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 06:59:03,782 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b4455af-77a1-41f8-877d-ab34b38e20d9/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 06:59:03,783 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b4455af-77a1-41f8-877d-ab34b38e20d9/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 06:59:03,787 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b4455af-77a1-41f8-877d-ab34b38e20d9/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2023-11-29 06:59:03,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:59:03,939 INFO L262 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 7 conjunts are in the unsatisfiable core [2023-11-29 06:59:03,942 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 06:59:04,058 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 4 proven. 38 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-29 06:59:04,058 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 06:59:04,251 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 4 proven. 38 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-29 06:59:04,252 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 06:59:04,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2043481827] [2023-11-29 06:59:04,252 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2043481827] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 06:59:04,252 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 06:59:04,252 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 13 [2023-11-29 06:59:04,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [895860472] [2023-11-29 06:59:04,253 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 06:59:04,253 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-11-29 06:59:04,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 06:59:04,254 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-11-29 06:59:04,255 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2023-11-29 06:59:04,255 INFO L87 Difference]: Start difference. First operand 36 states and 40 transitions. Second operand has 13 states, 13 states have (on average 4.384615384615385) internal successors, (57), 13 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) [2023-11-29 06:59:05,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:59:05,141 INFO L93 Difference]: Finished difference Result 85 states and 99 transitions. [2023-11-29 06:59:05,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-11-29 06:59:05,143 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.384615384615385) internal successors, (57), 13 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) Word has length 35 [2023-11-29 06:59:05,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 06:59:05,145 INFO L225 Difference]: With dead ends: 85 [2023-11-29 06:59:05,145 INFO L226 Difference]: Without dead ends: 69 [2023-11-29 06:59:05,146 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=236, Invalid=466, Unknown=0, NotChecked=0, Total=702 [2023-11-29 06:59:05,147 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 38 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 153 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 153 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-11-29 06:59:05,147 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 155 Invalid, 155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 153 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-11-29 06:59:05,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2023-11-29 06:59:05,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 66. [2023-11-29 06:59:05,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 65 states have (on average 1.0769230769230769) internal successors, (70), 65 states have internal predecessors, (70), 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) [2023-11-29 06:59:05,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 70 transitions. [2023-11-29 06:59:05,158 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 70 transitions. Word has length 35 [2023-11-29 06:59:05,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 06:59:05,158 INFO L495 AbstractCegarLoop]: Abstraction has 66 states and 70 transitions. [2023-11-29 06:59:05,159 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.384615384615385) internal successors, (57), 13 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) [2023-11-29 06:59:05,159 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 70 transitions. [2023-11-29 06:59:05,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2023-11-29 06:59:05,161 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 06:59:05,161 INFO L195 NwaCegarLoop]: trace histogram [11, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 06:59:05,165 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b4455af-77a1-41f8-877d-ab34b38e20d9/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2023-11-29 06:59:05,365 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b4455af-77a1-41f8-877d-ab34b38e20d9/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 06:59:05,365 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 06:59:05,366 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:59:05,366 INFO L85 PathProgramCache]: Analyzing trace with hash -2036934490, now seen corresponding path program 2 times [2023-11-29 06:59:05,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 06:59:05,367 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [779373] [2023-11-29 06:59:05,367 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-29 06:59:05,367 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 06:59:05,367 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b4455af-77a1-41f8-877d-ab34b38e20d9/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 06:59:05,368 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b4455af-77a1-41f8-877d-ab34b38e20d9/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 06:59:05,369 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b4455af-77a1-41f8-877d-ab34b38e20d9/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2023-11-29 06:59:06,277 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-29 06:59:06,278 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 06:59:06,296 INFO L262 TraceCheckSpWp]: Trace formula consists of 389 conjuncts, 92 conjunts are in the unsatisfiable core [2023-11-29 06:59:06,309 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 06:59:06,349 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-29 06:59:06,504 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-11-29 06:59:06,505 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 19 treesize of output 27 [2023-11-29 06:59:06,525 INFO L378 Elim1Store]: Elim1 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 [2023-11-29 06:59:06,621 INFO L378 Elim1Store]: Elim1 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 27 treesize of output 11 [2023-11-29 06:59:06,715 INFO L378 Elim1Store]: Elim1 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 16 treesize of output 11 [2023-11-29 06:59:06,759 INFO L349 Elim1Store]: treesize reduction 48, result has 32.4 percent of original size [2023-11-29 06:59:06,759 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 28 treesize of output 36 [2023-11-29 06:59:06,897 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-11-29 06:59:07,085 INFO L378 Elim1Store]: Elim1 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 16 treesize of output 11 [2023-11-29 06:59:07,145 INFO L349 Elim1Store]: treesize reduction 48, result has 32.4 percent of original size [2023-11-29 06:59:07,146 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 28 treesize of output 36 [2023-11-29 06:59:07,352 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-11-29 06:59:07,486 INFO L378 Elim1Store]: Elim1 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 16 treesize of output 11 [2023-11-29 06:59:07,558 INFO L349 Elim1Store]: treesize reduction 48, result has 32.4 percent of original size [2023-11-29 06:59:07,558 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 28 treesize of output 36 [2023-11-29 06:59:07,691 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-11-29 06:59:07,864 INFO L349 Elim1Store]: treesize reduction 48, result has 32.4 percent of original size [2023-11-29 06:59:07,864 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 28 treesize of output 36 [2023-11-29 06:59:07,899 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-11-29 06:59:07,991 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-11-29 06:59:08,112 INFO L378 Elim1Store]: Elim1 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 16 treesize of output 11 [2023-11-29 06:59:08,170 INFO L349 Elim1Store]: treesize reduction 48, result has 32.4 percent of original size [2023-11-29 06:59:08,171 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 28 treesize of output 36 [2023-11-29 06:59:08,283 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-11-29 06:59:08,468 INFO L349 Elim1Store]: treesize reduction 48, result has 32.4 percent of original size [2023-11-29 06:59:08,469 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 28 treesize of output 36 [2023-11-29 06:59:08,499 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-11-29 06:59:08,575 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-11-29 06:59:08,727 INFO L349 Elim1Store]: treesize reduction 48, result has 32.4 percent of original size [2023-11-29 06:59:08,727 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 28 treesize of output 36 [2023-11-29 06:59:08,769 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-11-29 06:59:08,855 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-11-29 06:59:09,005 INFO L349 Elim1Store]: treesize reduction 48, result has 32.4 percent of original size [2023-11-29 06:59:09,005 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 28 treesize of output 36 [2023-11-29 06:59:09,046 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-11-29 06:59:09,127 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-11-29 06:59:09,222 INFO L378 Elim1Store]: Elim1 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 16 treesize of output 11 [2023-11-29 06:59:09,259 INFO L349 Elim1Store]: treesize reduction 12, result has 42.9 percent of original size [2023-11-29 06:59:09,260 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 22 [2023-11-29 06:59:09,309 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-11-29 06:59:09,352 INFO L378 Elim1Store]: Elim1 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 16 treesize of output 11 [2023-11-29 06:59:09,393 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 1 proven. 129 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2023-11-29 06:59:09,393 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 06:59:09,521 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_396 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_393 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_393) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_396) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) (_ bv2 32)))) is different from false [2023-11-29 06:59:09,551 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_396 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_~t~0#1.base_21| (_ BitVec 32)) (v_ArrVal_393 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_~t~0#1.base_21|))) (not (= (_ bv2 32) (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_393) |v_ULTIMATE.start_main_~t~0#1.base_21| v_ArrVal_396) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))))) is different from false [2023-11-29 06:59:31,368 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_377 (_ BitVec 1)) (v_ArrVal_387 (_ BitVec 1)) (v_ArrVal_373 (_ BitVec 1)) (v_ArrVal_382 (_ BitVec 1)) (v_ArrVal_369 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_376 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_~t~0#1.base_24| (_ BitVec 32)) (|v_ULTIMATE.start_main_~t~0#1.base_23| (_ BitVec 32)) (|v_ULTIMATE.start_main_~t~0#1.base_25| (_ BitVec 32)) (|v_ULTIMATE.start_main_~t~0#1.base_22| (_ BitVec 32)) (v_ArrVal_396 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_386 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_~t~0#1.base_21| (_ BitVec 32)) (v_ArrVal_390 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_381 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_393 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (store |c_#valid| |v_ULTIMATE.start_main_~t~0#1.base_25| v_ArrVal_373))) (let ((.cse2 (store .cse1 |v_ULTIMATE.start_main_~t~0#1.base_24| v_ArrVal_377))) (let ((.cse0 (store .cse2 |v_ULTIMATE.start_main_~t~0#1.base_23| v_ArrVal_382))) (or (not (= (_ bv0 1) (select (store .cse0 |v_ULTIMATE.start_main_~t~0#1.base_22| v_ArrVal_387) |v_ULTIMATE.start_main_~t~0#1.base_21|))) (not (= (_ bv0 1) (select .cse0 |v_ULTIMATE.start_main_~t~0#1.base_22|))) (not (= (select |c_#valid| |v_ULTIMATE.start_main_~t~0#1.base_25|) (_ bv0 1))) (not (= (select .cse1 |v_ULTIMATE.start_main_~t~0#1.base_24|) (_ bv0 1))) (not (= (_ bv2 32) (select (select (store (store (store (store (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_369) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_376) |v_ULTIMATE.start_main_~t~0#1.base_25| v_ArrVal_381) |v_ULTIMATE.start_main_~t~0#1.base_24| v_ArrVal_386) |v_ULTIMATE.start_main_~t~0#1.base_23| v_ArrVal_390) |v_ULTIMATE.start_main_~t~0#1.base_22| v_ArrVal_393) |v_ULTIMATE.start_main_~t~0#1.base_21| v_ArrVal_396) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (not (= (select .cse2 |v_ULTIMATE.start_main_~t~0#1.base_23|) (_ bv0 1)))))))) is different from false [2023-11-29 06:59:35,050 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_377 (_ BitVec 1)) (v_ArrVal_387 (_ BitVec 1)) (v_ArrVal_367 (_ BitVec 1)) (v_ArrVal_362 (_ BitVec 1)) (v_ArrVal_373 (_ BitVec 1)) (v_ArrVal_382 (_ BitVec 1)) (v_ArrVal_369 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_~t~0#1.base_27| (_ BitVec 32)) (v_ArrVal_376 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_~t~0#1.base_24| (_ BitVec 32)) (v_ArrVal_366 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_~t~0#1.base_23| (_ BitVec 32)) (|v_ULTIMATE.start_main_~t~0#1.base_26| (_ BitVec 32)) (|v_ULTIMATE.start_main_~t~0#1.base_25| (_ BitVec 32)) (|v_ULTIMATE.start_main_~t~0#1.base_22| (_ BitVec 32)) (v_ArrVal_396 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_386 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_~t~0#1.base_21| (_ BitVec 32)) (v_ArrVal_390 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_381 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_393 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#valid| |v_ULTIMATE.start_main_~t~0#1.base_27| v_ArrVal_362))) (let ((.cse1 (store .cse2 |v_ULTIMATE.start_main_~t~0#1.base_26| v_ArrVal_367))) (let ((.cse4 (store .cse1 |v_ULTIMATE.start_main_~t~0#1.base_25| v_ArrVal_373))) (let ((.cse3 (store .cse4 |v_ULTIMATE.start_main_~t~0#1.base_24| v_ArrVal_377))) (let ((.cse0 (store .cse3 |v_ULTIMATE.start_main_~t~0#1.base_23| v_ArrVal_382))) (or (not (= (select (store .cse0 |v_ULTIMATE.start_main_~t~0#1.base_22| v_ArrVal_387) |v_ULTIMATE.start_main_~t~0#1.base_21|) (_ bv0 1))) (not (= (select .cse1 |v_ULTIMATE.start_main_~t~0#1.base_25|) (_ bv0 1))) (not (= (select |c_#valid| |v_ULTIMATE.start_main_~t~0#1.base_27|) (_ bv0 1))) (not (= (_ bv0 1) (select .cse2 |v_ULTIMATE.start_main_~t~0#1.base_26|))) (not (= (select (select (store (store (store (store (store (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_366) |v_ULTIMATE.start_main_~t~0#1.base_27| v_ArrVal_369) |v_ULTIMATE.start_main_~t~0#1.base_26| v_ArrVal_376) |v_ULTIMATE.start_main_~t~0#1.base_25| v_ArrVal_381) |v_ULTIMATE.start_main_~t~0#1.base_24| v_ArrVal_386) |v_ULTIMATE.start_main_~t~0#1.base_23| v_ArrVal_390) |v_ULTIMATE.start_main_~t~0#1.base_22| v_ArrVal_393) |v_ULTIMATE.start_main_~t~0#1.base_21| v_ArrVal_396) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) (_ bv2 32))) (not (= (_ bv0 1) (select .cse0 |v_ULTIMATE.start_main_~t~0#1.base_22|))) (not (= (_ bv0 1) (select .cse3 |v_ULTIMATE.start_main_~t~0#1.base_23|))) (not (= (_ bv0 1) (select .cse4 |v_ULTIMATE.start_main_~t~0#1.base_24|)))))))))) is different from false [2023-11-29 06:59:48,645 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_377 (_ BitVec 1)) (v_ArrVal_357 (_ BitVec 1)) (v_ArrVal_373 (_ BitVec 1)) (|v_ULTIMATE.start_main_~t~0#1.base_28| (_ BitVec 32)) (|v_ULTIMATE.start_main_~t~0#1.base_27| (_ BitVec 32)) (|v_ULTIMATE.start_main_~t~0#1.base_24| (_ BitVec 32)) (v_ArrVal_366 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_~t~0#1.base_23| (_ BitVec 32)) (|v_ULTIMATE.start_main_~t~0#1.base_26| (_ BitVec 32)) (|v_ULTIMATE.start_main_~t~0#1.base_25| (_ BitVec 32)) (|v_ULTIMATE.start_main_~t~0#1.base_22| (_ BitVec 32)) (v_ArrVal_386 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_~t~0#1.base_21| (_ BitVec 32)) (v_ArrVal_381 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_360 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_387 (_ BitVec 1)) (v_ArrVal_367 (_ BitVec 1)) (v_ArrVal_362 (_ BitVec 1)) (v_ArrVal_382 (_ BitVec 1)) (v_ArrVal_369 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_376 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_355 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_396 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_390 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_393 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#valid| |v_ULTIMATE.start_main_~t~0#1.base_28| v_ArrVal_357))) (let ((.cse4 (store .cse3 |v_ULTIMATE.start_main_~t~0#1.base_27| v_ArrVal_362))) (let ((.cse2 (store .cse4 |v_ULTIMATE.start_main_~t~0#1.base_26| v_ArrVal_367))) (let ((.cse0 (store .cse2 |v_ULTIMATE.start_main_~t~0#1.base_25| v_ArrVal_373))) (let ((.cse5 (store .cse0 |v_ULTIMATE.start_main_~t~0#1.base_24| v_ArrVal_377))) (let ((.cse1 (store .cse5 |v_ULTIMATE.start_main_~t~0#1.base_23| v_ArrVal_382))) (or (not (= (_ bv0 1) (select .cse0 |v_ULTIMATE.start_main_~t~0#1.base_24|))) (not (= (_ bv2 32) (select (select (store (store (store (store (store (store (store (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_355) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_360) |v_ULTIMATE.start_main_~t~0#1.base_28| v_ArrVal_366) |v_ULTIMATE.start_main_~t~0#1.base_27| v_ArrVal_369) |v_ULTIMATE.start_main_~t~0#1.base_26| v_ArrVal_376) |v_ULTIMATE.start_main_~t~0#1.base_25| v_ArrVal_381) |v_ULTIMATE.start_main_~t~0#1.base_24| v_ArrVal_386) |v_ULTIMATE.start_main_~t~0#1.base_23| v_ArrVal_390) |v_ULTIMATE.start_main_~t~0#1.base_22| v_ArrVal_393) |v_ULTIMATE.start_main_~t~0#1.base_21| v_ArrVal_396) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (not (= (_ bv0 1) (select .cse1 |v_ULTIMATE.start_main_~t~0#1.base_22|))) (not (= (_ bv0 1) (select .cse2 |v_ULTIMATE.start_main_~t~0#1.base_25|))) (not (= (select (store .cse1 |v_ULTIMATE.start_main_~t~0#1.base_22| v_ArrVal_387) |v_ULTIMATE.start_main_~t~0#1.base_21|) (_ bv0 1))) (not (= (select .cse3 |v_ULTIMATE.start_main_~t~0#1.base_27|) (_ bv0 1))) (not (= (_ bv0 1) (select .cse4 |v_ULTIMATE.start_main_~t~0#1.base_26|))) (not (= (_ bv0 1) (select .cse5 |v_ULTIMATE.start_main_~t~0#1.base_23|))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_~t~0#1.base_28|))))))))))) is different from false [2023-11-29 06:59:48,921 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_377 (_ BitVec 1)) (v_ArrVal_357 (_ BitVec 1)) (v_ArrVal_373 (_ BitVec 1)) (v_ArrVal_353 (_ BitVec 1)) (|v_ULTIMATE.start_main_~t~0#1.base_28| (_ BitVec 32)) (|v_ULTIMATE.start_main_~t~0#1.base_27| (_ BitVec 32)) (|v_ULTIMATE.start_main_~t~0#1.base_29| (_ BitVec 32)) (|v_ULTIMATE.start_main_~t~0#1.base_24| (_ BitVec 32)) (v_ArrVal_366 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_~t~0#1.base_23| (_ BitVec 32)) (|v_ULTIMATE.start_main_~t~0#1.base_26| (_ BitVec 32)) (|v_ULTIMATE.start_main_~t~0#1.base_25| (_ BitVec 32)) (|v_ULTIMATE.start_main_~t~0#1.base_22| (_ BitVec 32)) (v_ArrVal_386 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_~t~0#1.base_21| (_ BitVec 32)) (v_ArrVal_381 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_360 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_387 (_ BitVec 1)) (v_ArrVal_367 (_ BitVec 1)) (v_ArrVal_362 (_ BitVec 1)) (v_ArrVal_382 (_ BitVec 1)) (v_ArrVal_369 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_376 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_355 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_396 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_390 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_393 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#valid| |v_ULTIMATE.start_main_~t~0#1.base_29| v_ArrVal_353))) (let ((.cse2 (store .cse4 |v_ULTIMATE.start_main_~t~0#1.base_28| v_ArrVal_357))) (let ((.cse5 (store .cse2 |v_ULTIMATE.start_main_~t~0#1.base_27| v_ArrVal_362))) (let ((.cse3 (store .cse5 |v_ULTIMATE.start_main_~t~0#1.base_26| v_ArrVal_367))) (let ((.cse0 (store .cse3 |v_ULTIMATE.start_main_~t~0#1.base_25| v_ArrVal_373))) (let ((.cse6 (store .cse0 |v_ULTIMATE.start_main_~t~0#1.base_24| v_ArrVal_377))) (let ((.cse1 (store .cse6 |v_ULTIMATE.start_main_~t~0#1.base_23| v_ArrVal_382))) (or (not (= (select .cse0 |v_ULTIMATE.start_main_~t~0#1.base_24|) (_ bv0 1))) (not (= (_ bv0 1) (select (store .cse1 |v_ULTIMATE.start_main_~t~0#1.base_22| v_ArrVal_387) |v_ULTIMATE.start_main_~t~0#1.base_21|))) (not (= (select (select (store (store (store (store (store (store (store (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_355) |v_ULTIMATE.start_main_~t~0#1.base_29| v_ArrVal_360) |v_ULTIMATE.start_main_~t~0#1.base_28| v_ArrVal_366) |v_ULTIMATE.start_main_~t~0#1.base_27| v_ArrVal_369) |v_ULTIMATE.start_main_~t~0#1.base_26| v_ArrVal_376) |v_ULTIMATE.start_main_~t~0#1.base_25| v_ArrVal_381) |v_ULTIMATE.start_main_~t~0#1.base_24| v_ArrVal_386) |v_ULTIMATE.start_main_~t~0#1.base_23| v_ArrVal_390) |v_ULTIMATE.start_main_~t~0#1.base_22| v_ArrVal_393) |v_ULTIMATE.start_main_~t~0#1.base_21| v_ArrVal_396) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) (_ bv2 32))) (not (= (select .cse1 |v_ULTIMATE.start_main_~t~0#1.base_22|) (_ bv0 1))) (not (= (_ bv0 1) (select .cse2 |v_ULTIMATE.start_main_~t~0#1.base_27|))) (not (= (select .cse3 |v_ULTIMATE.start_main_~t~0#1.base_25|) (_ bv0 1))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_~t~0#1.base_29|))) (not (= (select .cse4 |v_ULTIMATE.start_main_~t~0#1.base_28|) (_ bv0 1))) (not (= (select .cse5 |v_ULTIMATE.start_main_~t~0#1.base_26|) (_ bv0 1))) (not (= (select .cse6 |v_ULTIMATE.start_main_~t~0#1.base_23|) (_ bv0 1)))))))))))) is different from false [2023-11-29 06:59:53,423 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_377 (_ BitVec 1)) (v_ArrVal_357 (_ BitVec 1)) (v_ArrVal_373 (_ BitVec 1)) (v_ArrVal_353 (_ BitVec 1)) (|v_ULTIMATE.start_main_~t~0#1.base_28| (_ BitVec 32)) (|v_ULTIMATE.start_main_~t~0#1.base_27| (_ BitVec 32)) (|v_ULTIMATE.start_main_~t~0#1.base_29| (_ BitVec 32)) (|v_ULTIMATE.start_main_~t~0#1.base_24| (_ BitVec 32)) (v_ArrVal_366 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_~t~0#1.base_23| (_ BitVec 32)) (|v_ULTIMATE.start_main_~t~0#1.base_26| (_ BitVec 32)) (|v_ULTIMATE.start_main_~t~0#1.base_25| (_ BitVec 32)) (v_ArrVal_348 (_ BitVec 32)) (|v_ULTIMATE.start_main_~t~0#1.base_22| (_ BitVec 32)) (v_ArrVal_386 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_~t~0#1.base_21| (_ BitVec 32)) (v_ArrVal_381 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_360 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_387 (_ BitVec 1)) (v_ArrVal_367 (_ BitVec 1)) (v_ArrVal_362 (_ BitVec 1)) (v_ArrVal_382 (_ BitVec 1)) (v_ArrVal_369 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_376 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_355 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_396 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_390 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_393 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#valid| |v_ULTIMATE.start_main_~t~0#1.base_29| v_ArrVal_353))) (let ((.cse2 (store .cse4 |v_ULTIMATE.start_main_~t~0#1.base_28| v_ArrVal_357))) (let ((.cse5 (store .cse2 |v_ULTIMATE.start_main_~t~0#1.base_27| v_ArrVal_362))) (let ((.cse3 (store .cse5 |v_ULTIMATE.start_main_~t~0#1.base_26| v_ArrVal_367))) (let ((.cse0 (store .cse3 |v_ULTIMATE.start_main_~t~0#1.base_25| v_ArrVal_373))) (let ((.cse6 (store .cse0 |v_ULTIMATE.start_main_~t~0#1.base_24| v_ArrVal_377))) (let ((.cse1 (store .cse6 |v_ULTIMATE.start_main_~t~0#1.base_23| v_ArrVal_382))) (or (not (= (select .cse0 |v_ULTIMATE.start_main_~t~0#1.base_24|) (_ bv0 1))) (not (= (_ bv0 1) (select (store .cse1 |v_ULTIMATE.start_main_~t~0#1.base_22| v_ArrVal_387) |v_ULTIMATE.start_main_~t~0#1.base_21|))) (not (= (select .cse1 |v_ULTIMATE.start_main_~t~0#1.base_22|) (_ bv0 1))) (not (= (select (select (store (store (store (store (store (store (store (store (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_int#1| |c_ULTIMATE.start_main_~p~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~p~0#1.offset|) v_ArrVal_348)) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_355) |v_ULTIMATE.start_main_~t~0#1.base_29| v_ArrVal_360) |v_ULTIMATE.start_main_~t~0#1.base_28| v_ArrVal_366) |v_ULTIMATE.start_main_~t~0#1.base_27| v_ArrVal_369) |v_ULTIMATE.start_main_~t~0#1.base_26| v_ArrVal_376) |v_ULTIMATE.start_main_~t~0#1.base_25| v_ArrVal_381) |v_ULTIMATE.start_main_~t~0#1.base_24| v_ArrVal_386) |v_ULTIMATE.start_main_~t~0#1.base_23| v_ArrVal_390) |v_ULTIMATE.start_main_~t~0#1.base_22| v_ArrVal_393) |v_ULTIMATE.start_main_~t~0#1.base_21| v_ArrVal_396) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) (_ bv2 32))) (not (= (_ bv0 1) (select .cse2 |v_ULTIMATE.start_main_~t~0#1.base_27|))) (not (= (select .cse3 |v_ULTIMATE.start_main_~t~0#1.base_25|) (_ bv0 1))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_~t~0#1.base_29|))) (not (= (select .cse4 |v_ULTIMATE.start_main_~t~0#1.base_28|) (_ bv0 1))) (not (= (select .cse5 |v_ULTIMATE.start_main_~t~0#1.base_26|) (_ bv0 1))) (not (= (select .cse6 |v_ULTIMATE.start_main_~t~0#1.base_23|) (_ bv0 1)))))))))))) is different from false [2023-11-29 06:59:53,702 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 06:59:53,703 INFO L378 Elim1Store]: Elim1 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 51 treesize of output 57 [2023-11-29 07:01:22,870 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b4455af-77a1-41f8-877d-ab34b38e20d9/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 101 [2023-11-29 07:01:22,870 WARN L249 Executor]: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b4455af-77a1-41f8-877d-ab34b38e20d9/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) stderr output: (error "out of memory") [2023-11-29 07:01:22,872 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 07:01:22,872 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [779373] [2023-11-29 07:01:22,873 WARN L320 FreeRefinementEngine]: Global settings require throwing the following exception [2023-11-29 07:01:22,879 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b4455af-77a1-41f8-877d-ab34b38e20d9/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2023-11-29 07:01:23,073 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b4455af-77a1-41f8-877d-ab34b38e20d9/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 07:01:23,074 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b4455af-77a1-41f8-877d-ab34b38e20d9/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminate(DualJunctionSaa.java:192) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne3(DualJunctionSaa.java:172) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne2(DualJunctionSaa.java:151) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne1(DualJunctionSaa.java:140) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne0(DualJunctionSaa.java:124) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne(DualJunctionSaa.java:108) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryExhaustivelyToEliminate(DualJunctionSaa.java:93) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminate(DualJunctionSaa.java:88) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToEliminateOne(QuantifierPusher.java:543) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.applyNewEliminationTechniquesExhaustively(QuantifierPusher.java:522) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.applyDualJunctionEliminationTechniques(QuantifierPusher.java:515) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:326) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:189) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:88) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:84) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:297) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:283) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.PartialQuantifierElimination.eliminate(PartialQuantifierElimination.java:51) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:238) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:420) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:399) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:271) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:341) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:184) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:110) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.isCorrect(IpTcStrategyModuleBase.java:57) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.checkFeasibility(AutomatonFreeRefinementEngine.java:210) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:121) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b4455af-77a1-41f8-877d-ab34b38e20d9/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:262) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseSuccess(Executor.java:277) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.push(Scriptor.java:133) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.arrays.DiffWrapperScript.push(DiffWrapperScript.java:90) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.push(WrapperScript.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.scripttransfer.HistoryRecordingScript.push(HistoryRecordingScript.java:107) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.push(WrapperScript.java:148) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.UndoableWrapperScript.push(UndoableWrapperScript.java:54) at de.uni_freiburg.informatik.ultimate.logic.Util.checkSat(Util.java:48) at de.uni_freiburg.informatik.ultimate.logic.simplification.SimplifyDDA.getRedundancy(SimplifyDDA.java:620) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.simplify.SimplifyDDAWithTimeout.getRedundancy(SimplifyDDAWithTimeout.java:120) at de.uni_freiburg.informatik.ultimate.logic.simplification.SimplifyDDA$Simplifier.walk(SimplifyDDA.java:370) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:115) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:106) at de.uni_freiburg.informatik.ultimate.logic.simplification.SimplifyDDA.simplifyOnce(SimplifyDDA.java:649) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.simplify.SimplifyDDAWithTimeout.getSimplifiedTerm(SimplifyDDAWithTimeout.java:180) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplify(SmtUtils.java:230) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplifyWithStatistics(SmtUtils.java:324) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1(Elim1Store.java:346) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.ElimStorePlain.applyComplexEliminationRules(ElimStorePlain.java:227) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminate(DualJunctionSaa.java:190) ... 53 more Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: EOF at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1518) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:701) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:383) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:258) ... 73 more [2023-11-29 07:01:23,078 INFO L158 Benchmark]: Toolchain (without parser) took 142505.90ms. Allocated memory was 69.2MB in the beginning and 15.4GB in the end (delta: 15.3GB). Free memory was 43.6MB in the beginning and 9.8GB in the end (delta: -9.8GB). Peak memory consumption was 6.2GB. Max. memory is 16.1GB. [2023-11-29 07:01:23,078 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 69.2MB. Free memory is still 45.8MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-29 07:01:23,079 INFO L158 Benchmark]: CACSL2BoogieTranslator took 440.10ms. Allocated memory was 69.2MB in the beginning and 100.7MB in the end (delta: 31.5MB). Free memory was 43.3MB in the beginning and 76.7MB in the end (delta: -33.4MB). Peak memory consumption was 19.6MB. Max. memory is 16.1GB. [2023-11-29 07:01:23,079 INFO L158 Benchmark]: Boogie Procedure Inliner took 47.93ms. Allocated memory is still 100.7MB. Free memory was 76.7MB in the beginning and 74.8MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-29 07:01:23,080 INFO L158 Benchmark]: Boogie Preprocessor took 57.42ms. Allocated memory is still 100.7MB. Free memory was 74.8MB in the beginning and 72.2MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-29 07:01:23,080 INFO L158 Benchmark]: RCFGBuilder took 432.63ms. Allocated memory is still 100.7MB. Free memory was 72.2MB in the beginning and 56.6MB in the end (delta: 15.6MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2023-11-29 07:01:23,080 INFO L158 Benchmark]: TraceAbstraction took 141520.14ms. Allocated memory was 100.7MB in the beginning and 15.4GB in the end (delta: 15.3GB). Free memory was 55.9MB in the beginning and 9.8GB in the end (delta: -9.8GB). Peak memory consumption was 6.2GB. Max. memory is 16.1GB. [2023-11-29 07:01:23,082 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22ms. Allocated memory is still 69.2MB. Free memory is still 45.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 440.10ms. Allocated memory was 69.2MB in the beginning and 100.7MB in the end (delta: 31.5MB). Free memory was 43.3MB in the beginning and 76.7MB in the end (delta: -33.4MB). Peak memory consumption was 19.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 47.93ms. Allocated memory is still 100.7MB. Free memory was 76.7MB in the beginning and 74.8MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 57.42ms. Allocated memory is still 100.7MB. Free memory was 74.8MB in the beginning and 72.2MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 432.63ms. Allocated memory is still 100.7MB. Free memory was 72.2MB in the beginning and 56.6MB in the end (delta: 15.6MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 141520.14ms. Allocated memory was 100.7MB in the beginning and 15.4GB in the end (delta: 15.3GB). Free memory was 55.9MB in the beginning and 9.8GB in the end (delta: -9.8GB). Peak memory consumption was 6.2GB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b4455af-77a1-41f8-877d-ab34b38e20d9/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b4455af-77a1-41f8-877d-ab34b38e20d9/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") : de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminate(DualJunctionSaa.java:192) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: AssertionError: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b4455af-77a1-41f8-877d-ab34b38e20d9/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory")