./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread/queue_longer.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 30e01a73 Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca97b3df-45b6-45fe-a635-e424ac4b0a7b/bin/ugemcutter-verify-ybdnMwjCTB/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca97b3df-45b6-45fe-a635-e424ac4b0a7b/bin/ugemcutter-verify-ybdnMwjCTB/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca97b3df-45b6-45fe-a635-e424ac4b0a7b/bin/ugemcutter-verify-ybdnMwjCTB/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca97b3df-45b6-45fe-a635-e424ac4b0a7b/bin/ugemcutter-verify-ybdnMwjCTB/config/GemCutterReach.xml -i ../../sv-benchmarks/c/pthread/queue_longer.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca97b3df-45b6-45fe-a635-e424ac4b0a7b/bin/ugemcutter-verify-ybdnMwjCTB/config/svcomp-Reach-32bit-GemCutter_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca97b3df-45b6-45fe-a635-e424ac4b0a7b/bin/ugemcutter-verify-ybdnMwjCTB --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 GemCutter --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 9f874a9872f93f025fac23ebed37f94a1f3b80bd0133ea4d7e298577c4fec427 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-30e01a7 [2023-11-22 09:01:01,395 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-22 09:01:01,465 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca97b3df-45b6-45fe-a635-e424ac4b0a7b/bin/ugemcutter-verify-ybdnMwjCTB/config/svcomp-Reach-32bit-GemCutter_Default.epf [2023-11-22 09:01:01,470 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-22 09:01:01,471 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-22 09:01:01,498 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-22 09:01:01,499 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-22 09:01:01,500 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-22 09:01:01,501 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-22 09:01:01,501 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-22 09:01:01,502 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-22 09:01:01,503 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-22 09:01:01,503 INFO L153 SettingsManager]: * Use SBE=true [2023-11-22 09:01:01,504 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-22 09:01:01,505 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-22 09:01:01,505 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-22 09:01:01,506 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-22 09:01:01,506 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-22 09:01:01,507 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-22 09:01:01,508 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-22 09:01:01,508 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-22 09:01:01,509 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-22 09:01:01,509 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-22 09:01:01,510 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-22 09:01:01,510 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-22 09:01:01,511 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-22 09:01:01,511 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-22 09:01:01,512 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-22 09:01:01,512 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-22 09:01:01,513 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-22 09:01:01,513 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-22 09:01:01,514 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-22 09:01:01,514 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-22 09:01:01,515 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-22 09:01:01,515 INFO L153 SettingsManager]: * DFS Order used in POR=LOOP_LOCKSTEP [2023-11-22 09:01:01,515 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-22 09:01:01,515 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-22 09:01:01,516 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2023-11-22 09:01:01,516 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-22 09:01:01,516 INFO L153 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2023-11-22 09:01:01,517 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2023-11-22 09:01:01,517 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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_ca97b3df-45b6-45fe-a635-e424ac4b0a7b/bin/ugemcutter-verify-ybdnMwjCTB/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_ca97b3df-45b6-45fe-a635-e424ac4b0a7b/bin/ugemcutter-verify-ybdnMwjCTB 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 -> GemCutter 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 -> 9f874a9872f93f025fac23ebed37f94a1f3b80bd0133ea4d7e298577c4fec427 [2023-11-22 09:01:01,760 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-22 09:01:01,788 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-22 09:01:01,791 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-22 09:01:01,793 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-22 09:01:01,794 INFO L274 PluginConnector]: CDTParser initialized [2023-11-22 09:01:01,795 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca97b3df-45b6-45fe-a635-e424ac4b0a7b/bin/ugemcutter-verify-ybdnMwjCTB/../../sv-benchmarks/c/pthread/queue_longer.i [2023-11-22 09:01:05,072 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-22 09:01:05,386 INFO L384 CDTParser]: Found 1 translation units. [2023-11-22 09:01:05,387 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca97b3df-45b6-45fe-a635-e424ac4b0a7b/sv-benchmarks/c/pthread/queue_longer.i [2023-11-22 09:01:05,408 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca97b3df-45b6-45fe-a635-e424ac4b0a7b/bin/ugemcutter-verify-ybdnMwjCTB/data/f35f28b98/def19837663d41a9b65bd0415a85346d/FLAGa625e3a2f [2023-11-22 09:01:05,423 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca97b3df-45b6-45fe-a635-e424ac4b0a7b/bin/ugemcutter-verify-ybdnMwjCTB/data/f35f28b98/def19837663d41a9b65bd0415a85346d [2023-11-22 09:01:05,426 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-22 09:01:05,428 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-22 09:01:05,430 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-22 09:01:05,430 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-22 09:01:05,436 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-22 09:01:05,437 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 09:01:05" (1/1) ... [2023-11-22 09:01:05,438 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@bb72d68 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:01:05, skipping insertion in model container [2023-11-22 09:01:05,438 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 09:01:05" (1/1) ... [2023-11-22 09:01:05,505 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-22 09:01:06,004 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_ca97b3df-45b6-45fe-a635-e424ac4b0a7b/sv-benchmarks/c/pthread/queue_longer.i[43296,43309] [2023-11-22 09:01:06,011 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_ca97b3df-45b6-45fe-a635-e424ac4b0a7b/sv-benchmarks/c/pthread/queue_longer.i[43503,43516] [2023-11-22 09:01:06,014 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_ca97b3df-45b6-45fe-a635-e424ac4b0a7b/sv-benchmarks/c/pthread/queue_longer.i[43783,43796] [2023-11-22 09:01:06,019 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-22 09:01:06,031 INFO L202 MainTranslator]: Completed pre-run [2023-11-22 09:01:06,118 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_ca97b3df-45b6-45fe-a635-e424ac4b0a7b/sv-benchmarks/c/pthread/queue_longer.i[43296,43309] [2023-11-22 09:01:06,120 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_ca97b3df-45b6-45fe-a635-e424ac4b0a7b/sv-benchmarks/c/pthread/queue_longer.i[43503,43516] [2023-11-22 09:01:06,124 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_ca97b3df-45b6-45fe-a635-e424ac4b0a7b/sv-benchmarks/c/pthread/queue_longer.i[43783,43796] [2023-11-22 09:01:06,134 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-22 09:01:06,254 INFO L206 MainTranslator]: Completed translation [2023-11-22 09:01:06,254 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:01:06 WrapperNode [2023-11-22 09:01:06,255 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-22 09:01:06,256 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-22 09:01:06,256 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-22 09:01:06,257 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-22 09:01:06,265 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:01:06" (1/1) ... [2023-11-22 09:01:06,298 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:01:06" (1/1) ... [2023-11-22 09:01:06,357 INFO L138 Inliner]: procedures = 275, calls = 63, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 251 [2023-11-22 09:01:06,357 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-22 09:01:06,358 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-22 09:01:06,358 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-22 09:01:06,358 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-22 09:01:06,369 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:01:06" (1/1) ... [2023-11-22 09:01:06,369 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:01:06" (1/1) ... [2023-11-22 09:01:06,388 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:01:06" (1/1) ... [2023-11-22 09:01:06,388 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:01:06" (1/1) ... [2023-11-22 09:01:06,415 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:01:06" (1/1) ... [2023-11-22 09:01:06,419 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:01:06" (1/1) ... [2023-11-22 09:01:06,421 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:01:06" (1/1) ... [2023-11-22 09:01:06,423 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:01:06" (1/1) ... [2023-11-22 09:01:06,443 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-22 09:01:06,444 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-22 09:01:06,444 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-22 09:01:06,444 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-22 09:01:06,445 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:01:06" (1/1) ... [2023-11-22 09:01:06,459 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-22 09:01:06,476 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca97b3df-45b6-45fe-a635-e424ac4b0a7b/bin/ugemcutter-verify-ybdnMwjCTB/z3 [2023-11-22 09:01:06,496 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca97b3df-45b6-45fe-a635-e424ac4b0a7b/bin/ugemcutter-verify-ybdnMwjCTB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-22 09:01:06,531 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca97b3df-45b6-45fe-a635-e424ac4b0a7b/bin/ugemcutter-verify-ybdnMwjCTB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-22 09:01:06,542 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2023-11-22 09:01:06,542 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2023-11-22 09:01:06,542 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2023-11-22 09:01:06,544 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2023-11-22 09:01:06,544 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-22 09:01:06,545 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-22 09:01:06,545 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2023-11-22 09:01:06,545 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-22 09:01:06,545 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-22 09:01:06,545 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2023-11-22 09:01:06,546 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-22 09:01:06,546 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-22 09:01:06,546 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-22 09:01:06,546 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-22 09:01:06,548 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-22 09:01:06,743 INFO L241 CfgBuilder]: Building ICFG [2023-11-22 09:01:06,745 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-22 09:01:07,160 INFO L282 CfgBuilder]: Performing block encoding [2023-11-22 09:01:07,642 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-22 09:01:07,643 INFO L309 CfgBuilder]: Removed 2 assume(true) statements. [2023-11-22 09:01:07,643 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 09:01:07 BoogieIcfgContainer [2023-11-22 09:01:07,643 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-22 09:01:07,647 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-22 09:01:07,647 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-22 09:01:07,651 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-22 09:01:07,652 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 09:01:05" (1/3) ... [2023-11-22 09:01:07,652 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5441bccc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 09:01:07, skipping insertion in model container [2023-11-22 09:01:07,653 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:01:06" (2/3) ... [2023-11-22 09:01:07,654 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5441bccc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 09:01:07, skipping insertion in model container [2023-11-22 09:01:07,654 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 09:01:07" (3/3) ... [2023-11-22 09:01:07,655 INFO L112 eAbstractionObserver]: Analyzing ICFG queue_longer.i [2023-11-22 09:01:07,666 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-11-22 09:01:07,677 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-22 09:01:07,677 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2023-11-22 09:01:07,677 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-22 09:01:07,760 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2023-11-22 09:01:07,814 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-22 09:01:07,814 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2023-11-22 09:01:07,814 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca97b3df-45b6-45fe-a635-e424ac4b0a7b/bin/ugemcutter-verify-ybdnMwjCTB/z3 [2023-11-22 09:01:07,815 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca97b3df-45b6-45fe-a635-e424ac4b0a7b/bin/ugemcutter-verify-ybdnMwjCTB/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2023-11-22 09:01:07,816 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca97b3df-45b6-45fe-a635-e424ac4b0a7b/bin/ugemcutter-verify-ybdnMwjCTB/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2023-11-22 09:01:07,854 INFO L159 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2023-11-22 09:01:07,891 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == t1Thread1of1ForFork1 ======== [2023-11-22 09:01:07,909 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=PARTIAL_ORDER_FA, 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;@6f67f39e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-22 09:01:07,909 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-22 09:01:08,166 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 09:01:08,171 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 09:01:08,172 INFO L85 PathProgramCache]: Analyzing trace with hash -1148517689, now seen corresponding path program 1 times [2023-11-22 09:01:08,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 09:01:08,182 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [979083492] [2023-11-22 09:01:08,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 09:01:08,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 09:01:08,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 09:01:08,511 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-22 09:01:08,511 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 09:01:08,512 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [979083492] [2023-11-22 09:01:08,513 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [979083492] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 09:01:08,513 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-22 09:01:08,514 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-22 09:01:08,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1374129934] [2023-11-22 09:01:08,516 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 09:01:08,521 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-22 09:01:08,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 09:01:08,553 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-22 09:01:08,553 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-22 09:01:08,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-22 09:01:08,556 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-22 09:01:08,558 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 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-22 09:01:08,558 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-22 09:01:08,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-22 09:01:08,602 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-22 09:01:08,602 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 09:01:08,603 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 09:01:08,603 INFO L85 PathProgramCache]: Analyzing trace with hash 45317787, now seen corresponding path program 1 times [2023-11-22 09:01:08,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 09:01:08,605 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1182233043] [2023-11-22 09:01:08,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 09:01:08,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 09:01:08,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 09:01:08,862 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-22 09:01:08,862 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 09:01:08,863 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1182233043] [2023-11-22 09:01:08,863 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1182233043] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 09:01:08,863 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-22 09:01:08,863 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-22 09:01:08,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1766261592] [2023-11-22 09:01:08,864 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 09:01:08,865 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-22 09:01:08,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 09:01:08,866 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-22 09:01:08,866 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-22 09:01:08,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-22 09:01:08,867 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-22 09:01:08,867 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 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-22 09:01:08,868 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-22 09:01:08,868 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-22 09:01:08,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-22 09:01:08,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-22 09:01:08,956 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-22 09:01:08,956 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 09:01:08,957 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 09:01:08,957 INFO L85 PathProgramCache]: Analyzing trace with hash 1404853059, now seen corresponding path program 1 times [2023-11-22 09:01:08,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 09:01:08,958 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1667290972] [2023-11-22 09:01:08,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 09:01:08,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 09:01:09,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 09:01:10,035 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-22 09:01:10,036 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 09:01:10,036 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1667290972] [2023-11-22 09:01:10,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1667290972] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 09:01:10,037 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-22 09:01:10,037 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-22 09:01:10,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1041471588] [2023-11-22 09:01:10,037 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 09:01:10,038 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-22 09:01:10,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 09:01:10,038 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-22 09:01:10,039 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-22 09:01:10,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-22 09:01:10,039 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-22 09:01:10,040 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 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-22 09:01:10,040 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-22 09:01:10,041 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-11-22 09:01:10,041 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-22 09:01:10,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-22 09:01:10,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-22 09:01:10,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-22 09:01:10,211 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-22 09:01:10,216 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 09:01:10,218 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 09:01:10,218 INFO L85 PathProgramCache]: Analyzing trace with hash 599637629, now seen corresponding path program 1 times [2023-11-22 09:01:10,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 09:01:10,219 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [814251381] [2023-11-22 09:01:10,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 09:01:10,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 09:01:10,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 09:01:10,915 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-22 09:01:10,916 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 09:01:10,917 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [814251381] [2023-11-22 09:01:10,917 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [814251381] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 09:01:10,917 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-22 09:01:10,917 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-22 09:01:10,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [701387983] [2023-11-22 09:01:10,918 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 09:01:10,919 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-22 09:01:10,920 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 09:01:10,924 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-22 09:01:10,924 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-11-22 09:01:10,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-22 09:01:10,925 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-22 09:01:10,926 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 09:01:10,926 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-22 09:01:10,928 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-11-22 09:01:10,928 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-22 09:01:10,928 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-22 09:01:11,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-22 09:01:11,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-22 09:01:11,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-22 09:01:11,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-22 09:01:11,339 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-22 09:01:11,339 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 09:01:11,340 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 09:01:11,340 INFO L85 PathProgramCache]: Analyzing trace with hash 1720964931, now seen corresponding path program 1 times [2023-11-22 09:01:11,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 09:01:11,341 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1130323758] [2023-11-22 09:01:11,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 09:01:11,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 09:01:11,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 09:01:11,519 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-22 09:01:11,520 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 09:01:11,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1130323758] [2023-11-22 09:01:11,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1130323758] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 09:01:11,521 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-22 09:01:11,521 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-22 09:01:11,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1430179955] [2023-11-22 09:01:11,521 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 09:01:11,522 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-22 09:01:11,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 09:01:11,524 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-22 09:01:11,524 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-22 09:01:11,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-22 09:01:11,524 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-22 09:01:11,525 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 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-22 09:01:11,525 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-22 09:01:11,525 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-11-22 09:01:11,525 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-22 09:01:11,525 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2023-11-22 09:01:11,526 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-22 09:01:11,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-22 09:01:11,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-22 09:01:11,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-22 09:01:11,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-22 09:01:11,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-22 09:01:11,847 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-22 09:01:11,847 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 09:01:11,848 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 09:01:11,848 INFO L85 PathProgramCache]: Analyzing trace with hash 1452079588, now seen corresponding path program 1 times [2023-11-22 09:01:11,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 09:01:11,848 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1737993647] [2023-11-22 09:01:11,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 09:01:11,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 09:01:11,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 09:01:11,954 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-22 09:01:11,954 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 09:01:11,955 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1737993647] [2023-11-22 09:01:11,955 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1737993647] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 09:01:11,955 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-22 09:01:11,955 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-22 09:01:11,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [338658939] [2023-11-22 09:01:11,956 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 09:01:11,956 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-22 09:01:11,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 09:01:11,957 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-22 09:01:11,957 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-22 09:01:11,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-22 09:01:11,958 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-22 09:01:11,958 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 2 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-22 09:01:11,958 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-22 09:01:11,958 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-11-22 09:01:11,959 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-22 09:01:11,959 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2023-11-22 09:01:11,959 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-11-22 09:01:11,959 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-22 09:01:12,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-22 09:01:12,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-22 09:01:12,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-22 09:01:12,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-22 09:01:12,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-22 09:01:12,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-22 09:01:12,056 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-11-22 09:01:12,057 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-22 09:01:12,063 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2023-11-22 09:01:12,065 INFO L307 ceAbstractionStarter]: Result for error location t1Thread1of1ForFork1 was SAFE (1/3) [2023-11-22 09:01:12,068 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-22 09:01:12,069 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2023-11-22 09:01:12,069 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca97b3df-45b6-45fe-a635-e424ac4b0a7b/bin/ugemcutter-verify-ybdnMwjCTB/z3 [2023-11-22 09:01:12,096 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca97b3df-45b6-45fe-a635-e424ac4b0a7b/bin/ugemcutter-verify-ybdnMwjCTB/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2023-11-22 09:01:12,101 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca97b3df-45b6-45fe-a635-e424ac4b0a7b/bin/ugemcutter-verify-ybdnMwjCTB/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (3)] Waiting until timeout for monitored process [2023-11-22 09:01:12,102 INFO L159 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2023-11-22 09:01:12,104 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2023-11-22 09:01:12,105 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=PARTIAL_ORDER_FA, 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;@6f67f39e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-22 09:01:12,105 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2023-11-22 09:01:12,107 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-22 09:01:12,107 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 09:01:12,107 INFO L85 PathProgramCache]: Analyzing trace with hash 648967, now seen corresponding path program 1 times [2023-11-22 09:01:12,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 09:01:12,107 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1207077594] [2023-11-22 09:01:12,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 09:01:12,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 09:01:12,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 09:01:12,123 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-22 09:01:12,126 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 09:01:12,126 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1207077594] [2023-11-22 09:01:12,126 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1207077594] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 09:01:12,127 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-22 09:01:12,127 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-22 09:01:12,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1945968801] [2023-11-22 09:01:12,127 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 09:01:12,127 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-22 09:01:12,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 09:01:12,128 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-22 09:01:12,128 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-22 09:01:12,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-22 09:01:12,129 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-22 09:01:12,129 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 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-22 09:01:12,129 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-22 09:01:12,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-22 09:01:12,485 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2023-11-22 09:01:12,485 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 3 remaining) [2023-11-22 09:01:12,485 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2023-11-22 09:01:12,485 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-22 09:01:12,487 INFO L445 BasicCegarLoop]: Path program histogram: [1] [2023-11-22 09:01:12,488 INFO L307 ceAbstractionStarter]: Result for error location ULTIMATE.start was SAFE,SAFE,SAFE (2/3) [2023-11-22 09:01:12,490 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-22 09:01:12,491 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2023-11-22 09:01:12,491 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca97b3df-45b6-45fe-a635-e424ac4b0a7b/bin/ugemcutter-verify-ybdnMwjCTB/z3 [2023-11-22 09:01:12,493 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca97b3df-45b6-45fe-a635-e424ac4b0a7b/bin/ugemcutter-verify-ybdnMwjCTB/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2023-11-22 09:01:12,496 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca97b3df-45b6-45fe-a635-e424ac4b0a7b/bin/ugemcutter-verify-ybdnMwjCTB/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (4)] Waiting until timeout for monitored process [2023-11-22 09:01:12,497 INFO L159 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2023-11-22 09:01:12,499 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == t2Thread1of1ForFork0 ======== [2023-11-22 09:01:12,500 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=PARTIAL_ORDER_FA, 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;@6f67f39e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-22 09:01:12,500 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-22 09:01:12,701 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 09:01:12,702 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 09:01:12,702 INFO L85 PathProgramCache]: Analyzing trace with hash 666817930, now seen corresponding path program 1 times [2023-11-22 09:01:12,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 09:01:12,702 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1445611157] [2023-11-22 09:01:12,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 09:01:12,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 09:01:12,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 09:01:12,738 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-22 09:01:12,738 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 09:01:12,738 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1445611157] [2023-11-22 09:01:12,738 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1445611157] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 09:01:12,739 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-22 09:01:12,739 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-22 09:01:12,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [437328209] [2023-11-22 09:01:12,739 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 09:01:12,740 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-22 09:01:12,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 09:01:12,740 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-22 09:01:12,741 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-22 09:01:12,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-22 09:01:12,741 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-22 09:01:12,741 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 10.0) internal successors, (20), 2 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 09:01:12,741 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-22 09:01:12,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-22 09:01:12,826 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-22 09:01:12,826 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 09:01:12,826 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 09:01:12,826 INFO L85 PathProgramCache]: Analyzing trace with hash -869427106, now seen corresponding path program 1 times [2023-11-22 09:01:12,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 09:01:12,827 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1252077083] [2023-11-22 09:01:12,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 09:01:12,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 09:01:12,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 09:01:12,889 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-22 09:01:12,890 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 09:01:12,890 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1252077083] [2023-11-22 09:01:12,890 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1252077083] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 09:01:12,890 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-22 09:01:12,890 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-22 09:01:12,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1948717708] [2023-11-22 09:01:12,891 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 09:01:12,891 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-22 09:01:12,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 09:01:12,893 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-22 09:01:12,893 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-22 09:01:12,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-22 09:01:12,893 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-22 09:01:12,893 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 09:01:12,893 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-22 09:01:12,894 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-22 09:01:13,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-22 09:01:13,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-22 09:01:13,982 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-22 09:01:13,982 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 09:01:13,982 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 09:01:13,982 INFO L85 PathProgramCache]: Analyzing trace with hash -1293368570, now seen corresponding path program 1 times [2023-11-22 09:01:13,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 09:01:13,983 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1321105532] [2023-11-22 09:01:13,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 09:01:13,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 09:01:14,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 09:01:14,070 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-22 09:01:14,070 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 09:01:14,071 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1321105532] [2023-11-22 09:01:14,071 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1321105532] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 09:01:14,071 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-22 09:01:14,071 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-22 09:01:14,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [804358077] [2023-11-22 09:01:14,071 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 09:01:14,072 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-22 09:01:14,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 09:01:14,072 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-22 09:01:14,072 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-22 09:01:14,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-22 09:01:14,073 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-22 09:01:14,073 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 09:01:14,073 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-22 09:01:14,073 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-11-22 09:01:14,073 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-22 09:01:14,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-22 09:01:14,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-22 09:01:14,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-22 09:01:14,504 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-22 09:01:14,504 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 09:01:14,505 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 09:01:14,505 INFO L85 PathProgramCache]: Analyzing trace with hash 989324053, now seen corresponding path program 1 times [2023-11-22 09:01:14,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 09:01:14,505 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1181326991] [2023-11-22 09:01:14,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 09:01:14,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 09:01:14,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 09:01:17,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-22 09:01:17,001 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 09:01:17,002 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1181326991] [2023-11-22 09:01:17,002 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1181326991] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 09:01:17,002 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-22 09:01:17,002 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2023-11-22 09:01:17,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [921110773] [2023-11-22 09:01:17,004 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 09:01:17,005 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-11-22 09:01:17,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 09:01:17,007 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-11-22 09:01:17,008 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2023-11-22 09:01:17,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-22 09:01:17,008 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-22 09:01:17,009 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.0) internal successors, (26), 12 states have internal predecessors, (26), 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-22 09:01:17,009 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-22 09:01:17,009 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-11-22 09:01:17,009 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-11-22 09:01:17,009 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-22 09:01:17,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-22 09:01:17,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-22 09:01:17,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-22 09:01:17,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-22 09:01:17,540 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-22 09:01:17,540 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 09:01:17,541 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 09:01:17,541 INFO L85 PathProgramCache]: Analyzing trace with hash 521053307, now seen corresponding path program 1 times [2023-11-22 09:01:17,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 09:01:17,541 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [898816517] [2023-11-22 09:01:17,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 09:01:17,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 09:01:17,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 09:01:17,755 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-22 09:01:17,755 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 09:01:17,756 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [898816517] [2023-11-22 09:01:17,756 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [898816517] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 09:01:17,756 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-22 09:01:17,756 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-22 09:01:17,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2044704584] [2023-11-22 09:01:17,756 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 09:01:17,757 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-22 09:01:17,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 09:01:17,758 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-22 09:01:17,758 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-22 09:01:17,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-22 09:01:17,758 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-22 09:01:17,758 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 09:01:17,759 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-22 09:01:17,759 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-11-22 09:01:17,759 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-11-22 09:01:17,759 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2023-11-22 09:01:17,759 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-22 09:01:17,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-22 09:01:17,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-22 09:01:17,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-22 09:01:17,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-22 09:01:17,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-22 09:01:17,889 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-22 09:01:17,889 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 09:01:17,889 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 09:01:17,889 INFO L85 PathProgramCache]: Analyzing trace with hash 2028417654, now seen corresponding path program 1 times [2023-11-22 09:01:17,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 09:01:17,890 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [625038806] [2023-11-22 09:01:17,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 09:01:17,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 09:01:18,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 09:01:22,132 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-22 09:01:22,132 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 09:01:22,133 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [625038806] [2023-11-22 09:01:22,133 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [625038806] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-22 09:01:22,133 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [337907362] [2023-11-22 09:01:22,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 09:01:22,137 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-22 09:01:22,137 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca97b3df-45b6-45fe-a635-e424ac4b0a7b/bin/ugemcutter-verify-ybdnMwjCTB/z3 [2023-11-22 09:01:22,139 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca97b3df-45b6-45fe-a635-e424ac4b0a7b/bin/ugemcutter-verify-ybdnMwjCTB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-22 09:01:22,167 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca97b3df-45b6-45fe-a635-e424ac4b0a7b/bin/ugemcutter-verify-ybdnMwjCTB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-11-22 09:01:22,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 09:01:22,380 INFO L262 TraceCheckSpWp]: Trace formula consists of 324 conjuncts, 71 conjunts are in the unsatisfiable core [2023-11-22 09:01:22,403 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 09:01:22,509 INFO L349 Elim1Store]: treesize reduction 24, result has 41.5 percent of original size [2023-11-22 09:01:22,510 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 25 treesize of output 33 [2023-11-22 09:01:22,538 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2023-11-22 09:01:22,704 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 30 [2023-11-22 09:01:22,908 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 129 treesize of output 125 [2023-11-22 09:01:23,071 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 40 [2023-11-22 09:01:23,474 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 0 case distinctions, treesize of input 51 treesize of output 50 [2023-11-22 09:01:23,484 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 12 treesize of output 1 [2023-11-22 09:01:23,854 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 126 treesize of output 122 [2023-11-22 09:01:23,882 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 30 treesize of output 18 [2023-11-22 09:01:24,283 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 96 treesize of output 100 [2023-11-22 09:01:24,307 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-22 09:01:24,308 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 5 [2023-11-22 09:01:24,916 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 156 treesize of output 144 [2023-11-22 09:01:24,956 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 95 treesize of output 88 [2023-11-22 09:01:25,020 WARN L214 Elim1Store]: Array PQE input equivalent to false [2023-11-22 09:01:25,457 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 157 treesize of output 145 [2023-11-22 09:01:25,478 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 39 treesize of output 31 [2023-11-22 09:01:25,567 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-22 09:01:25,568 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-22 09:01:27,530 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse83 (= (mod c_~enqueue_flag~0 256) 0)) (.cse2 (+ (* |c_t2Thread1of1ForFork0_~i~1#1| 4) |c_~#stored_elements~0.offset|)) (.cse9 (select |c_#memory_int| |c_~#queue~0.base|)) (.cse6 (+ 1600 |c_~#queue~0.offset|))) (and (or (let ((.cse10 (+ |c_~#queue~0.offset| 1604))) (let ((.cse80 (select .cse9 .cse10))) (let ((.cse8 (+ |c_~#stored_elements~0.offset| 4 (* |c_t1Thread1of1ForFork1_~i~0#1| 4))) (.cse25 (+ (* .cse80 4) |c_~#queue~0.offset|))) (let ((.cse21 (= .cse80 402)) (.cse81 (= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (.cse82 (= .cse8 .cse25))) (let ((.cse22 (and .cse81 .cse82)) (.cse29 (not .cse82)) (.cse30 (not .cse81)) (.cse0 (not .cse21)) (.cse11 (not (= .cse80 401))) (.cse5 (+ 1608 |c_~#queue~0.offset|)) (.cse35 (forall ((v_ArrVal_525 Int)) (= 400 (select (store .cse9 .cse25 v_ArrVal_525) .cse10)))) (.cse39 (forall ((v_ArrVal_525 Int)) (not (= 400 (select (store .cse9 .cse25 v_ArrVal_525) .cse10)))))) (and (or (and (or .cse0 (forall ((v_DerPreprocessor_62 Int) (v_DerPreprocessor_63 Int) (v_DerPreprocessor_25 (Array Int Int))) (let ((.cse7 (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse9 .cse5 v_DerPreprocessor_62) .cse10 403)))) (let ((.cse1 (store (select .cse7 |c_~#stored_elements~0.base|) .cse8 v_DerPreprocessor_63))) (let ((.cse4 (select (store .cse7 |c_~#stored_elements~0.base| .cse1) |c_~#queue~0.base|))) (let ((.cse3 (select .cse4 .cse6))) (or (not (= (select (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| .cse1) |c_~#queue~0.base| v_DerPreprocessor_25) |c_~#stored_elements~0.base|) .cse2) 0)) (= 400 .cse3) (not (= v_DerPreprocessor_62 (select .cse4 .cse5))) (= (select .cse4 (+ (* 4 .cse3) |c_~#queue~0.offset|)) 0)))))))) (or .cse11 (and (forall ((v_DerPreprocessor_57 Int) (v_DerPreprocessor_58 Int) (v_DerPreprocessor_59 Int) (v_DerPreprocessor_25 (Array Int Int))) (let ((.cse16 (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse9 .cse5 v_DerPreprocessor_57) .cse10 v_DerPreprocessor_58)))) (let ((.cse13 (store (select .cse16 |c_~#stored_elements~0.base|) .cse8 v_DerPreprocessor_59))) (let ((.cse12 (select (store .cse16 |c_~#stored_elements~0.base| .cse13) |c_~#queue~0.base|))) (let ((.cse14 (select .cse12 .cse6)) (.cse15 (select .cse12 .cse10))) (or (not (= v_DerPreprocessor_57 (select .cse12 .cse5))) (not (= (select (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| .cse13) |c_~#queue~0.base| v_DerPreprocessor_25) |c_~#stored_elements~0.base|) .cse2) 0)) (= (select .cse12 (+ (* .cse14 4) |c_~#queue~0.offset|)) 0) (< (+ 2147483647 .cse15) 0) (= 400 .cse14) (< 2147483648 .cse15) (not (= v_DerPreprocessor_58 .cse15)))))))) (forall ((v_DerPreprocessor_60 Int) (v_DerPreprocessor_61 Int) (v_DerPreprocessor_25 (Array Int Int))) (let ((.cse20 (store |c_#memory_int| |c_~#queue~0.base| (store .cse9 .cse5 v_DerPreprocessor_60)))) (let ((.cse18 (store (select .cse20 |c_~#stored_elements~0.base|) .cse8 v_DerPreprocessor_61))) (let ((.cse19 (select (store .cse20 |c_~#stored_elements~0.base| .cse18) |c_~#queue~0.base|))) (let ((.cse17 (select .cse19 .cse6))) (or (= 400 .cse17) (not (= (select (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| .cse18) |c_~#queue~0.base| v_DerPreprocessor_25) |c_~#stored_elements~0.base|) .cse2) 0)) (not (= v_DerPreprocessor_60 (select .cse19 .cse5))) (= (select .cse19 (+ (* 4 .cse17) |c_~#queue~0.offset|)) 0))))))))) (or .cse21 .cse22 (forall ((v_DerPreprocessor_66 Int) (v_DerPreprocessor_67 Int) (v_DerPreprocessor_64 Int) (v_DerPreprocessor_65 Int) (v_DerPreprocessor_25 (Array Int Int))) (let ((.cse28 (store |c_#memory_int| |c_~#queue~0.base| (store (store (store .cse9 .cse25 v_DerPreprocessor_64) .cse5 v_DerPreprocessor_65) .cse10 v_DerPreprocessor_66)))) (let ((.cse24 (store (select .cse28 |c_~#stored_elements~0.base|) .cse8 v_DerPreprocessor_67))) (let ((.cse27 (select (store .cse28 |c_~#stored_elements~0.base| .cse24) |c_~#queue~0.base|))) (let ((.cse23 (select .cse27 .cse25)) (.cse26 (select .cse27 .cse6))) (or (< 2147483647 .cse23) (not (= 0 (select (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| .cse24) |c_~#queue~0.base| v_DerPreprocessor_25) |c_~#stored_elements~0.base|) .cse2))) (not (= v_DerPreprocessor_66 (+ (select (store .cse9 .cse25 .cse23) .cse10) 1))) (< (+ .cse23 2147483648) 0) (= .cse26 400) (= (select .cse27 (+ (* .cse26 4) |c_~#queue~0.offset|)) 0) (not (= v_DerPreprocessor_65 (select .cse27 .cse5)))))))))) (or .cse29 .cse30 (forall ((v_DerPreprocessor_68 Int) (|v_t1Thread1of1ForFork1_~value~0#1_15| Int) (v_DerPreprocessor_69 Int) (v_DerPreprocessor_25 (Array Int Int))) (let ((.cse34 (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse9 .cse5 v_DerPreprocessor_68) .cse10 (+ (select (store .cse9 .cse25 |v_t1Thread1of1ForFork1_~value~0#1_15|) .cse10) 1))))) (let ((.cse33 (store (select .cse34 |c_~#stored_elements~0.base|) .cse8 v_DerPreprocessor_69))) (let ((.cse31 (select (store .cse34 |c_~#stored_elements~0.base| .cse33) |c_~#queue~0.base|))) (let ((.cse32 (select .cse31 .cse6))) (or (< (+ |v_t1Thread1of1ForFork1_~value~0#1_15| 2147483648) 0) (< 2147483647 |v_t1Thread1of1ForFork1_~value~0#1_15|) (= (select .cse31 (+ (* .cse32 4) |c_~#queue~0.offset|)) 0) (= 400 .cse32) (not (= v_DerPreprocessor_68 (select .cse31 .cse5))) (not (= 0 (select (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| .cse33) |c_~#queue~0.base| v_DerPreprocessor_25) |c_~#stored_elements~0.base|) .cse2))))))))))) .cse35) (or (forall ((v_DerPreprocessor_27 (Array Int Int)) (v_DerPreprocessor_43 Int) (v_DerPreprocessor_25 (Array Int Int))) (let ((.cse38 (store |c_#memory_int| |c_~#queue~0.base| v_DerPreprocessor_27))) (let ((.cse36 (store (select .cse38 |c_~#stored_elements~0.base|) .cse8 v_DerPreprocessor_43))) (or (not (= (select (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| .cse36) |c_~#queue~0.base| v_DerPreprocessor_25) |c_~#stored_elements~0.base|) .cse2) 1)) (not (= 0 (let ((.cse37 (select (store .cse38 |c_~#stored_elements~0.base| .cse36) |c_~#queue~0.base|))) (select .cse37 (+ (* (select .cse37 .cse6) 4) |c_~#queue~0.offset|))))))))) .cse39) (or (forall ((v_DerPreprocessor_29 Int) (v_DerPreprocessor_26 (Array Int Int)) (v_DerPreprocessor_27 (Array Int Int))) (let ((.cse41 (store |c_#memory_int| |c_~#queue~0.base| v_DerPreprocessor_27))) (let ((.cse40 (store (select .cse41 |c_~#stored_elements~0.base|) .cse8 v_DerPreprocessor_29))) (or (not (= (select (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| .cse40) |c_~#queue~0.base| v_DerPreprocessor_26) |c_~#stored_elements~0.base|) .cse2) 0)) (not (= 400 (select (select (store .cse41 |c_~#stored_elements~0.base| .cse40) |c_~#queue~0.base|) .cse6))))))) .cse39) (or (and (or .cse11 (and (forall ((v_DerPreprocessor_47 Int) (v_DerPreprocessor_48 Int) (v_DerPreprocessor_25 (Array Int Int))) (let ((.cse44 (store |c_#memory_int| |c_~#queue~0.base| (store .cse9 .cse5 v_DerPreprocessor_47)))) (let ((.cse43 (store (select .cse44 |c_~#stored_elements~0.base|) .cse8 v_DerPreprocessor_48))) (let ((.cse42 (select (store .cse44 |c_~#stored_elements~0.base| .cse43) |c_~#queue~0.base|))) (or (not (= (select .cse42 (+ |c_~#queue~0.offset| (* (select .cse42 .cse6) 4))) 0)) (not (= 1 (select (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| .cse43) |c_~#queue~0.base| v_DerPreprocessor_25) |c_~#stored_elements~0.base|) .cse2))) (not (= (select .cse42 .cse5) v_DerPreprocessor_47))))))) (forall ((v_DerPreprocessor_46 Int) (v_DerPreprocessor_44 Int) (v_DerPreprocessor_45 Int) (v_DerPreprocessor_25 (Array Int Int))) (let ((.cse48 (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse9 .cse5 v_DerPreprocessor_44) .cse10 v_DerPreprocessor_45)))) (let ((.cse47 (store (select .cse48 |c_~#stored_elements~0.base|) .cse8 v_DerPreprocessor_46))) (let ((.cse45 (select (store .cse48 |c_~#stored_elements~0.base| .cse47) |c_~#queue~0.base|))) (let ((.cse46 (select .cse45 .cse10))) (or (not (= v_DerPreprocessor_44 (select .cse45 .cse5))) (not (= (select .cse45 (+ |c_~#queue~0.offset| (* (select .cse45 .cse6) 4))) 0)) (< (+ 2147483647 .cse46) 0) (not (= v_DerPreprocessor_45 .cse46)) (< 2147483648 .cse46) (not (= (select (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| .cse47) |c_~#queue~0.base| v_DerPreprocessor_25) |c_~#stored_elements~0.base|) .cse2) 1)))))))))) (or .cse21 .cse22 (forall ((v_DerPreprocessor_49 Int) (v_DerPreprocessor_50 Int) (v_DerPreprocessor_51 Int) (v_DerPreprocessor_52 Int) (v_DerPreprocessor_25 (Array Int Int))) (let ((.cse52 (store |c_#memory_int| |c_~#queue~0.base| (store (store (store .cse9 .cse25 v_DerPreprocessor_49) .cse5 v_DerPreprocessor_50) .cse10 v_DerPreprocessor_51)))) (let ((.cse51 (store (select .cse52 |c_~#stored_elements~0.base|) .cse8 v_DerPreprocessor_52))) (let ((.cse49 (select (store .cse52 |c_~#stored_elements~0.base| .cse51) |c_~#queue~0.base|))) (let ((.cse50 (select .cse49 .cse25))) (or (not (= 0 (select .cse49 (+ |c_~#queue~0.offset| (* (select .cse49 .cse6) 4))))) (< 2147483647 .cse50) (not (= (select (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| .cse51) |c_~#queue~0.base| v_DerPreprocessor_25) |c_~#stored_elements~0.base|) .cse2) 1)) (not (= v_DerPreprocessor_51 (+ (select (store .cse9 .cse25 .cse50) .cse10) 1))) (< (+ .cse50 2147483648) 0) (not (= (select .cse49 .cse5) v_DerPreprocessor_50))))))))) (or .cse29 .cse30 (forall ((|v_t1Thread1of1ForFork1_~value~0#1_15| Int) (v_DerPreprocessor_55 Int) (v_DerPreprocessor_56 Int) (v_DerPreprocessor_25 (Array Int Int))) (let ((.cse55 (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse9 .cse5 v_DerPreprocessor_55) .cse10 (+ (select (store .cse9 .cse25 |v_t1Thread1of1ForFork1_~value~0#1_15|) .cse10) 1))))) (let ((.cse54 (store (select .cse55 |c_~#stored_elements~0.base|) .cse8 v_DerPreprocessor_56))) (let ((.cse53 (select (store .cse55 |c_~#stored_elements~0.base| .cse54) |c_~#queue~0.base|))) (or (< (+ |v_t1Thread1of1ForFork1_~value~0#1_15| 2147483648) 0) (< 2147483647 |v_t1Thread1of1ForFork1_~value~0#1_15|) (not (= v_DerPreprocessor_55 (select .cse53 .cse5))) (not (= (select .cse53 (+ (* (select .cse53 .cse6) 4) |c_~#queue~0.offset|)) 0)) (not (= (select (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| .cse54) |c_~#queue~0.base| v_DerPreprocessor_25) |c_~#stored_elements~0.base|) .cse2) 1)))))))) (or (forall ((v_DerPreprocessor_53 Int) (v_DerPreprocessor_54 Int) (v_DerPreprocessor_25 (Array Int Int))) (let ((.cse58 (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse9 .cse5 v_DerPreprocessor_53) .cse10 403)))) (let ((.cse57 (store (select .cse58 |c_~#stored_elements~0.base|) .cse8 v_DerPreprocessor_54))) (let ((.cse56 (select (store .cse58 |c_~#stored_elements~0.base| .cse57) |c_~#queue~0.base|))) (or (not (= (select .cse56 (+ |c_~#queue~0.offset| (* (select .cse56 .cse6) 4))) 0)) (not (= v_DerPreprocessor_53 (select .cse56 .cse5))) (not (= (select (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| .cse57) |c_~#queue~0.base| v_DerPreprocessor_25) |c_~#stored_elements~0.base|) .cse2) 1))))))) .cse0)) .cse35) (or (and (or .cse21 .cse22 (forall ((v_DerPreprocessor_33 Int) (v_DerPreprocessor_26 (Array Int Int)) (v_DerPreprocessor_31 Int) (v_DerPreprocessor_32 Int) (v_DerPreprocessor_30 Int)) (let ((.cse62 (store |c_#memory_int| |c_~#queue~0.base| (store (store (store .cse9 .cse25 v_DerPreprocessor_30) .cse5 v_DerPreprocessor_31) .cse10 v_DerPreprocessor_32)))) (let ((.cse61 (store (select .cse62 |c_~#stored_elements~0.base|) .cse8 v_DerPreprocessor_33))) (let ((.cse60 (select (store .cse62 |c_~#stored_elements~0.base| .cse61) |c_~#queue~0.base|))) (let ((.cse59 (select .cse60 .cse25))) (or (not (= v_DerPreprocessor_32 (+ (select (store .cse9 .cse25 .cse59) .cse10) 1))) (< (+ .cse59 2147483648) 0) (not (= v_DerPreprocessor_31 (select .cse60 .cse5))) (< 2147483647 .cse59) (not (= (select (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| .cse61) |c_~#queue~0.base| v_DerPreprocessor_26) |c_~#stored_elements~0.base|) .cse2) 0)) (not (= 400 (select .cse60 .cse6)))))))))) (or .cse29 .cse30 (forall ((|v_t1Thread1of1ForFork1_~value~0#1_15| Int) (v_DerPreprocessor_26 (Array Int Int)) (v_DerPreprocessor_42 Int) (v_DerPreprocessor_41 Int)) (let ((.cse65 (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse9 .cse5 v_DerPreprocessor_41) .cse10 (+ (select (store .cse9 .cse25 |v_t1Thread1of1ForFork1_~value~0#1_15|) .cse10) 1))))) (let ((.cse63 (store (select .cse65 |c_~#stored_elements~0.base|) .cse8 v_DerPreprocessor_42))) (let ((.cse64 (select (store .cse65 |c_~#stored_elements~0.base| .cse63) |c_~#queue~0.base|))) (or (< (+ |v_t1Thread1of1ForFork1_~value~0#1_15| 2147483648) 0) (< 2147483647 |v_t1Thread1of1ForFork1_~value~0#1_15|) (not (= (select (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| .cse63) |c_~#queue~0.base| v_DerPreprocessor_26) |c_~#stored_elements~0.base|) .cse2) 0)) (not (= v_DerPreprocessor_41 (select .cse64 .cse5))) (not (= 400 (select .cse64 .cse6))))))))) (or .cse0 (forall ((v_DerPreprocessor_35 Int) (v_DerPreprocessor_34 Int) (v_DerPreprocessor_26 (Array Int Int))) (let ((.cse68 (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse9 .cse5 v_DerPreprocessor_34) .cse10 403)))) (let ((.cse67 (store (select .cse68 |c_~#stored_elements~0.base|) .cse8 v_DerPreprocessor_35))) (let ((.cse66 (select (store .cse68 |c_~#stored_elements~0.base| .cse67) |c_~#queue~0.base|))) (or (not (= (select .cse66 .cse6) 400)) (not (= (select .cse66 .cse5) v_DerPreprocessor_34)) (not (= (select (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| .cse67) |c_~#queue~0.base| v_DerPreprocessor_26) |c_~#stored_elements~0.base|) .cse2) 0)))))))) (or .cse11 (and (forall ((v_DerPreprocessor_36 Int) (v_DerPreprocessor_37 Int) (v_DerPreprocessor_38 Int) (v_DerPreprocessor_26 (Array Int Int))) (let ((.cse72 (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse9 .cse5 v_DerPreprocessor_36) .cse10 v_DerPreprocessor_37)))) (let ((.cse71 (store (select .cse72 |c_~#stored_elements~0.base|) .cse8 v_DerPreprocessor_38))) (let ((.cse69 (select (store .cse72 |c_~#stored_elements~0.base| .cse71) |c_~#queue~0.base|))) (let ((.cse70 (select .cse69 .cse10))) (or (not (= 400 (select .cse69 .cse6))) (not (= v_DerPreprocessor_37 .cse70)) (not (= (select (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| .cse71) |c_~#queue~0.base| v_DerPreprocessor_26) |c_~#stored_elements~0.base|) .cse2) 0)) (< (+ 2147483647 .cse70) 0) (< 2147483648 .cse70) (not (= v_DerPreprocessor_36 (select .cse69 .cse5))))))))) (forall ((v_DerPreprocessor_39 Int) (v_DerPreprocessor_26 (Array Int Int)) (v_DerPreprocessor_40 Int)) (let ((.cse75 (store |c_#memory_int| |c_~#queue~0.base| (store .cse9 .cse5 v_DerPreprocessor_39)))) (let ((.cse74 (store (select .cse75 |c_~#stored_elements~0.base|) .cse8 v_DerPreprocessor_40))) (let ((.cse73 (select (store .cse75 |c_~#stored_elements~0.base| .cse74) |c_~#queue~0.base|))) (or (not (= 400 (select .cse73 .cse6))) (not (= (select (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| .cse74) |c_~#queue~0.base| v_DerPreprocessor_26) |c_~#stored_elements~0.base|) .cse2) 0)) (not (= (select .cse73 .cse5) v_DerPreprocessor_39)))))))))) .cse35) (or (forall ((v_DerPreprocessor_27 (Array Int Int)) (v_DerPreprocessor_70 Int) (v_DerPreprocessor_25 (Array Int Int))) (let ((.cse79 (store |c_#memory_int| |c_~#queue~0.base| v_DerPreprocessor_27))) (let ((.cse77 (store (select .cse79 |c_~#stored_elements~0.base|) .cse8 v_DerPreprocessor_70))) (let ((.cse78 (select (store .cse79 |c_~#stored_elements~0.base| .cse77) |c_~#queue~0.base|))) (let ((.cse76 (select .cse78 .cse6))) (or (= 400 .cse76) (not (= (select (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| .cse77) |c_~#queue~0.base| v_DerPreprocessor_25) |c_~#stored_elements~0.base|) .cse2) 0)) (= (select .cse78 (+ (* .cse76 4) |c_~#queue~0.offset|)) 0))))))) .cse39))))))) .cse83) (or (not .cse83) (let ((.cse86 (select .cse9 .cse6))) (let ((.cse84 (= 400 .cse86))) (and (or (not .cse84) (forall ((v_DerPreprocessor_26 (Array Int Int))) (not (= (select (select (store |c_#memory_int| |c_~#queue~0.base| v_DerPreprocessor_26) |c_~#stored_elements~0.base|) .cse2) 0)))) (or (let ((.cse85 (= (select .cse9 (+ |c_~#queue~0.offset| (* .cse86 4))) 0))) (and (or (forall ((v_DerPreprocessor_25 (Array Int Int))) (not (= (select (select (store |c_#memory_int| |c_~#queue~0.base| v_DerPreprocessor_25) |c_~#stored_elements~0.base|) .cse2) 1))) (not .cse85)) (or (forall ((v_DerPreprocessor_25 (Array Int Int))) (not (= (select (select (store |c_#memory_int| |c_~#queue~0.base| v_DerPreprocessor_25) |c_~#stored_elements~0.base|) .cse2) 0))) .cse85))) .cse84))))))) is different from false [2023-11-22 09:01:43,835 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse15 (select |c_#memory_int| |c_~#queue~0.base|)) (.cse16 (+ |c_~#queue~0.offset| 1604))) (let ((.cse82 (select .cse15 .cse16))) (let ((.cse4 (+ |c_~#stored_elements~0.offset| 4 (* |c_t1Thread1of1ForFork1_~i~0#1| 4))) (.cse17 (+ (* .cse82 4) |c_~#queue~0.offset|))) (let ((.cse25 (= .cse82 402)) (.cse80 (= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (.cse81 (= .cse4 .cse17))) (let ((.cse5 (forall ((v_ArrVal_525 Int)) (not (= 400 (select (store .cse15 .cse17 v_ArrVal_525) .cse16))))) (.cse32 (not (= .cse82 401))) (.cse18 (not .cse81)) (.cse19 (not .cse80)) (.cse24 (not .cse25)) (.cse31 (and .cse80 .cse81)) (.cse1 (+ (* |c_t2Thread1of1ForFork0_~i~1#1| 4) |c_~#stored_elements~0.offset| 4)) (.cse3 (+ 1600 |c_~#queue~0.offset|)) (.cse13 (+ 1608 |c_~#queue~0.offset|)) (.cse42 (forall ((v_ArrVal_525 Int)) (= 400 (select (store .cse15 .cse17 v_ArrVal_525) .cse16))))) (and (or (forall ((v_DerPreprocessor_29 Int) (v_DerPreprocessor_26 (Array Int Int)) (v_DerPreprocessor_27 (Array Int Int))) (let ((.cse2 (store |c_#memory_int| |c_~#queue~0.base| v_DerPreprocessor_27))) (let ((.cse0 (store (select .cse2 |c_~#stored_elements~0.base|) .cse4 v_DerPreprocessor_29))) (or (not (= (select (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| .cse0) |c_~#queue~0.base| v_DerPreprocessor_26) |c_~#stored_elements~0.base|) .cse1) 0)) (not (= 400 (select (select (store .cse2 |c_~#stored_elements~0.base| .cse0) |c_~#queue~0.base|) .cse3))))))) .cse5) (or .cse5 (forall ((v_DerPreprocessor_27 (Array Int Int)) (v_DerPreprocessor_70 Int) (v_DerPreprocessor_25 (Array Int Int))) (let ((.cse9 (store |c_#memory_int| |c_~#queue~0.base| v_DerPreprocessor_27))) (let ((.cse8 (store (select .cse9 |c_~#stored_elements~0.base|) .cse4 v_DerPreprocessor_70))) (let ((.cse7 (select (store .cse9 |c_~#stored_elements~0.base| .cse8) |c_~#queue~0.base|))) (let ((.cse6 (select .cse7 .cse3))) (or (= 400 .cse6) (= (select .cse7 (+ (* .cse6 4) |c_~#queue~0.offset|)) 0) (not (= (select (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| .cse8) |c_~#queue~0.base| v_DerPreprocessor_25) |c_~#stored_elements~0.base|) .cse1) 0))))))))) (or (and (or (forall ((v_DerPreprocessor_68 Int) (|v_t1Thread1of1ForFork1_~value~0#1_15| Int) (v_DerPreprocessor_69 Int) (v_DerPreprocessor_25 (Array Int Int))) (let ((.cse14 (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse15 .cse13 v_DerPreprocessor_68) .cse16 (+ (select (store .cse15 .cse17 |v_t1Thread1of1ForFork1_~value~0#1_15|) .cse16) 1))))) (let ((.cse10 (store (select .cse14 |c_~#stored_elements~0.base|) .cse4 v_DerPreprocessor_69))) (let ((.cse11 (select (store .cse14 |c_~#stored_elements~0.base| .cse10) |c_~#queue~0.base|))) (let ((.cse12 (select .cse11 .cse3))) (or (not (= (select (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| .cse10) |c_~#queue~0.base| v_DerPreprocessor_25) |c_~#stored_elements~0.base|) .cse1) 0)) (< (+ |v_t1Thread1of1ForFork1_~value~0#1_15| 2147483648) 0) (< 2147483647 |v_t1Thread1of1ForFork1_~value~0#1_15|) (= (select .cse11 (+ (* .cse12 4) |c_~#queue~0.offset|)) 0) (= 400 .cse12) (not (= v_DerPreprocessor_68 (select .cse11 .cse13))))))))) .cse18 .cse19) (or (forall ((v_DerPreprocessor_62 Int) (v_DerPreprocessor_63 Int) (v_DerPreprocessor_25 (Array Int Int))) (let ((.cse23 (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse15 .cse13 v_DerPreprocessor_62) .cse16 403)))) (let ((.cse22 (store (select .cse23 |c_~#stored_elements~0.base|) .cse4 v_DerPreprocessor_63))) (let ((.cse21 (select (store .cse23 |c_~#stored_elements~0.base| .cse22) |c_~#queue~0.base|))) (let ((.cse20 (select .cse21 .cse3))) (or (= 400 .cse20) (not (= v_DerPreprocessor_62 (select .cse21 .cse13))) (not (= (select (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| .cse22) |c_~#queue~0.base| v_DerPreprocessor_25) |c_~#stored_elements~0.base|) .cse1) 0)) (= (select .cse21 (+ (* 4 .cse20) |c_~#queue~0.offset|)) 0))))))) .cse24) (or .cse25 (forall ((v_DerPreprocessor_66 Int) (v_DerPreprocessor_67 Int) (v_DerPreprocessor_64 Int) (v_DerPreprocessor_65 Int) (v_DerPreprocessor_25 (Array Int Int))) (let ((.cse30 (store |c_#memory_int| |c_~#queue~0.base| (store (store (store .cse15 .cse17 v_DerPreprocessor_64) .cse13 v_DerPreprocessor_65) .cse16 v_DerPreprocessor_66)))) (let ((.cse29 (store (select .cse30 |c_~#stored_elements~0.base|) .cse4 v_DerPreprocessor_67))) (let ((.cse28 (select (store .cse30 |c_~#stored_elements~0.base| .cse29) |c_~#queue~0.base|))) (let ((.cse26 (select .cse28 .cse17)) (.cse27 (select .cse28 .cse3))) (or (< 2147483647 .cse26) (not (= v_DerPreprocessor_66 (+ (select (store .cse15 .cse17 .cse26) .cse16) 1))) (< (+ .cse26 2147483648) 0) (= .cse27 400) (= (select .cse28 (+ (* .cse27 4) |c_~#queue~0.offset|)) 0) (not (= (select (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| .cse29) |c_~#queue~0.base| v_DerPreprocessor_25) |c_~#stored_elements~0.base|) .cse1) 0)) (not (= v_DerPreprocessor_65 (select .cse28 .cse13))))))))) .cse31) (or .cse32 (and (forall ((v_DerPreprocessor_57 Int) (v_DerPreprocessor_58 Int) (v_DerPreprocessor_59 Int) (v_DerPreprocessor_25 (Array Int Int))) (let ((.cse37 (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse15 .cse13 v_DerPreprocessor_57) .cse16 v_DerPreprocessor_58)))) (let ((.cse34 (store (select .cse37 |c_~#stored_elements~0.base|) .cse4 v_DerPreprocessor_59))) (let ((.cse33 (select (store .cse37 |c_~#stored_elements~0.base| .cse34) |c_~#queue~0.base|))) (let ((.cse35 (select .cse33 .cse3)) (.cse36 (select .cse33 .cse16))) (or (not (= v_DerPreprocessor_57 (select .cse33 .cse13))) (not (= (select (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| .cse34) |c_~#queue~0.base| v_DerPreprocessor_25) |c_~#stored_elements~0.base|) .cse1) 0)) (= (select .cse33 (+ (* .cse35 4) |c_~#queue~0.offset|)) 0) (< (+ 2147483647 .cse36) 0) (= 400 .cse35) (< 2147483648 .cse36) (not (= v_DerPreprocessor_58 .cse36)))))))) (forall ((v_DerPreprocessor_60 Int) (v_DerPreprocessor_61 Int) (v_DerPreprocessor_25 (Array Int Int))) (let ((.cse41 (store |c_#memory_int| |c_~#queue~0.base| (store .cse15 .cse13 v_DerPreprocessor_60)))) (let ((.cse40 (store (select .cse41 |c_~#stored_elements~0.base|) .cse4 v_DerPreprocessor_61))) (let ((.cse39 (select (store .cse41 |c_~#stored_elements~0.base| .cse40) |c_~#queue~0.base|))) (let ((.cse38 (select .cse39 .cse3))) (or (= 400 .cse38) (not (= v_DerPreprocessor_60 (select .cse39 .cse13))) (= (select .cse39 (+ (* 4 .cse38) |c_~#queue~0.offset|)) 0) (not (= (select (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| .cse40) |c_~#queue~0.base| v_DerPreprocessor_25) |c_~#stored_elements~0.base|) .cse1) 0))))))))))) .cse42) (or (forall ((v_DerPreprocessor_27 (Array Int Int)) (v_DerPreprocessor_43 Int) (v_DerPreprocessor_25 (Array Int Int))) (let ((.cse44 (store |c_#memory_int| |c_~#queue~0.base| v_DerPreprocessor_27))) (let ((.cse45 (store (select .cse44 |c_~#stored_elements~0.base|) .cse4 v_DerPreprocessor_43))) (or (not (= 0 (let ((.cse43 (select (store .cse44 |c_~#stored_elements~0.base| .cse45) |c_~#queue~0.base|))) (select .cse43 (+ (* (select .cse43 .cse3) 4) |c_~#queue~0.offset|))))) (not (= (select (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| .cse45) |c_~#queue~0.base| v_DerPreprocessor_25) |c_~#stored_elements~0.base|) .cse1) 1)))))) .cse5) (or (and (or .cse25 .cse31 (forall ((v_DerPreprocessor_49 Int) (v_DerPreprocessor_50 Int) (v_DerPreprocessor_51 Int) (v_DerPreprocessor_52 Int) (v_DerPreprocessor_25 (Array Int Int))) (let ((.cse49 (store |c_#memory_int| |c_~#queue~0.base| (store (store (store .cse15 .cse17 v_DerPreprocessor_49) .cse13 v_DerPreprocessor_50) .cse16 v_DerPreprocessor_51)))) (let ((.cse48 (store (select .cse49 |c_~#stored_elements~0.base|) .cse4 v_DerPreprocessor_52))) (let ((.cse46 (select (store .cse49 |c_~#stored_elements~0.base| .cse48) |c_~#queue~0.base|))) (let ((.cse47 (select .cse46 .cse17))) (or (not (= 0 (select .cse46 (+ |c_~#queue~0.offset| (* (select .cse46 .cse3) 4))))) (< 2147483647 .cse47) (not (= v_DerPreprocessor_51 (+ (select (store .cse15 .cse17 .cse47) .cse16) 1))) (not (= (select (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| .cse48) |c_~#queue~0.base| v_DerPreprocessor_25) |c_~#stored_elements~0.base|) .cse1) 1)) (< (+ .cse47 2147483648) 0) (not (= (select .cse46 .cse13) v_DerPreprocessor_50))))))))) (or (and (forall ((v_DerPreprocessor_46 Int) (v_DerPreprocessor_44 Int) (v_DerPreprocessor_45 Int) (v_DerPreprocessor_25 (Array Int Int))) (let ((.cse53 (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse15 .cse13 v_DerPreprocessor_44) .cse16 v_DerPreprocessor_45)))) (let ((.cse52 (store (select .cse53 |c_~#stored_elements~0.base|) .cse4 v_DerPreprocessor_46))) (let ((.cse50 (select (store .cse53 |c_~#stored_elements~0.base| .cse52) |c_~#queue~0.base|))) (let ((.cse51 (select .cse50 .cse16))) (or (not (= v_DerPreprocessor_44 (select .cse50 .cse13))) (not (= (select .cse50 (+ |c_~#queue~0.offset| (* (select .cse50 .cse3) 4))) 0)) (< (+ 2147483647 .cse51) 0) (not (= v_DerPreprocessor_45 .cse51)) (< 2147483648 .cse51) (not (= (select (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| .cse52) |c_~#queue~0.base| v_DerPreprocessor_25) |c_~#stored_elements~0.base|) .cse1) 1)))))))) (forall ((v_DerPreprocessor_47 Int) (v_DerPreprocessor_48 Int) (v_DerPreprocessor_25 (Array Int Int))) (let ((.cse56 (store |c_#memory_int| |c_~#queue~0.base| (store .cse15 .cse13 v_DerPreprocessor_47)))) (let ((.cse55 (store (select .cse56 |c_~#stored_elements~0.base|) .cse4 v_DerPreprocessor_48))) (let ((.cse54 (select (store .cse56 |c_~#stored_elements~0.base| .cse55) |c_~#queue~0.base|))) (or (not (= (select .cse54 (+ |c_~#queue~0.offset| (* (select .cse54 .cse3) 4))) 0)) (not (= (select (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| .cse55) |c_~#queue~0.base| v_DerPreprocessor_25) |c_~#stored_elements~0.base|) .cse1) 1)) (not (= (select .cse54 .cse13) v_DerPreprocessor_47)))))))) .cse32) (or .cse18 .cse19 (forall ((|v_t1Thread1of1ForFork1_~value~0#1_15| Int) (v_DerPreprocessor_55 Int) (v_DerPreprocessor_56 Int) (v_DerPreprocessor_25 (Array Int Int))) (let ((.cse59 (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse15 .cse13 v_DerPreprocessor_55) .cse16 (+ (select (store .cse15 .cse17 |v_t1Thread1of1ForFork1_~value~0#1_15|) .cse16) 1))))) (let ((.cse58 (store (select .cse59 |c_~#stored_elements~0.base|) .cse4 v_DerPreprocessor_56))) (let ((.cse57 (select (store .cse59 |c_~#stored_elements~0.base| .cse58) |c_~#queue~0.base|))) (or (< (+ |v_t1Thread1of1ForFork1_~value~0#1_15| 2147483648) 0) (< 2147483647 |v_t1Thread1of1ForFork1_~value~0#1_15|) (not (= v_DerPreprocessor_55 (select .cse57 .cse13))) (not (= (select .cse57 (+ (* (select .cse57 .cse3) 4) |c_~#queue~0.offset|)) 0)) (not (= (select (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| .cse58) |c_~#queue~0.base| v_DerPreprocessor_25) |c_~#stored_elements~0.base|) .cse1) 1)))))))) (or .cse24 (forall ((v_DerPreprocessor_53 Int) (v_DerPreprocessor_54 Int) (v_DerPreprocessor_25 (Array Int Int))) (let ((.cse62 (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse15 .cse13 v_DerPreprocessor_53) .cse16 403)))) (let ((.cse61 (store (select .cse62 |c_~#stored_elements~0.base|) .cse4 v_DerPreprocessor_54))) (let ((.cse60 (select (store .cse62 |c_~#stored_elements~0.base| .cse61) |c_~#queue~0.base|))) (or (not (= (select .cse60 (+ |c_~#queue~0.offset| (* (select .cse60 .cse3) 4))) 0)) (not (= (select (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| .cse61) |c_~#queue~0.base| v_DerPreprocessor_25) |c_~#stored_elements~0.base|) .cse1) 1)) (not (= v_DerPreprocessor_53 (select .cse60 .cse13)))))))))) .cse42) (or (and (or (and (forall ((v_DerPreprocessor_36 Int) (v_DerPreprocessor_37 Int) (v_DerPreprocessor_38 Int) (v_DerPreprocessor_26 (Array Int Int))) (let ((.cse66 (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse15 .cse13 v_DerPreprocessor_36) .cse16 v_DerPreprocessor_37)))) (let ((.cse63 (store (select .cse66 |c_~#stored_elements~0.base|) .cse4 v_DerPreprocessor_38))) (let ((.cse64 (select (store .cse66 |c_~#stored_elements~0.base| .cse63) |c_~#queue~0.base|))) (let ((.cse65 (select .cse64 .cse16))) (or (not (= (select (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| .cse63) |c_~#queue~0.base| v_DerPreprocessor_26) |c_~#stored_elements~0.base|) .cse1) 0)) (not (= 400 (select .cse64 .cse3))) (not (= v_DerPreprocessor_37 .cse65)) (< (+ 2147483647 .cse65) 0) (< 2147483648 .cse65) (not (= v_DerPreprocessor_36 (select .cse64 .cse13))))))))) (forall ((v_DerPreprocessor_39 Int) (v_DerPreprocessor_26 (Array Int Int)) (v_DerPreprocessor_40 Int)) (let ((.cse69 (store |c_#memory_int| |c_~#queue~0.base| (store .cse15 .cse13 v_DerPreprocessor_39)))) (let ((.cse68 (store (select .cse69 |c_~#stored_elements~0.base|) .cse4 v_DerPreprocessor_40))) (let ((.cse67 (select (store .cse69 |c_~#stored_elements~0.base| .cse68) |c_~#queue~0.base|))) (or (not (= 400 (select .cse67 .cse3))) (not (= (select .cse67 .cse13) v_DerPreprocessor_39)) (not (= (select (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| .cse68) |c_~#queue~0.base| v_DerPreprocessor_26) |c_~#stored_elements~0.base|) .cse1) 0)))))))) .cse32) (or .cse18 .cse19 (forall ((|v_t1Thread1of1ForFork1_~value~0#1_15| Int) (v_DerPreprocessor_26 (Array Int Int)) (v_DerPreprocessor_42 Int) (v_DerPreprocessor_41 Int)) (let ((.cse72 (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse15 .cse13 v_DerPreprocessor_41) .cse16 (+ (select (store .cse15 .cse17 |v_t1Thread1of1ForFork1_~value~0#1_15|) .cse16) 1))))) (let ((.cse70 (store (select .cse72 |c_~#stored_elements~0.base|) .cse4 v_DerPreprocessor_42))) (let ((.cse71 (select (store .cse72 |c_~#stored_elements~0.base| .cse70) |c_~#queue~0.base|))) (or (not (= (select (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| .cse70) |c_~#queue~0.base| v_DerPreprocessor_26) |c_~#stored_elements~0.base|) .cse1) 0)) (< (+ |v_t1Thread1of1ForFork1_~value~0#1_15| 2147483648) 0) (< 2147483647 |v_t1Thread1of1ForFork1_~value~0#1_15|) (not (= v_DerPreprocessor_41 (select .cse71 .cse13))) (not (= 400 (select .cse71 .cse3))))))))) (or .cse24 (forall ((v_DerPreprocessor_35 Int) (v_DerPreprocessor_34 Int) (v_DerPreprocessor_26 (Array Int Int))) (let ((.cse75 (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse15 .cse13 v_DerPreprocessor_34) .cse16 403)))) (let ((.cse74 (store (select .cse75 |c_~#stored_elements~0.base|) .cse4 v_DerPreprocessor_35))) (let ((.cse73 (select (store .cse75 |c_~#stored_elements~0.base| .cse74) |c_~#queue~0.base|))) (or (not (= (select .cse73 .cse3) 400)) (not (= (select .cse73 .cse13) v_DerPreprocessor_34)) (not (= (select (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| .cse74) |c_~#queue~0.base| v_DerPreprocessor_26) |c_~#stored_elements~0.base|) .cse1) 0)))))))) (or .cse25 .cse31 (forall ((v_DerPreprocessor_33 Int) (v_DerPreprocessor_26 (Array Int Int)) (v_DerPreprocessor_31 Int) (v_DerPreprocessor_32 Int) (v_DerPreprocessor_30 Int)) (let ((.cse79 (store |c_#memory_int| |c_~#queue~0.base| (store (store (store .cse15 .cse17 v_DerPreprocessor_30) .cse13 v_DerPreprocessor_31) .cse16 v_DerPreprocessor_32)))) (let ((.cse78 (store (select .cse79 |c_~#stored_elements~0.base|) .cse4 v_DerPreprocessor_33))) (let ((.cse77 (select (store .cse79 |c_~#stored_elements~0.base| .cse78) |c_~#queue~0.base|))) (let ((.cse76 (select .cse77 .cse17))) (or (not (= v_DerPreprocessor_32 (+ (select (store .cse15 .cse17 .cse76) .cse16) 1))) (< (+ .cse76 2147483648) 0) (not (= v_DerPreprocessor_31 (select .cse77 .cse13))) (< 2147483647 .cse76) (not (= (select (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| .cse78) |c_~#queue~0.base| v_DerPreprocessor_26) |c_~#stored_elements~0.base|) .cse1) 0)) (not (= 400 (select .cse77 .cse3))))))))))) .cse42))))))) is different from false [2023-11-22 09:01:47,165 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 30 treesize of output 18 [2023-11-22 09:01:47,186 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 30 treesize of output 18 [2023-11-22 09:01:51,963 INFO L349 Elim1Store]: treesize reduction 30, result has 80.0 percent of original size [2023-11-22 09:01:51,964 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 6 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 8 new quantified variables, introduced 18 case distinctions, treesize of input 2116 treesize of output 1698