./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/goblint-regression/28-race_reach_75-tricky_address2_racefree.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0e0057cc 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_f3a5cbb6-c03d-425b-a860-16031649589e/bin/ugemcutter-verify-Bi2udmvEmx/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3a5cbb6-c03d-425b-a860-16031649589e/bin/ugemcutter-verify-Bi2udmvEmx/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3a5cbb6-c03d-425b-a860-16031649589e/bin/ugemcutter-verify-Bi2udmvEmx/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3a5cbb6-c03d-425b-a860-16031649589e/bin/ugemcutter-verify-Bi2udmvEmx/config/GemCutterReach.xml -i ../../sv-benchmarks/c/goblint-regression/28-race_reach_75-tricky_address2_racefree.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3a5cbb6-c03d-425b-a860-16031649589e/bin/ugemcutter-verify-Bi2udmvEmx/config/svcomp-Reach-32bit-GemCutter_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3a5cbb6-c03d-425b-a860-16031649589e/bin/ugemcutter-verify-Bi2udmvEmx --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 3c0354ee6107efc04d15102ecf9eef73430e38e14b70f16419cd07cd733fd0df --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-12-02 20:25:16,330 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-02 20:25:16,395 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3a5cbb6-c03d-425b-a860-16031649589e/bin/ugemcutter-verify-Bi2udmvEmx/config/svcomp-Reach-32bit-GemCutter_Default.epf [2023-12-02 20:25:16,399 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-02 20:25:16,400 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-02 20:25:16,422 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-02 20:25:16,422 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-02 20:25:16,423 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-02 20:25:16,424 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-02 20:25:16,424 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-02 20:25:16,425 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-02 20:25:16,425 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-02 20:25:16,426 INFO L153 SettingsManager]: * Use SBE=true [2023-12-02 20:25:16,426 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-02 20:25:16,427 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-02 20:25:16,427 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-02 20:25:16,428 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-02 20:25:16,428 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-02 20:25:16,429 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-02 20:25:16,429 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-02 20:25:16,429 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-02 20:25:16,432 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-02 20:25:16,432 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-02 20:25:16,432 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-02 20:25:16,433 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-02 20:25:16,433 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-02 20:25:16,433 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-02 20:25:16,434 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-02 20:25:16,434 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-02 20:25:16,434 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-02 20:25:16,435 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-02 20:25:16,435 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-02 20:25:16,435 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-02 20:25:16,436 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-02 20:25:16,436 INFO L153 SettingsManager]: * DFS Order used in POR=LOOP_LOCKSTEP [2023-12-02 20:25:16,437 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-02 20:25:16,437 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-02 20:25:16,437 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2023-12-02 20:25:16,437 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-02 20:25:16,437 INFO L153 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2023-12-02 20:25:16,438 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2023-12-02 20:25:16,438 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_f3a5cbb6-c03d-425b-a860-16031649589e/bin/ugemcutter-verify-Bi2udmvEmx/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_f3a5cbb6-c03d-425b-a860-16031649589e/bin/ugemcutter-verify-Bi2udmvEmx 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 -> 3c0354ee6107efc04d15102ecf9eef73430e38e14b70f16419cd07cd733fd0df [2023-12-02 20:25:16,689 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-02 20:25:16,714 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-02 20:25:16,717 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-02 20:25:16,718 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-02 20:25:16,719 INFO L274 PluginConnector]: CDTParser initialized [2023-12-02 20:25:16,719 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3a5cbb6-c03d-425b-a860-16031649589e/bin/ugemcutter-verify-Bi2udmvEmx/../../sv-benchmarks/c/goblint-regression/28-race_reach_75-tricky_address2_racefree.i [2023-12-02 20:25:19,457 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-02 20:25:19,695 INFO L384 CDTParser]: Found 1 translation units. [2023-12-02 20:25:19,695 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3a5cbb6-c03d-425b-a860-16031649589e/sv-benchmarks/c/goblint-regression/28-race_reach_75-tricky_address2_racefree.i [2023-12-02 20:25:19,713 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3a5cbb6-c03d-425b-a860-16031649589e/bin/ugemcutter-verify-Bi2udmvEmx/data/fc2c8537b/638737820c6c4e23a5506a334bae5118/FLAG02458d97b [2023-12-02 20:25:19,727 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3a5cbb6-c03d-425b-a860-16031649589e/bin/ugemcutter-verify-Bi2udmvEmx/data/fc2c8537b/638737820c6c4e23a5506a334bae5118 [2023-12-02 20:25:19,730 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-02 20:25:19,731 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-12-02 20:25:19,733 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-02 20:25:19,733 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-02 20:25:19,738 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-02 20:25:19,738 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 08:25:19" (1/1) ... [2023-12-02 20:25:19,740 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5d6c00b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:25:19, skipping insertion in model container [2023-12-02 20:25:19,740 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 08:25:19" (1/1) ... [2023-12-02 20:25:19,790 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-02 20:25:20,245 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_f3a5cbb6-c03d-425b-a860-16031649589e/sv-benchmarks/c/goblint-regression/28-race_reach_75-tricky_address2_racefree.i[41323,41336] [2023-12-02 20:25:20,275 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-02 20:25:20,294 INFO L202 MainTranslator]: Completed pre-run [2023-12-02 20:25:20,332 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_f3a5cbb6-c03d-425b-a860-16031649589e/sv-benchmarks/c/goblint-regression/28-race_reach_75-tricky_address2_racefree.i[41323,41336] [2023-12-02 20:25:20,344 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-02 20:25:20,407 INFO L206 MainTranslator]: Completed translation [2023-12-02 20:25:20,408 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:25:20 WrapperNode [2023-12-02 20:25:20,408 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-02 20:25:20,409 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-02 20:25:20,409 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-02 20:25:20,409 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-02 20:25:20,416 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:25:20" (1/1) ... [2023-12-02 20:25:20,436 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:25:20" (1/1) ... [2023-12-02 20:25:20,482 INFO L138 Inliner]: procedures = 271, calls = 49, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 216 [2023-12-02 20:25:20,483 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-02 20:25:20,484 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-02 20:25:20,484 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-02 20:25:20,484 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-02 20:25:20,497 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:25:20" (1/1) ... [2023-12-02 20:25:20,497 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:25:20" (1/1) ... [2023-12-02 20:25:20,502 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:25:20" (1/1) ... [2023-12-02 20:25:20,503 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:25:20" (1/1) ... [2023-12-02 20:25:20,512 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:25:20" (1/1) ... [2023-12-02 20:25:20,517 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:25:20" (1/1) ... [2023-12-02 20:25:20,530 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:25:20" (1/1) ... [2023-12-02 20:25:20,532 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:25:20" (1/1) ... [2023-12-02 20:25:20,536 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-02 20:25:20,537 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-02 20:25:20,537 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-02 20:25:20,537 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-02 20:25:20,538 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:25:20" (1/1) ... [2023-12-02 20:25:20,544 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-02 20:25:20,554 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3a5cbb6-c03d-425b-a860-16031649589e/bin/ugemcutter-verify-Bi2udmvEmx/z3 [2023-12-02 20:25:20,567 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3a5cbb6-c03d-425b-a860-16031649589e/bin/ugemcutter-verify-Bi2udmvEmx/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-12-02 20:25:20,577 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3a5cbb6-c03d-425b-a860-16031649589e/bin/ugemcutter-verify-Bi2udmvEmx/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-12-02 20:25:20,601 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-12-02 20:25:20,601 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-12-02 20:25:20,601 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2023-12-02 20:25:20,601 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-12-02 20:25:20,601 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-12-02 20:25:20,602 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2023-12-02 20:25:20,602 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-02 20:25:20,602 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2023-12-02 20:25:20,602 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2023-12-02 20:25:20,602 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-12-02 20:25:20,602 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-02 20:25:20,602 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-02 20:25:20,604 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-12-02 20:25:20,751 INFO L241 CfgBuilder]: Building ICFG [2023-12-02 20:25:20,753 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-02 20:25:21,030 INFO L282 CfgBuilder]: Performing block encoding [2023-12-02 20:25:21,187 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-02 20:25:21,187 INFO L309 CfgBuilder]: Removed 23 assume(true) statements. [2023-12-02 20:25:21,187 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 08:25:21 BoogieIcfgContainer [2023-12-02 20:25:21,187 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-02 20:25:21,190 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-02 20:25:21,190 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-02 20:25:21,192 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-02 20:25:21,193 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 08:25:19" (1/3) ... [2023-12-02 20:25:21,193 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@57c9d4e3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 08:25:21, skipping insertion in model container [2023-12-02 20:25:21,193 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:25:20" (2/3) ... [2023-12-02 20:25:21,194 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@57c9d4e3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 08:25:21, skipping insertion in model container [2023-12-02 20:25:21,194 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 08:25:21" (3/3) ... [2023-12-02 20:25:21,195 INFO L112 eAbstractionObserver]: Analyzing ICFG 28-race_reach_75-tricky_address2_racefree.i [2023-12-02 20:25:21,203 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-12-02 20:25:21,211 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-02 20:25:21,211 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-12-02 20:25:21,211 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-12-02 20:25:21,255 INFO L144 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2023-12-02 20:25:21,293 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-02 20:25:21,294 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2023-12-02 20:25:21,294 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3a5cbb6-c03d-425b-a860-16031649589e/bin/ugemcutter-verify-Bi2udmvEmx/z3 [2023-12-02 20:25:21,296 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3a5cbb6-c03d-425b-a860-16031649589e/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2023-12-02 20:25:21,298 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3a5cbb6-c03d-425b-a860-16031649589e/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2023-12-02 20:25:21,329 INFO L159 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2023-12-02 20:25:21,342 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == t_funThread1of1ForFork0 ======== [2023-12-02 20:25:21,348 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;@470b3d7d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-02 20:25:21,349 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-02 20:25:21,499 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 20:25:21,503 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 20:25:21,504 INFO L85 PathProgramCache]: Analyzing trace with hash -1957889072, now seen corresponding path program 1 times [2023-12-02 20:25:21,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-02 20:25:21,511 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [629319296] [2023-12-02 20:25:21,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 20:25:21,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 20:25:21,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 20:25:21,772 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-12-02 20:25:21,772 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-02 20:25:21,772 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [629319296] [2023-12-02 20:25:21,773 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [629319296] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 20:25:21,773 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 20:25:21,773 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-02 20:25:21,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2090739282] [2023-12-02 20:25:21,775 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 20:25:21,778 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-02 20:25:21,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-02 20:25:21,798 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-02 20:25:21,799 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 20:25:21,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:25:21,801 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-12-02 20:25:21,801 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 2 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-12-02 20:25:21,802 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:25:22,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:25:22,416 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-02 20:25:22,416 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 20:25:22,417 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 20:25:22,417 INFO L85 PathProgramCache]: Analyzing trace with hash -676058371, now seen corresponding path program 1 times [2023-12-02 20:25:22,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-02 20:25:22,417 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [819531232] [2023-12-02 20:25:22,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 20:25:22,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 20:25:22,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 20:25:22,520 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-12-02 20:25:22,520 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-02 20:25:22,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [819531232] [2023-12-02 20:25:22,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [819531232] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 20:25:22,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [105275059] [2023-12-02 20:25:22,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 20:25:22,521 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 20:25:22,521 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3a5cbb6-c03d-425b-a860-16031649589e/bin/ugemcutter-verify-Bi2udmvEmx/z3 [2023-12-02 20:25:22,547 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3a5cbb6-c03d-425b-a860-16031649589e/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 20:25:22,548 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3a5cbb6-c03d-425b-a860-16031649589e/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-12-02 20:25:22,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 20:25:22,639 INFO L262 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-02 20:25:22,644 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 20:25:22,680 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-12-02 20:25:22,680 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 20:25:22,699 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-12-02 20:25:22,699 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [105275059] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 20:25:22,700 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 20:25:22,700 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2023-12-02 20:25:22,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1852654810] [2023-12-02 20:25:22,701 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 20:25:22,701 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-02 20:25:22,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-02 20:25:22,702 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-02 20:25:22,703 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2023-12-02 20:25:22,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:25:22,703 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-12-02 20:25:22,704 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.0) internal successors, (21), 6 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-12-02 20:25:22,704 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:25:22,704 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:25:22,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:25:22,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-02 20:25:22,881 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3a5cbb6-c03d-425b-a860-16031649589e/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-12-02 20:25:23,076 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3a5cbb6-c03d-425b-a860-16031649589e/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 20:25:23,076 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 20:25:23,077 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 20:25:23,077 INFO L85 PathProgramCache]: Analyzing trace with hash 184355689, now seen corresponding path program 2 times [2023-12-02 20:25:23,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-02 20:25:23,078 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1565786284] [2023-12-02 20:25:23,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 20:25:23,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 20:25:23,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 20:25:23,224 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-12-02 20:25:23,224 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-02 20:25:23,224 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1565786284] [2023-12-02 20:25:23,225 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1565786284] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 20:25:23,225 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1733615086] [2023-12-02 20:25:23,225 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-02 20:25:23,225 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 20:25:23,225 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3a5cbb6-c03d-425b-a860-16031649589e/bin/ugemcutter-verify-Bi2udmvEmx/z3 [2023-12-02 20:25:23,228 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3a5cbb6-c03d-425b-a860-16031649589e/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 20:25:23,232 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3a5cbb6-c03d-425b-a860-16031649589e/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-12-02 20:25:23,331 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-02 20:25:23,331 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-02 20:25:23,333 INFO L262 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-02 20:25:23,334 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 20:25:23,354 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-12-02 20:25:23,354 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 20:25:23,413 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-12-02 20:25:23,413 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1733615086] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 20:25:23,413 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 20:25:23,413 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2023-12-02 20:25:23,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [166858835] [2023-12-02 20:25:23,414 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 20:25:23,414 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-12-02 20:25:23,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-02 20:25:23,415 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-12-02 20:25:23,416 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2023-12-02 20:25:23,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:25:23,416 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-12-02 20:25:23,416 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.076923076923077) internal successors, (27), 12 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 20:25:23,416 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:25:23,416 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-12-02 20:25:23,417 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:25:23,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:25:23,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-02 20:25:23,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-12-02 20:25:23,572 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3a5cbb6-c03d-425b-a860-16031649589e/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2023-12-02 20:25:23,767 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3a5cbb6-c03d-425b-a860-16031649589e/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 20:25:23,767 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 20:25:23,768 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 20:25:23,768 INFO L85 PathProgramCache]: Analyzing trace with hash 2063278825, now seen corresponding path program 3 times [2023-12-02 20:25:23,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-02 20:25:23,768 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [139381978] [2023-12-02 20:25:23,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 20:25:23,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 20:25:23,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 20:25:24,105 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-12-02 20:25:24,106 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-02 20:25:24,106 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [139381978] [2023-12-02 20:25:24,106 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [139381978] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 20:25:24,106 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1949684053] [2023-12-02 20:25:24,106 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-02 20:25:24,106 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 20:25:24,107 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3a5cbb6-c03d-425b-a860-16031649589e/bin/ugemcutter-verify-Bi2udmvEmx/z3 [2023-12-02 20:25:24,108 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3a5cbb6-c03d-425b-a860-16031649589e/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 20:25:24,112 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3a5cbb6-c03d-425b-a860-16031649589e/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-12-02 20:25:24,214 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-12-02 20:25:24,214 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-02 20:25:24,215 INFO L262 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 18 conjunts are in the unsatisfiable core [2023-12-02 20:25:24,218 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 20:25:24,251 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2023-12-02 20:25:24,345 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-12-02 20:25:24,345 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-12-02 20:25:24,370 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 15 treesize of output 10 [2023-12-02 20:25:24,432 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 15 treesize of output 10 [2023-12-02 20:25:24,470 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 33 [2023-12-02 20:25:24,484 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2023-12-02 20:25:24,484 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 20:25:30,537 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_140 (Array Int Int)) (|~#a~0.offset| Int) (|t_funThread1of1ForFork0_~i~0#1| Int)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_140) |c_~#a~0.base|) (+ (* |t_funThread1of1ForFork0_~i~0#1| 28) |~#a~0.offset|)) 0)) is different from false [2023-12-02 20:25:30,720 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 1 not checked. [2023-12-02 20:25:30,720 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1949684053] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 20:25:30,721 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 20:25:30,721 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 12 [2023-12-02 20:25:30,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2072728163] [2023-12-02 20:25:30,721 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 20:25:30,722 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-12-02 20:25:30,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-02 20:25:30,723 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-12-02 20:25:30,723 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=95, Unknown=1, NotChecked=20, Total=156 [2023-12-02 20:25:30,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:25:30,723 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-12-02 20:25:30,724 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.5384615384615383) internal successors, (46), 12 states have internal predecessors, (46), 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-12-02 20:25:30,724 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:25:30,724 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-12-02 20:25:30,724 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2023-12-02 20:25:30,724 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:25:31,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:25:31,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-02 20:25:31,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-12-02 20:25:31,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-02 20:25:31,157 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3a5cbb6-c03d-425b-a860-16031649589e/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2023-12-02 20:25:31,352 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3a5cbb6-c03d-425b-a860-16031649589e/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 20:25:31,352 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 20:25:31,352 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 20:25:31,353 INFO L85 PathProgramCache]: Analyzing trace with hash 538921772, now seen corresponding path program 1 times [2023-12-02 20:25:31,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-02 20:25:31,353 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1238395047] [2023-12-02 20:25:31,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 20:25:31,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 20:25:31,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 20:25:31,451 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-12-02 20:25:31,451 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-02 20:25:31,451 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1238395047] [2023-12-02 20:25:31,451 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1238395047] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 20:25:31,452 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [195895907] [2023-12-02 20:25:31,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 20:25:31,452 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 20:25:31,452 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3a5cbb6-c03d-425b-a860-16031649589e/bin/ugemcutter-verify-Bi2udmvEmx/z3 [2023-12-02 20:25:31,456 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3a5cbb6-c03d-425b-a860-16031649589e/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 20:25:31,460 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3a5cbb6-c03d-425b-a860-16031649589e/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-12-02 20:25:31,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 20:25:31,576 INFO L262 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-02 20:25:31,579 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 20:25:31,585 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-12-02 20:25:31,597 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2023-12-02 20:25:31,597 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 20:25:31,597 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [195895907] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 20:25:31,598 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-02 20:25:31,598 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2023-12-02 20:25:31,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [27948157] [2023-12-02 20:25:31,598 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 20:25:31,599 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-02 20:25:31,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-02 20:25:31,599 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-02 20:25:31,600 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-12-02 20:25:31,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:25:31,600 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-12-02 20:25:31,600 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 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-12-02 20:25:31,600 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:25:31,600 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-12-02 20:25:31,600 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2023-12-02 20:25:31,601 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-12-02 20:25:31,601 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:25:31,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:25:31,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-02 20:25:31,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-12-02 20:25:31,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-02 20:25:31,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:25:31,784 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3a5cbb6-c03d-425b-a860-16031649589e/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2023-12-02 20:25:31,979 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3a5cbb6-c03d-425b-a860-16031649589e/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 20:25:31,980 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 20:25:31,980 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 20:25:31,980 INFO L85 PathProgramCache]: Analyzing trace with hash 446472496, now seen corresponding path program 1 times [2023-12-02 20:25:31,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-02 20:25:31,980 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [15259423] [2023-12-02 20:25:31,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 20:25:31,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 20:25:32,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 20:25:32,061 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-12-02 20:25:32,062 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-02 20:25:32,062 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [15259423] [2023-12-02 20:25:32,062 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [15259423] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 20:25:32,062 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [618169934] [2023-12-02 20:25:32,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 20:25:32,063 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 20:25:32,063 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3a5cbb6-c03d-425b-a860-16031649589e/bin/ugemcutter-verify-Bi2udmvEmx/z3 [2023-12-02 20:25:32,064 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3a5cbb6-c03d-425b-a860-16031649589e/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 20:25:32,073 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3a5cbb6-c03d-425b-a860-16031649589e/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-12-02 20:25:32,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 20:25:32,187 INFO L262 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-02 20:25:32,189 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 20:25:32,208 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-12-02 20:25:32,209 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 20:25:32,235 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-12-02 20:25:32,235 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [618169934] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 20:25:32,235 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 20:25:32,235 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2023-12-02 20:25:32,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [940733610] [2023-12-02 20:25:32,236 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 20:25:32,236 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-02 20:25:32,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-02 20:25:32,237 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-02 20:25:32,237 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2023-12-02 20:25:32,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:25:32,237 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-12-02 20:25:32,238 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 7 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 20:25:32,238 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:25:32,238 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-12-02 20:25:32,238 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2023-12-02 20:25:32,238 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-12-02 20:25:32,238 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:25:32,238 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:25:32,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:25:32,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-02 20:25:32,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-12-02 20:25:32,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-02 20:25:32,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:25:32,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-02 20:25:32,334 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-02 20:25:32,339 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3a5cbb6-c03d-425b-a860-16031649589e/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2023-12-02 20:25:32,535 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3a5cbb6-c03d-425b-a860-16031649589e/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 20:25:32,540 INFO L445 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1] [2023-12-02 20:25:32,541 INFO L307 ceAbstractionStarter]: Result for error location t_funThread1of1ForFork0 was SAFE (1/2) [2023-12-02 20:25:32,545 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-02 20:25:32,545 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2023-12-02 20:25:32,546 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3a5cbb6-c03d-425b-a860-16031649589e/bin/ugemcutter-verify-Bi2udmvEmx/z3 [2023-12-02 20:25:32,546 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3a5cbb6-c03d-425b-a860-16031649589e/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2023-12-02 20:25:32,547 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3a5cbb6-c03d-425b-a860-16031649589e/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (8)] Waiting until timeout for monitored process [2023-12-02 20:25:32,550 INFO L159 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2023-12-02 20:25:32,550 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2023-12-02 20:25:32,551 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;@470b3d7d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-02 20:25:32,551 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2023-12-02 20:25:32,613 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-12-02 20:25:32,613 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 20:25:32,613 INFO L85 PathProgramCache]: Analyzing trace with hash 942037046, now seen corresponding path program 1 times [2023-12-02 20:25:32,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-02 20:25:32,614 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [660916073] [2023-12-02 20:25:32,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 20:25:32,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 20:25:32,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 20:25:32,645 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-12-02 20:25:32,645 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-02 20:25:32,645 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [660916073] [2023-12-02 20:25:32,646 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [660916073] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 20:25:32,646 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 20:25:32,646 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-02 20:25:32,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1750617506] [2023-12-02 20:25:32,646 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 20:25:32,646 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-02 20:25:32,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-02 20:25:32,647 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-02 20:25:32,647 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 20:25:32,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:25:32,647 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-12-02 20:25:32,648 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 20:25:32,648 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:25:32,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:25:32,678 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-12-02 20:25:32,678 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-12-02 20:25:32,678 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 20:25:32,678 INFO L85 PathProgramCache]: Analyzing trace with hash -1189696879, now seen corresponding path program 1 times [2023-12-02 20:25:32,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-02 20:25:32,679 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1484438146] [2023-12-02 20:25:32,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 20:25:32,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 20:25:32,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 20:25:32,718 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-12-02 20:25:32,718 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-02 20:25:32,718 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1484438146] [2023-12-02 20:25:32,718 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1484438146] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 20:25:32,718 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [757665583] [2023-12-02 20:25:32,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 20:25:32,718 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 20:25:32,719 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3a5cbb6-c03d-425b-a860-16031649589e/bin/ugemcutter-verify-Bi2udmvEmx/z3 [2023-12-02 20:25:32,722 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3a5cbb6-c03d-425b-a860-16031649589e/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 20:25:32,724 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3a5cbb6-c03d-425b-a860-16031649589e/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-12-02 20:25:32,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 20:25:32,815 INFO L262 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-02 20:25:32,816 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 20:25:32,828 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-12-02 20:25:32,828 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 20:25:32,844 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-12-02 20:25:32,844 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [757665583] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 20:25:32,844 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 20:25:32,844 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2023-12-02 20:25:32,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1421508329] [2023-12-02 20:25:32,844 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 20:25:32,845 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-02 20:25:32,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-02 20:25:32,846 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-02 20:25:32,846 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2023-12-02 20:25:32,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:25:32,846 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-12-02 20:25:32,846 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 6 states have internal predecessors, (17), 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-12-02 20:25:32,846 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:25:32,847 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:25:32,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:25:32,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-02 20:25:32,884 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3a5cbb6-c03d-425b-a860-16031649589e/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2023-12-02 20:25:33,079 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3a5cbb6-c03d-425b-a860-16031649589e/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2023-12-02 20:25:33,079 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-12-02 20:25:33,080 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 20:25:33,080 INFO L85 PathProgramCache]: Analyzing trace with hash -463953667, now seen corresponding path program 2 times [2023-12-02 20:25:33,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-02 20:25:33,080 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1295546987] [2023-12-02 20:25:33,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 20:25:33,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 20:25:33,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 20:25:33,168 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-12-02 20:25:33,168 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-02 20:25:33,168 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1295546987] [2023-12-02 20:25:33,168 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1295546987] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 20:25:33,168 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1384360190] [2023-12-02 20:25:33,168 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-02 20:25:33,168 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 20:25:33,169 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3a5cbb6-c03d-425b-a860-16031649589e/bin/ugemcutter-verify-Bi2udmvEmx/z3 [2023-12-02 20:25:33,169 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3a5cbb6-c03d-425b-a860-16031649589e/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 20:25:33,172 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3a5cbb6-c03d-425b-a860-16031649589e/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-12-02 20:25:33,270 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-02 20:25:33,271 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-02 20:25:33,272 INFO L262 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-02 20:25:33,273 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 20:25:33,289 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-12-02 20:25:33,289 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 20:25:33,341 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-12-02 20:25:33,342 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1384360190] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 20:25:33,342 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 20:25:33,342 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2023-12-02 20:25:33,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1479174041] [2023-12-02 20:25:33,343 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 20:25:33,343 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-12-02 20:25:33,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-02 20:25:33,344 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-12-02 20:25:33,344 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2023-12-02 20:25:33,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:25:33,344 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-12-02 20:25:33,345 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 1.7692307692307692) internal successors, (23), 12 states have internal predecessors, (23), 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-12-02 20:25:33,345 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:25:33,345 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-12-02 20:25:33,345 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:25:33,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:25:33,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-02 20:25:33,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-12-02 20:25:33,393 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3a5cbb6-c03d-425b-a860-16031649589e/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2023-12-02 20:25:33,593 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3a5cbb6-c03d-425b-a860-16031649589e/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 20:25:33,594 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-12-02 20:25:33,594 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 20:25:33,594 INFO L85 PathProgramCache]: Analyzing trace with hash 1510897789, now seen corresponding path program 3 times [2023-12-02 20:25:33,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-02 20:25:33,594 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1138312988] [2023-12-02 20:25:33,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 20:25:33,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 20:25:33,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-02 20:25:33,618 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-02 20:25:33,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-02 20:25:33,655 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-12-02 20:25:33,656 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-12-02 20:25:33,656 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2023-12-02 20:25:33,656 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2023-12-02 20:25:33,656 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-12-02 20:25:33,658 INFO L445 BasicCegarLoop]: Path program histogram: [3, 1] [2023-12-02 20:25:33,658 INFO L307 ceAbstractionStarter]: Result for error location ULTIMATE.start was UNSAFE,UNKNOWN (2/2) [2023-12-02 20:25:33,659 WARN L233 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2023-12-02 20:25:33,659 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2023-12-02 20:25:33,686 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2023-12-02 20:25:33,689 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-02 20:25:33,689 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2023-12-02 20:25:33,689 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3a5cbb6-c03d-425b-a860-16031649589e/bin/ugemcutter-verify-Bi2udmvEmx/z3 [2023-12-02 20:25:33,690 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3a5cbb6-c03d-425b-a860-16031649589e/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2023-12-02 20:25:33,696 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3a5cbb6-c03d-425b-a860-16031649589e/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (11)] Waiting until timeout for monitored process [2023-12-02 20:25:33,698 INFO L159 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2023-12-02 20:25:33,698 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == t_funThread1of2ForFork0 ======== [2023-12-02 20:25:33,699 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;@470b3d7d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-02 20:25:33,699 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-02 20:25:34,042 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 20:25:34,043 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 20:25:34,043 INFO L85 PathProgramCache]: Analyzing trace with hash -1096242198, now seen corresponding path program 1 times [2023-12-02 20:25:34,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-02 20:25:34,043 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [159110631] [2023-12-02 20:25:34,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 20:25:34,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 20:25:34,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 20:25:34,089 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-12-02 20:25:34,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-02 20:25:34,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [159110631] [2023-12-02 20:25:34,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [159110631] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 20:25:34,090 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 20:25:34,090 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-02 20:25:34,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2022832185] [2023-12-02 20:25:34,090 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 20:25:34,090 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-02 20:25:34,090 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-02 20:25:34,091 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-02 20:25:34,091 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 20:25:34,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:25:34,091 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-12-02 20:25:34,091 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 2 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 20:25:34,091 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:25:38,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:25:38,578 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-12-02 20:25:38,578 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 20:25:38,578 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 20:25:38,579 INFO L85 PathProgramCache]: Analyzing trace with hash -1538588662, now seen corresponding path program 1 times [2023-12-02 20:25:38,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-02 20:25:38,579 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1638909173] [2023-12-02 20:25:38,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 20:25:38,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 20:25:38,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 20:25:38,619 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-12-02 20:25:38,619 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-02 20:25:38,619 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1638909173] [2023-12-02 20:25:38,619 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1638909173] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 20:25:38,619 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [325358710] [2023-12-02 20:25:38,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 20:25:38,619 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 20:25:38,620 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3a5cbb6-c03d-425b-a860-16031649589e/bin/ugemcutter-verify-Bi2udmvEmx/z3 [2023-12-02 20:25:38,623 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3a5cbb6-c03d-425b-a860-16031649589e/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 20:25:38,636 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3a5cbb6-c03d-425b-a860-16031649589e/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2023-12-02 20:25:38,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 20:25:38,748 INFO L262 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-02 20:25:38,750 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 20:25:38,759 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-12-02 20:25:38,759 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 20:25:38,773 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-12-02 20:25:38,774 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [325358710] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 20:25:38,774 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 20:25:38,774 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2023-12-02 20:25:38,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [536110042] [2023-12-02 20:25:38,774 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 20:25:38,774 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-02 20:25:38,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-02 20:25:38,775 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-02 20:25:38,776 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2023-12-02 20:25:38,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:25:38,776 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-12-02 20:25:38,776 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 20:25:38,776 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:25:38,776 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:25:39,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:25:39,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-02 20:25:40,003 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3a5cbb6-c03d-425b-a860-16031649589e/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2023-12-02 20:25:40,198 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3a5cbb6-c03d-425b-a860-16031649589e/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2023-12-02 20:25:40,199 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 20:25:40,199 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 20:25:40,199 INFO L85 PathProgramCache]: Analyzing trace with hash 273563630, now seen corresponding path program 2 times [2023-12-02 20:25:40,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-02 20:25:40,199 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [149640492] [2023-12-02 20:25:40,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 20:25:40,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 20:25:40,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 20:25:40,289 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-12-02 20:25:40,289 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-02 20:25:40,289 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [149640492] [2023-12-02 20:25:40,289 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [149640492] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 20:25:40,289 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [850908395] [2023-12-02 20:25:40,290 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-02 20:25:40,290 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 20:25:40,290 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3a5cbb6-c03d-425b-a860-16031649589e/bin/ugemcutter-verify-Bi2udmvEmx/z3 [2023-12-02 20:25:40,291 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3a5cbb6-c03d-425b-a860-16031649589e/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 20:25:40,296 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3a5cbb6-c03d-425b-a860-16031649589e/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2023-12-02 20:25:40,419 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-02 20:25:40,420 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-02 20:25:40,421 INFO L262 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-02 20:25:40,422 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 20:25:40,436 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-12-02 20:25:40,436 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 20:25:40,490 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-12-02 20:25:40,490 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [850908395] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 20:25:40,490 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 20:25:40,490 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2023-12-02 20:25:40,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [68170743] [2023-12-02 20:25:40,491 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 20:25:40,491 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-12-02 20:25:40,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-02 20:25:40,492 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-12-02 20:25:40,492 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2023-12-02 20:25:40,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:25:40,492 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-12-02 20:25:40,492 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 12 states have internal predecessors, (30), 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-12-02 20:25:40,492 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:25:40,493 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-12-02 20:25:40,493 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:25:41,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:25:41,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-02 20:25:41,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-12-02 20:25:41,845 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3a5cbb6-c03d-425b-a860-16031649589e/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2023-12-02 20:25:42,041 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3a5cbb6-c03d-425b-a860-16031649589e/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2023-12-02 20:25:42,041 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 20:25:42,041 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 20:25:42,042 INFO L85 PathProgramCache]: Analyzing trace with hash -2116351378, now seen corresponding path program 3 times [2023-12-02 20:25:42,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-02 20:25:42,042 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1824138868] [2023-12-02 20:25:42,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 20:25:42,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 20:25:42,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 20:25:42,250 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-12-02 20:25:42,250 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-02 20:25:42,250 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1824138868] [2023-12-02 20:25:42,250 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1824138868] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 20:25:42,250 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [399738636] [2023-12-02 20:25:42,251 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-02 20:25:42,251 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 20:25:42,251 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3a5cbb6-c03d-425b-a860-16031649589e/bin/ugemcutter-verify-Bi2udmvEmx/z3 [2023-12-02 20:25:42,252 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3a5cbb6-c03d-425b-a860-16031649589e/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 20:25:42,279 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3a5cbb6-c03d-425b-a860-16031649589e/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2023-12-02 20:25:42,400 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-12-02 20:25:42,401 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-02 20:25:42,402 INFO L262 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 18 conjunts are in the unsatisfiable core [2023-12-02 20:25:42,405 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 20:25:42,412 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2023-12-02 20:25:42,481 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-12-02 20:25:42,481 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-12-02 20:25:42,504 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 15 treesize of output 10 [2023-12-02 20:25:42,558 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 15 treesize of output 10 [2023-12-02 20:25:42,598 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 33 [2023-12-02 20:25:42,610 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2023-12-02 20:25:42,610 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 20:25:48,658 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_539 (Array Int Int)) (|~#a~0.offset| Int) (|t_funThread1of2ForFork0_~i~0#1| Int)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_539) |c_~#a~0.base|) (+ (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset|)) 0)) is different from false [2023-12-02 20:25:48,785 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 2 not checked. [2023-12-02 20:25:48,786 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [399738636] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 20:25:48,786 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 20:25:48,786 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 12 [2023-12-02 20:25:48,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [840031667] [2023-12-02 20:25:48,786 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 20:25:48,787 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-12-02 20:25:48,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-02 20:25:48,788 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-12-02 20:25:48,788 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=93, Unknown=3, NotChecked=20, Total=156 [2023-12-02 20:25:48,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:25:48,788 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-12-02 20:25:48,788 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.461538461538462) internal successors, (58), 12 states have internal predecessors, (58), 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-12-02 20:25:48,789 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:25:48,789 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-12-02 20:25:48,789 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2023-12-02 20:25:48,789 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:25:50,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:25:50,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-02 20:25:50,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-12-02 20:25:50,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-02 20:25:50,887 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3a5cbb6-c03d-425b-a860-16031649589e/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2023-12-02 20:25:51,081 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3a5cbb6-c03d-425b-a860-16031649589e/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2023-12-02 20:25:51,082 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 20:25:51,082 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 20:25:51,082 INFO L85 PathProgramCache]: Analyzing trace with hash -1982754305, now seen corresponding path program 1 times [2023-12-02 20:25:51,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-02 20:25:51,082 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [53667978] [2023-12-02 20:25:51,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 20:25:51,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 20:25:51,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 20:25:51,175 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2023-12-02 20:25:51,176 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-02 20:25:51,176 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [53667978] [2023-12-02 20:25:51,176 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [53667978] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 20:25:51,176 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 20:25:51,176 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-02 20:25:51,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [55251296] [2023-12-02 20:25:51,176 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 20:25:51,177 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-02 20:25:51,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-02 20:25:51,177 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-02 20:25:51,177 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 20:25:51,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:25:51,178 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-12-02 20:25:51,178 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 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-12-02 20:25:51,178 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:25:51,178 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-12-02 20:25:51,178 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2023-12-02 20:25:51,178 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2023-12-02 20:25:51,178 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:25:52,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:25:52,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-02 20:25:52,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-12-02 20:25:52,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-02 20:25:52,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:25:52,307 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-12-02 20:25:52,307 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 20:25:52,307 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 20:25:52,307 INFO L85 PathProgramCache]: Analyzing trace with hash -1953809843, now seen corresponding path program 1 times [2023-12-02 20:25:52,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-02 20:25:52,307 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [784898429] [2023-12-02 20:25:52,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 20:25:52,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 20:25:52,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 20:26:29,215 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 0 proven. 62 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 20:26:29,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-02 20:26:29,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [784898429] [2023-12-02 20:26:29,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [784898429] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 20:26:29,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1771881186] [2023-12-02 20:26:29,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 20:26:29,216 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 20:26:29,216 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3a5cbb6-c03d-425b-a860-16031649589e/bin/ugemcutter-verify-Bi2udmvEmx/z3 [2023-12-02 20:26:29,217 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3a5cbb6-c03d-425b-a860-16031649589e/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 20:26:29,217 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3a5cbb6-c03d-425b-a860-16031649589e/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2023-12-02 20:26:29,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 20:26:29,325 INFO L262 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 33 conjunts are in the unsatisfiable core [2023-12-02 20:26:29,328 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 20:26:29,334 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2023-12-02 20:26:29,411 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-12-02 20:26:29,411 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-12-02 20:26:29,445 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 15 treesize of output 10 [2023-12-02 20:26:29,504 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2023-12-02 20:26:29,577 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 15 treesize of output 10 [2023-12-02 20:26:29,667 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-12-02 20:26:29,667 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 11 [2023-12-02 20:26:29,745 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 15 treesize of output 10 [2023-12-02 20:26:29,807 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 25 [2023-12-02 20:26:29,895 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 55 treesize of output 49 [2023-12-02 20:26:29,934 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-12-02 20:26:29,935 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 20:26:30,034 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_665 (Array Int Int))) (= (select (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_665) |c_~#a~0.base|)) (.cse1 (+ |c_~#a~0.offset| (* |c_t_funThread2of2ForFork0_~i~0#1| 28)))) (store .cse0 .cse1 (+ (select .cse0 .cse1) 1))) (+ (* |c_t_funThread1of2ForFork0_~i~0#1| 28) |c_~#a~0.offset|)) 0)) is different from false [2023-12-02 20:26:30,282 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 25 treesize of output 16 [2023-12-02 20:26:30,301 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (+ (* |c_t_funThread1of2ForFork0_~i~0#1| 28) |c_~#a~0.offset|))) (and (or (forall ((|v_t_funThread2of2ForFork0_~i~0#1_17| Int) (v_ArrVal_665 (Array Int Int))) (= (select (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_665) |c_~#a~0.base|)) (.cse1 (+ |c_~#a~0.offset| (* |v_t_funThread2of2ForFork0_~i~0#1_17| 28)))) (store .cse0 .cse1 (+ (select .cse0 .cse1) 1))) .cse2) 0)) (= |c_~#a~0.base| |c_t_funThread1of2ForFork0_~p~0#1.base|)) (forall ((|v_t_funThread2of2ForFork0_~i~0#1_17| Int) (v_ArrVal_665 (Array Int Int))) (let ((.cse3 (+ |c_~#a~0.offset| (* |v_t_funThread2of2ForFork0_~i~0#1_17| 28)))) (or (= .cse3 |c_t_funThread1of2ForFork0_~p~0#1.offset|) (= (select (let ((.cse4 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_665) |c_~#a~0.base|))) (store .cse4 .cse3 (+ (select .cse4 .cse3) 1))) .cse2) 0)))))) is different from false [2023-12-02 20:26:32,316 WARN L854 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of2ForFork0_~i~0#1_17| Int) (|~#a~0.offset| Int) (|v_t_funThread2of2ForFork0_~i~0#1_17| Int) (v_ArrVal_665 (Array Int Int))) (or (= |v_t_funThread2of2ForFork0_~i~0#1_17| |v_t_funThread1of2ForFork0_~i~0#1_17|) (= (select (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_665) |c_~#a~0.base|)) (.cse1 (+ |~#a~0.offset| (* |v_t_funThread2of2ForFork0_~i~0#1_17| 28)))) (store .cse0 .cse1 (+ (select .cse0 .cse1) 1))) (+ (* |v_t_funThread1of2ForFork0_~i~0#1_17| 28) |~#a~0.offset|)) 0))) is different from false [2023-12-02 20:26:32,537 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 55 trivial. 6 not checked. [2023-12-02 20:26:32,537 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1771881186] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 20:26:32,537 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 20:26:32,537 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 10, 10] total 37 [2023-12-02 20:26:32,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [974890608] [2023-12-02 20:26:32,538 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 20:26:32,538 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2023-12-02 20:26:32,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-02 20:26:32,539 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2023-12-02 20:26:32,540 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=167, Invalid=1032, Unknown=3, NotChecked=204, Total=1406 [2023-12-02 20:26:32,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:26:32,540 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-12-02 20:26:32,541 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 2.4473684210526314) internal successors, (93), 37 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 20:26:32,541 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:26:32,541 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-12-02 20:26:32,541 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2023-12-02 20:26:32,541 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2023-12-02 20:26:32,541 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:26:32,541 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:26:38,237 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 20:26:39,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:26:39,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-02 20:26:39,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-12-02 20:26:39,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-02 20:26:39,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:26:39,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2023-12-02 20:26:39,117 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3a5cbb6-c03d-425b-a860-16031649589e/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2023-12-02 20:26:39,312 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3a5cbb6-c03d-425b-a860-16031649589e/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2023-12-02 20:26:39,312 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 20:26:39,312 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 20:26:39,312 INFO L85 PathProgramCache]: Analyzing trace with hash -1104475625, now seen corresponding path program 1 times [2023-12-02 20:26:39,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-02 20:26:39,313 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [999003696] [2023-12-02 20:26:39,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 20:26:39,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 20:26:39,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 20:26:39,416 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-12-02 20:26:39,416 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-02 20:26:39,416 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [999003696] [2023-12-02 20:26:39,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [999003696] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 20:26:39,417 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1726613301] [2023-12-02 20:26:39,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 20:26:39,417 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 20:26:39,417 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3a5cbb6-c03d-425b-a860-16031649589e/bin/ugemcutter-verify-Bi2udmvEmx/z3 [2023-12-02 20:26:39,418 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3a5cbb6-c03d-425b-a860-16031649589e/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 20:26:39,424 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3a5cbb6-c03d-425b-a860-16031649589e/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2023-12-02 20:26:39,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 20:26:39,577 INFO L262 TraceCheckSpWp]: Trace formula consists of 312 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-02 20:26:39,578 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 20:26:39,602 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-12-02 20:26:39,602 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 20:26:39,640 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-12-02 20:26:39,640 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1726613301] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 20:26:39,641 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 20:26:39,641 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2023-12-02 20:26:39,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [142628140] [2023-12-02 20:26:39,641 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 20:26:39,641 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-02 20:26:39,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-02 20:26:39,642 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-02 20:26:39,642 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2023-12-02 20:26:39,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:26:39,642 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-12-02 20:26:39,643 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.888888888888889) internal successors, (71), 9 states have internal predecessors, (71), 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-12-02 20:26:39,643 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:26:39,643 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-12-02 20:26:39,643 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2023-12-02 20:26:39,643 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2023-12-02 20:26:39,643 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:26:39,643 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 33 states. [2023-12-02 20:26:39,643 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:26:40,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:26:40,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-02 20:26:40,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-12-02 20:26:40,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-02 20:26:40,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:26:40,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2023-12-02 20:26:40,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-02 20:26:40,407 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3a5cbb6-c03d-425b-a860-16031649589e/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2023-12-02 20:26:40,604 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3a5cbb6-c03d-425b-a860-16031649589e/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2023-12-02 20:26:40,604 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 20:26:40,604 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 20:26:40,604 INFO L85 PathProgramCache]: Analyzing trace with hash -1135122107, now seen corresponding path program 1 times [2023-12-02 20:26:40,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-02 20:26:40,605 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [378699687] [2023-12-02 20:26:40,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 20:26:40,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 20:26:40,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 20:26:41,096 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2023-12-02 20:26:41,096 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-02 20:26:41,096 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [378699687] [2023-12-02 20:26:41,096 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [378699687] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 20:26:41,096 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1592289686] [2023-12-02 20:26:41,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 20:26:41,097 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 20:26:41,097 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3a5cbb6-c03d-425b-a860-16031649589e/bin/ugemcutter-verify-Bi2udmvEmx/z3 [2023-12-02 20:26:41,098 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3a5cbb6-c03d-425b-a860-16031649589e/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 20:26:41,101 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3a5cbb6-c03d-425b-a860-16031649589e/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2023-12-02 20:26:41,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 20:26:41,328 INFO L262 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 25 conjunts are in the unsatisfiable core [2023-12-02 20:26:41,331 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 20:26:41,336 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2023-12-02 20:26:41,431 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-12-02 20:26:41,431 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-12-02 20:26:41,454 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 15 treesize of output 10 [2023-12-02 20:26:41,482 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 15 treesize of output 10 [2023-12-02 20:26:41,540 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 15 treesize of output 10 [2023-12-02 20:26:41,572 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 25 [2023-12-02 20:26:41,639 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 41 [2023-12-02 20:26:41,701 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 33 [2023-12-02 20:26:41,723 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2023-12-02 20:26:41,724 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 20:26:47,786 WARN L854 $PredicateComparison]: unable to prove that (forall ((|t_funThread1of2ForFork0_~i~0#1| Int)) (= (select (let ((.cse0 (select |c_#memory_int| |c_~#a~0.base|)) (.cse1 (+ |c_~#a~0.offset| (* |c_t_funThread2of2ForFork0_~i~0#1| 28)))) (store .cse0 .cse1 (+ (- 1) (select .cse0 .cse1)))) (+ |c_~#a~0.offset| (* |t_funThread1of2ForFork0_~i~0#1| 28))) 0)) is different from false [2023-12-02 20:26:49,859 WARN L854 $PredicateComparison]: unable to prove that (forall ((|~#a~0.offset| Int) (|t_funThread2of2ForFork0_~i~0#1| Int) (|t_funThread1of2ForFork0_~i~0#1| Int) (v_ArrVal_874 (Array Int Int))) (= (select (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_874) |c_~#a~0.base|)) (.cse1 (+ (* 28 |t_funThread2of2ForFork0_~i~0#1|) |~#a~0.offset|))) (store .cse0 .cse1 (select .cse0 .cse1))) (+ (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset|)) 0)) is different from false [2023-12-02 20:26:49,992 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 2 not checked. [2023-12-02 20:26:49,992 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1592289686] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 20:26:49,992 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 20:26:49,992 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 7] total 17 [2023-12-02 20:26:49,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [373942491] [2023-12-02 20:26:49,992 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 20:26:49,993 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-12-02 20:26:49,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-02 20:26:49,993 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-12-02 20:26:49,994 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=181, Unknown=2, NotChecked=58, Total=306 [2023-12-02 20:26:49,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:26:49,994 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-12-02 20:26:49,994 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 6.111111111111111) internal successors, (110), 17 states have internal predecessors, (110), 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-12-02 20:26:49,994 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:26:49,994 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-12-02 20:26:49,994 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2023-12-02 20:26:49,994 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2023-12-02 20:26:49,994 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:26:49,994 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 35 states. [2023-12-02 20:26:49,995 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2023-12-02 20:26:49,995 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:26:50,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:26:50,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-02 20:26:50,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-12-02 20:26:50,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-02 20:26:50,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:26:50,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2023-12-02 20:26:50,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-02 20:26:50,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-02 20:26:50,512 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3a5cbb6-c03d-425b-a860-16031649589e/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2023-12-02 20:26:50,707 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3a5cbb6-c03d-425b-a860-16031649589e/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2023-12-02 20:26:50,707 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 20:26:50,708 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 20:26:50,708 INFO L85 PathProgramCache]: Analyzing trace with hash 1224865554, now seen corresponding path program 1 times [2023-12-02 20:26:50,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-02 20:26:50,708 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1498504472] [2023-12-02 20:26:50,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 20:26:50,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 20:26:50,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 20:27:11,828 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 0 proven. 62 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 20:27:11,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-02 20:27:11,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1498504472] [2023-12-02 20:27:11,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1498504472] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 20:27:11,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [877206312] [2023-12-02 20:27:11,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 20:27:11,829 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 20:27:11,829 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3a5cbb6-c03d-425b-a860-16031649589e/bin/ugemcutter-verify-Bi2udmvEmx/z3 [2023-12-02 20:27:11,830 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3a5cbb6-c03d-425b-a860-16031649589e/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 20:27:11,831 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3a5cbb6-c03d-425b-a860-16031649589e/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2023-12-02 20:27:11,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 20:27:11,954 INFO L262 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 36 conjunts are in the unsatisfiable core [2023-12-02 20:27:11,957 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 20:27:11,961 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2023-12-02 20:27:12,069 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-12-02 20:27:12,069 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-12-02 20:27:12,107 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 15 treesize of output 10 [2023-12-02 20:27:12,187 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 15 treesize of output 10 [2023-12-02 20:27:12,291 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2023-12-02 20:27:12,433 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 15 treesize of output 10 [2023-12-02 20:27:12,520 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 20:27:12,521 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 21 treesize of output 16 [2023-12-02 20:27:12,549 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 25 [2023-12-02 20:27:12,630 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 20:27:12,631 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 21 treesize of output 16 [2023-12-02 20:27:12,709 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-12-02 20:27:12,710 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 11 [2023-12-02 20:27:12,816 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 55 treesize of output 49 [2023-12-02 20:27:12,859 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-12-02 20:27:12,859 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 20:27:13,143 WARN L854 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_967 (Array Int Int))) (not (= (select (select (store |c_#pthreadsMutex| |c_~#__global_lock~0.base| v_ArrVal_967) |c_t_funThread1of2ForFork0_~p~0#1.base|) (+ 4 |c_t_funThread1of2ForFork0_~p~0#1.offset|)) 0))) (forall ((v_ArrVal_964 (Array Int Int))) (= (select (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_964) |c_~#a~0.base|)) (.cse1 (+ |c_~#a~0.offset| (* |c_t_funThread2of2ForFork0_~i~0#1| 28)))) (store .cse0 .cse1 (+ (select .cse0 .cse1) 1))) (+ (* |c_t_funThread1of2ForFork0_~i~0#1| 28) |c_~#a~0.offset|)) 0))) is different from false [2023-12-02 20:27:13,175 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:27:13,175 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 24 [2023-12-02 20:27:13,181 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:27:13,181 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 38 [2023-12-02 20:27:13,184 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 22 treesize of output 18 [2023-12-02 20:27:13,297 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (+ (* |c_t_funThread1of2ForFork0_~i~0#1| 28) |c_~#a~0.offset|))) (let ((.cse0 (forall ((v_ArrVal_964 (Array Int Int)) (|v_t_funThread2of2ForFork0_~i~0#1_23| Int)) (= (select (let ((.cse4 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_964) |c_~#a~0.base|)) (.cse5 (+ |c_~#a~0.offset| (* |v_t_funThread2of2ForFork0_~i~0#1_23| 28)))) (store .cse4 .cse5 (+ (select .cse4 .cse5) 1))) .cse3) 0)))) (and (or (not (= |c_~#__global_lock~0.base| |c_t_funThread1of2ForFork0_~p~0#1.base|)) .cse0) (or .cse0 (= |c_~#a~0.base| |c_t_funThread1of2ForFork0_~p~0#1.base|)) (forall ((v_ArrVal_964 (Array Int Int)) (|v_t_funThread2of2ForFork0_~i~0#1_23| Int)) (let ((.cse1 (+ |c_~#a~0.offset| (* |v_t_funThread2of2ForFork0_~i~0#1_23| 28)))) (or (= .cse1 |c_t_funThread1of2ForFork0_~p~0#1.offset|) (= (select (let ((.cse2 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_964) |c_~#a~0.base|))) (store .cse2 .cse1 (+ (select .cse2 .cse1) 1))) .cse3) 0))))))) is different from false [2023-12-02 20:27:15,376 WARN L854 $PredicateComparison]: unable to prove that (and (or (forall ((v_ArrVal_964 (Array Int Int)) (|v_t_funThread1of2ForFork0_~i~0#1_23| Int) (|~#a~0.offset| Int) (|v_t_funThread2of2ForFork0_~i~0#1_23| Int)) (= (select (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_964) |c_~#a~0.base|)) (.cse1 (+ (* |v_t_funThread2of2ForFork0_~i~0#1_23| 28) |~#a~0.offset|))) (store .cse0 .cse1 (+ (select .cse0 .cse1) 1))) (+ (* |v_t_funThread1of2ForFork0_~i~0#1_23| 28) |~#a~0.offset|)) 0)) (not (= |c_~#a~0.base| |c_~#__global_lock~0.base|))) (forall ((v_ArrVal_964 (Array Int Int)) (|v_t_funThread1of2ForFork0_~i~0#1_23| Int) (|~#a~0.offset| Int) (|v_t_funThread2of2ForFork0_~i~0#1_23| Int)) (or (= |v_t_funThread2of2ForFork0_~i~0#1_23| |v_t_funThread1of2ForFork0_~i~0#1_23|) (= (select (let ((.cse2 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_964) |c_~#a~0.base|)) (.cse3 (+ (* |v_t_funThread2of2ForFork0_~i~0#1_23| 28) |~#a~0.offset|))) (store .cse2 .cse3 (+ (select .cse2 .cse3) 1))) (+ (* |v_t_funThread1of2ForFork0_~i~0#1_23| 28) |~#a~0.offset|)) 0)))) is different from false [2023-12-02 20:27:15,752 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 7 not checked. [2023-12-02 20:27:15,752 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [877206312] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 20:27:15,752 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 20:27:15,752 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 11, 11] total 40 [2023-12-02 20:27:15,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [924796559] [2023-12-02 20:27:15,753 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 20:27:15,753 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2023-12-02 20:27:15,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-02 20:27:15,754 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2023-12-02 20:27:15,754 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=225, Invalid=1190, Unknown=3, NotChecked=222, Total=1640 [2023-12-02 20:27:15,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:27:15,755 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-12-02 20:27:15,755 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 41 states have (on average 2.4146341463414633) internal successors, (99), 40 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 20:27:15,755 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:27:15,755 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-12-02 20:27:15,755 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2023-12-02 20:27:15,755 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2023-12-02 20:27:15,755 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:27:15,755 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 35 states. [2023-12-02 20:27:15,755 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2023-12-02 20:27:15,756 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-12-02 20:27:15,756 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:27:19,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:27:19,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-02 20:27:19,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-12-02 20:27:19,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-02 20:27:19,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:27:19,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2023-12-02 20:27:19,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-02 20:27:19,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-02 20:27:19,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2023-12-02 20:27:19,994 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-02 20:27:19,998 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3a5cbb6-c03d-425b-a860-16031649589e/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2023-12-02 20:27:20,194 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3a5cbb6-c03d-425b-a860-16031649589e/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 20:27:20,196 INFO L445 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1, 1] [2023-12-02 20:27:20,196 INFO L307 ceAbstractionStarter]: Result for error location t_funThread1of2ForFork0 was SAFE (1/3) [2023-12-02 20:27:20,198 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-02 20:27:20,198 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2023-12-02 20:27:20,198 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3a5cbb6-c03d-425b-a860-16031649589e/bin/ugemcutter-verify-Bi2udmvEmx/z3 [2023-12-02 20:27:20,199 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3a5cbb6-c03d-425b-a860-16031649589e/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2023-12-02 20:27:20,199 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3a5cbb6-c03d-425b-a860-16031649589e/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (19)] Waiting until timeout for monitored process [2023-12-02 20:27:20,202 INFO L159 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2023-12-02 20:27:20,202 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2023-12-02 20:27:20,203 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;@470b3d7d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-02 20:27:20,203 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2023-12-02 20:27:20,287 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-12-02 20:27:20,287 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 20:27:20,287 INFO L85 PathProgramCache]: Analyzing trace with hash 1790519570, now seen corresponding path program 1 times [2023-12-02 20:27:20,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-02 20:27:20,288 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [745705599] [2023-12-02 20:27:20,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 20:27:20,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 20:27:20,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 20:27:20,314 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-12-02 20:27:20,314 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-02 20:27:20,314 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [745705599] [2023-12-02 20:27:20,314 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [745705599] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 20:27:20,314 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 20:27:20,314 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-02 20:27:20,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1782657217] [2023-12-02 20:27:20,314 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 20:27:20,315 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-02 20:27:20,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-02 20:27:20,315 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-02 20:27:20,315 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 20:27:20,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:27:20,315 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-12-02 20:27:20,315 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 2 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-12-02 20:27:20,316 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:27:20,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:27:20,390 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-12-02 20:27:20,390 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-12-02 20:27:20,391 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 20:27:20,391 INFO L85 PathProgramCache]: Analyzing trace with hash -581680862, now seen corresponding path program 1 times [2023-12-02 20:27:20,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-02 20:27:20,391 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1297102126] [2023-12-02 20:27:20,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 20:27:20,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 20:27:20,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 20:27:20,426 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-12-02 20:27:20,426 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-02 20:27:20,426 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1297102126] [2023-12-02 20:27:20,426 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1297102126] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 20:27:20,426 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [517104164] [2023-12-02 20:27:20,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 20:27:20,426 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 20:27:20,427 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3a5cbb6-c03d-425b-a860-16031649589e/bin/ugemcutter-verify-Bi2udmvEmx/z3 [2023-12-02 20:27:20,428 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3a5cbb6-c03d-425b-a860-16031649589e/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 20:27:20,431 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3a5cbb6-c03d-425b-a860-16031649589e/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2023-12-02 20:27:20,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 20:27:20,551 INFO L262 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-02 20:27:20,552 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 20:27:20,559 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-12-02 20:27:20,559 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 20:27:20,571 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-12-02 20:27:20,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [517104164] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 20:27:20,571 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 20:27:20,571 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2023-12-02 20:27:20,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [855724394] [2023-12-02 20:27:20,572 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 20:27:20,572 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-02 20:27:20,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-02 20:27:20,572 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-02 20:27:20,572 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2023-12-02 20:27:20,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:27:20,573 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-12-02 20:27:20,573 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 20:27:20,573 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:27:20,573 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:27:20,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:27:20,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-02 20:27:20,619 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3a5cbb6-c03d-425b-a860-16031649589e/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Ended with exit code 0 [2023-12-02 20:27:20,815 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3a5cbb6-c03d-425b-a860-16031649589e/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 20:27:20,815 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-12-02 20:27:20,816 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 20:27:20,816 INFO L85 PathProgramCache]: Analyzing trace with hash -239534658, now seen corresponding path program 2 times [2023-12-02 20:27:20,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-02 20:27:20,816 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1380755570] [2023-12-02 20:27:20,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 20:27:20,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 20:27:20,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 20:27:20,866 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-12-02 20:27:20,867 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-02 20:27:20,867 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1380755570] [2023-12-02 20:27:20,867 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1380755570] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 20:27:20,867 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1520508753] [2023-12-02 20:27:20,867 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-02 20:27:20,867 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 20:27:20,867 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3a5cbb6-c03d-425b-a860-16031649589e/bin/ugemcutter-verify-Bi2udmvEmx/z3 [2023-12-02 20:27:20,868 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3a5cbb6-c03d-425b-a860-16031649589e/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 20:27:20,870 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3a5cbb6-c03d-425b-a860-16031649589e/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2023-12-02 20:27:21,006 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-02 20:27:21,006 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-02 20:27:21,007 INFO L262 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-02 20:27:21,008 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 20:27:21,017 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-12-02 20:27:21,017 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 20:27:21,055 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-12-02 20:27:21,055 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1520508753] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 20:27:21,055 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 20:27:21,055 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2023-12-02 20:27:21,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [104024589] [2023-12-02 20:27:21,055 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 20:27:21,056 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-12-02 20:27:21,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-02 20:27:21,056 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-12-02 20:27:21,057 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2023-12-02 20:27:21,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:27:21,057 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-12-02 20:27:21,057 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 12 states have internal predecessors, (30), 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-12-02 20:27:21,057 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:27:21,057 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-12-02 20:27:21,057 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:27:21,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:27:21,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-02 20:27:21,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-12-02 20:27:21,102 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3a5cbb6-c03d-425b-a860-16031649589e/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Ended with exit code 0 [2023-12-02 20:27:21,298 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3a5cbb6-c03d-425b-a860-16031649589e/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 20:27:21,298 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-12-02 20:27:21,298 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 20:27:21,298 INFO L85 PathProgramCache]: Analyzing trace with hash -1312455874, now seen corresponding path program 3 times [2023-12-02 20:27:21,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-02 20:27:21,299 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [12528000] [2023-12-02 20:27:21,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 20:27:21,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 20:27:21,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-02 20:27:21,315 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-02 20:27:21,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-02 20:27:21,337 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-12-02 20:27:21,337 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-12-02 20:27:21,337 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2023-12-02 20:27:21,338 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2023-12-02 20:27:21,338 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2023-12-02 20:27:21,339 INFO L445 BasicCegarLoop]: Path program histogram: [3, 1] [2023-12-02 20:27:21,340 INFO L307 ceAbstractionStarter]: Result for error location ULTIMATE.start was UNSAFE,UNKNOWN (2/3) [2023-12-02 20:27:21,340 WARN L233 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2023-12-02 20:27:21,340 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2023-12-02 20:27:21,369 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2023-12-02 20:27:21,372 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-02 20:27:21,372 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2023-12-02 20:27:21,372 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3a5cbb6-c03d-425b-a860-16031649589e/bin/ugemcutter-verify-Bi2udmvEmx/z3 [2023-12-02 20:27:21,373 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3a5cbb6-c03d-425b-a860-16031649589e/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2023-12-02 20:27:21,376 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3a5cbb6-c03d-425b-a860-16031649589e/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (22)] Waiting until timeout for monitored process [2023-12-02 20:27:21,378 INFO L159 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2023-12-02 20:27:21,378 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2023-12-02 20:27:21,379 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;@470b3d7d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-02 20:27:21,379 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2023-12-02 20:27:21,527 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-12-02 20:27:21,528 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 20:27:21,528 INFO L85 PathProgramCache]: Analyzing trace with hash -69044282, now seen corresponding path program 1 times [2023-12-02 20:27:21,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-02 20:27:21,528 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1225566181] [2023-12-02 20:27:21,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 20:27:21,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 20:27:21,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 20:27:21,558 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-12-02 20:27:21,559 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-02 20:27:21,559 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1225566181] [2023-12-02 20:27:21,559 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1225566181] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 20:27:21,559 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 20:27:21,559 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-02 20:27:21,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2096010785] [2023-12-02 20:27:21,559 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 20:27:21,560 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-02 20:27:21,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-02 20:27:21,560 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-02 20:27:21,560 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 20:27:21,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:27:21,560 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-12-02 20:27:21,560 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 2 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-12-02 20:27:21,561 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:27:21,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:27:21,726 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2023-12-02 20:27:21,726 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-12-02 20:27:21,726 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 20:27:21,726 INFO L85 PathProgramCache]: Analyzing trace with hash 1539012963, now seen corresponding path program 1 times [2023-12-02 20:27:21,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-02 20:27:21,727 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2040196570] [2023-12-02 20:27:21,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 20:27:21,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 20:27:21,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 20:27:21,757 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-12-02 20:27:21,757 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-02 20:27:21,757 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2040196570] [2023-12-02 20:27:21,757 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2040196570] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 20:27:21,757 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1646496669] [2023-12-02 20:27:21,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 20:27:21,758 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 20:27:21,758 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3a5cbb6-c03d-425b-a860-16031649589e/bin/ugemcutter-verify-Bi2udmvEmx/z3 [2023-12-02 20:27:21,759 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3a5cbb6-c03d-425b-a860-16031649589e/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 20:27:21,759 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3a5cbb6-c03d-425b-a860-16031649589e/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2023-12-02 20:27:21,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 20:27:21,891 INFO L262 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-02 20:27:21,892 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 20:27:21,899 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-12-02 20:27:21,899 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 20:27:21,911 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-12-02 20:27:21,911 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1646496669] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 20:27:21,911 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 20:27:21,911 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2023-12-02 20:27:21,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1150323390] [2023-12-02 20:27:21,911 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 20:27:21,912 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-02 20:27:21,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-02 20:27:21,912 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-02 20:27:21,912 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2023-12-02 20:27:21,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:27:21,912 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-12-02 20:27:21,912 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 6 states have internal predecessors, (36), 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-12-02 20:27:21,912 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:27:21,913 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:27:21,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:27:21,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-02 20:27:21,967 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3a5cbb6-c03d-425b-a860-16031649589e/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Ended with exit code 0 [2023-12-02 20:27:22,163 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,23 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3a5cbb6-c03d-425b-a860-16031649589e/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 20:27:22,163 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-12-02 20:27:22,163 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 20:27:22,164 INFO L85 PathProgramCache]: Analyzing trace with hash 732249554, now seen corresponding path program 2 times [2023-12-02 20:27:22,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-02 20:27:22,164 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1629295339] [2023-12-02 20:27:22,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 20:27:22,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 20:27:22,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 20:27:22,219 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-12-02 20:27:22,219 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-02 20:27:22,219 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1629295339] [2023-12-02 20:27:22,219 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1629295339] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 20:27:22,219 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [957867588] [2023-12-02 20:27:22,219 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-02 20:27:22,219 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 20:27:22,219 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3a5cbb6-c03d-425b-a860-16031649589e/bin/ugemcutter-verify-Bi2udmvEmx/z3 [2023-12-02 20:27:22,220 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3a5cbb6-c03d-425b-a860-16031649589e/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 20:27:22,221 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3a5cbb6-c03d-425b-a860-16031649589e/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2023-12-02 20:27:22,341 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-02 20:27:22,341 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-02 20:27:22,343 INFO L262 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-02 20:27:22,343 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 20:27:22,354 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-12-02 20:27:22,354 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 20:27:22,393 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-12-02 20:27:22,394 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [957867588] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 20:27:22,394 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 20:27:22,394 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2023-12-02 20:27:22,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1472335461] [2023-12-02 20:27:22,394 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 20:27:22,394 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-12-02 20:27:22,395 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-02 20:27:22,395 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-12-02 20:27:22,395 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2023-12-02 20:27:22,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:27:22,395 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-12-02 20:27:22,396 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.230769230769231) internal successors, (42), 12 states have internal predecessors, (42), 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-12-02 20:27:22,396 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:27:22,396 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-12-02 20:27:22,396 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:27:22,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:27:22,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-02 20:27:22,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-12-02 20:27:22,482 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3a5cbb6-c03d-425b-a860-16031649589e/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Ended with exit code 0 [2023-12-02 20:27:22,678 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3a5cbb6-c03d-425b-a860-16031649589e/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2023-12-02 20:27:22,678 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-12-02 20:27:22,678 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 20:27:22,678 INFO L85 PathProgramCache]: Analyzing trace with hash -222174158, now seen corresponding path program 3 times [2023-12-02 20:27:22,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-02 20:27:22,679 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1239123554] [2023-12-02 20:27:22,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 20:27:22,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 20:27:22,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-02 20:27:22,704 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-02 20:27:22,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-02 20:27:22,740 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-12-02 20:27:22,740 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-12-02 20:27:22,740 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2023-12-02 20:27:22,741 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2023-12-02 20:27:22,741 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2023-12-02 20:27:22,742 INFO L445 BasicCegarLoop]: Path program histogram: [3, 1] [2023-12-02 20:27:22,742 INFO L307 ceAbstractionStarter]: Result for error location ULTIMATE.start was UNSAFE,UNKNOWN (1/4) [2023-12-02 20:27:22,743 WARN L233 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2023-12-02 20:27:22,743 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2023-12-02 20:27:22,776 INFO L144 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2023-12-02 20:27:22,779 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-02 20:27:22,779 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2023-12-02 20:27:22,779 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3a5cbb6-c03d-425b-a860-16031649589e/bin/ugemcutter-verify-Bi2udmvEmx/z3 [2023-12-02 20:27:22,780 INFO L229 MonitoredProcess]: Starting monitored process 25 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3a5cbb6-c03d-425b-a860-16031649589e/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2023-12-02 20:27:22,780 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3a5cbb6-c03d-425b-a860-16031649589e/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (25)] Waiting until timeout for monitored process [2023-12-02 20:27:22,783 INFO L159 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2023-12-02 20:27:22,783 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == t_funThread4of4ForFork0 ======== [2023-12-02 20:27:22,783 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;@470b3d7d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-02 20:27:22,784 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-02 20:27:22,983 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 20:27:22,983 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 20:27:22,983 INFO L85 PathProgramCache]: Analyzing trace with hash -199797332, now seen corresponding path program 1 times [2023-12-02 20:27:22,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-02 20:27:22,983 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [776701937] [2023-12-02 20:27:22,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 20:27:22,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 20:27:22,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 20:27:23,022 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2023-12-02 20:27:23,022 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-02 20:27:23,022 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [776701937] [2023-12-02 20:27:23,023 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [776701937] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 20:27:23,023 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 20:27:23,023 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-02 20:27:23,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [217898119] [2023-12-02 20:27:23,023 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 20:27:23,023 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-02 20:27:23,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-02 20:27:23,024 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-02 20:27:23,024 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 20:27:23,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:27:23,024 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-12-02 20:27:23,025 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 2 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 20:27:23,025 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:27:50,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:27:50,171 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2023-12-02 20:27:50,171 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 20:27:50,171 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 20:27:50,171 INFO L85 PathProgramCache]: Analyzing trace with hash 909898761, now seen corresponding path program 1 times [2023-12-02 20:27:50,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-02 20:27:50,171 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1931815240] [2023-12-02 20:27:50,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 20:27:50,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 20:27:50,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 20:27:50,216 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2023-12-02 20:27:50,216 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-02 20:27:50,216 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1931815240] [2023-12-02 20:27:50,217 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1931815240] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 20:27:50,217 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [865929352] [2023-12-02 20:27:50,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 20:27:50,217 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 20:27:50,217 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3a5cbb6-c03d-425b-a860-16031649589e/bin/ugemcutter-verify-Bi2udmvEmx/z3 [2023-12-02 20:27:50,219 INFO L229 MonitoredProcess]: Starting monitored process 26 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3a5cbb6-c03d-425b-a860-16031649589e/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 20:27:50,220 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3a5cbb6-c03d-425b-a860-16031649589e/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2023-12-02 20:27:50,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 20:27:50,394 INFO L262 TraceCheckSpWp]: Trace formula consists of 387 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-02 20:27:50,396 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 20:27:50,404 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2023-12-02 20:27:50,404 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 20:27:50,418 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2023-12-02 20:27:50,418 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [865929352] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 20:27:50,418 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 20:27:50,418 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2023-12-02 20:27:50,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2020611463] [2023-12-02 20:27:50,418 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 20:27:50,419 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-02 20:27:50,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-02 20:27:50,419 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-02 20:27:50,419 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2023-12-02 20:27:50,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:27:50,419 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-12-02 20:27:50,420 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 6 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 20:27:50,420 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:27:50,420 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:28:02,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:28:02,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-02 20:28:02,314 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3a5cbb6-c03d-425b-a860-16031649589e/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Ended with exit code 0 [2023-12-02 20:28:02,510 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28,26 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3a5cbb6-c03d-425b-a860-16031649589e/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 20:28:02,510 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 20:28:02,511 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 20:28:02,511 INFO L85 PathProgramCache]: Analyzing trace with hash -1347679204, now seen corresponding path program 2 times [2023-12-02 20:28:02,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-02 20:28:02,511 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1210971564] [2023-12-02 20:28:02,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 20:28:02,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 20:28:02,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 20:28:02,589 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2023-12-02 20:28:02,590 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-02 20:28:02,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1210971564] [2023-12-02 20:28:02,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1210971564] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 20:28:02,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [684584913] [2023-12-02 20:28:02,590 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-02 20:28:02,590 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 20:28:02,590 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3a5cbb6-c03d-425b-a860-16031649589e/bin/ugemcutter-verify-Bi2udmvEmx/z3 [2023-12-02 20:28:02,591 INFO L229 MonitoredProcess]: Starting monitored process 27 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3a5cbb6-c03d-425b-a860-16031649589e/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 20:28:02,592 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3a5cbb6-c03d-425b-a860-16031649589e/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2023-12-02 20:28:02,798 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-02 20:28:02,798 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-02 20:28:02,801 INFO L262 TraceCheckSpWp]: Trace formula consists of 408 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-02 20:28:02,802 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 20:28:02,815 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2023-12-02 20:28:02,815 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 20:28:02,867 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2023-12-02 20:28:02,867 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [684584913] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 20:28:02,867 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 20:28:02,868 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2023-12-02 20:28:02,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1374881118] [2023-12-02 20:28:02,868 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 20:28:02,868 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-12-02 20:28:02,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-02 20:28:02,869 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-12-02 20:28:02,869 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2023-12-02 20:28:02,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:28:02,869 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-12-02 20:28:02,869 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 6.230769230769231) internal successors, (81), 12 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 20:28:02,869 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:28:02,869 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-12-02 20:28:02,869 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:28:15,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:28:15,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-02 20:28:15,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-12-02 20:28:15,275 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3a5cbb6-c03d-425b-a860-16031649589e/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Ended with exit code 0 [2023-12-02 20:28:15,471 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,27 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3a5cbb6-c03d-425b-a860-16031649589e/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 20:28:15,471 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 20:28:15,472 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 20:28:15,472 INFO L85 PathProgramCache]: Analyzing trace with hash -1287514884, now seen corresponding path program 3 times [2023-12-02 20:28:15,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-02 20:28:15,472 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [667364302] [2023-12-02 20:28:15,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 20:28:15,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 20:28:15,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 20:28:23,184 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 7 proven. 74 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 20:28:23,185 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-02 20:28:23,185 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [667364302] [2023-12-02 20:28:23,185 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [667364302] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 20:28:23,185 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [768213473] [2023-12-02 20:28:23,185 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-02 20:28:23,185 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 20:28:23,185 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3a5cbb6-c03d-425b-a860-16031649589e/bin/ugemcutter-verify-Bi2udmvEmx/z3 [2023-12-02 20:28:23,186 INFO L229 MonitoredProcess]: Starting monitored process 28 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3a5cbb6-c03d-425b-a860-16031649589e/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 20:28:23,186 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3a5cbb6-c03d-425b-a860-16031649589e/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2023-12-02 20:28:24,690 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2023-12-02 20:28:24,690 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-02 20:28:24,695 INFO L262 TraceCheckSpWp]: Trace formula consists of 436 conjuncts, 60 conjunts are in the unsatisfiable core [2023-12-02 20:28:24,699 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 20:28:24,703 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2023-12-02 20:28:24,813 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-12-02 20:28:24,814 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-12-02 20:28:24,866 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 15 treesize of output 10 [2023-12-02 20:28:24,949 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2023-12-02 20:28:25,052 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 15 treesize of output 10 [2023-12-02 20:28:25,176 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-12-02 20:28:25,176 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 28 [2023-12-02 20:28:25,337 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 15 treesize of output 10 [2023-12-02 20:28:25,489 INFO L349 Elim1Store]: treesize reduction 50, result has 33.3 percent of original size [2023-12-02 20:28:25,490 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 41 treesize of output 43 [2023-12-02 20:28:25,623 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 20:28:25,623 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 45 treesize of output 36 [2023-12-02 20:28:25,651 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 25 [2023-12-02 20:28:25,749 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 20:28:25,750 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 45 treesize of output 36 [2023-12-02 20:28:25,937 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 31 treesize of output 26 [2023-12-02 20:28:26,086 INFO L349 Elim1Store]: treesize reduction 36, result has 26.5 percent of original size [2023-12-02 20:28:26,086 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 49 treesize of output 25 [2023-12-02 20:28:26,206 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 41 [2023-12-02 20:28:26,570 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 38 [2023-12-02 20:28:26,805 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 88 treesize of output 75 [2023-12-02 20:28:26,959 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 105 treesize of output 90 [2023-12-02 20:28:27,438 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 162 treesize of output 141 [2023-12-02 20:28:28,377 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 449 treesize of output 403 [2023-12-02 20:28:28,517 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 9 proven. 17 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-12-02 20:28:28,517 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 20:28:28,915 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1714 (Array Int Int))) (= (select (let ((.cse0 (let ((.cse3 (+ |c_~#a~0.offset| (* |c_t_funThread2of4ForFork0_~i~0#1| 28)))) (let ((.cse2 (select (store (store |c_#memory_int| |c_~#a~0.base| (let ((.cse4 (select |c_#memory_int| |c_~#a~0.base|))) (store .cse4 .cse3 (+ (select .cse4 .cse3) 1)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1714) |c_~#a~0.base|))) (store .cse2 .cse3 (+ (- 1) (select .cse2 .cse3)))))) (.cse1 (+ |c_~#a~0.offset| (* |c_t_funThread3of4ForFork0_~i~0#1| 28)))) (store .cse0 .cse1 (+ (select .cse0 .cse1) 1))) (+ (* |c_t_funThread4of4ForFork0_~i~0#1| 28) |c_~#a~0.offset|)) 0)) is different from false [2023-12-02 20:28:28,956 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1714 (Array Int Int)) (v_ArrVal_1712 Int)) (= (select (let ((.cse0 (let ((.cse3 (+ |c_~#a~0.offset| (* |c_t_funThread2of4ForFork0_~i~0#1| 28)))) (let ((.cse2 (select (store (store |c_#memory_int| |c_~#a~0.base| (let ((.cse4 (store (select |c_#memory_int| |c_~#a~0.base|) (+ |c_~#a~0.offset| (* |c_t_funThread1of4ForFork0_~i~0#1| 28)) v_ArrVal_1712))) (store .cse4 .cse3 (+ (select .cse4 .cse3) 1)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1714) |c_~#a~0.base|))) (store .cse2 .cse3 (+ (- 1) (select .cse2 .cse3)))))) (.cse1 (+ |c_~#a~0.offset| (* |c_t_funThread3of4ForFork0_~i~0#1| 28)))) (store .cse0 .cse1 (+ (select .cse0 .cse1) 1))) (+ (* |c_t_funThread4of4ForFork0_~i~0#1| 28) |c_~#a~0.offset|)) 0)) is different from false [2023-12-02 20:28:29,530 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1714 (Array Int Int)) (v_ArrVal_1710 (Array Int Int)) (v_ArrVal_1709 (Array Int Int)) (v_ArrVal_1712 Int) (|v_t_funThread4of4ForFork0_~i~0#1_15| Int)) (let ((.cse5 (* |v_t_funThread4of4ForFork0_~i~0#1_15| 28))) (or (= (select (let ((.cse0 (let ((.cse3 (+ |c_~#a~0.offset| (* |c_t_funThread2of4ForFork0_~i~0#1| 28)))) (let ((.cse2 (select (store (store |c_#memory_int| |c_~#a~0.base| (let ((.cse4 (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1710) |c_~#a~0.base|) (+ |c_~#a~0.offset| (* |c_t_funThread1of4ForFork0_~i~0#1| 28)) v_ArrVal_1712))) (store .cse4 .cse3 (+ (select .cse4 .cse3) 1)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1714) |c_~#a~0.base|))) (store .cse2 .cse3 (+ (- 1) (select .cse2 .cse3)))))) (.cse1 (+ |c_~#a~0.offset| (* |c_t_funThread3of4ForFork0_~i~0#1| 28)))) (store .cse0 .cse1 (+ (select .cse0 .cse1) 1))) (+ .cse5 |c_~#a~0.offset|)) 0) (not (= (select (select (store |c_#pthreadsMutex| |c_~#__global_lock~0.base| v_ArrVal_1709) |c_~#a~0.base|) (+ .cse5 |c_~#a~0.offset| 4)) 0))))) is different from false [2023-12-02 20:28:29,810 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1714 (Array Int Int)) (v_ArrVal_1710 (Array Int Int)) (v_ArrVal_1709 (Array Int Int)) (v_ArrVal_1712 Int) (|v_t_funThread4of4ForFork0_~i~0#1_15| Int)) (let ((.cse0 (* |v_t_funThread4of4ForFork0_~i~0#1_15| 28))) (or (not (= (select (select (store (store |c_#pthreadsMutex| |c_t_funThread3of4ForFork0_~p~0#1.base| (store (select |c_#pthreadsMutex| |c_t_funThread3of4ForFork0_~p~0#1.base|) (+ |c_t_funThread3of4ForFork0_~p~0#1.offset| 4) 1)) |c_~#__global_lock~0.base| v_ArrVal_1709) |c_~#a~0.base|) (+ .cse0 |c_~#a~0.offset| 4)) 0)) (= (select (let ((.cse1 (let ((.cse4 (+ |c_~#a~0.offset| (* |c_t_funThread2of4ForFork0_~i~0#1| 28)))) (let ((.cse3 (select (store (store |c_#memory_int| |c_~#a~0.base| (let ((.cse5 (let ((.cse7 (+ |c_~#a~0.offset| (* |c_t_funThread1of4ForFork0_~i~0#1| 28)))) (store (select (store (store |c_#memory_int| |c_~#a~0.base| (let ((.cse6 (select |c_#memory_int| |c_~#a~0.base|))) (store .cse6 .cse7 (+ (select .cse6 .cse7) 1)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1710) |c_~#a~0.base|) .cse7 v_ArrVal_1712)))) (store .cse5 .cse4 (+ (select .cse5 .cse4) 1)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1714) |c_~#a~0.base|))) (store .cse3 .cse4 (+ (select .cse3 .cse4) (- 1)))))) (.cse2 (+ |c_~#a~0.offset| (* |c_t_funThread3of4ForFork0_~i~0#1| 28)))) (store .cse1 .cse2 (+ (select .cse1 .cse2) 1))) (+ .cse0 |c_~#a~0.offset|)) 0)))) is different from false [2023-12-02 20:28:31,740 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1714 (Array Int Int)) (v_ArrVal_1710 (Array Int Int)) (|v_t_funThread3of4ForFork0_~i~0#1_15| Int) (v_ArrVal_1709 (Array Int Int)) (v_ArrVal_1712 Int) (|v_t_funThread4of4ForFork0_~i~0#1_15| Int)) (let ((.cse1 (* |v_t_funThread3of4ForFork0_~i~0#1_15| 28)) (.cse2 (* |v_t_funThread4of4ForFork0_~i~0#1_15| 28))) (or (not (= (select (select (store (let ((.cse0 (store |c_#pthreadsMutex| |c_t_funThread2of4ForFork0_~p~0#1.base| (store (select |c_#pthreadsMutex| |c_t_funThread2of4ForFork0_~p~0#1.base|) (+ 4 |c_t_funThread2of4ForFork0_~p~0#1.offset|) 1)))) (store .cse0 |c_~#a~0.base| (store (select .cse0 |c_~#a~0.base|) (+ .cse1 |c_~#a~0.offset| 4) 1))) |c_~#__global_lock~0.base| v_ArrVal_1709) |c_~#a~0.base|) (+ .cse2 |c_~#a~0.offset| 4)) 0)) (= (select (let ((.cse3 (let ((.cse6 (+ |c_~#a~0.offset| (* |c_t_funThread2of4ForFork0_~i~0#1| 28)))) (let ((.cse5 (select (store (store |c_#memory_int| |c_~#a~0.base| (let ((.cse7 (let ((.cse9 (+ |c_~#a~0.offset| (* |c_t_funThread1of4ForFork0_~i~0#1| 28)))) (store (select (store (store |c_#memory_int| |c_~#a~0.base| (let ((.cse8 (select |c_#memory_int| |c_~#a~0.base|))) (store .cse8 .cse9 (+ (select .cse8 .cse9) 1)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1710) |c_~#a~0.base|) .cse9 v_ArrVal_1712)))) (store .cse7 .cse6 (+ (select .cse7 .cse6) 1)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1714) |c_~#a~0.base|))) (store .cse5 .cse6 (+ (select .cse5 .cse6) (- 1)))))) (.cse4 (+ .cse1 |c_~#a~0.offset|))) (store .cse3 .cse4 (+ (select .cse3 .cse4) 1))) (+ .cse2 |c_~#a~0.offset|)) 0)))) is different from false [2023-12-02 20:28:31,762 WARN L854 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread2of4ForFork0_~i~0#1_15| Int) (v_ArrVal_1714 (Array Int Int)) (v_ArrVal_1710 (Array Int Int)) (|v_t_funThread3of4ForFork0_~i~0#1_15| Int) (v_ArrVal_1709 (Array Int Int)) (v_ArrVal_1712 Int) (|v_t_funThread4of4ForFork0_~i~0#1_15| Int)) (let ((.cse1 (* |v_t_funThread3of4ForFork0_~i~0#1_15| 28)) (.cse0 (* |v_t_funThread2of4ForFork0_~i~0#1_15| 28)) (.cse2 (* |v_t_funThread4of4ForFork0_~i~0#1_15| 28))) (or (not (= (select (select (store (store |c_#pthreadsMutex| |c_~#a~0.base| (store (store (select |c_#pthreadsMutex| |c_~#a~0.base|) (+ .cse0 |c_~#a~0.offset| 4) 1) (+ .cse1 |c_~#a~0.offset| 4) 1)) |c_~#__global_lock~0.base| v_ArrVal_1709) |c_~#a~0.base|) (+ .cse2 |c_~#a~0.offset| 4)) 0)) (= (select (let ((.cse3 (let ((.cse6 (+ .cse0 |c_~#a~0.offset|))) (let ((.cse5 (select (store (store |c_#memory_int| |c_~#a~0.base| (let ((.cse7 (let ((.cse9 (+ |c_~#a~0.offset| (* |c_t_funThread1of4ForFork0_~i~0#1| 28)))) (store (select (store (store |c_#memory_int| |c_~#a~0.base| (let ((.cse8 (select |c_#memory_int| |c_~#a~0.base|))) (store .cse8 .cse9 (+ (select .cse8 .cse9) 1)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1710) |c_~#a~0.base|) .cse9 v_ArrVal_1712)))) (store .cse7 .cse6 (+ (select .cse7 .cse6) 1)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1714) |c_~#a~0.base|))) (store .cse5 .cse6 (+ (- 1) (select .cse5 .cse6)))))) (.cse4 (+ .cse1 |c_~#a~0.offset|))) (store .cse3 .cse4 (+ (select .cse3 .cse4) 1))) (+ .cse2 |c_~#a~0.offset|)) 0)))) is different from false [2023-12-02 20:28:37,015 INFO L349 Elim1Store]: treesize reduction 35, result has 40.7 percent of original size [2023-12-02 20:28:37,015 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 49 treesize of output 40 [2023-12-02 20:28:37,050 INFO L349 Elim1Store]: treesize reduction 15, result has 61.5 percent of original size [2023-12-02 20:28:37,050 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 58 treesize of output 57 [2023-12-02 20:28:37,062 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 25 treesize of output 18 [2023-12-02 20:28:37,261 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse6 (+ |c_~#a~0.offset| (* |c_t_funThread1of4ForFork0_~i~0#1| 28)))) (let ((.cse5 (store |c_#memory_int| |c_~#a~0.base| (let ((.cse18 (select |c_#memory_int| |c_~#a~0.base|))) (store .cse18 .cse6 (+ (select .cse18 .cse6) 1)))))) (and (or (= |c_t_funThread1of4ForFork0_~p~0#1.base| |c_~#a~0.base|) (forall ((v_ArrVal_1714 (Array Int Int)) (v_ArrVal_1710 (Array Int Int)) (|v_t_funThread3of4ForFork0_~i~0#1_15| Int) (v_ArrVal_1712 Int) (|t_funThread2of4ForFork0_~i~0#1| Int) (|v_t_funThread4of4ForFork0_~i~0#1_15| Int)) (or (= |v_t_funThread3of4ForFork0_~i~0#1_15| |v_t_funThread4of4ForFork0_~i~0#1_15|) (= (select (let ((.cse0 (let ((.cse3 (+ (* |t_funThread2of4ForFork0_~i~0#1| 28) |c_~#a~0.offset|))) (let ((.cse2 (select (store (store |c_#memory_int| |c_~#a~0.base| (let ((.cse4 (store (select (store .cse5 |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1710) |c_~#a~0.base|) .cse6 v_ArrVal_1712))) (store .cse4 .cse3 (+ (select .cse4 .cse3) 1)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1714) |c_~#a~0.base|))) (store .cse2 .cse3 (+ (- 1) (select .cse2 .cse3)))))) (.cse1 (+ (* |v_t_funThread3of4ForFork0_~i~0#1_15| 28) |c_~#a~0.offset|))) (store .cse0 .cse1 (+ (select .cse0 .cse1) 1))) (+ (* |v_t_funThread4of4ForFork0_~i~0#1_15| 28) |c_~#a~0.offset|)) 0)))) (or (forall ((v_ArrVal_1714 (Array Int Int)) (v_ArrVal_1710 (Array Int Int)) (|v_t_funThread3of4ForFork0_~i~0#1_15| Int) (v_ArrVal_1712 Int) (|t_funThread2of4ForFork0_~i~0#1| Int) (|v_t_funThread4of4ForFork0_~i~0#1_15| Int)) (= (select (let ((.cse7 (let ((.cse10 (+ (* |t_funThread2of4ForFork0_~i~0#1| 28) |c_~#a~0.offset|))) (let ((.cse9 (select (store (store |c_#memory_int| |c_~#a~0.base| (let ((.cse11 (store (select (store .cse5 |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1710) |c_~#a~0.base|) .cse6 v_ArrVal_1712))) (store .cse11 .cse10 (+ (select .cse11 .cse10) 1)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1714) |c_~#a~0.base|))) (store .cse9 .cse10 (+ (- 1) (select .cse9 .cse10)))))) (.cse8 (+ (* |v_t_funThread3of4ForFork0_~i~0#1_15| 28) |c_~#a~0.offset|))) (store .cse7 .cse8 (+ (select .cse7 .cse8) 1))) (+ (* |v_t_funThread4of4ForFork0_~i~0#1_15| 28) |c_~#a~0.offset|)) 0)) (not (= |c_~#a~0.base| |c_~#__global_lock~0.base|))) (forall ((v_ArrVal_1714 (Array Int Int)) (v_ArrVal_1710 (Array Int Int)) (|v_t_funThread3of4ForFork0_~i~0#1_15| Int) (v_ArrVal_1712 Int) (|t_funThread2of4ForFork0_~i~0#1| Int) (|v_t_funThread4of4ForFork0_~i~0#1_15| Int)) (let ((.cse17 (+ (* |v_t_funThread4of4ForFork0_~i~0#1_15| 28) |c_~#a~0.offset|))) (or (= |v_t_funThread3of4ForFork0_~i~0#1_15| |v_t_funThread4of4ForFork0_~i~0#1_15|) (= (select (let ((.cse12 (let ((.cse15 (+ (* |t_funThread2of4ForFork0_~i~0#1| 28) |c_~#a~0.offset|))) (let ((.cse14 (select (store (store |c_#memory_int| |c_~#a~0.base| (let ((.cse16 (store (select (store .cse5 |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1710) |c_~#a~0.base|) .cse6 v_ArrVal_1712))) (store .cse16 .cse15 (+ (select .cse16 .cse15) 1)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1714) |c_~#a~0.base|))) (store .cse14 .cse15 (+ (- 1) (select .cse14 .cse15)))))) (.cse13 (+ (* |v_t_funThread3of4ForFork0_~i~0#1_15| 28) |c_~#a~0.offset|))) (store .cse12 .cse13 (+ (select .cse12 .cse13) 1))) .cse17) 0) (= .cse17 |c_t_funThread1of4ForFork0_~p~0#1.offset|))))))) is different from false [2023-12-02 20:28:37,299 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse5 (select |c_#memory_int| |c_~#a~0.base|))) (and (or (not (= |c_~#a~0.base| |c_~#__global_lock~0.base|)) (forall ((v_ArrVal_1714 (Array Int Int)) (v_ArrVal_1710 (Array Int Int)) (|v_t_funThread3of4ForFork0_~i~0#1_15| Int) (|~#a~0.offset| Int) (|v_t_funThread1of4ForFork0_~i~0#1_15| Int) (v_ArrVal_1712 Int) (|t_funThread2of4ForFork0_~i~0#1| Int) (|v_t_funThread4of4ForFork0_~i~0#1_15| Int)) (= 0 (select (let ((.cse0 (let ((.cse3 (+ (* |t_funThread2of4ForFork0_~i~0#1| 28) |~#a~0.offset|))) (let ((.cse2 (select (store (store |c_#memory_int| |c_~#a~0.base| (let ((.cse4 (let ((.cse6 (+ (* |v_t_funThread1of4ForFork0_~i~0#1_15| 28) |~#a~0.offset|))) (store (select (store (store |c_#memory_int| |c_~#a~0.base| (store .cse5 .cse6 (+ (select .cse5 .cse6) 1))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1710) |c_~#a~0.base|) .cse6 v_ArrVal_1712)))) (store .cse4 .cse3 (+ (select .cse4 .cse3) 1)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1714) |c_~#a~0.base|))) (store .cse2 .cse3 (+ (- 1) (select .cse2 .cse3)))))) (.cse1 (+ (* |v_t_funThread3of4ForFork0_~i~0#1_15| 28) |~#a~0.offset|))) (store .cse0 .cse1 (+ (select .cse0 .cse1) 1))) (+ (* |v_t_funThread4of4ForFork0_~i~0#1_15| 28) |~#a~0.offset|))))) (forall ((v_ArrVal_1714 (Array Int Int)) (v_ArrVal_1710 (Array Int Int)) (|v_t_funThread3of4ForFork0_~i~0#1_15| Int) (|~#a~0.offset| Int) (|v_t_funThread1of4ForFork0_~i~0#1_15| Int) (v_ArrVal_1712 Int) (|t_funThread2of4ForFork0_~i~0#1| Int) (|v_t_funThread4of4ForFork0_~i~0#1_15| Int)) (or (= 0 (select (let ((.cse7 (let ((.cse10 (+ (* |t_funThread2of4ForFork0_~i~0#1| 28) |~#a~0.offset|))) (let ((.cse9 (select (store (store |c_#memory_int| |c_~#a~0.base| (let ((.cse11 (let ((.cse12 (+ (* |v_t_funThread1of4ForFork0_~i~0#1_15| 28) |~#a~0.offset|))) (store (select (store (store |c_#memory_int| |c_~#a~0.base| (store .cse5 .cse12 (+ (select .cse5 .cse12) 1))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1710) |c_~#a~0.base|) .cse12 v_ArrVal_1712)))) (store .cse11 .cse10 (+ (select .cse11 .cse10) 1)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1714) |c_~#a~0.base|))) (store .cse9 .cse10 (+ (- 1) (select .cse9 .cse10)))))) (.cse8 (+ (* |v_t_funThread3of4ForFork0_~i~0#1_15| 28) |~#a~0.offset|))) (store .cse7 .cse8 (+ (select .cse7 .cse8) 1))) (+ (* |v_t_funThread4of4ForFork0_~i~0#1_15| 28) |~#a~0.offset|))) (= |v_t_funThread3of4ForFork0_~i~0#1_15| |v_t_funThread4of4ForFork0_~i~0#1_15|) (= |v_t_funThread1of4ForFork0_~i~0#1_15| |v_t_funThread4of4ForFork0_~i~0#1_15|))))) is different from false [2023-12-02 20:28:39,358 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1714 (Array Int Int)) (v_ArrVal_1700 (Array Int Int)) (v_ArrVal_1710 (Array Int Int)) (|v_t_funThread3of4ForFork0_~i~0#1_15| Int) (|~#a~0.offset| Int) (|v_t_funThread1of4ForFork0_~i~0#1_15| Int) (v_ArrVal_1712 Int) (|t_funThread2of4ForFork0_~i~0#1| Int) (|v_t_funThread4of4ForFork0_~i~0#1_15| Int)) (or (= |v_t_funThread3of4ForFork0_~i~0#1_15| |v_t_funThread4of4ForFork0_~i~0#1_15|) (= |v_t_funThread1of4ForFork0_~i~0#1_15| |v_t_funThread4of4ForFork0_~i~0#1_15|) (= (select (let ((.cse0 (let ((.cse3 (+ (* |t_funThread2of4ForFork0_~i~0#1| 28) |~#a~0.offset|))) (let ((.cse2 (select (store (store |c_#memory_int| |c_~#a~0.base| (let ((.cse4 (let ((.cse6 (+ (* |v_t_funThread1of4ForFork0_~i~0#1_15| 28) |~#a~0.offset|))) (store (select (store (store |c_#memory_int| |c_~#a~0.base| (let ((.cse5 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1700) |c_~#a~0.base|))) (store .cse5 .cse6 (+ (select .cse5 .cse6) 1)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1710) |c_~#a~0.base|) .cse6 v_ArrVal_1712)))) (store .cse4 .cse3 (+ (select .cse4 .cse3) 1)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1714) |c_~#a~0.base|))) (store .cse2 .cse3 (+ (- 1) (select .cse2 .cse3)))))) (.cse1 (+ (* |v_t_funThread3of4ForFork0_~i~0#1_15| 28) |~#a~0.offset|))) (store .cse0 .cse1 (+ (select .cse0 .cse1) 1))) (+ (* |v_t_funThread4of4ForFork0_~i~0#1_15| 28) |~#a~0.offset|)) 0))) (or (not (= |c_~#a~0.base| |c_~#__global_lock~0.base|)) (forall ((v_ArrVal_1714 (Array Int Int)) (v_ArrVal_1700 (Array Int Int)) (v_ArrVal_1710 (Array Int Int)) (|v_t_funThread3of4ForFork0_~i~0#1_15| Int) (|~#a~0.offset| Int) (|v_t_funThread1of4ForFork0_~i~0#1_15| Int) (v_ArrVal_1712 Int) (|t_funThread2of4ForFork0_~i~0#1| Int) (|v_t_funThread4of4ForFork0_~i~0#1_15| Int)) (= (select (let ((.cse7 (let ((.cse10 (+ (* |t_funThread2of4ForFork0_~i~0#1| 28) |~#a~0.offset|))) (let ((.cse9 (select (store (store |c_#memory_int| |c_~#a~0.base| (let ((.cse11 (let ((.cse13 (+ (* |v_t_funThread1of4ForFork0_~i~0#1_15| 28) |~#a~0.offset|))) (store (select (store (store |c_#memory_int| |c_~#a~0.base| (let ((.cse12 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1700) |c_~#a~0.base|))) (store .cse12 .cse13 (+ (select .cse12 .cse13) 1)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1710) |c_~#a~0.base|) .cse13 v_ArrVal_1712)))) (store .cse11 .cse10 (+ (select .cse11 .cse10) 1)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1714) |c_~#a~0.base|))) (store .cse9 .cse10 (+ (- 1) (select .cse9 .cse10)))))) (.cse8 (+ (* |v_t_funThread3of4ForFork0_~i~0#1_15| 28) |~#a~0.offset|))) (store .cse7 .cse8 (+ (select .cse7 .cse8) 1))) (+ (* |v_t_funThread4of4ForFork0_~i~0#1_15| 28) |~#a~0.offset|)) 0)))) is different from false [2023-12-02 20:28:40,117 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 8 refuted. 3 times theorem prover too weak. 56 trivial. 14 not checked. [2023-12-02 20:28:40,117 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [768213473] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 20:28:40,117 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 20:28:40,117 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 19, 22] total 67 [2023-12-02 20:28:40,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [472787129] [2023-12-02 20:28:40,118 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 20:28:40,118 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 68 states [2023-12-02 20:28:40,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-02 20:28:40,119 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2023-12-02 20:28:40,121 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=296, Invalid=3116, Unknown=46, NotChecked=1098, Total=4556 [2023-12-02 20:28:40,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:28:40,121 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-12-02 20:28:40,121 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 68 states, 68 states have (on average 3.411764705882353) internal successors, (232), 67 states have internal predecessors, (232), 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-12-02 20:28:40,121 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:28:40,121 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-12-02 20:28:40,121 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2023-12-02 20:28:40,121 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:29:14,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:29:14,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-02 20:29:14,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-12-02 20:29:14,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2023-12-02 20:29:14,951 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3a5cbb6-c03d-425b-a860-16031649589e/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Forceful destruction successful, exit code 0 [2023-12-02 20:29:15,146 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,28 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3a5cbb6-c03d-425b-a860-16031649589e/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 20:29:15,146 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 20:29:15,146 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 20:29:15,146 INFO L85 PathProgramCache]: Analyzing trace with hash -741191475, now seen corresponding path program 1 times [2023-12-02 20:29:15,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-02 20:29:15,147 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [364493180] [2023-12-02 20:29:15,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 20:29:15,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 20:29:15,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 20:29:15,238 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2023-12-02 20:29:15,238 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-02 20:29:15,238 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [364493180] [2023-12-02 20:29:15,238 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [364493180] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 20:29:15,238 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 20:29:15,238 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-02 20:29:15,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [527851108] [2023-12-02 20:29:15,238 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 20:29:15,239 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-02 20:29:15,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-02 20:29:15,239 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-02 20:29:15,239 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 20:29:15,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:29:15,239 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-12-02 20:29:15,240 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 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-12-02 20:29:15,240 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:29:15,240 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-12-02 20:29:15,240 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2023-12-02 20:29:15,240 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 46 states. [2023-12-02 20:29:15,240 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:29:25,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:29:25,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-02 20:29:25,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-12-02 20:29:25,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2023-12-02 20:29:25,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:29:25,603 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2023-12-02 20:29:25,603 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 20:29:25,603 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 20:29:25,603 INFO L85 PathProgramCache]: Analyzing trace with hash -318696594, now seen corresponding path program 1 times [2023-12-02 20:29:25,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-02 20:29:25,603 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [339842589] [2023-12-02 20:29:25,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 20:29:25,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 20:29:25,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 20:29:25,714 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-12-02 20:29:25,714 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-02 20:29:25,714 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [339842589] [2023-12-02 20:29:25,714 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [339842589] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 20:29:25,715 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1446789005] [2023-12-02 20:29:25,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 20:29:25,715 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 20:29:25,715 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3a5cbb6-c03d-425b-a860-16031649589e/bin/ugemcutter-verify-Bi2udmvEmx/z3 [2023-12-02 20:29:25,716 INFO L229 MonitoredProcess]: Starting monitored process 29 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3a5cbb6-c03d-425b-a860-16031649589e/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 20:29:25,716 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3a5cbb6-c03d-425b-a860-16031649589e/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2023-12-02 20:29:26,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 20:29:26,096 INFO L262 TraceCheckSpWp]: Trace formula consists of 504 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-02 20:29:26,097 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 20:29:26,180 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-12-02 20:29:26,180 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 20:29:26,359 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-12-02 20:29:26,360 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1446789005] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 20:29:26,360 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 20:29:26,360 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2023-12-02 20:29:26,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1171331163] [2023-12-02 20:29:26,360 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 20:29:26,361 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-12-02 20:29:26,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-02 20:29:26,362 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-12-02 20:29:26,362 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2023-12-02 20:29:26,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:29:26,362 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-12-02 20:29:26,362 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 12.0) internal successors, (156), 13 states have internal predecessors, (156), 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-12-02 20:29:26,362 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:29:26,363 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-12-02 20:29:26,363 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2023-12-02 20:29:26,363 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 46 states. [2023-12-02 20:29:26,363 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:29:26,363 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:29:27,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:29:27,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-02 20:29:27,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-12-02 20:29:27,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2023-12-02 20:29:27,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:29:27,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-02 20:29:27,531 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3a5cbb6-c03d-425b-a860-16031649589e/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Ended with exit code 0 [2023-12-02 20:29:27,727 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,29 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3a5cbb6-c03d-425b-a860-16031649589e/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 20:29:27,727 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 20:29:27,727 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 20:29:27,727 INFO L85 PathProgramCache]: Analyzing trace with hash -673313843, now seen corresponding path program 1 times [2023-12-02 20:29:27,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-02 20:29:27,727 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1142983841] [2023-12-02 20:29:27,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 20:29:27,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 20:29:27,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 20:29:27,952 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2023-12-02 20:29:27,952 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-02 20:29:27,952 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1142983841] [2023-12-02 20:29:27,952 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1142983841] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 20:29:27,952 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [710815140] [2023-12-02 20:29:27,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 20:29:27,952 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 20:29:27,952 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3a5cbb6-c03d-425b-a860-16031649589e/bin/ugemcutter-verify-Bi2udmvEmx/z3 [2023-12-02 20:29:27,953 INFO L229 MonitoredProcess]: Starting monitored process 30 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3a5cbb6-c03d-425b-a860-16031649589e/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 20:29:27,954 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3a5cbb6-c03d-425b-a860-16031649589e/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process [2023-12-02 20:29:28,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 20:29:28,158 INFO L262 TraceCheckSpWp]: Trace formula consists of 457 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-02 20:29:28,160 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 20:29:28,399 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-12-02 20:29:28,440 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 20:29:28,440 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-12-02 20:29:28,453 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2023-12-02 20:29:28,453 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 20:29:28,467 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2151 (Array Int Int))) (not (= (select (select (store |c_#pthreadsMutex| |c_t_funThread3of4ForFork0_~p~0#1.base| v_ArrVal_2151) |c_~#__global_lock~0.base|) |c_~#__global_lock~0.offset|) 0))) is different from false [2023-12-02 20:29:28,481 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:29:28,481 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 20 [2023-12-02 20:29:28,484 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 33 treesize of output 25 [2023-12-02 20:29:28,619 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2023-12-02 20:29:28,619 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [710815140] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 20:29:28,619 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 20:29:28,619 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 13 [2023-12-02 20:29:28,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1171909501] [2023-12-02 20:29:28,619 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 20:29:28,620 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-12-02 20:29:28,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-02 20:29:28,620 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-12-02 20:29:28,621 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=116, Unknown=1, NotChecked=22, Total=182 [2023-12-02 20:29:28,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:29:28,621 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-12-02 20:29:28,621 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 14.928571428571429) internal successors, (209), 13 states have internal predecessors, (209), 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-12-02 20:29:28,621 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:29:28,621 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-12-02 20:29:28,621 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2023-12-02 20:29:28,621 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 47 states. [2023-12-02 20:29:28,621 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:29:28,621 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2023-12-02 20:29:28,622 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:29:29,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:29:29,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-02 20:29:29,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-12-02 20:29:29,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2023-12-02 20:29:29,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:29:29,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-02 20:29:29,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-02 20:29:29,913 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3a5cbb6-c03d-425b-a860-16031649589e/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Ended with exit code 0 [2023-12-02 20:29:30,109 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3a5cbb6-c03d-425b-a860-16031649589e/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable33 [2023-12-02 20:29:30,109 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 20:29:30,109 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 20:29:30,109 INFO L85 PathProgramCache]: Analyzing trace with hash -257090723, now seen corresponding path program 1 times [2023-12-02 20:29:30,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-02 20:29:30,110 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [62173851] [2023-12-02 20:29:30,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 20:29:30,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 20:29:30,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 20:29:32,113 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2023-12-02 20:29:32,114 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-02 20:29:32,114 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [62173851] [2023-12-02 20:29:32,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [62173851] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 20:29:32,114 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1995199497] [2023-12-02 20:29:32,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 20:29:32,114 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 20:29:32,114 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3a5cbb6-c03d-425b-a860-16031649589e/bin/ugemcutter-verify-Bi2udmvEmx/z3 [2023-12-02 20:29:32,115 INFO L229 MonitoredProcess]: Starting monitored process 31 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3a5cbb6-c03d-425b-a860-16031649589e/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 20:29:32,116 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3a5cbb6-c03d-425b-a860-16031649589e/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Waiting until timeout for monitored process [2023-12-02 20:29:32,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 20:29:32,322 INFO L262 TraceCheckSpWp]: Trace formula consists of 454 conjuncts, 60 conjunts are in the unsatisfiable core [2023-12-02 20:29:32,326 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 20:29:32,329 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2023-12-02 20:29:32,431 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-12-02 20:29:32,431 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-12-02 20:29:32,460 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 15 treesize of output 10 [2023-12-02 20:29:32,518 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 15 treesize of output 10 [2023-12-02 20:29:32,582 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2023-12-02 20:29:32,676 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 15 treesize of output 10 [2023-12-02 20:29:32,781 INFO L349 Elim1Store]: treesize reduction 25, result has 40.5 percent of original size [2023-12-02 20:29:32,782 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 41 treesize of output 35 [2023-12-02 20:29:32,900 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 20:29:32,900 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 33 treesize of output 26 [2023-12-02 20:29:32,922 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 25 [2023-12-02 20:29:32,996 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 20:29:32,997 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 33 treesize of output 26 [2023-12-02 20:29:33,143 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 31 treesize of output 26 [2023-12-02 20:29:33,259 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 20:29:33,271 INFO L349 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2023-12-02 20:29:33,272 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 37 treesize of output 18 [2023-12-02 20:29:33,366 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 41 [2023-12-02 20:29:33,514 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 39 [2023-12-02 20:29:33,670 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 76 treesize of output 69 [2023-12-02 20:29:33,799 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 134 treesize of output 129 [2023-12-02 20:29:33,912 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 91 treesize of output 82 [2023-12-02 20:29:34,089 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 119 treesize of output 110 [2023-12-02 20:29:34,259 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 143 treesize of output 133 [2023-12-02 20:29:34,317 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 7 proven. 17 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2023-12-02 20:29:34,317 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 20:29:34,331 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2332 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2332) |c_~#a~0.base|) (+ (* |c_t_funThread4of4ForFork0_~i~0#1| 28) |c_~#a~0.offset|)) 0)) is different from false [2023-12-02 20:29:34,338 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2332 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_~#a~0.base| (let ((.cse0 (select |c_#memory_int| |c_~#a~0.base|)) (.cse1 (+ |c_~#a~0.offset| (* |c_t_funThread2of4ForFork0_~i~0#1| 28)))) (store .cse0 .cse1 (+ (- 1) (select .cse0 .cse1))))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2332) |c_~#a~0.base|) (+ (* |c_t_funThread4of4ForFork0_~i~0#1| 28) |c_~#a~0.offset|)) 0)) is different from false [2023-12-02 20:29:38,999 INFO L349 Elim1Store]: treesize reduction 35, result has 40.7 percent of original size [2023-12-02 20:29:38,999 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 74 treesize of output 55 [2023-12-02 20:29:39,050 INFO L349 Elim1Store]: treesize reduction 15, result has 61.5 percent of original size [2023-12-02 20:29:39,050 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 58 treesize of output 57 [2023-12-02 20:29:39,059 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 25 treesize of output 18 [2023-12-02 20:29:41,220 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse10 (= |c_~#a~0.base| |c_t_funThread2of4ForFork0_~p~0#1.base|)) (.cse3 (+ |c_~#a~0.offset| (* |c_t_funThread2of4ForFork0_~i~0#1| 28))) (.cse4 (select |c_#memory_int| |c_~#a~0.base|))) (and (forall ((|v_t_funThread4of4ForFork0_~i~0#1_21| Int)) (let ((.cse0 (+ (* |v_t_funThread4of4ForFork0_~i~0#1_21| 28) |c_~#a~0.offset|))) (or (= .cse0 |c_t_funThread2of4ForFork0_~p~0#1.offset|) (forall ((|v_t_funThread3of4ForFork0_~i~0#1_21| Int) (|t_funThread1of4ForFork0_~i~0#1| Int) (v_ArrVal_2332 (Array Int Int)) (v_ArrVal_2329 Int)) (let ((.cse1 (+ (* |v_t_funThread3of4ForFork0_~i~0#1_21| 28) |c_~#a~0.offset|))) (or (= .cse1 |c_t_funThread2of4ForFork0_~p~0#1.offset|) (= |v_t_funThread3of4ForFork0_~i~0#1_21| |v_t_funThread4of4ForFork0_~i~0#1_21|) (= (select (select (store (store |c_#memory_int| |c_~#a~0.base| (let ((.cse2 (let ((.cse5 (+ |c_~#a~0.offset| (* 28 |t_funThread1of4ForFork0_~i~0#1|)))) (store .cse4 .cse5 (select .cse4 .cse5))))) (store (store .cse2 .cse1 v_ArrVal_2329) .cse3 (+ (- 1) (select (store (store .cse2 .cse3 (+ (select .cse2 .cse3) 1)) .cse1 v_ArrVal_2329) .cse3))))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2332) |c_~#a~0.base|) .cse0) 0))))))) (or (forall ((|v_t_funThread3of4ForFork0_~i~0#1_21| Int) (|v_t_funThread4of4ForFork0_~i~0#1_21| Int) (|t_funThread1of4ForFork0_~i~0#1| Int) (v_ArrVal_2332 (Array Int Int)) (v_ArrVal_2329 Int)) (let ((.cse6 (+ (* |v_t_funThread4of4ForFork0_~i~0#1_21| 28) |c_~#a~0.offset|))) (or (= .cse6 |c_t_funThread2of4ForFork0_~p~0#1.offset|) (= |v_t_funThread3of4ForFork0_~i~0#1_21| |v_t_funThread4of4ForFork0_~i~0#1_21|) (= (select (select (store (store |c_#memory_int| |c_~#a~0.base| (let ((.cse7 (let ((.cse9 (+ |c_~#a~0.offset| (* 28 |t_funThread1of4ForFork0_~i~0#1|)))) (store .cse4 .cse9 (select .cse4 .cse9)))) (.cse8 (+ (* |v_t_funThread3of4ForFork0_~i~0#1_21| 28) |c_~#a~0.offset|))) (store (store .cse7 .cse8 v_ArrVal_2329) .cse3 (+ (- 1) (select (store (store .cse7 .cse3 (+ (select .cse7 .cse3) 1)) .cse8 v_ArrVal_2329) .cse3))))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2332) |c_~#a~0.base|) .cse6) 0)))) .cse10) (or (forall ((|v_t_funThread3of4ForFork0_~i~0#1_21| Int) (|v_t_funThread4of4ForFork0_~i~0#1_21| Int) (|t_funThread1of4ForFork0_~i~0#1| Int) (v_ArrVal_2332 (Array Int Int)) (v_ArrVal_2329 Int)) (or (= |v_t_funThread3of4ForFork0_~i~0#1_21| |v_t_funThread4of4ForFork0_~i~0#1_21|) (= (select (select (store (store |c_#memory_int| |c_~#a~0.base| (let ((.cse11 (let ((.cse13 (+ |c_~#a~0.offset| (* 28 |t_funThread1of4ForFork0_~i~0#1|)))) (store .cse4 .cse13 (select .cse4 .cse13)))) (.cse12 (+ (* |v_t_funThread3of4ForFork0_~i~0#1_21| 28) |c_~#a~0.offset|))) (store (store .cse11 .cse12 v_ArrVal_2329) .cse3 (+ (- 1) (select (store (store .cse11 .cse3 (+ (select .cse11 .cse3) 1)) .cse12 v_ArrVal_2329) .cse3))))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2332) |c_~#a~0.base|) (+ (* |v_t_funThread4of4ForFork0_~i~0#1_21| 28) |c_~#a~0.offset|)) 0))) .cse10) (or (not (= |c_~#a~0.base| |c_~#__global_lock~0.base|)) (and (or (forall ((|v_t_funThread3of4ForFork0_~i~0#1_21| Int) (|v_t_funThread4of4ForFork0_~i~0#1_21| Int) (|t_funThread1of4ForFork0_~i~0#1| Int) (v_ArrVal_2332 (Array Int Int)) (v_ArrVal_2329 Int)) (= (select (select (store (store |c_#memory_int| |c_~#a~0.base| (let ((.cse14 (let ((.cse16 (+ |c_~#a~0.offset| (* 28 |t_funThread1of4ForFork0_~i~0#1|)))) (store .cse4 .cse16 (select .cse4 .cse16)))) (.cse15 (+ (* |v_t_funThread3of4ForFork0_~i~0#1_21| 28) |c_~#a~0.offset|))) (store (store .cse14 .cse15 v_ArrVal_2329) .cse3 (+ (- 1) (select (store (store .cse14 .cse3 (+ (select .cse14 .cse3) 1)) .cse15 v_ArrVal_2329) .cse3))))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2332) |c_~#a~0.base|) (+ (* |v_t_funThread4of4ForFork0_~i~0#1_21| 28) |c_~#a~0.offset|)) 0)) .cse10) (forall ((|v_t_funThread3of4ForFork0_~i~0#1_21| Int) (|v_t_funThread4of4ForFork0_~i~0#1_21| Int) (|t_funThread1of4ForFork0_~i~0#1| Int) (v_ArrVal_2332 (Array Int Int)) (v_ArrVal_2329 Int)) (let ((.cse17 (+ (* |v_t_funThread3of4ForFork0_~i~0#1_21| 28) |c_~#a~0.offset|))) (or (= .cse17 |c_t_funThread2of4ForFork0_~p~0#1.offset|) (= (select (select (store (store |c_#memory_int| |c_~#a~0.base| (let ((.cse18 (let ((.cse19 (+ |c_~#a~0.offset| (* 28 |t_funThread1of4ForFork0_~i~0#1|)))) (store .cse4 .cse19 (select .cse4 .cse19))))) (store (store .cse18 .cse17 v_ArrVal_2329) .cse3 (+ (- 1) (select (store (store .cse18 .cse3 (+ (select .cse18 .cse3) 1)) .cse17 v_ArrVal_2329) .cse3))))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2332) |c_~#a~0.base|) (+ (* |v_t_funThread4of4ForFork0_~i~0#1_21| 28) |c_~#a~0.offset|)) 0)))))))) is different from false [2023-12-02 20:29:43,257 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_int| |c_~#a~0.base|))) (and (forall ((|v_t_funThread4of4ForFork0_~i~0#1_21| Int) (|v_t_funThread2of4ForFork0_~i~0#1_21| Int) (|~#a~0.offset| Int)) (or (= |v_t_funThread2of4ForFork0_~i~0#1_21| |v_t_funThread4of4ForFork0_~i~0#1_21|) (forall ((|v_t_funThread3of4ForFork0_~i~0#1_21| Int) (|t_funThread1of4ForFork0_~i~0#1| Int) (v_ArrVal_2332 (Array Int Int)) (v_ArrVal_2329 Int)) (or (= (select (select (store (store |c_#memory_int| |c_~#a~0.base| (let ((.cse0 (let ((.cse4 (+ (* 28 |t_funThread1of4ForFork0_~i~0#1|) |~#a~0.offset|))) (store .cse3 .cse4 (select .cse3 .cse4)))) (.cse1 (+ (* |v_t_funThread3of4ForFork0_~i~0#1_21| 28) |~#a~0.offset|)) (.cse2 (+ (* |v_t_funThread2of4ForFork0_~i~0#1_21| 28) |~#a~0.offset|))) (store (store .cse0 .cse1 v_ArrVal_2329) .cse2 (+ (- 1) (select (store (store .cse0 .cse2 (+ (select .cse0 .cse2) 1)) .cse1 v_ArrVal_2329) .cse2))))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2332) |c_~#a~0.base|) (+ (* |v_t_funThread4of4ForFork0_~i~0#1_21| 28) |~#a~0.offset|)) 0) (= |v_t_funThread3of4ForFork0_~i~0#1_21| |v_t_funThread2of4ForFork0_~i~0#1_21|) (= |v_t_funThread3of4ForFork0_~i~0#1_21| |v_t_funThread4of4ForFork0_~i~0#1_21|))))) (or (forall ((|v_t_funThread3of4ForFork0_~i~0#1_21| Int) (|v_t_funThread4of4ForFork0_~i~0#1_21| Int) (|t_funThread1of4ForFork0_~i~0#1| Int) (|v_t_funThread2of4ForFork0_~i~0#1_21| Int) (|~#a~0.offset| Int) (v_ArrVal_2332 (Array Int Int)) (v_ArrVal_2329 Int)) (or (= (select (select (store (store |c_#memory_int| |c_~#a~0.base| (let ((.cse5 (let ((.cse8 (+ (* 28 |t_funThread1of4ForFork0_~i~0#1|) |~#a~0.offset|))) (store .cse3 .cse8 (select .cse3 .cse8)))) (.cse6 (+ (* |v_t_funThread3of4ForFork0_~i~0#1_21| 28) |~#a~0.offset|)) (.cse7 (+ (* |v_t_funThread2of4ForFork0_~i~0#1_21| 28) |~#a~0.offset|))) (store (store .cse5 .cse6 v_ArrVal_2329) .cse7 (+ (- 1) (select (store (store .cse5 .cse7 (+ (select .cse5 .cse7) 1)) .cse6 v_ArrVal_2329) .cse7))))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2332) |c_~#a~0.base|) (+ (* |v_t_funThread4of4ForFork0_~i~0#1_21| 28) |~#a~0.offset|)) 0) (= |v_t_funThread3of4ForFork0_~i~0#1_21| |v_t_funThread2of4ForFork0_~i~0#1_21|))) (not (= |c_~#a~0.base| |c_~#__global_lock~0.base|))))) is different from false [2023-12-02 20:29:45,318 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2316 (Array Int Int)) (|v_t_funThread4of4ForFork0_~i~0#1_21| Int) (|v_t_funThread2of4ForFork0_~i~0#1_21| Int) (|~#a~0.offset| Int)) (or (= |v_t_funThread2of4ForFork0_~i~0#1_21| |v_t_funThread4of4ForFork0_~i~0#1_21|) (forall ((|v_t_funThread3of4ForFork0_~i~0#1_21| Int) (|t_funThread1of4ForFork0_~i~0#1| Int) (v_ArrVal_2332 (Array Int Int)) (v_ArrVal_2329 Int)) (or (= |v_t_funThread3of4ForFork0_~i~0#1_21| |v_t_funThread2of4ForFork0_~i~0#1_21|) (= |v_t_funThread3of4ForFork0_~i~0#1_21| |v_t_funThread4of4ForFork0_~i~0#1_21|) (= (select (select (store (store |c_#memory_int| |c_~#a~0.base| (let ((.cse0 (let ((.cse3 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2316) |c_~#a~0.base|)) (.cse4 (+ (* 28 |t_funThread1of4ForFork0_~i~0#1|) |~#a~0.offset|))) (store .cse3 .cse4 (select .cse3 .cse4)))) (.cse1 (+ (* |v_t_funThread3of4ForFork0_~i~0#1_21| 28) |~#a~0.offset|)) (.cse2 (+ (* |v_t_funThread2of4ForFork0_~i~0#1_21| 28) |~#a~0.offset|))) (store (store .cse0 .cse1 v_ArrVal_2329) .cse2 (+ (- 1) (select (store (store .cse0 .cse2 (+ (select .cse0 .cse2) 1)) .cse1 v_ArrVal_2329) .cse2))))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2332) |c_~#a~0.base|) (+ (* |v_t_funThread4of4ForFork0_~i~0#1_21| 28) |~#a~0.offset|)) 0))))) (or (not (= |c_~#a~0.base| |c_~#__global_lock~0.base|)) (forall ((|v_t_funThread3of4ForFork0_~i~0#1_21| Int) (v_ArrVal_2316 (Array Int Int)) (|v_t_funThread4of4ForFork0_~i~0#1_21| Int) (|t_funThread1of4ForFork0_~i~0#1| Int) (|v_t_funThread2of4ForFork0_~i~0#1_21| Int) (|~#a~0.offset| Int) (v_ArrVal_2332 (Array Int Int)) (v_ArrVal_2329 Int)) (or (= |v_t_funThread3of4ForFork0_~i~0#1_21| |v_t_funThread2of4ForFork0_~i~0#1_21|) (= (select (select (store (store |c_#memory_int| |c_~#a~0.base| (let ((.cse5 (let ((.cse8 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2316) |c_~#a~0.base|)) (.cse9 (+ (* 28 |t_funThread1of4ForFork0_~i~0#1|) |~#a~0.offset|))) (store .cse8 .cse9 (select .cse8 .cse9)))) (.cse6 (+ (* |v_t_funThread3of4ForFork0_~i~0#1_21| 28) |~#a~0.offset|)) (.cse7 (+ (* |v_t_funThread2of4ForFork0_~i~0#1_21| 28) |~#a~0.offset|))) (store (store .cse5 .cse6 v_ArrVal_2329) .cse7 (+ (- 1) (select (store (store .cse5 .cse7 (+ (select .cse5 .cse7) 1)) .cse6 v_ArrVal_2329) .cse7))))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2332) |c_~#a~0.base|) (+ (* |v_t_funThread4of4ForFork0_~i~0#1_21| 28) |~#a~0.offset|)) 0))))) is different from false [2023-12-02 20:29:46,321 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 6 refuted. 1 times theorem prover too weak. 56 trivial. 18 not checked. [2023-12-02 20:29:46,321 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1995199497] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 20:29:46,321 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 20:29:46,322 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 18, 18] total 42 [2023-12-02 20:29:46,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1618306420] [2023-12-02 20:29:46,322 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 20:29:46,322 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2023-12-02 20:29:46,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-02 20:29:46,323 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2023-12-02 20:29:46,324 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=186, Invalid=1228, Unknown=12, NotChecked=380, Total=1806 [2023-12-02 20:29:46,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:29:46,324 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-12-02 20:29:46,324 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 43 states have (on average 4.883720930232558) internal successors, (210), 42 states have internal predecessors, (210), 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-12-02 20:29:46,324 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:29:46,324 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-12-02 20:29:46,324 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2023-12-02 20:29:46,324 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 47 states. [2023-12-02 20:29:46,324 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:29:46,324 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2023-12-02 20:29:46,324 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-12-02 20:29:46,325 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:31:01,721 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.56s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-12-02 20:31:10,533 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-12-02 20:31:12,623 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-12-02 20:31:13,960 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.25s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-12-02 20:31:16,946 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-12-02 20:31:38,690 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.44s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-12-02 20:32:01,282 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse6 (select |c_#memory_int| |c_~#a~0.base|)) (.cse7 (+ |c_~#a~0.offset| (* |c_t_funThread1of4ForFork0_~i~0#1| 28)))) (store .cse6 .cse7 (+ (- 1) (select .cse6 .cse7))))) (.cse2 (+ |c_~#a~0.offset| (* |c_t_funThread2of4ForFork0_~i~0#1| 28)))) (let ((.cse3 (store .cse0 .cse2 (+ (select .cse0 .cse2) 1))) (.cse1 (+ |c_~#a~0.offset| (* |c_t_funThread3of4ForFork0_~i~0#1| 28)))) (and (forall ((|v_t_funThread4of4ForFork0_~i~0#1_21| Int) (v_ArrVal_2332 (Array Int Int)) (v_ArrVal_2329 Int)) (let ((.cse4 (* |v_t_funThread4of4ForFork0_~i~0#1_21| 28))) (or (= (select (select (store (store |c_#memory_int| |c_~#a~0.base| (store (store .cse0 .cse1 v_ArrVal_2329) .cse2 (+ (- 1) (select (store .cse3 .cse1 v_ArrVal_2329) .cse2)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2332) |c_~#a~0.base|) (+ .cse4 |c_~#a~0.offset|)) 0) (not (= (select (select |c_#pthreadsMutex| |c_~#a~0.base|) (+ .cse4 |c_~#a~0.offset| 4)) 0))))) (forall ((|v_t_funThread4of4ForFork0_~i~0#1_21| Int) (v_ArrVal_2323 (Array Int Int)) (v_ArrVal_2332 (Array Int Int)) (v_ArrVal_2329 Int)) (let ((.cse5 (* |v_t_funThread4of4ForFork0_~i~0#1_21| 28))) (or (= (select (select (store (store |c_#memory_int| |c_~#a~0.base| (store (store .cse0 .cse1 v_ArrVal_2329) .cse2 (+ (- 1) (select (store .cse3 .cse1 v_ArrVal_2329) .cse2)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2332) |c_~#a~0.base|) (+ .cse5 |c_~#a~0.offset|)) 0) (not (= (select (select (store |c_#pthreadsMutex| |c_~#__global_lock~0.base| v_ArrVal_2323) |c_~#a~0.base|) (+ .cse5 |c_~#a~0.offset| 4)) 0))))) (forall ((v_ArrVal_2332 (Array Int Int)) (v_ArrVal_2329 Int)) (= (select (select (store (store |c_#memory_int| |c_~#a~0.base| (store (store .cse0 .cse1 v_ArrVal_2329) .cse2 (+ (- 1) (select (store .cse3 .cse1 v_ArrVal_2329) .cse2)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2332) |c_~#a~0.base|) (+ (* |c_t_funThread4of4ForFork0_~i~0#1| 28) |c_~#a~0.offset|)) 0))))) is different from false [2023-12-02 20:32:18,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:32:18,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-02 20:32:18,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-12-02 20:32:18,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2023-12-02 20:32:18,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:32:18,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-02 20:32:18,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-02 20:32:18,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2023-12-02 20:32:18,882 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3a5cbb6-c03d-425b-a860-16031649589e/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Ended with exit code 0 [2023-12-02 20:32:19,078 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3a5cbb6-c03d-425b-a860-16031649589e/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable34 [2023-12-02 20:32:19,078 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 20:32:19,078 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 20:32:19,078 INFO L85 PathProgramCache]: Analyzing trace with hash -2076874118, now seen corresponding path program 4 times [2023-12-02 20:32:19,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-02 20:32:19,078 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1224416734] [2023-12-02 20:32:19,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 20:32:19,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 20:32:19,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 20:32:47,536 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 4 proven. 77 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 20:32:47,536 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-02 20:32:47,536 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1224416734] [2023-12-02 20:32:47,537 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1224416734] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 20:32:47,537 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1529055516] [2023-12-02 20:32:47,537 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-12-02 20:32:47,537 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 20:32:47,537 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3a5cbb6-c03d-425b-a860-16031649589e/bin/ugemcutter-verify-Bi2udmvEmx/z3 [2023-12-02 20:32:47,538 INFO L229 MonitoredProcess]: Starting monitored process 32 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3a5cbb6-c03d-425b-a860-16031649589e/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 20:32:47,538 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3a5cbb6-c03d-425b-a860-16031649589e/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Waiting until timeout for monitored process [2023-12-02 20:32:47,780 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-12-02 20:32:47,780 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-02 20:32:47,782 INFO L262 TraceCheckSpWp]: Trace formula consists of 450 conjuncts, 64 conjunts are in the unsatisfiable core [2023-12-02 20:32:47,786 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 20:32:47,792 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2023-12-02 20:32:47,924 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-12-02 20:32:47,925 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-12-02 20:32:47,987 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 15 treesize of output 10 [2023-12-02 20:32:48,084 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2023-12-02 20:32:48,195 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 15 treesize of output 10 [2023-12-02 20:32:48,322 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-12-02 20:32:48,322 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 11 [2023-12-02 20:32:48,438 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 15 treesize of output 10 [2023-12-02 20:32:48,556 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2023-12-02 20:32:48,688 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 20:32:48,688 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 21 treesize of output 16 [2023-12-02 20:32:48,698 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 25 [2023-12-02 20:32:48,804 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 20:32:48,805 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 21 treesize of output 16 [2023-12-02 20:32:48,967 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 31 treesize of output 26 [2023-12-02 20:32:49,119 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-12-02 20:32:49,120 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 11 [2023-12-02 20:32:49,246 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 41 [2023-12-02 20:32:49,389 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 73 [2023-12-02 20:32:49,697 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 111 treesize of output 106 [2023-12-02 20:32:49,849 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 128 treesize of output 121 [2023-12-02 20:32:50,100 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 208 treesize of output 201 [2023-12-02 20:32:50,409 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 407 treesize of output 401 [2023-12-02 20:32:50,481 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 5 proven. 21 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-12-02 20:32:50,481 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 20:32:50,788 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2501 (Array Int Int))) (= (select (let ((.cse0 (let ((.cse2 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2501) |c_~#a~0.base|)) (.cse3 (+ |c_~#a~0.offset| (* |c_t_funThread2of4ForFork0_~i~0#1| 28)))) (store .cse2 .cse3 (+ (- 1) (select .cse2 .cse3))))) (.cse1 (+ |c_~#a~0.offset| (* |c_t_funThread3of4ForFork0_~i~0#1| 28)))) (store .cse0 .cse1 (+ (select .cse0 .cse1) 1))) (+ (* |c_t_funThread4of4ForFork0_~i~0#1| 28) |c_~#a~0.offset|)) 0)) is different from false [2023-12-02 20:32:50,845 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2501 (Array Int Int))) (= (select (let ((.cse0 (let ((.cse2 (select (store (store |c_#memory_int| |c_~#a~0.base| (let ((.cse4 (select |c_#memory_int| |c_~#a~0.base|)) (.cse5 (+ |c_~#a~0.offset| (* |c_t_funThread1of4ForFork0_~i~0#1| 28)))) (store .cse4 .cse5 (+ (- 1) (select .cse4 .cse5))))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2501) |c_~#a~0.base|)) (.cse3 (+ |c_~#a~0.offset| (* |c_t_funThread2of4ForFork0_~i~0#1| 28)))) (store .cse2 .cse3 (+ (- 1) (select .cse2 .cse3))))) (.cse1 (+ |c_~#a~0.offset| (* |c_t_funThread3of4ForFork0_~i~0#1| 28)))) (store .cse0 .cse1 (+ (select .cse0 .cse1) 1))) (+ (* |c_t_funThread4of4ForFork0_~i~0#1| 28) |c_~#a~0.offset|)) 0)) is different from false [2023-12-02 20:32:51,272 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2501 (Array Int Int))) (= (select (let ((.cse0 (let ((.cse3 (+ |c_~#a~0.offset| (* |c_t_funThread2of4ForFork0_~i~0#1| 28)))) (let ((.cse2 (select (store (store |c_#memory_int| |c_~#a~0.base| (let ((.cse4 (let ((.cse6 (select |c_#memory_int| |c_~#a~0.base|))) (store .cse6 .cse3 (+ (select .cse6 .cse3) 1)))) (.cse5 (+ |c_~#a~0.offset| (* |c_t_funThread1of4ForFork0_~i~0#1| 28)))) (store .cse4 .cse5 (+ (- 1) (select .cse4 .cse5))))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2501) |c_~#a~0.base|))) (store .cse2 .cse3 (+ (- 1) (select .cse2 .cse3)))))) (.cse1 (+ |c_~#a~0.offset| (* |c_t_funThread3of4ForFork0_~i~0#1| 28)))) (store .cse0 .cse1 (+ (select .cse0 .cse1) 1))) (+ (* |c_t_funThread4of4ForFork0_~i~0#1| 28) |c_~#a~0.offset|)) 0)) is different from false [2023-12-02 20:32:52,067 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2501 (Array Int Int)) (v_ArrVal_2497 (Array Int Int)) (v_ArrVal_2496 (Array Int Int)) (|v_t_funThread4of4ForFork0_~i~0#1_23| Int)) (let ((.cse7 (* |v_t_funThread4of4ForFork0_~i~0#1_23| 28))) (or (= (select (let ((.cse0 (let ((.cse3 (+ |c_~#a~0.offset| (* |c_t_funThread2of4ForFork0_~i~0#1| 28)))) (let ((.cse2 (select (store (store |c_#memory_int| |c_~#a~0.base| (let ((.cse4 (let ((.cse6 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2497) |c_~#a~0.base|))) (store .cse6 .cse3 (+ (select .cse6 .cse3) 1)))) (.cse5 (+ |c_~#a~0.offset| (* |c_t_funThread1of4ForFork0_~i~0#1| 28)))) (store .cse4 .cse5 (+ (- 1) (select .cse4 .cse5))))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2501) |c_~#a~0.base|))) (store .cse2 .cse3 (+ (- 1) (select .cse2 .cse3)))))) (.cse1 (+ |c_~#a~0.offset| (* |c_t_funThread3of4ForFork0_~i~0#1| 28)))) (store .cse0 .cse1 (+ (select .cse0 .cse1) 1))) (+ |c_~#a~0.offset| .cse7)) 0) (not (= (select (select (store |c_#pthreadsMutex| |c_~#__global_lock~0.base| v_ArrVal_2496) |c_~#a~0.base|) (+ |c_~#a~0.offset| 4 .cse7)) 0))))) is different from false [2023-12-02 20:32:52,392 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:32:52,393 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 27 [2023-12-02 20:32:52,409 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:32:52,409 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 45 [2023-12-02 20:32:52,418 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 25 treesize of output 18 [2023-12-02 20:32:54,481 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse7 (+ |c_~#a~0.offset| (* |c_t_funThread1of4ForFork0_~i~0#1| 28)))) (let ((.cse3 (+ |c_~#a~0.offset| (* |c_t_funThread3of4ForFork0_~i~0#1| 28))) (.cse5 (+ |c_~#a~0.offset| (* |c_t_funThread2of4ForFork0_~i~0#1| 28))) (.cse9 (store |c_#memory_int| |c_~#a~0.base| (let ((.cse14 (select |c_#memory_int| |c_~#a~0.base|))) (store .cse14 .cse7 (+ (select .cse14 .cse7) 1)))))) (let ((.cse0 (forall ((v_ArrVal_2501 (Array Int Int)) (v_ArrVal_2497 (Array Int Int)) (|v_t_funThread4of4ForFork0_~i~0#1_23| Int)) (= 0 (select (let ((.cse10 (let ((.cse11 (select (store (store |c_#memory_int| |c_~#a~0.base| (let ((.cse12 (let ((.cse13 (select (store .cse9 |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2497) |c_~#a~0.base|))) (store .cse13 .cse5 (+ (select .cse13 .cse5) 1))))) (store .cse12 .cse7 (+ (- 1) (select .cse12 .cse7))))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2501) |c_~#a~0.base|))) (store .cse11 .cse5 (+ (- 1) (select .cse11 .cse5)))))) (store .cse10 .cse3 (+ (select .cse10 .cse3) 1))) (+ |c_~#a~0.offset| (* |v_t_funThread4of4ForFork0_~i~0#1_23| 28))))))) (and (or (not (= |c_~#a~0.base| |c_~#__global_lock~0.base|)) .cse0) (or (= |c_~#a~0.base| |c_t_funThread3of4ForFork0_~p~0#1.base|) .cse0) (forall ((v_ArrVal_2501 (Array Int Int)) (v_ArrVal_2497 (Array Int Int)) (|v_t_funThread4of4ForFork0_~i~0#1_23| Int)) (let ((.cse1 (+ |c_~#a~0.offset| (* |v_t_funThread4of4ForFork0_~i~0#1_23| 28)))) (or (= .cse1 |c_t_funThread3of4ForFork0_~p~0#1.offset|) (= 0 (select (let ((.cse2 (let ((.cse4 (select (store (store |c_#memory_int| |c_~#a~0.base| (let ((.cse6 (let ((.cse8 (select (store .cse9 |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2497) |c_~#a~0.base|))) (store .cse8 .cse5 (+ (select .cse8 .cse5) 1))))) (store .cse6 .cse7 (+ (- 1) (select .cse6 .cse7))))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2501) |c_~#a~0.base|))) (store .cse4 .cse5 (+ (- 1) (select .cse4 .cse5)))))) (store .cse2 .cse3 (+ (select .cse2 .cse3) 1))) .cse1))))))))) is different from false [2023-12-02 20:32:56,513 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse5 (+ |c_~#a~0.offset| (* |c_t_funThread1of4ForFork0_~i~0#1| 28)))) (let ((.cse3 (+ |c_~#a~0.offset| (* |c_t_funThread2of4ForFork0_~i~0#1| 28))) (.cse7 (store |c_#memory_int| |c_~#a~0.base| (let ((.cse13 (select |c_#memory_int| |c_~#a~0.base|))) (store .cse13 .cse5 (+ (select .cse13 .cse5) 1)))))) (and (forall ((|v_t_funThread3of4ForFork0_~i~0#1_23| Int) (v_ArrVal_2501 (Array Int Int)) (v_ArrVal_2497 (Array Int Int)) (|v_t_funThread4of4ForFork0_~i~0#1_23| Int)) (or (= |v_t_funThread3of4ForFork0_~i~0#1_23| |v_t_funThread4of4ForFork0_~i~0#1_23|) (= (select (let ((.cse0 (let ((.cse2 (select (store (store |c_#memory_int| |c_~#a~0.base| (let ((.cse4 (let ((.cse6 (select (store .cse7 |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2497) |c_~#a~0.base|))) (store .cse6 .cse3 (+ (select .cse6 .cse3) 1))))) (store .cse4 .cse5 (+ (- 1) (select .cse4 .cse5))))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2501) |c_~#a~0.base|))) (store .cse2 .cse3 (+ (- 1) (select .cse2 .cse3))))) (.cse1 (+ |c_~#a~0.offset| (* |v_t_funThread3of4ForFork0_~i~0#1_23| 28)))) (store .cse0 .cse1 (+ (select .cse0 .cse1) 1))) (+ |c_~#a~0.offset| (* |v_t_funThread4of4ForFork0_~i~0#1_23| 28))) 0))) (or (not (= |c_~#a~0.base| |c_~#__global_lock~0.base|)) (forall ((|v_t_funThread3of4ForFork0_~i~0#1_23| Int) (v_ArrVal_2501 (Array Int Int)) (v_ArrVal_2497 (Array Int Int)) (|v_t_funThread4of4ForFork0_~i~0#1_23| Int)) (= (select (let ((.cse8 (let ((.cse10 (select (store (store |c_#memory_int| |c_~#a~0.base| (let ((.cse11 (let ((.cse12 (select (store .cse7 |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2497) |c_~#a~0.base|))) (store .cse12 .cse3 (+ (select .cse12 .cse3) 1))))) (store .cse11 .cse5 (+ (- 1) (select .cse11 .cse5))))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2501) |c_~#a~0.base|))) (store .cse10 .cse3 (+ (- 1) (select .cse10 .cse3))))) (.cse9 (+ |c_~#a~0.offset| (* |v_t_funThread3of4ForFork0_~i~0#1_23| 28)))) (store .cse8 .cse9 (+ (select .cse8 .cse9) 1))) (+ |c_~#a~0.offset| (* |v_t_funThread4of4ForFork0_~i~0#1_23| 28))) 0)))))) is different from false [2023-12-02 20:32:58,567 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_~#a~0.offset| (* |c_t_funThread2of4ForFork0_~i~0#1| 28))) (.cse5 (+ |c_~#a~0.offset| (* |c_t_funThread1of4ForFork0_~i~0#1| 28)))) (and (forall ((|v_t_funThread3of4ForFork0_~i~0#1_23| Int) (v_ArrVal_2501 (Array Int Int)) (v_ArrVal_2497 (Array Int Int)) (|v_t_funThread4of4ForFork0_~i~0#1_23| Int) (v_ArrVal_2491 (Array Int Int))) (or (= (select (let ((.cse0 (let ((.cse2 (select (store (store |c_#memory_int| |c_~#a~0.base| (let ((.cse4 (let ((.cse6 (select (store (store |c_#memory_int| |c_~#a~0.base| (let ((.cse7 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2491) |c_~#a~0.base|))) (store .cse7 .cse5 (+ (select .cse7 .cse5) 1)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2497) |c_~#a~0.base|))) (store .cse6 .cse3 (+ (select .cse6 .cse3) 1))))) (store .cse4 .cse5 (+ (- 1) (select .cse4 .cse5))))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2501) |c_~#a~0.base|))) (store .cse2 .cse3 (+ (- 1) (select .cse2 .cse3))))) (.cse1 (+ |c_~#a~0.offset| (* |v_t_funThread3of4ForFork0_~i~0#1_23| 28)))) (store .cse0 .cse1 (+ (select .cse0 .cse1) 1))) (+ |c_~#a~0.offset| (* |v_t_funThread4of4ForFork0_~i~0#1_23| 28))) 0) (= |v_t_funThread3of4ForFork0_~i~0#1_23| |v_t_funThread4of4ForFork0_~i~0#1_23|))) (or (not (= |c_~#a~0.base| |c_~#__global_lock~0.base|)) (forall ((|v_t_funThread3of4ForFork0_~i~0#1_23| Int) (v_ArrVal_2501 (Array Int Int)) (v_ArrVal_2497 (Array Int Int)) (|v_t_funThread4of4ForFork0_~i~0#1_23| Int) (v_ArrVal_2491 (Array Int Int))) (= (select (let ((.cse8 (let ((.cse10 (select (store (store |c_#memory_int| |c_~#a~0.base| (let ((.cse11 (let ((.cse12 (select (store (store |c_#memory_int| |c_~#a~0.base| (let ((.cse13 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2491) |c_~#a~0.base|))) (store .cse13 .cse5 (+ (select .cse13 .cse5) 1)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2497) |c_~#a~0.base|))) (store .cse12 .cse3 (+ (select .cse12 .cse3) 1))))) (store .cse11 .cse5 (+ (- 1) (select .cse11 .cse5))))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2501) |c_~#a~0.base|))) (store .cse10 .cse3 (+ (- 1) (select .cse10 .cse3))))) (.cse9 (+ |c_~#a~0.offset| (* |v_t_funThread3of4ForFork0_~i~0#1_23| 28)))) (store .cse8 .cse9 (+ (select .cse8 .cse9) 1))) (+ |c_~#a~0.offset| (* |v_t_funThread4of4ForFork0_~i~0#1_23| 28))) 0))))) is different from false [2023-12-02 20:32:59,594 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 25 treesize of output 16 [2023-12-02 20:32:59,648 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 25 treesize of output 16 [2023-12-02 20:33:00,810 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse5 (+ |c_~#a~0.offset| (* |c_t_funThread1of4ForFork0_~i~0#1| 28))) (.cse8 (= |c_t_funThread1of4ForFork0_~p~0#1.base| |c_~#a~0.base|))) (and (forall ((|v_t_funThread3of4ForFork0_~i~0#1_23| Int) (|v_t_funThread4of4ForFork0_~i~0#1_23| Int)) (or (= |v_t_funThread3of4ForFork0_~i~0#1_23| |v_t_funThread4of4ForFork0_~i~0#1_23|) (forall ((|v_t_funThread2of4ForFork0_~i~0#1_23| Int) (v_ArrVal_2501 (Array Int Int)) (v_ArrVal_2497 (Array Int Int)) (v_ArrVal_2491 (Array Int Int))) (let ((.cse0 (+ |c_~#a~0.offset| (* |v_t_funThread2of4ForFork0_~i~0#1_23| 28)))) (or (= .cse0 |c_t_funThread1of4ForFork0_~p~0#1.offset|) (= (select (let ((.cse1 (let ((.cse3 (select (store (store |c_#memory_int| |c_~#a~0.base| (let ((.cse4 (let ((.cse6 (select (store (store |c_#memory_int| |c_~#a~0.base| (let ((.cse7 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2491) |c_~#a~0.base|))) (store .cse7 .cse5 (+ (select .cse7 .cse5) 1)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2497) |c_~#a~0.base|))) (store .cse6 .cse0 (+ (select .cse6 .cse0) 1))))) (store .cse4 .cse5 (+ (- 1) (select .cse4 .cse5))))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2501) |c_~#a~0.base|))) (store .cse3 .cse0 (+ (- 1) (select .cse3 .cse0))))) (.cse2 (+ |c_~#a~0.offset| (* |v_t_funThread3of4ForFork0_~i~0#1_23| 28)))) (store .cse1 .cse2 (+ (select .cse1 .cse2) 1))) (+ |c_~#a~0.offset| (* |v_t_funThread4of4ForFork0_~i~0#1_23| 28))) 0)))))) (or .cse8 (forall ((|v_t_funThread3of4ForFork0_~i~0#1_23| Int) (|v_t_funThread2of4ForFork0_~i~0#1_23| Int) (v_ArrVal_2501 (Array Int Int)) (v_ArrVal_2497 (Array Int Int)) (|v_t_funThread4of4ForFork0_~i~0#1_23| Int) (v_ArrVal_2491 (Array Int Int))) (or (= (select (let ((.cse9 (let ((.cse12 (+ |c_~#a~0.offset| (* |v_t_funThread2of4ForFork0_~i~0#1_23| 28)))) (let ((.cse11 (select (store (store |c_#memory_int| |c_~#a~0.base| (let ((.cse13 (let ((.cse14 (select (store (store |c_#memory_int| |c_~#a~0.base| (let ((.cse15 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2491) |c_~#a~0.base|))) (store .cse15 .cse5 (+ (select .cse15 .cse5) 1)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2497) |c_~#a~0.base|))) (store .cse14 .cse12 (+ (select .cse14 .cse12) 1))))) (store .cse13 .cse5 (+ (- 1) (select .cse13 .cse5))))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2501) |c_~#a~0.base|))) (store .cse11 .cse12 (+ (- 1) (select .cse11 .cse12)))))) (.cse10 (+ |c_~#a~0.offset| (* |v_t_funThread3of4ForFork0_~i~0#1_23| 28)))) (store .cse9 .cse10 (+ (select .cse9 .cse10) 1))) (+ |c_~#a~0.offset| (* |v_t_funThread4of4ForFork0_~i~0#1_23| 28))) 0) (= |v_t_funThread3of4ForFork0_~i~0#1_23| |v_t_funThread4of4ForFork0_~i~0#1_23|)))) (or (not (= |c_~#a~0.base| |c_~#__global_lock~0.base|)) (and (forall ((|v_t_funThread3of4ForFork0_~i~0#1_23| Int) (|v_t_funThread2of4ForFork0_~i~0#1_23| Int) (v_ArrVal_2501 (Array Int Int)) (v_ArrVal_2497 (Array Int Int)) (|v_t_funThread4of4ForFork0_~i~0#1_23| Int) (v_ArrVal_2491 (Array Int Int))) (let ((.cse16 (+ |c_~#a~0.offset| (* |v_t_funThread2of4ForFork0_~i~0#1_23| 28)))) (or (= .cse16 |c_t_funThread1of4ForFork0_~p~0#1.offset|) (= (select (let ((.cse17 (let ((.cse19 (select (store (store |c_#memory_int| |c_~#a~0.base| (let ((.cse20 (let ((.cse21 (select (store (store |c_#memory_int| |c_~#a~0.base| (let ((.cse22 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2491) |c_~#a~0.base|))) (store .cse22 .cse5 (+ (select .cse22 .cse5) 1)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2497) |c_~#a~0.base|))) (store .cse21 .cse16 (+ (select .cse21 .cse16) 1))))) (store .cse20 .cse5 (+ (- 1) (select .cse20 .cse5))))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2501) |c_~#a~0.base|))) (store .cse19 .cse16 (+ (- 1) (select .cse19 .cse16))))) (.cse18 (+ |c_~#a~0.offset| (* |v_t_funThread3of4ForFork0_~i~0#1_23| 28)))) (store .cse17 .cse18 (+ (select .cse17 .cse18) 1))) (+ |c_~#a~0.offset| (* |v_t_funThread4of4ForFork0_~i~0#1_23| 28))) 0)))) (or (forall ((|v_t_funThread3of4ForFork0_~i~0#1_23| Int) (|v_t_funThread2of4ForFork0_~i~0#1_23| Int) (v_ArrVal_2501 (Array Int Int)) (v_ArrVal_2497 (Array Int Int)) (|v_t_funThread4of4ForFork0_~i~0#1_23| Int) (v_ArrVal_2491 (Array Int Int))) (= (select (let ((.cse23 (let ((.cse26 (+ |c_~#a~0.offset| (* |v_t_funThread2of4ForFork0_~i~0#1_23| 28)))) (let ((.cse25 (select (store (store |c_#memory_int| |c_~#a~0.base| (let ((.cse27 (let ((.cse28 (select (store (store |c_#memory_int| |c_~#a~0.base| (let ((.cse29 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2491) |c_~#a~0.base|))) (store .cse29 .cse5 (+ (select .cse29 .cse5) 1)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2497) |c_~#a~0.base|))) (store .cse28 .cse26 (+ (select .cse28 .cse26) 1))))) (store .cse27 .cse5 (+ (- 1) (select .cse27 .cse5))))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2501) |c_~#a~0.base|))) (store .cse25 .cse26 (+ (- 1) (select .cse25 .cse26)))))) (.cse24 (+ |c_~#a~0.offset| (* |v_t_funThread3of4ForFork0_~i~0#1_23| 28)))) (store .cse23 .cse24 (+ (select .cse23 .cse24) 1))) (+ |c_~#a~0.offset| (* |v_t_funThread4of4ForFork0_~i~0#1_23| 28))) 0)) .cse8))))) is different from false [2023-12-02 20:33:02,876 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((|v_t_funThread3of4ForFork0_~i~0#1_23| Int) (|~#a~0.offset| Int) (|v_t_funThread1of4ForFork0_~i~0#1_23| Int) (|v_t_funThread4of4ForFork0_~i~0#1_23| Int)) (or (forall ((|v_t_funThread2of4ForFork0_~i~0#1_23| Int) (v_ArrVal_2501 (Array Int Int)) (v_ArrVal_2497 (Array Int Int)) (v_ArrVal_2491 (Array Int Int))) (or (= (select (let ((.cse0 (let ((.cse3 (+ (* |v_t_funThread2of4ForFork0_~i~0#1_23| 28) |~#a~0.offset|))) (let ((.cse2 (select (store (store |c_#memory_int| |c_~#a~0.base| (let ((.cse5 (+ (* |v_t_funThread1of4ForFork0_~i~0#1_23| 28) |~#a~0.offset|))) (let ((.cse4 (let ((.cse6 (select (store (store |c_#memory_int| |c_~#a~0.base| (let ((.cse7 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2491) |c_~#a~0.base|))) (store .cse7 .cse5 (+ (select .cse7 .cse5) 1)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2497) |c_~#a~0.base|))) (store .cse6 .cse3 (+ (select .cse6 .cse3) 1))))) (store .cse4 .cse5 (+ (- 1) (select .cse4 .cse5)))))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2501) |c_~#a~0.base|))) (store .cse2 .cse3 (+ (- 1) (select .cse2 .cse3)))))) (.cse1 (+ |~#a~0.offset| (* |v_t_funThread3of4ForFork0_~i~0#1_23| 28)))) (store .cse0 .cse1 (+ (select .cse0 .cse1) 1))) (+ (* |v_t_funThread4of4ForFork0_~i~0#1_23| 28) |~#a~0.offset|)) 0) (= |v_t_funThread1of4ForFork0_~i~0#1_23| |v_t_funThread2of4ForFork0_~i~0#1_23|))) (= |v_t_funThread3of4ForFork0_~i~0#1_23| |v_t_funThread4of4ForFork0_~i~0#1_23|))) (or (forall ((|v_t_funThread3of4ForFork0_~i~0#1_23| Int) (|v_t_funThread2of4ForFork0_~i~0#1_23| Int) (v_ArrVal_2501 (Array Int Int)) (|v_t_funThread1of4ForFork0_~i~0#1_23| Int) (|~#a~0.offset| Int) (v_ArrVal_2497 (Array Int Int)) (|v_t_funThread4of4ForFork0_~i~0#1_23| Int) (v_ArrVal_2491 (Array Int Int))) (or (= (select (let ((.cse8 (let ((.cse11 (+ (* |v_t_funThread2of4ForFork0_~i~0#1_23| 28) |~#a~0.offset|))) (let ((.cse10 (select (store (store |c_#memory_int| |c_~#a~0.base| (let ((.cse13 (+ (* |v_t_funThread1of4ForFork0_~i~0#1_23| 28) |~#a~0.offset|))) (let ((.cse12 (let ((.cse14 (select (store (store |c_#memory_int| |c_~#a~0.base| (let ((.cse15 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2491) |c_~#a~0.base|))) (store .cse15 .cse13 (+ (select .cse15 .cse13) 1)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2497) |c_~#a~0.base|))) (store .cse14 .cse11 (+ (select .cse14 .cse11) 1))))) (store .cse12 .cse13 (+ (- 1) (select .cse12 .cse13)))))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2501) |c_~#a~0.base|))) (store .cse10 .cse11 (+ (- 1) (select .cse10 .cse11)))))) (.cse9 (+ |~#a~0.offset| (* |v_t_funThread3of4ForFork0_~i~0#1_23| 28)))) (store .cse8 .cse9 (+ (select .cse8 .cse9) 1))) (+ (* |v_t_funThread4of4ForFork0_~i~0#1_23| 28) |~#a~0.offset|)) 0) (= |v_t_funThread1of4ForFork0_~i~0#1_23| |v_t_funThread2of4ForFork0_~i~0#1_23|))) (not (= |c_~#a~0.base| |c_~#__global_lock~0.base|)))) is different from false [2023-12-02 20:33:03,954 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 4 refuted. 1 times theorem prover too weak. 55 trivial. 21 not checked. [2023-12-02 20:33:03,955 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1529055516] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 20:33:03,955 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 20:33:03,955 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 19, 21] total 66 [2023-12-02 20:33:03,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [65168230] [2023-12-02 20:33:03,955 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 20:33:03,956 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 67 states [2023-12-02 20:33:03,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-02 20:33:03,957 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2023-12-02 20:33:03,959 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=270, Invalid=3048, Unknown=24, NotChecked=1080, Total=4422 [2023-12-02 20:33:03,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:33:03,959 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-12-02 20:33:03,959 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 67 states, 67 states have (on average 3.537313432835821) internal successors, (237), 66 states have internal predecessors, (237), 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-12-02 20:33:03,959 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:33:03,959 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-12-02 20:33:03,959 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2023-12-02 20:33:03,959 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 68 states. [2023-12-02 20:33:03,959 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:33:03,959 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2023-12-02 20:33:03,959 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-12-02 20:33:03,960 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 34 states. [2023-12-02 20:33:03,960 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:34:28,020 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.51s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-12-02 20:34:29,882 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.07s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-12-02 20:34:32,560 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-12-02 20:34:36,690 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.80s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-12-02 20:34:38,301 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.59s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-12-02 20:35:01,238 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-12-02 20:35:05,881 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-12-02 20:35:10,287 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-12-02 20:35:12,295 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-12-02 20:35:14,309 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-12-02 20:35:16,319 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-12-02 20:35:17,469 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.15s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-12-02 20:35:32,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:35:32,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-02 20:35:32,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-12-02 20:35:32,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2023-12-02 20:35:32,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:35:32,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-02 20:35:32,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-02 20:35:32,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2023-12-02 20:35:32,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2023-12-02 20:35:32,133 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3a5cbb6-c03d-425b-a860-16031649589e/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Ended with exit code 0 [2023-12-02 20:35:32,329 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 32 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3a5cbb6-c03d-425b-a860-16031649589e/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable35 [2023-12-02 20:35:32,329 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 20:35:32,329 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 20:35:32,329 INFO L85 PathProgramCache]: Analyzing trace with hash -910850458, now seen corresponding path program 5 times [2023-12-02 20:35:32,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-02 20:35:32,329 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1028218083] [2023-12-02 20:35:32,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 20:35:32,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 20:35:32,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 20:35:39,219 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 79 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-12-02 20:35:39,219 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-02 20:35:39,219 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1028218083] [2023-12-02 20:35:39,219 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1028218083] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 20:35:39,219 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [651311701] [2023-12-02 20:35:39,219 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-12-02 20:35:39,219 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 20:35:39,219 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3a5cbb6-c03d-425b-a860-16031649589e/bin/ugemcutter-verify-Bi2udmvEmx/z3 [2023-12-02 20:35:39,220 INFO L229 MonitoredProcess]: Starting monitored process 33 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3a5cbb6-c03d-425b-a860-16031649589e/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 20:35:39,221 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3a5cbb6-c03d-425b-a860-16031649589e/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Waiting until timeout for monitored process [2023-12-02 20:35:45,298 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2023-12-02 20:35:45,298 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-02 20:35:45,306 INFO L262 TraceCheckSpWp]: Trace formula consists of 450 conjuncts, 64 conjunts are in the unsatisfiable core [2023-12-02 20:35:45,310 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 20:35:45,319 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2023-12-02 20:35:45,539 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-12-02 20:35:45,539 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-12-02 20:35:45,649 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 15 treesize of output 10 [2023-12-02 20:35:45,780 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-12-02 20:35:45,987 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 15 treesize of output 10 [2023-12-02 20:35:46,218 INFO L349 Elim1Store]: treesize reduction 30, result has 37.5 percent of original size [2023-12-02 20:35:46,218 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 38 treesize of output 36 [2023-12-02 20:35:46,512 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 15 treesize of output 10 [2023-12-02 20:35:46,770 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 20:35:46,804 INFO L349 Elim1Store]: treesize reduction 47, result has 31.9 percent of original size [2023-12-02 20:35:46,804 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 2 case distinctions, treesize of input 38 treesize of output 40 [2023-12-02 20:35:47,065 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 20:35:47,066 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 42 treesize of output 33 [2023-12-02 20:35:47,125 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 25 [2023-12-02 20:35:47,292 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 20:35:47,293 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 42 treesize of output 33 [2023-12-02 20:35:47,612 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 31 treesize of output 26 [2023-12-02 20:35:47,876 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 20:35:47,911 INFO L349 Elim1Store]: treesize reduction 32, result has 34.7 percent of original size [2023-12-02 20:35:47,912 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 46 treesize of output 29 [2023-12-02 20:35:48,096 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 41 [2023-12-02 20:35:48,297 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 73 [2023-12-02 20:35:48,731 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 111 treesize of output 106 [2023-12-02 20:35:48,935 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 128 treesize of output 121 [2023-12-02 20:35:49,211 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 240 treesize of output 233 [2023-12-02 20:35:51,734 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 439 treesize of output 433 [2023-12-02 20:35:51,840 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 9 proven. 17 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-12-02 20:35:51,840 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 20:35:52,362 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2675 (Array Int Int))) (= (select (let ((.cse0 (let ((.cse2 (select (store (store |c_#memory_int| |c_~#a~0.base| (let ((.cse4 (select |c_#memory_int| |c_~#a~0.base|)) (.cse5 (+ |c_~#a~0.offset| (* |c_t_funThread1of4ForFork0_~i~0#1| 28)))) (store .cse4 .cse5 (+ (- 1) (select .cse4 .cse5))))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2675) |c_~#a~0.base|)) (.cse3 (+ |c_~#a~0.offset| (* |c_t_funThread3of4ForFork0_~i~0#1| 28)))) (store .cse2 .cse3 (+ (select .cse2 .cse3) 1)))) (.cse1 (+ |c_~#a~0.offset| (* |c_t_funThread2of4ForFork0_~i~0#1| 28)))) (store .cse0 .cse1 (+ (- 1) (select .cse0 .cse1)))) (+ (* |c_t_funThread4of4ForFork0_~i~0#1| 28) |c_~#a~0.offset|)) 0)) is different from false [2023-12-02 20:35:53,634 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2675 (Array Int Int)) (|v_t_funThread4of4ForFork0_~i~0#1_25| Int) (v_ArrVal_2671 (Array Int Int)) (v_ArrVal_2670 (Array Int Int))) (let ((.cse0 (* |v_t_funThread4of4ForFork0_~i~0#1_25| 28))) (or (not (= (select (select (store |c_#pthreadsMutex| |c_~#__global_lock~0.base| v_ArrVal_2670) |c_~#a~0.base|) (+ |c_~#a~0.offset| .cse0 4)) 0)) (= (select (let ((.cse2 (+ |c_~#a~0.offset| (* |c_t_funThread2of4ForFork0_~i~0#1| 28)))) (let ((.cse1 (let ((.cse3 (select (store (store |c_#memory_int| |c_~#a~0.base| (let ((.cse5 (let ((.cse7 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2671) |c_~#a~0.base|))) (store .cse7 .cse2 (+ (select .cse7 .cse2) 1)))) (.cse6 (+ |c_~#a~0.offset| (* |c_t_funThread1of4ForFork0_~i~0#1| 28)))) (store .cse5 .cse6 (+ (- 1) (select .cse5 .cse6))))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2675) |c_~#a~0.base|)) (.cse4 (+ |c_~#a~0.offset| (* |c_t_funThread3of4ForFork0_~i~0#1| 28)))) (store .cse3 .cse4 (+ (select .cse3 .cse4) 1))))) (store .cse1 .cse2 (+ (- 1) (select .cse1 .cse2))))) (+ |c_~#a~0.offset| .cse0)) 0)))) is different from false [2023-12-02 20:35:53,655 WARN L854 $PredicateComparison]: unable to prove that (forall ((|t_funThread1of4ForFork0_~i~0#1| Int) (v_ArrVal_2675 (Array Int Int)) (|v_t_funThread4of4ForFork0_~i~0#1_25| Int) (v_ArrVal_2671 (Array Int Int)) (v_ArrVal_2670 (Array Int Int))) (let ((.cse0 (* |v_t_funThread4of4ForFork0_~i~0#1_25| 28))) (or (not (= (select (select (store |c_#pthreadsMutex| |c_~#__global_lock~0.base| v_ArrVal_2670) |c_~#a~0.base|) (+ |c_~#a~0.offset| .cse0 4)) 0)) (= (select (let ((.cse2 (+ |c_~#a~0.offset| (* |c_t_funThread2of4ForFork0_~i~0#1| 28)))) (let ((.cse1 (let ((.cse3 (select (store (store |c_#memory_int| |c_~#a~0.base| (let ((.cse6 (+ |c_~#a~0.offset| (* 28 |t_funThread1of4ForFork0_~i~0#1|)))) (let ((.cse5 (let ((.cse7 (select (store (store |c_#memory_int| |c_~#a~0.base| (let ((.cse8 (select |c_#memory_int| |c_~#a~0.base|))) (store .cse8 .cse6 (+ (select .cse8 .cse6) 1)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2671) |c_~#a~0.base|))) (store .cse7 .cse2 (+ (select .cse7 .cse2) 1))))) (store .cse5 .cse6 (+ (- 1) (select .cse5 .cse6)))))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2675) |c_~#a~0.base|)) (.cse4 (+ |c_~#a~0.offset| (* |c_t_funThread3of4ForFork0_~i~0#1| 28)))) (store .cse3 .cse4 (+ (select .cse3 .cse4) 1))))) (store .cse1 .cse2 (+ (- 1) (select .cse1 .cse2))))) (+ |c_~#a~0.offset| .cse0)) 0)))) is different from false [2023-12-02 20:35:53,718 WARN L854 $PredicateComparison]: unable to prove that (forall ((|t_funThread1of4ForFork0_~i~0#1| Int) (v_ArrVal_2675 (Array Int Int)) (|v_t_funThread4of4ForFork0_~i~0#1_25| Int) (v_ArrVal_2671 (Array Int Int)) (v_ArrVal_2670 (Array Int Int))) (let ((.cse0 (* |v_t_funThread4of4ForFork0_~i~0#1_25| 28))) (or (not (= (select (select (store (store |c_#pthreadsMutex| |c_t_funThread3of4ForFork0_~p~0#1.base| (store (select |c_#pthreadsMutex| |c_t_funThread3of4ForFork0_~p~0#1.base|) (+ |c_t_funThread3of4ForFork0_~p~0#1.offset| 4) 1)) |c_~#__global_lock~0.base| v_ArrVal_2670) |c_~#a~0.base|) (+ |c_~#a~0.offset| .cse0 4)) 0)) (= (select (let ((.cse2 (+ |c_~#a~0.offset| (* |c_t_funThread2of4ForFork0_~i~0#1| 28)))) (let ((.cse1 (let ((.cse3 (select (store (store |c_#memory_int| |c_~#a~0.base| (let ((.cse6 (+ |c_~#a~0.offset| (* 28 |t_funThread1of4ForFork0_~i~0#1|)))) (let ((.cse5 (let ((.cse7 (select (store (store |c_#memory_int| |c_~#a~0.base| (let ((.cse8 (select |c_#memory_int| |c_~#a~0.base|))) (store .cse8 .cse6 (+ (select .cse8 .cse6) 1)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2671) |c_~#a~0.base|))) (store .cse7 .cse2 (+ (select .cse7 .cse2) 1))))) (store .cse5 .cse6 (+ (- 1) (select .cse5 .cse6)))))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2675) |c_~#a~0.base|)) (.cse4 (+ |c_~#a~0.offset| (* |c_t_funThread3of4ForFork0_~i~0#1| 28)))) (store .cse3 .cse4 (+ (select .cse3 .cse4) 1))))) (store .cse1 .cse2 (+ (- 1) (select .cse1 .cse2))))) (+ |c_~#a~0.offset| .cse0)) 0)))) is different from false [2023-12-02 20:35:53,741 WARN L854 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread3of4ForFork0_~i~0#1_25| Int) (|t_funThread1of4ForFork0_~i~0#1| Int) (v_ArrVal_2675 (Array Int Int)) (|v_t_funThread4of4ForFork0_~i~0#1_25| Int) (v_ArrVal_2671 (Array Int Int)) (v_ArrVal_2670 (Array Int Int))) (let ((.cse0 (* |v_t_funThread3of4ForFork0_~i~0#1_25| 28)) (.cse1 (* |v_t_funThread4of4ForFork0_~i~0#1_25| 28))) (or (not (= (select (select (store (store |c_#pthreadsMutex| |c_~#a~0.base| (store (select |c_#pthreadsMutex| |c_~#a~0.base|) (+ |c_~#a~0.offset| 4 .cse0) 1)) |c_~#__global_lock~0.base| v_ArrVal_2670) |c_~#a~0.base|) (+ |c_~#a~0.offset| .cse1 4)) 0)) (= (select (let ((.cse3 (+ |c_~#a~0.offset| (* |c_t_funThread2of4ForFork0_~i~0#1| 28)))) (let ((.cse2 (let ((.cse4 (select (store (store |c_#memory_int| |c_~#a~0.base| (let ((.cse7 (+ |c_~#a~0.offset| (* 28 |t_funThread1of4ForFork0_~i~0#1|)))) (let ((.cse6 (let ((.cse8 (select (store (store |c_#memory_int| |c_~#a~0.base| (let ((.cse9 (select |c_#memory_int| |c_~#a~0.base|))) (store .cse9 .cse7 (+ (select .cse9 .cse7) 1)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2671) |c_~#a~0.base|))) (store .cse8 .cse3 (+ (select .cse8 .cse3) 1))))) (store .cse6 .cse7 (+ (- 1) (select .cse6 .cse7)))))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2675) |c_~#a~0.base|)) (.cse5 (+ |c_~#a~0.offset| .cse0))) (store .cse4 .cse5 (+ (select .cse4 .cse5) 1))))) (store .cse2 .cse3 (+ (- 1) (select .cse2 .cse3))))) (+ |c_~#a~0.offset| .cse1)) 0)))) is different from false [2023-12-02 20:35:53,779 WARN L854 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread3of4ForFork0_~i~0#1_25| Int) (|t_funThread1of4ForFork0_~i~0#1| Int) (v_ArrVal_2664 (Array Int Int)) (v_ArrVal_2675 (Array Int Int)) (|v_t_funThread4of4ForFork0_~i~0#1_25| Int) (v_ArrVal_2671 (Array Int Int)) (v_ArrVal_2670 (Array Int Int))) (let ((.cse0 (* |v_t_funThread3of4ForFork0_~i~0#1_25| 28)) (.cse1 (* |v_t_funThread4of4ForFork0_~i~0#1_25| 28))) (or (not (= (select (select (store (store |c_#pthreadsMutex| |c_~#a~0.base| (store (select |c_#pthreadsMutex| |c_~#a~0.base|) (+ |c_~#a~0.offset| 4 .cse0) 1)) |c_~#__global_lock~0.base| v_ArrVal_2670) |c_~#a~0.base|) (+ |c_~#a~0.offset| .cse1 4)) 0)) (= (select (let ((.cse3 (+ |c_~#a~0.offset| (* |c_t_funThread2of4ForFork0_~i~0#1| 28)))) (let ((.cse2 (let ((.cse4 (select (store (store |c_#memory_int| |c_~#a~0.base| (let ((.cse7 (+ |c_~#a~0.offset| (* 28 |t_funThread1of4ForFork0_~i~0#1|)))) (let ((.cse6 (let ((.cse8 (select (store (store |c_#memory_int| |c_~#a~0.base| (let ((.cse9 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2664) |c_~#a~0.base|))) (store .cse9 .cse7 (+ (select .cse9 .cse7) 1)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2671) |c_~#a~0.base|))) (store .cse8 .cse3 (+ (select .cse8 .cse3) 1))))) (store .cse6 .cse7 (+ (- 1) (select .cse6 .cse7)))))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2675) |c_~#a~0.base|)) (.cse5 (+ |c_~#a~0.offset| .cse0))) (store .cse4 .cse5 (+ (select .cse4 .cse5) 1))))) (store .cse2 .cse3 (+ (- 1) (select .cse2 .cse3))))) (+ |c_~#a~0.offset| .cse1)) 0)))) is different from false [2023-12-02 20:35:54,721 INFO L349 Elim1Store]: treesize reduction 104, result has 26.2 percent of original size [2023-12-02 20:35:54,721 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 82 treesize of output 68 [2023-12-02 20:35:54,835 INFO L349 Elim1Store]: treesize reduction 38, result has 45.7 percent of original size [2023-12-02 20:35:54,836 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 71 treesize of output 69 [2023-12-02 20:35:54,849 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 25 treesize of output 18 [2023-12-02 20:35:54,981 WARN L854 $PredicateComparison]: unable to prove that (and (or (forall ((|v_t_funThread2of4ForFork0_~i~0#1_25| Int) (|v_t_funThread3of4ForFork0_~i~0#1_25| Int) (|t_funThread1of4ForFork0_~i~0#1| Int) (v_ArrVal_2664 (Array Int Int)) (v_ArrVal_2675 (Array Int Int)) (|~#a~0.offset| Int) (|v_t_funThread4of4ForFork0_~i~0#1_25| Int) (v_ArrVal_2671 (Array Int Int))) (= (select (let ((.cse1 (+ (* |v_t_funThread2of4ForFork0_~i~0#1_25| 28) |~#a~0.offset|))) (let ((.cse0 (let ((.cse2 (select (store (store |c_#memory_int| |c_~#a~0.base| (let ((.cse5 (+ (* 28 |t_funThread1of4ForFork0_~i~0#1|) |~#a~0.offset|))) (let ((.cse4 (let ((.cse6 (select (store (store |c_#memory_int| |c_~#a~0.base| (let ((.cse7 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2664) |c_~#a~0.base|))) (store .cse7 .cse5 (+ (select .cse7 .cse5) 1)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2671) |c_~#a~0.base|))) (store .cse6 .cse1 (+ (select .cse6 .cse1) 1))))) (store .cse4 .cse5 (+ (- 1) (select .cse4 .cse5)))))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2675) |c_~#a~0.base|)) (.cse3 (+ (* |v_t_funThread3of4ForFork0_~i~0#1_25| 28) |~#a~0.offset|))) (store .cse2 .cse3 (+ (select .cse2 .cse3) 1))))) (store .cse0 .cse1 (+ (- 1) (select .cse0 .cse1))))) (+ (* |v_t_funThread4of4ForFork0_~i~0#1_25| 28) |~#a~0.offset|)) 0)) (not (= |c_~#a~0.base| |c_~#__global_lock~0.base|))) (forall ((|v_t_funThread2of4ForFork0_~i~0#1_25| Int) (|v_t_funThread3of4ForFork0_~i~0#1_25| Int) (|t_funThread1of4ForFork0_~i~0#1| Int) (v_ArrVal_2664 (Array Int Int)) (v_ArrVal_2675 (Array Int Int)) (|~#a~0.offset| Int) (|v_t_funThread4of4ForFork0_~i~0#1_25| Int) (v_ArrVal_2671 (Array Int Int))) (or (= (select (let ((.cse9 (+ (* |v_t_funThread2of4ForFork0_~i~0#1_25| 28) |~#a~0.offset|))) (let ((.cse8 (let ((.cse10 (select (store (store |c_#memory_int| |c_~#a~0.base| (let ((.cse13 (+ (* 28 |t_funThread1of4ForFork0_~i~0#1|) |~#a~0.offset|))) (let ((.cse12 (let ((.cse14 (select (store (store |c_#memory_int| |c_~#a~0.base| (let ((.cse15 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2664) |c_~#a~0.base|))) (store .cse15 .cse13 (+ (select .cse15 .cse13) 1)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2671) |c_~#a~0.base|))) (store .cse14 .cse9 (+ (select .cse14 .cse9) 1))))) (store .cse12 .cse13 (+ (- 1) (select .cse12 .cse13)))))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2675) |c_~#a~0.base|)) (.cse11 (+ (* |v_t_funThread3of4ForFork0_~i~0#1_25| 28) |~#a~0.offset|))) (store .cse10 .cse11 (+ (select .cse10 .cse11) 1))))) (store .cse8 .cse9 (+ (- 1) (select .cse8 .cse9))))) (+ (* |v_t_funThread4of4ForFork0_~i~0#1_25| 28) |~#a~0.offset|)) 0) (= |v_t_funThread3of4ForFork0_~i~0#1_25| |v_t_funThread4of4ForFork0_~i~0#1_25|) (= |v_t_funThread2of4ForFork0_~i~0#1_25| |v_t_funThread4of4ForFork0_~i~0#1_25|)))) is different from false [2023-12-02 20:35:56,058 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 55 trivial. 19 not checked. [2023-12-02 20:35:56,058 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [651311701] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 20:35:56,058 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 20:35:56,058 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 19, 20] total 61 [2023-12-02 20:35:56,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2054392594] [2023-12-02 20:35:56,059 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 20:35:56,059 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 62 states [2023-12-02 20:35:56,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-02 20:35:56,060 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2023-12-02 20:35:56,062 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=243, Invalid=2726, Unknown=29, NotChecked=784, Total=3782 [2023-12-02 20:35:56,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:35:56,062 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-12-02 20:35:56,062 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 62 states, 62 states have (on average 3.5806451612903225) internal successors, (222), 61 states have internal predecessors, (222), 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-12-02 20:35:56,062 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:35:56,062 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-12-02 20:35:56,062 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2023-12-02 20:35:56,063 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 68 states. [2023-12-02 20:35:56,063 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:35:56,063 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2023-12-02 20:35:56,063 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-12-02 20:35:56,063 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 34 states. [2023-12-02 20:35:56,063 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 50 states. [2023-12-02 20:35:56,063 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:36:09,082 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 20:36:30,979 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-12-02 20:36:51,381 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-12-02 20:36:57,413 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-12-02 20:36:59,472 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-12-02 20:37:01,507 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-12-02 20:37:03,509 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-12-02 20:37:06,220 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-12-02 20:37:08,259 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-12-02 20:37:10,678 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-12-02 20:37:12,924 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-12-02 20:37:15,057 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-12-02 20:37:17,355 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-12-02 20:37:19,358 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-12-02 20:37:21,374 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-12-02 20:37:23,717 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-12-02 20:37:25,721 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-12-02 20:37:28,103 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-12-02 20:37:30,142 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-12-02 20:37:32,289 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-12-02 20:37:34,291 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-12-02 20:37:38,929 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-12-02 20:37:41,197 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-12-02 20:37:51,164 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-12-02 20:37:53,226 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-12-02 20:37:55,229 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-12-02 20:38:23,246 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-12-02 20:38:25,322 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-12-02 20:38:27,358 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-12-02 20:38:28,401 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.04s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-12-02 20:38:32,756 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-12-02 20:38:35,038 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 20:38:37,382 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1]