./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-data-race.prp --file ../../sv-benchmarks/c/pthread/queue_ok_longer.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 0e0057cc Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82171be7-b9a3-4f46-8c93-6297f7d3b3be/bin/ugemcutter-verify-Bi2udmvEmx/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82171be7-b9a3-4f46-8c93-6297f7d3b3be/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_82171be7-b9a3-4f46-8c93-6297f7d3b3be/bin/ugemcutter-verify-Bi2udmvEmx/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82171be7-b9a3-4f46-8c93-6297f7d3b3be/bin/ugemcutter-verify-Bi2udmvEmx/config/GemCutterReach.xml -i ../../sv-benchmarks/c/pthread/queue_ok_longer.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82171be7-b9a3-4f46-8c93-6297f7d3b3be/bin/ugemcutter-verify-Bi2udmvEmx/config/svcomp-DataRace-32bit-GemCutter_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82171be7-b9a3-4f46-8c93-6297f7d3b3be/bin/ugemcutter-verify-Bi2udmvEmx --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! data-race) ) --witnessprinter.graph.data.producer GemCutter --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash f58af1aa15d4bec1241042c84c595fb9585ff7c461dd0b44f9fde0638838779a --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-12-02 20:18:49,772 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-02 20:18:49,838 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82171be7-b9a3-4f46-8c93-6297f7d3b3be/bin/ugemcutter-verify-Bi2udmvEmx/config/svcomp-DataRace-32bit-GemCutter_Default.epf [2023-12-02 20:18:49,843 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-02 20:18:49,844 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-02 20:18:49,870 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-02 20:18:49,870 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-02 20:18:49,871 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-02 20:18:49,872 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-02 20:18:49,872 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-02 20:18:49,873 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-02 20:18:49,874 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-02 20:18:49,874 INFO L153 SettingsManager]: * Use SBE=true [2023-12-02 20:18:49,875 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-02 20:18:49,875 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-02 20:18:49,876 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-02 20:18:49,876 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-02 20:18:49,877 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-02 20:18:49,877 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-02 20:18:49,877 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-02 20:18:49,878 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-02 20:18:49,879 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-02 20:18:49,879 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2023-12-02 20:18:49,879 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-12-02 20:18:49,880 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-02 20:18:49,880 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-02 20:18:49,881 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-02 20:18:49,881 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-02 20:18:49,882 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-02 20:18:49,882 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-12-02 20:18:49,883 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-02 20:18:49,883 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-02 20:18:49,884 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-02 20:18:49,884 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-02 20:18:49,884 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-02 20:18:49,885 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-02 20:18:49,885 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-02 20:18:49,885 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-02 20:18:49,885 INFO L153 SettingsManager]: * Abstraction used for commutativity in POR=VARIABLES_GLOBAL [2023-12-02 20:18:49,886 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2023-12-02 20:18:49,886 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-02 20:18:49,886 INFO L153 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2023-12-02 20:18:49,886 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2023-12-02 20:18:49,886 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_82171be7-b9a3-4f46-8c93-6297f7d3b3be/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_82171be7-b9a3-4f46-8c93-6297f7d3b3be/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 ! data-race) ) 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 -> f58af1aa15d4bec1241042c84c595fb9585ff7c461dd0b44f9fde0638838779a [2023-12-02 20:18:50,113 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-02 20:18:50,136 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-02 20:18:50,138 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-02 20:18:50,139 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-02 20:18:50,140 INFO L274 PluginConnector]: CDTParser initialized [2023-12-02 20:18:50,141 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82171be7-b9a3-4f46-8c93-6297f7d3b3be/bin/ugemcutter-verify-Bi2udmvEmx/../../sv-benchmarks/c/pthread/queue_ok_longer.i [2023-12-02 20:18:52,823 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-02 20:18:53,121 INFO L384 CDTParser]: Found 1 translation units. [2023-12-02 20:18:53,122 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82171be7-b9a3-4f46-8c93-6297f7d3b3be/sv-benchmarks/c/pthread/queue_ok_longer.i [2023-12-02 20:18:53,139 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82171be7-b9a3-4f46-8c93-6297f7d3b3be/bin/ugemcutter-verify-Bi2udmvEmx/data/092dae700/7429b3ccc65f4bff8ec8f3fc05e22b0f/FLAG993f02815 [2023-12-02 20:18:53,153 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82171be7-b9a3-4f46-8c93-6297f7d3b3be/bin/ugemcutter-verify-Bi2udmvEmx/data/092dae700/7429b3ccc65f4bff8ec8f3fc05e22b0f [2023-12-02 20:18:53,156 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-02 20:18:53,157 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-12-02 20:18:53,158 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-02 20:18:53,159 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-02 20:18:53,163 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-02 20:18:53,164 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 08:18:53" (1/1) ... [2023-12-02 20:18:53,165 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@cfabdc5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:18:53, skipping insertion in model container [2023-12-02 20:18:53,165 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 08:18:53" (1/1) ... [2023-12-02 20:18:53,221 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-02 20:18:53,632 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-02 20:18:53,642 INFO L202 MainTranslator]: Completed pre-run [2023-12-02 20:18:53,701 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-02 20:18:53,753 INFO L206 MainTranslator]: Completed translation [2023-12-02 20:18:53,753 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:18:53 WrapperNode [2023-12-02 20:18:53,754 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-02 20:18:53,754 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-02 20:18:53,755 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-02 20:18:53,755 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-02 20:18:53,760 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:18:53" (1/1) ... [2023-12-02 20:18:53,786 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:18:53" (1/1) ... [2023-12-02 20:18:53,835 INFO L138 Inliner]: procedures = 275, calls = 61, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 399 [2023-12-02 20:18:53,836 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-02 20:18:53,837 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-02 20:18:53,837 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-02 20:18:53,837 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-02 20:18:53,845 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:18:53" (1/1) ... [2023-12-02 20:18:53,845 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:18:53" (1/1) ... [2023-12-02 20:18:53,864 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:18:53" (1/1) ... [2023-12-02 20:18:53,864 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:18:53" (1/1) ... [2023-12-02 20:18:53,907 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:18:53" (1/1) ... [2023-12-02 20:18:53,912 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:18:53" (1/1) ... [2023-12-02 20:18:53,916 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:18:53" (1/1) ... [2023-12-02 20:18:53,920 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:18:53" (1/1) ... [2023-12-02 20:18:53,926 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-02 20:18:53,927 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-02 20:18:53,927 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-02 20:18:53,928 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-02 20:18:53,929 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:18:53" (1/1) ... [2023-12-02 20:18:53,935 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-02 20:18:53,948 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82171be7-b9a3-4f46-8c93-6297f7d3b3be/bin/ugemcutter-verify-Bi2udmvEmx/z3 [2023-12-02 20:18:53,962 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82171be7-b9a3-4f46-8c93-6297f7d3b3be/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:18:53,981 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82171be7-b9a3-4f46-8c93-6297f7d3b3be/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:18:54,006 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2023-12-02 20:18:54,007 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2023-12-02 20:18:54,007 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2023-12-02 20:18:54,007 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2023-12-02 20:18:54,007 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-12-02 20:18:54,007 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-12-02 20:18:54,007 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2023-12-02 20:18:54,008 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-12-02 20:18:54,008 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-12-02 20:18:54,008 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2023-12-02 20:18:54,008 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-02 20:18:54,008 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-12-02 20:18:54,008 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-02 20:18:54,008 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-02 20:18:54,010 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:18:54,162 INFO L241 CfgBuilder]: Building ICFG [2023-12-02 20:18:54,164 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-02 20:18:54,747 INFO L282 CfgBuilder]: Performing block encoding [2023-12-02 20:18:54,772 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-02 20:18:54,773 INFO L309 CfgBuilder]: Removed 2 assume(true) statements. [2023-12-02 20:18:54,774 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 08:18:54 BoogieIcfgContainer [2023-12-02 20:18:54,775 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-02 20:18:54,777 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-02 20:18:54,777 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-02 20:18:54,780 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-02 20:18:54,781 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 08:18:53" (1/3) ... [2023-12-02 20:18:54,781 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ed8e827 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 08:18:54, skipping insertion in model container [2023-12-02 20:18:54,781 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:18:53" (2/3) ... [2023-12-02 20:18:54,782 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ed8e827 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 08:18:54, skipping insertion in model container [2023-12-02 20:18:54,782 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 08:18:54" (3/3) ... [2023-12-02 20:18:54,783 INFO L112 eAbstractionObserver]: Analyzing ICFG queue_ok_longer.i [2023-12-02 20:18:54,792 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-12-02 20:18:54,802 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-02 20:18:54,802 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 35 error locations. [2023-12-02 20:18:54,802 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-12-02 20:18:54,959 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2023-12-02 20:18:55,006 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-02 20:18:55,006 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2023-12-02 20:18:55,006 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82171be7-b9a3-4f46-8c93-6297f7d3b3be/bin/ugemcutter-verify-Bi2udmvEmx/z3 [2023-12-02 20:18:55,008 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82171be7-b9a3-4f46-8c93-6297f7d3b3be/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2023-12-02 20:18:55,013 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82171be7-b9a3-4f46-8c93-6297f7d3b3be/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2023-12-02 20:18:55,054 INFO L159 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2023-12-02 20:18:55,064 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == t1Thread1of1ForFork0 ======== [2023-12-02 20:18:55,069 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;@77c7cd3d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-02 20:18:55,070 INFO L358 AbstractCegarLoop]: Starting to check reachability of 12 error locations. [2023-12-02 20:18:55,363 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting t1Err0ASSERT_VIOLATIONDATA_RACE === [t1Err0ASSERT_VIOLATIONDATA_RACE, t1Err10ASSERT_VIOLATIONDATA_RACE, t1Err11ASSERT_VIOLATIONDATA_RACE, t1Err1ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2023-12-02 20:18:55,367 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 20:18:55,368 INFO L85 PathProgramCache]: Analyzing trace with hash -812567522, now seen corresponding path program 1 times [2023-12-02 20:18:55,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-02 20:18:55,376 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [608948395] [2023-12-02 20:18:55,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 20:18:55,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 20:18:55,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 20:18:55,673 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 20:18:55,674 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-02 20:18:55,674 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [608948395] [2023-12-02 20:18:55,675 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [608948395] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 20:18:55,675 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 20:18:55,675 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-02 20:18:55,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [677113166] [2023-12-02 20:18:55,677 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 20:18:55,682 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-02 20:18:55,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-02 20:18:55,702 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-02 20:18:55,703 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-02 20:18:55,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:18:55,707 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-12-02 20:18:55,708 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 53.5) internal successors, (107), 2 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 20:18:55,708 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:18:55,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:18:55,741 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-02 20:18:55,742 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting t1Err0ASSERT_VIOLATIONDATA_RACE === [t1Err0ASSERT_VIOLATIONDATA_RACE, t1Err10ASSERT_VIOLATIONDATA_RACE, t1Err11ASSERT_VIOLATIONDATA_RACE, t1Err1ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2023-12-02 20:18:55,742 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 20:18:55,743 INFO L85 PathProgramCache]: Analyzing trace with hash 142411293, now seen corresponding path program 1 times [2023-12-02 20:18:55,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-02 20:18:55,743 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [305697468] [2023-12-02 20:18:55,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 20:18:55,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 20:18:55,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 20:18:55,889 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 20:18:55,889 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-02 20:18:55,890 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [305697468] [2023-12-02 20:18:55,890 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [305697468] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 20:18:55,890 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 20:18:55,890 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-02 20:18:55,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [417239004] [2023-12-02 20:18:55,891 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 20:18:55,892 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-02 20:18:55,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-02 20:18:55,894 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-02 20:18:55,894 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 20:18:55,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:18:55,896 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-12-02 20:18:55,896 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 51.5) internal successors, (103), 3 states have internal predecessors, (103), 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:18:55,897 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:18:55,897 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:18:56,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:18:56,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:18:56,004 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-02 20:18:56,004 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting t1Err1ASSERT_VIOLATIONDATA_RACE === [t1Err0ASSERT_VIOLATIONDATA_RACE, t1Err10ASSERT_VIOLATIONDATA_RACE, t1Err11ASSERT_VIOLATIONDATA_RACE, t1Err1ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2023-12-02 20:18:56,005 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 20:18:56,005 INFO L85 PathProgramCache]: Analyzing trace with hash -698335854, now seen corresponding path program 1 times [2023-12-02 20:18:56,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-02 20:18:56,005 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [52319100] [2023-12-02 20:18:56,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 20:18:56,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 20:18:56,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 20:18:56,766 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 20:18:56,767 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-02 20:18:56,767 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [52319100] [2023-12-02 20:18:56,767 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [52319100] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 20:18:56,767 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 20:18:56,768 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-02 20:18:56,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [920331581] [2023-12-02 20:18:56,768 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 20:18:56,769 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-02 20:18:56,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-02 20:18:56,770 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-02 20:18:56,770 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-12-02 20:18:56,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:18:56,772 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-12-02 20:18:56,772 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 24.2) internal successors, (121), 6 states have internal predecessors, (121), 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:18:56,772 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:18:56,773 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:18:56,773 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:18:57,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:18:57,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:18:57,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-02 20:18:57,076 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-02 20:18:57,076 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting t1Err2ASSERT_VIOLATIONDATA_RACE === [t1Err0ASSERT_VIOLATIONDATA_RACE, t1Err10ASSERT_VIOLATIONDATA_RACE, t1Err11ASSERT_VIOLATIONDATA_RACE, t1Err1ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2023-12-02 20:18:57,077 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 20:18:57,077 INFO L85 PathProgramCache]: Analyzing trace with hash 826659390, now seen corresponding path program 1 times [2023-12-02 20:18:57,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-02 20:18:57,078 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [482574382] [2023-12-02 20:18:57,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 20:18:57,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 20:18:57,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 20:18:57,724 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 20:18:57,724 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-02 20:18:57,725 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [482574382] [2023-12-02 20:18:57,725 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [482574382] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 20:18:57,725 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 20:18:57,725 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-02 20:18:57,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1447375184] [2023-12-02 20:18:57,725 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 20:18:57,726 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-02 20:18:57,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-02 20:18:57,727 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-02 20:18:57,728 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-12-02 20:18:57,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:18:57,730 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-12-02 20:18:57,731 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 25.6) internal successors, (128), 6 states have internal predecessors, (128), 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:18:57,731 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:18:57,731 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:18:57,731 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-12-02 20:18:57,731 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:18:58,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:18:58,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:18:58,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-02 20:18:58,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-02 20:18:58,029 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-12-02 20:18:58,030 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting t1Err3ASSERT_VIOLATIONDATA_RACE === [t1Err0ASSERT_VIOLATIONDATA_RACE, t1Err10ASSERT_VIOLATIONDATA_RACE, t1Err11ASSERT_VIOLATIONDATA_RACE, t1Err1ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2023-12-02 20:18:58,030 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 20:18:58,030 INFO L85 PathProgramCache]: Analyzing trace with hash -1076419005, now seen corresponding path program 1 times [2023-12-02 20:18:58,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-02 20:18:58,031 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [582144457] [2023-12-02 20:18:58,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 20:18:58,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 20:18:58,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 20:18:58,538 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 20:18:58,538 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-02 20:18:58,538 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [582144457] [2023-12-02 20:18:58,538 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [582144457] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 20:18:58,539 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 20:18:58,539 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-02 20:18:58,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [543141536] [2023-12-02 20:18:58,539 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 20:18:58,540 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-02 20:18:58,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-02 20:18:58,541 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-02 20:18:58,541 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-12-02 20:18:58,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:18:58,544 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-12-02 20:18:58,544 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 27.2) internal successors, (136), 6 states have internal predecessors, (136), 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:18:58,544 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:18:58,544 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:18:58,544 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-12-02 20:18:58,545 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-12-02 20:18:58,545 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:18:58,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:18:58,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:18:58,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-02 20:18:58,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-02 20:18:58,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-02 20:18:58,831 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-12-02 20:18:58,831 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting t1Err4ASSERT_VIOLATIONDATA_RACE === [t1Err0ASSERT_VIOLATIONDATA_RACE, t1Err10ASSERT_VIOLATIONDATA_RACE, t1Err11ASSERT_VIOLATIONDATA_RACE, t1Err1ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2023-12-02 20:18:58,831 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 20:18:58,832 INFO L85 PathProgramCache]: Analyzing trace with hash 436992456, now seen corresponding path program 1 times [2023-12-02 20:18:58,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-02 20:18:58,832 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [333909921] [2023-12-02 20:18:58,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 20:18:58,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 20:18:58,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 20:18:59,467 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 20:18:59,467 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-02 20:18:59,467 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [333909921] [2023-12-02 20:18:59,468 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [333909921] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 20:18:59,468 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 20:18:59,468 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-02 20:18:59,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1946492122] [2023-12-02 20:18:59,468 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 20:18:59,469 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-02 20:18:59,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-02 20:18:59,469 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-02 20:18:59,470 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-12-02 20:18:59,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:18:59,471 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-12-02 20:18:59,471 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 28.8) internal successors, (144), 6 states have internal predecessors, (144), 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:18:59,472 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:18:59,472 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:18:59,472 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-12-02 20:18:59,472 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-12-02 20:18:59,472 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-12-02 20:18:59,472 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:18:59,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:18:59,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:18:59,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-02 20:18:59,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-02 20:18:59,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-02 20:18:59,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-02 20:18:59,930 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-12-02 20:18:59,930 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting t1Err6ASSERT_VIOLATIONDATA_RACE === [t1Err0ASSERT_VIOLATIONDATA_RACE, t1Err10ASSERT_VIOLATIONDATA_RACE, t1Err11ASSERT_VIOLATIONDATA_RACE, t1Err1ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2023-12-02 20:18:59,931 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 20:18:59,931 INFO L85 PathProgramCache]: Analyzing trace with hash 1947881399, now seen corresponding path program 1 times [2023-12-02 20:18:59,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-02 20:18:59,931 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1988875596] [2023-12-02 20:18:59,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 20:18:59,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 20:18:59,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 20:19:00,600 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 20:19:00,600 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-02 20:19:00,600 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1988875596] [2023-12-02 20:19:00,601 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1988875596] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 20:19:00,601 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 20:19:00,601 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-02 20:19:00,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1291833800] [2023-12-02 20:19:00,601 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 20:19:00,602 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-02 20:19:00,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-02 20:19:00,603 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-02 20:19:00,603 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-12-02 20:19:00,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:19:00,604 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-12-02 20:19:00,605 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 32.4) internal successors, (162), 6 states have internal predecessors, (162), 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:19:00,605 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:19:00,605 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:19:00,605 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-12-02 20:19:00,605 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-12-02 20:19:00,605 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-12-02 20:19:00,605 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-12-02 20:19:00,605 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:19:00,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:19:00,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:19:00,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-02 20:19:00,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-02 20:19:00,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-02 20:19:00,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-02 20:19:00,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-02 20:19:00,960 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-12-02 20:19:00,960 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting t1Err9ASSERT_VIOLATIONDATA_RACE === [t1Err0ASSERT_VIOLATIONDATA_RACE, t1Err10ASSERT_VIOLATIONDATA_RACE, t1Err11ASSERT_VIOLATIONDATA_RACE, t1Err1ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2023-12-02 20:19:00,961 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 20:19:00,961 INFO L85 PathProgramCache]: Analyzing trace with hash 1108705957, now seen corresponding path program 1 times [2023-12-02 20:19:00,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-02 20:19:00,961 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1377453146] [2023-12-02 20:19:00,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 20:19:00,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 20:19:01,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 20:19:01,504 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 20:19:01,504 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-02 20:19:01,504 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1377453146] [2023-12-02 20:19:01,505 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1377453146] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 20:19:01,505 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 20:19:01,505 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-02 20:19:01,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [964449070] [2023-12-02 20:19:01,506 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 20:19:01,506 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-02 20:19:01,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-02 20:19:01,507 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-02 20:19:01,508 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-12-02 20:19:01,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:19:01,509 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-12-02 20:19:01,510 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 35.2) internal successors, (176), 6 states have internal predecessors, (176), 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:19:01,510 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:19:01,510 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:19:01,510 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-12-02 20:19:01,510 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-12-02 20:19:01,510 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-12-02 20:19:01,511 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-12-02 20:19:01,511 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-12-02 20:19:01,511 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:19:01,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:19:01,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:19:01,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-02 20:19:01,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-02 20:19:01,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-02 20:19:01,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-02 20:19:01,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-02 20:19:01,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-02 20:19:01,985 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-12-02 20:19:01,986 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting t1Err9ASSERT_VIOLATIONDATA_RACE === [t1Err0ASSERT_VIOLATIONDATA_RACE, t1Err10ASSERT_VIOLATIONDATA_RACE, t1Err11ASSERT_VIOLATIONDATA_RACE, t1Err1ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2023-12-02 20:19:01,986 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 20:19:01,986 INFO L85 PathProgramCache]: Analyzing trace with hash -722204627, now seen corresponding path program 1 times [2023-12-02 20:19:01,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-02 20:19:01,986 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [47439536] [2023-12-02 20:19:01,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 20:19:01,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 20:19:02,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 20:19:03,892 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 20:19:03,892 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-02 20:19:03,892 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [47439536] [2023-12-02 20:19:03,892 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [47439536] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 20:19:03,893 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 20:19:03,893 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2023-12-02 20:19:03,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [57058890] [2023-12-02 20:19:03,893 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 20:19:03,894 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-12-02 20:19:03,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-02 20:19:03,894 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-12-02 20:19:03,895 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=200, Unknown=0, NotChecked=0, Total=240 [2023-12-02 20:19:03,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:19:03,896 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-12-02 20:19:03,896 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 11.625) internal successors, (186), 16 states have internal predecessors, (186), 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:19:03,896 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:19:03,896 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:19:03,897 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-12-02 20:19:03,897 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-12-02 20:19:03,897 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-12-02 20:19:03,897 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-12-02 20:19:03,897 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-12-02 20:19:03,897 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-12-02 20:19:03,897 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:19:05,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:19:05,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:19:05,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-02 20:19:05,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-02 20:19:05,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-02 20:19:05,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-02 20:19:05,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-02 20:19:05,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-02 20:19:05,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-12-02 20:19:05,244 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-12-02 20:19:05,244 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting t1Err8ASSERT_VIOLATIONDATA_RACE === [t1Err0ASSERT_VIOLATIONDATA_RACE, t1Err10ASSERT_VIOLATIONDATA_RACE, t1Err11ASSERT_VIOLATIONDATA_RACE, t1Err1ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2023-12-02 20:19:05,244 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 20:19:05,245 INFO L85 PathProgramCache]: Analyzing trace with hash -1045509099, now seen corresponding path program 1 times [2023-12-02 20:19:05,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-02 20:19:05,245 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1421267500] [2023-12-02 20:19:05,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 20:19:05,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 20:19:05,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 20:19:05,946 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 20:19:05,946 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-02 20:19:05,946 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1421267500] [2023-12-02 20:19:05,948 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1421267500] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 20:19:05,948 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 20:19:05,948 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-02 20:19:05,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1788892808] [2023-12-02 20:19:05,949 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 20:19:05,949 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-02 20:19:05,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-02 20:19:05,950 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-02 20:19:05,951 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-12-02 20:19:05,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:19:05,952 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-12-02 20:19:05,952 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 33.8) internal successors, (169), 6 states have internal predecessors, (169), 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:19:05,952 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:19:05,952 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:19:05,952 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-12-02 20:19:05,953 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-12-02 20:19:05,953 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-12-02 20:19:05,953 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-12-02 20:19:05,953 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-12-02 20:19:05,953 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-12-02 20:19:05,953 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2023-12-02 20:19:05,953 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:19:06,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:19:06,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:19:06,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-02 20:19:06,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-02 20:19:06,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-02 20:19:06,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-02 20:19:06,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-02 20:19:06,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-02 20:19:06,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-12-02 20:19:06,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-02 20:19:06,441 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-12-02 20:19:06,441 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting t1Err6ASSERT_VIOLATIONDATA_RACE === [t1Err0ASSERT_VIOLATIONDATA_RACE, t1Err10ASSERT_VIOLATIONDATA_RACE, t1Err11ASSERT_VIOLATIONDATA_RACE, t1Err1ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2023-12-02 20:19:06,441 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 20:19:06,442 INFO L85 PathProgramCache]: Analyzing trace with hash 1407120491, now seen corresponding path program 1 times [2023-12-02 20:19:06,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-02 20:19:06,442 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1037306215] [2023-12-02 20:19:06,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 20:19:06,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 20:19:06,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 20:19:07,935 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 43 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-12-02 20:19:07,936 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-02 20:19:07,936 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1037306215] [2023-12-02 20:19:07,936 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1037306215] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 20:19:07,936 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1051181118] [2023-12-02 20:19:07,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 20:19:07,937 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 20:19:07,937 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82171be7-b9a3-4f46-8c93-6297f7d3b3be/bin/ugemcutter-verify-Bi2udmvEmx/z3 [2023-12-02 20:19:07,973 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82171be7-b9a3-4f46-8c93-6297f7d3b3be/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 20:19:07,978 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82171be7-b9a3-4f46-8c93-6297f7d3b3be/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-12-02 20:19:08,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 20:19:08,319 INFO L262 TraceCheckSpWp]: Trace formula consists of 808 conjuncts, 36 conjunts are in the unsatisfiable core [2023-12-02 20:19:08,336 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 20:19:08,415 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-12-02 20:19:08,415 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:19:09,643 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:19:09,679 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 19 treesize of output 18 [2023-12-02 20:19:09,723 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2023-12-02 20:19:09,776 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 38 [2023-12-02 20:19:09,986 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 37 treesize of output 26 [2023-12-02 20:19:10,030 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 43 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-12-02 20:19:10,030 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 20:19:10,066 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1300 (Array Int Int))) (= |c_t1Thread1of1ForFork0_enqueue_#t~nondet45#1| (select (select (store |c_#race| |c_ULTIMATE.start_main_~#id1~0#1.base| v_ArrVal_1300) |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 1606 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)))) (forall ((v_ArrVal_1300 (Array Int Int))) (= |c_t1Thread1of1ForFork0_enqueue_#t~nondet45#1| (select (select (store |c_#race| |c_ULTIMATE.start_main_~#id1~0#1.base| v_ArrVal_1300) |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 1605 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)))) (forall ((v_ArrVal_1300 (Array Int Int))) (= |c_t1Thread1of1ForFork0_enqueue_#t~nondet45#1| (select (select (store |c_#race| |c_ULTIMATE.start_main_~#id1~0#1.base| v_ArrVal_1300) |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 1607 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)))) (forall ((v_ArrVal_1300 (Array Int Int))) (= |c_t1Thread1of1ForFork0_enqueue_#t~nondet45#1| (select (select (store |c_#race| |c_ULTIMATE.start_main_~#id1~0#1.base| v_ArrVal_1300) |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))))) is different from false [2023-12-02 20:19:10,192 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 1607 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse0 (store |c_#race| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#race| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) .cse1 |c_t1Thread1of1ForFork0_enqueue_#t~nondet45#1|)))) (and (forall ((v_ArrVal_1300 (Array Int Int))) (= |c_t1Thread1of1ForFork0_enqueue_#t~nondet45#1| (select (select (store .cse0 |c_ULTIMATE.start_main_~#id1~0#1.base| v_ArrVal_1300) |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604)))) (forall ((v_ArrVal_1300 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#id1~0#1.base| v_ArrVal_1300) |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) .cse1) |c_t1Thread1of1ForFork0_enqueue_#t~nondet45#1|)) (forall ((v_ArrVal_1300 (Array Int Int))) (= |c_t1Thread1of1ForFork0_enqueue_#t~nondet45#1| (select (select (store .cse0 |c_ULTIMATE.start_main_~#id1~0#1.base| v_ArrVal_1300) |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 1605 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)))) (forall ((v_ArrVal_1300 (Array Int Int))) (= |c_t1Thread1of1ForFork0_enqueue_#t~nondet45#1| (select (select (store .cse0 |c_ULTIMATE.start_main_~#id1~0#1.base| v_ArrVal_1300) |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 1606 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))))))) is different from false [2023-12-02 20:19:10,218 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (+ 1606 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse1 (+ 1607 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse0 (store |c_#race| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store (select |c_#race| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) .cse2 |c_t1Thread1of1ForFork0_enqueue_#t~nondet45#1|) .cse1 |c_t1Thread1of1ForFork0_enqueue_#t~nondet45#1|)))) (and (forall ((v_ArrVal_1300 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#id1~0#1.base| v_ArrVal_1300) |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) .cse1) |c_t1Thread1of1ForFork0_enqueue_#t~nondet45#1|)) (forall ((v_ArrVal_1300 (Array Int Int))) (= |c_t1Thread1of1ForFork0_enqueue_#t~nondet45#1| (select (select (store .cse0 |c_ULTIMATE.start_main_~#id1~0#1.base| v_ArrVal_1300) |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) .cse2))) (forall ((v_ArrVal_1300 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#id1~0#1.base| v_ArrVal_1300) |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604)) |c_t1Thread1of1ForFork0_enqueue_#t~nondet45#1|)) (forall ((v_ArrVal_1300 (Array Int Int))) (= |c_t1Thread1of1ForFork0_enqueue_#t~nondet45#1| (select (select (store .cse0 |c_ULTIMATE.start_main_~#id1~0#1.base| v_ArrVal_1300) |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 1605 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))))))) is different from false [2023-12-02 20:19:10,240 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 1605 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse3 (+ 1606 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse2 (+ 1607 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse0 (store |c_#race| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store (store (select |c_#race| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) .cse1 |c_t1Thread1of1ForFork0_enqueue_#t~nondet45#1|) .cse3 |c_t1Thread1of1ForFork0_enqueue_#t~nondet45#1|) .cse2 |c_t1Thread1of1ForFork0_enqueue_#t~nondet45#1|)))) (and (forall ((v_ArrVal_1300 (Array Int Int))) (= |c_t1Thread1of1ForFork0_enqueue_#t~nondet45#1| (select (select (store .cse0 |c_ULTIMATE.start_main_~#id1~0#1.base| v_ArrVal_1300) |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) .cse1))) (forall ((v_ArrVal_1300 (Array Int Int))) (= |c_t1Thread1of1ForFork0_enqueue_#t~nondet45#1| (select (select (store .cse0 |c_ULTIMATE.start_main_~#id1~0#1.base| v_ArrVal_1300) |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) .cse2))) (forall ((v_ArrVal_1300 (Array Int Int))) (= |c_t1Thread1of1ForFork0_enqueue_#t~nondet45#1| (select (select (store .cse0 |c_ULTIMATE.start_main_~#id1~0#1.base| v_ArrVal_1300) |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) .cse3))) (forall ((v_ArrVal_1300 (Array Int Int))) (= |c_t1Thread1of1ForFork0_enqueue_#t~nondet45#1| (select (select (store .cse0 |c_ULTIMATE.start_main_~#id1~0#1.base| v_ArrVal_1300) |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))))))) is different from false [2023-12-02 20:19:10,261 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:19:10,262 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 4 case distinctions, treesize of input 37 treesize of output 53 [2023-12-02 20:19:10,269 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:19:10,270 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 70 treesize of output 28 [2023-12-02 20:19:10,280 INFO L349 Elim1Store]: treesize reduction 40, result has 2.4 percent of original size [2023-12-02 20:19:10,280 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 37 treesize of output 1 [2023-12-02 20:19:10,286 INFO L349 Elim1Store]: treesize reduction 40, result has 2.4 percent of original size [2023-12-02 20:19:10,287 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 37 treesize of output 1 [2023-12-02 20:19:10,293 INFO L349 Elim1Store]: treesize reduction 40, result has 2.4 percent of original size [2023-12-02 20:19:10,293 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 37 treesize of output 1 [2023-12-02 20:19:10,645 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 43 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-12-02 20:19:10,646 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1051181118] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 20:19:10,646 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 20:19:10,646 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12, 11] total 29 [2023-12-02 20:19:10,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1490087828] [2023-12-02 20:19:10,647 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 20:19:10,648 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2023-12-02 20:19:10,648 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-02 20:19:10,649 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2023-12-02 20:19:10,650 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=549, Unknown=4, NotChecked=204, Total=870 [2023-12-02 20:19:10,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:19:10,652 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-12-02 20:19:10,653 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 29 states have (on average 23.17241379310345) internal successors, (672), 30 states have internal predecessors, (672), 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:19:10,653 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:19:10,653 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:19:10,653 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-12-02 20:19:10,653 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-12-02 20:19:10,653 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-12-02 20:19:10,653 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-12-02 20:19:10,653 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-12-02 20:19:10,653 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-12-02 20:19:10,653 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2023-12-02 20:19:10,653 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-12-02 20:19:10,654 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:19:12,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:19:12,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:19:12,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-02 20:19:12,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-02 20:19:12,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-02 20:19:12,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-02 20:19:12,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-02 20:19:12,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-02 20:19:12,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-12-02 20:19:12,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-02 20:19:12,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-12-02 20:19:12,768 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82171be7-b9a3-4f46-8c93-6297f7d3b3be/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-12-02 20:19:12,958 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82171be7-b9a3-4f46-8c93-6297f7d3b3be/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2023-12-02 20:19:12,959 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting t1Err6ASSERT_VIOLATIONDATA_RACE === [t1Err0ASSERT_VIOLATIONDATA_RACE, t1Err10ASSERT_VIOLATIONDATA_RACE, t1Err11ASSERT_VIOLATIONDATA_RACE, t1Err1ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2023-12-02 20:19:12,959 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 20:19:12,959 INFO L85 PathProgramCache]: Analyzing trace with hash 1527072202, now seen corresponding path program 1 times [2023-12-02 20:19:12,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-02 20:19:12,959 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1914199211] [2023-12-02 20:19:12,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 20:19:12,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 20:19:13,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 20:19:13,923 INFO L134 CoverageAnalysis]: Checked inductivity of 991 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 987 trivial. 0 not checked. [2023-12-02 20:19:13,923 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-02 20:19:13,923 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1914199211] [2023-12-02 20:19:13,923 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1914199211] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 20:19:13,923 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 20:19:13,923 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-02 20:19:13,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1972992337] [2023-12-02 20:19:13,924 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 20:19:13,924 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-02 20:19:13,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-02 20:19:13,925 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-02 20:19:13,925 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 20:19:13,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:19:13,927 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-12-02 20:19:13,927 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 76.33333333333333) internal successors, (229), 3 states have internal predecessors, (229), 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:19:13,927 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:19:13,927 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:19:13,927 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-12-02 20:19:13,927 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-12-02 20:19:13,928 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-12-02 20:19:13,928 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-12-02 20:19:13,928 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-12-02 20:19:13,928 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-12-02 20:19:13,928 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2023-12-02 20:19:13,928 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-12-02 20:19:13,928 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2023-12-02 20:19:13,928 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:19:14,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:19:14,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:19:14,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-02 20:19:14,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-02 20:19:14,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-02 20:19:14,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-02 20:19:14,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-02 20:19:14,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-02 20:19:14,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-12-02 20:19:14,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-02 20:19:14,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-12-02 20:19:14,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:19:14,165 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-12-02 20:19:14,165 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting t1Err10ASSERT_VIOLATIONDATA_RACE === [t1Err0ASSERT_VIOLATIONDATA_RACE, t1Err10ASSERT_VIOLATIONDATA_RACE, t1Err11ASSERT_VIOLATIONDATA_RACE, t1Err1ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2023-12-02 20:19:14,166 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 20:19:14,166 INFO L85 PathProgramCache]: Analyzing trace with hash -1730630263, now seen corresponding path program 1 times [2023-12-02 20:19:14,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-02 20:19:14,166 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2074957587] [2023-12-02 20:19:14,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 20:19:14,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 20:19:14,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 20:19:14,516 INFO L134 CoverageAnalysis]: Checked inductivity of 1086 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1086 trivial. 0 not checked. [2023-12-02 20:19:14,517 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-02 20:19:14,517 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2074957587] [2023-12-02 20:19:14,517 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2074957587] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 20:19:14,517 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 20:19:14,517 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-02 20:19:14,517 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1083043358] [2023-12-02 20:19:14,517 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 20:19:14,518 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-02 20:19:14,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-02 20:19:14,519 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-02 20:19:14,519 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 20:19:14,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:19:14,521 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-12-02 20:19:14,521 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 109.0) internal successors, (218), 3 states have internal predecessors, (218), 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:19:14,521 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:19:14,521 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:19:14,521 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-12-02 20:19:14,521 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-12-02 20:19:14,522 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-12-02 20:19:14,522 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-12-02 20:19:14,522 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-12-02 20:19:14,522 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-12-02 20:19:14,522 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2023-12-02 20:19:14,522 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-12-02 20:19:14,522 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2023-12-02 20:19:14,522 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:19:14,522 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:19:14,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:19:14,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:19:14,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-02 20:19:14,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-02 20:19:14,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-02 20:19:14,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-02 20:19:14,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-02 20:19:14,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-02 20:19:14,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-12-02 20:19:14,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-02 20:19:14,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-12-02 20:19:14,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:19:14,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:19:14,696 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-12-02 20:19:14,697 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting t1Err11ASSERT_VIOLATIONDATA_RACE === [t1Err0ASSERT_VIOLATIONDATA_RACE, t1Err10ASSERT_VIOLATIONDATA_RACE, t1Err11ASSERT_VIOLATIONDATA_RACE, t1Err1ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2023-12-02 20:19:14,697 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 20:19:14,697 INFO L85 PathProgramCache]: Analyzing trace with hash -1978796490, now seen corresponding path program 1 times [2023-12-02 20:19:14,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-02 20:19:14,697 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [558942767] [2023-12-02 20:19:14,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 20:19:14,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 20:19:14,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 20:19:15,016 INFO L134 CoverageAnalysis]: Checked inductivity of 1086 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1086 trivial. 0 not checked. [2023-12-02 20:19:15,016 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-02 20:19:15,016 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [558942767] [2023-12-02 20:19:15,016 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [558942767] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 20:19:15,016 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 20:19:15,017 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-02 20:19:15,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [594848874] [2023-12-02 20:19:15,017 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 20:19:15,018 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-02 20:19:15,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-02 20:19:15,019 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-02 20:19:15,019 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 20:19:15,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:19:15,020 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-12-02 20:19:15,021 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 111.5) internal successors, (223), 3 states have internal predecessors, (223), 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:19:15,021 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:19:15,021 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:19:15,021 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-12-02 20:19:15,021 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-12-02 20:19:15,022 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-12-02 20:19:15,022 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-12-02 20:19:15,022 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-12-02 20:19:15,022 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-12-02 20:19:15,022 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2023-12-02 20:19:15,022 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-12-02 20:19:15,022 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2023-12-02 20:19:15,022 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:19:15,023 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:19:15,023 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:19:15,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:19:15,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:19:15,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-02 20:19:15,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-02 20:19:15,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-02 20:19:15,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-02 20:19:15,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-02 20:19:15,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-02 20:19:15,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-12-02 20:19:15,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-02 20:19:15,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-12-02 20:19:15,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:19:15,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:19:15,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:19:15,376 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-12-02 20:19:15,377 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting t1Err8ASSERT_VIOLATIONDATA_RACE === [t1Err0ASSERT_VIOLATIONDATA_RACE, t1Err10ASSERT_VIOLATIONDATA_RACE, t1Err11ASSERT_VIOLATIONDATA_RACE, t1Err1ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2023-12-02 20:19:15,377 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 20:19:15,377 INFO L85 PathProgramCache]: Analyzing trace with hash -309493342, now seen corresponding path program 1 times [2023-12-02 20:19:15,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-02 20:19:15,377 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [10851740] [2023-12-02 20:19:15,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 20:19:15,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 20:19:15,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 20:19:17,186 INFO L134 CoverageAnalysis]: Checked inductivity of 634 backedges. 0 proven. 187 refuted. 0 times theorem prover too weak. 447 trivial. 0 not checked. [2023-12-02 20:19:17,186 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-02 20:19:17,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [10851740] [2023-12-02 20:19:17,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [10851740] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 20:19:17,187 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [146493622] [2023-12-02 20:19:17,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 20:19:17,187 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 20:19:17,187 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82171be7-b9a3-4f46-8c93-6297f7d3b3be/bin/ugemcutter-verify-Bi2udmvEmx/z3 [2023-12-02 20:19:17,188 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82171be7-b9a3-4f46-8c93-6297f7d3b3be/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 20:19:17,192 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82171be7-b9a3-4f46-8c93-6297f7d3b3be/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-12-02 20:19:17,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 20:19:17,764 INFO L262 TraceCheckSpWp]: Trace formula consists of 1570 conjuncts, 54 conjunts are in the unsatisfiable core [2023-12-02 20:19:17,787 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 20:19:19,013 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:19:19,114 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 20:19:19,115 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 18 treesize of output 13 [2023-12-02 20:19:19,411 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 20:19:19,421 INFO L349 Elim1Store]: treesize reduction 39, result has 18.8 percent of original size [2023-12-02 20:19:19,422 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 42 treesize of output 16 [2023-12-02 20:19:19,634 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 20:19:19,635 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 29 treesize of output 13 [2023-12-02 20:19:19,870 INFO L134 CoverageAnalysis]: Checked inductivity of 634 backedges. 556 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2023-12-02 20:19:19,870 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 20:19:19,870 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [146493622] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 20:19:19,870 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-02 20:19:19,871 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [11] total 21 [2023-12-02 20:19:19,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1374681941] [2023-12-02 20:19:19,871 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 20:19:19,872 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-12-02 20:19:19,872 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-02 20:19:19,873 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-12-02 20:19:19,874 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=344, Unknown=0, NotChecked=0, Total=420 [2023-12-02 20:19:19,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:19:19,875 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-12-02 20:19:19,876 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 38.27272727272727) internal successors, (421), 11 states have internal predecessors, (421), 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:19:19,876 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:19:19,876 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:19:19,876 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-12-02 20:19:19,876 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-12-02 20:19:19,877 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-12-02 20:19:19,877 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-12-02 20:19:19,877 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-12-02 20:19:19,877 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-12-02 20:19:19,877 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2023-12-02 20:19:19,877 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-12-02 20:19:19,877 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2023-12-02 20:19:19,877 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:19:19,878 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:19:19,878 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:19:19,878 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:19:20,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:19:20,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:19:20,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-02 20:19:20,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-02 20:19:20,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-02 20:19:20,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-02 20:19:20,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-02 20:19:20,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-02 20:19:20,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-12-02 20:19:20,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-02 20:19:20,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-12-02 20:19:20,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:19:20,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:19:20,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:19:20,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-12-02 20:19:20,755 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82171be7-b9a3-4f46-8c93-6297f7d3b3be/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2023-12-02 20:19:20,949 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82171be7-b9a3-4f46-8c93-6297f7d3b3be/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2023-12-02 20:19:20,949 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting t1Err4ASSERT_VIOLATIONDATA_RACE === [t1Err0ASSERT_VIOLATIONDATA_RACE, t1Err10ASSERT_VIOLATIONDATA_RACE, t1Err11ASSERT_VIOLATIONDATA_RACE, t1Err1ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2023-12-02 20:19:20,950 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 20:19:20,950 INFO L85 PathProgramCache]: Analyzing trace with hash -58876605, now seen corresponding path program 1 times [2023-12-02 20:19:20,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-02 20:19:20,950 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [59885628] [2023-12-02 20:19:20,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 20:19:20,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 20:19:21,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 20:19:24,606 INFO L134 CoverageAnalysis]: Checked inductivity of 3630 backedges. 0 proven. 330 refuted. 0 times theorem prover too weak. 3300 trivial. 0 not checked. [2023-12-02 20:19:24,606 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-02 20:19:24,607 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [59885628] [2023-12-02 20:19:24,607 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [59885628] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 20:19:24,607 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1795240459] [2023-12-02 20:19:24,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 20:19:24,607 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 20:19:24,607 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82171be7-b9a3-4f46-8c93-6297f7d3b3be/bin/ugemcutter-verify-Bi2udmvEmx/z3 [2023-12-02 20:19:24,608 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82171be7-b9a3-4f46-8c93-6297f7d3b3be/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 20:19:24,609 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82171be7-b9a3-4f46-8c93-6297f7d3b3be/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-12-02 20:19:25,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 20:19:25,457 INFO L262 TraceCheckSpWp]: Trace formula consists of 3044 conjuncts, 61 conjunts are in the unsatisfiable core [2023-12-02 20:19:25,473 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 20:19:28,367 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:19:28,460 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 20:19:28,461 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:19:28,735 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 20:19:28,736 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2023-12-02 20:19:28,896 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 23 treesize of output 11 [2023-12-02 20:19:29,250 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 19 treesize of output 11 [2023-12-02 20:19:29,372 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 20:19:29,373 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:19:29,609 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 20:19:29,610 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2023-12-02 20:19:29,714 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 23 treesize of output 11 [2023-12-02 20:19:29,825 INFO L134 CoverageAnalysis]: Checked inductivity of 3630 backedges. 1539 proven. 528 refuted. 0 times theorem prover too weak. 1563 trivial. 0 not checked. [2023-12-02 20:19:29,825 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 20:19:30,286 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5054 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem39#1_38| Int) (v_ArrVal_5056 Int)) (let ((.cse0 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_5054) |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem39#1_38|) (not (= 400 (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem39#1_38|) |c_~#queue~0.offset|) v_ArrVal_5056) .cse1)))))) is different from false [2023-12-02 20:19:30,417 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5054 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem39#1_38| Int) (v_ArrVal_5056 Int)) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604) (+ |c_t1Thread1of1ForFork0_enqueue_#t~post47#1| 1))) |c_~#stored_elements~0.base| v_ArrVal_5054) |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (or (not (= 400 (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem39#1_38|) |c_~#queue~0.offset|) v_ArrVal_5056) .cse1))) (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem39#1_38|)))) is different from false [2023-12-02 20:19:30,429 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5054 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem39#1_38| Int) (v_ArrVal_5056 Int)) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604) (+ |c_t1Thread1of1ForFork0_enqueue_#t~mem46#1| 1))) |c_~#stored_elements~0.base| v_ArrVal_5054) |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem39#1_38|) (not (= 400 (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem39#1_38|) |c_~#queue~0.offset|) v_ArrVal_5056) .cse1)))))) is different from false [2023-12-02 20:19:30,496 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5054 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem39#1_38| Int) (v_ArrVal_5056 Int)) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse3 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (store .cse2 .cse3 (+ (select .cse2 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_5054) |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (or (not (= 400 (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem39#1_38|) |c_~#queue~0.offset|) v_ArrVal_5056) .cse1))) (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem39#1_38|)))) is different from false [2023-12-02 20:19:30,673 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5054 (Array Int Int)) (v_ArrVal_5051 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem39#1_38| Int) (v_ArrVal_5056 Int)) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse3 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (store (store .cse2 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_5051) .cse3 (+ (select .cse2 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_5054) |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (or (not (= 400 (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem39#1_38|) |c_~#queue~0.offset|) v_ArrVal_5056) .cse1))) (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem39#1_38|)))) is different from false [2023-12-02 20:19:30,848 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5054 (Array Int Int)) (v_ArrVal_5051 Int) (v_ArrVal_5048 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem39#1_38| Int) (v_ArrVal_5056 Int)) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse2 (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ (* |c_t1Thread1of1ForFork0_enqueue_#t~mem39#1| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_5048)) (.cse3 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (store (store .cse2 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_5051) .cse3 (+ (select .cse2 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_5054) |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem39#1_38|) (not (= 400 (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem39#1_38|) |c_~#queue~0.offset|) v_ArrVal_5056) .cse1)))))) is different from false [2023-12-02 20:19:30,935 WARN L854 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem39#1_42| Int)) (let ((.cse1 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604)) (.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem39#1_42|) (forall ((v_ArrVal_5054 (Array Int Int)) (v_ArrVal_5051 Int) (v_ArrVal_5048 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem39#1_38| Int) (v_ArrVal_5056 Int)) (let ((.cse2 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse4 (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem39#1_42|) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_5048))) (store (store .cse4 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_5051) .cse1 (+ (select .cse4 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_5054) |c_~#queue~0.base|)) (.cse3 (+ |c_~#queue~0.offset| 1604))) (or (not (= (select (store .cse2 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem39#1_38|) |c_~#queue~0.offset|) v_ArrVal_5056) .cse3) 400)) (< (select .cse2 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~mem39#1_38|))))))) is different from false [2023-12-02 20:19:30,979 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5054 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem39#1_42| Int) (v_ArrVal_5051 Int) (v_ArrVal_5048 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem39#1_38| Int) (v_ArrVal_5056 Int)) (let ((.cse3 (+ |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| 1604)) (.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|))) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| (let ((.cse4 (store .cse2 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem39#1_42|) |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_5048))) (store (store .cse4 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_5051) .cse3 (+ (select .cse4 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_5054) |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (or (not (= 400 (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem39#1_38|) |c_~#queue~0.offset|) v_ArrVal_5056) .cse1))) (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem39#1_38|) (< (select .cse2 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~mem39#1_42|))))) is different from false [2023-12-02 20:19:31,594 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:19:31,594 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 201 treesize of output 141 [2023-12-02 20:19:31,605 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:19:31,605 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 225 treesize of output 223 [2023-12-02 20:19:31,622 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 91 treesize of output 83 [2023-12-02 20:19:31,633 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-12-02 20:19:31,666 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 8 treesize of output 4 [2023-12-02 20:19:31,744 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:19:31,744 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 85 treesize of output 77 [2023-12-02 20:19:32,967 INFO L134 CoverageAnalysis]: Checked inductivity of 3630 backedges. 1074 proven. 478 refuted. 0 times theorem prover too weak. 1563 trivial. 515 not checked. [2023-12-02 20:19:32,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1795240459] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 20:19:32,967 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 20:19:32,968 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 18, 22] total 48 [2023-12-02 20:19:32,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1267688792] [2023-12-02 20:19:32,968 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 20:19:32,970 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2023-12-02 20:19:32,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-02 20:19:32,973 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2023-12-02 20:19:32,974 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=214, Invalid=1365, Unknown=13, NotChecked=664, Total=2256 [2023-12-02 20:19:32,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:19:32,977 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-12-02 20:19:32,978 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 48 states have (on average 23.166666666666668) internal successors, (1112), 48 states have internal predecessors, (1112), 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:19:32,979 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:19:32,979 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:19:32,979 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-12-02 20:19:32,979 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-12-02 20:19:32,979 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-12-02 20:19:32,979 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-12-02 20:19:32,979 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-12-02 20:19:32,979 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-12-02 20:19:32,979 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2023-12-02 20:19:32,979 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-12-02 20:19:32,979 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2023-12-02 20:19:32,979 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:19:32,979 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:19:32,979 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:19:32,980 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2023-12-02 20:19:32,980 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:19:45,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:19:45,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:19:45,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-02 20:19:45,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-02 20:19:45,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-02 20:19:45,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-02 20:19:45,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-02 20:19:45,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-02 20:19:45,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-12-02 20:19:45,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-02 20:19:45,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-12-02 20:19:45,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:19:45,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:19:45,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:19:45,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-12-02 20:19:45,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2023-12-02 20:19:45,852 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82171be7-b9a3-4f46-8c93-6297f7d3b3be/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2023-12-02 20:19:46,044 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82171be7-b9a3-4f46-8c93-6297f7d3b3be/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2023-12-02 20:19:46,044 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting t1Err2ASSERT_VIOLATIONDATA_RACE === [t1Err0ASSERT_VIOLATIONDATA_RACE, t1Err10ASSERT_VIOLATIONDATA_RACE, t1Err11ASSERT_VIOLATIONDATA_RACE, t1Err1ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2023-12-02 20:19:46,045 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 20:19:46,045 INFO L85 PathProgramCache]: Analyzing trace with hash -230028343, now seen corresponding path program 1 times [2023-12-02 20:19:46,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-02 20:19:46,045 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1199552731] [2023-12-02 20:19:46,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 20:19:46,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 20:19:46,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 20:19:54,241 INFO L134 CoverageAnalysis]: Checked inductivity of 14980 backedges. 0 proven. 340 refuted. 0 times theorem prover too weak. 14640 trivial. 0 not checked. [2023-12-02 20:19:54,241 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-02 20:19:54,242 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1199552731] [2023-12-02 20:19:54,242 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1199552731] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 20:19:54,242 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [429543308] [2023-12-02 20:19:54,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 20:19:54,242 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 20:19:54,242 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82171be7-b9a3-4f46-8c93-6297f7d3b3be/bin/ugemcutter-verify-Bi2udmvEmx/z3 [2023-12-02 20:19:54,243 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82171be7-b9a3-4f46-8c93-6297f7d3b3be/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 20:19:54,244 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82171be7-b9a3-4f46-8c93-6297f7d3b3be/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-12-02 20:19:55,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 20:19:55,766 INFO L262 TraceCheckSpWp]: Trace formula consists of 5685 conjuncts, 172 conjunts are in the unsatisfiable core [2023-12-02 20:19:55,796 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 20:19:57,589 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:19:57,698 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 20:19:57,699 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:19:57,986 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 20:19:57,986 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2023-12-02 20:19:58,138 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 23 treesize of output 11 [2023-12-02 20:19:58,456 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 19 treesize of output 11 [2023-12-02 20:19:58,573 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 20:19:58,573 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:20:00,723 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:20:00,805 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 20:20:00,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 16 treesize of output 11 [2023-12-02 20:20:01,015 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 20:20:01,015 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2023-12-02 20:20:01,178 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 23 treesize of output 11 [2023-12-02 20:20:01,419 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 19 treesize of output 11 [2023-12-02 20:20:01,507 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 20:20:01,508 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:20:01,758 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 23 treesize of output 11 [2023-12-02 20:20:01,907 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 23 treesize of output 11 [2023-12-02 20:20:02,283 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 19 treesize of output 11 [2023-12-02 20:20:02,408 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 20:20:02,408 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:20:02,799 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 20:20:02,799 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2023-12-02 20:20:02,989 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 23 treesize of output 11 [2023-12-02 20:20:03,417 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 19 treesize of output 11 [2023-12-02 20:20:03,544 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 20:20:03,544 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:20:03,784 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 23 treesize of output 11 [2023-12-02 20:20:03,842 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 23 treesize of output 11 [2023-12-02 20:20:03,933 INFO L134 CoverageAnalysis]: Checked inductivity of 14980 backedges. 8725 proven. 3889 refuted. 0 times theorem prover too weak. 2366 trivial. 0 not checked. [2023-12-02 20:20:03,933 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 20:20:04,385 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8066 Int) (v_ArrVal_8064 (Array Int Int))) (not (= 400 (let ((.cse1 (+ |c_~#queue~0.offset| 1604))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604) (+ |c_t1Thread1of1ForFork0_enqueue_#t~post47#1| 1))) |c_~#stored_elements~0.base| v_ArrVal_8064) |c_~#queue~0.base|))) (store .cse0 (+ |c_~#queue~0.offset| (* (select .cse0 .cse1) 4)) v_ArrVal_8066)) .cse1))))) is different from false [2023-12-02 20:20:04,393 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8066 Int) (v_ArrVal_8064 (Array Int Int))) (not (= 400 (let ((.cse1 (+ |c_~#queue~0.offset| 1604))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604) (+ |c_t1Thread1of1ForFork0_enqueue_#t~mem46#1| 1))) |c_~#stored_elements~0.base| v_ArrVal_8064) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_8066)) .cse1))))) is different from false [2023-12-02 20:20:04,591 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8066 Int) (v_ArrVal_8060 Int) (v_ArrVal_8064 (Array Int Int))) (not (= 400 (let ((.cse1 (+ |c_~#queue~0.offset| 1604))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse3 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (store (store .cse2 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_8060) .cse3 (+ (select .cse2 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_8064) |c_~#queue~0.base|))) (store .cse0 (+ |c_~#queue~0.offset| (* (select .cse0 .cse1) 4)) v_ArrVal_8066)) .cse1))))) is different from false [2023-12-02 20:20:04,666 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8066 Int) (v_ArrVal_8060 Int) (v_ArrVal_8059 Int) (v_ArrVal_8064 (Array Int Int))) (not (= (let ((.cse1 (+ |c_~#queue~0.offset| 1604))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse2 (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ (* |c_t1Thread1of1ForFork0_enqueue_#t~mem39#1| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_8059)) (.cse3 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (store (store .cse2 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_8060) .cse3 (+ (select .cse2 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_8064) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_8066)) .cse1)) 400))) is different from false [2023-12-02 20:20:04,706 WARN L854 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem39#1_109| Int)) (let ((.cse4 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse3 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (or (forall ((v_ArrVal_8066 Int) (v_ArrVal_8060 Int) (v_ArrVal_8059 Int) (v_ArrVal_8064 (Array Int Int))) (not (= (let ((.cse1 (+ |c_~#queue~0.offset| 1604))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse2 (store .cse4 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem39#1_109|) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_8059))) (store (store .cse2 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_8060) .cse3 (+ (select .cse2 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_8064) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_8066)) .cse1)) 400))) (< (select .cse4 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~mem39#1_109|)))) is different from false [2023-12-02 20:20:04,732 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8066 Int) (v_ArrVal_8060 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem39#1_109| Int) (v_ArrVal_8059 Int) (v_ArrVal_8064 (Array Int Int))) (let ((.cse4 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|)) (.cse3 (+ |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| 1604))) (or (not (= 400 (let ((.cse1 (+ |c_~#queue~0.offset| 1604))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| (let ((.cse2 (store .cse4 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem39#1_109|) |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_8059))) (store (store .cse2 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_8060) .cse3 (+ (select .cse2 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_8064) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_8066)) .cse1)))) (< (select .cse4 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~mem39#1_109|)))) is different from false [2023-12-02 20:20:05,005 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8057 (Array Int Int)) (v_ArrVal_8066 Int) (v_ArrVal_8060 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem39#1_109| Int) (v_ArrVal_8059 Int) (v_ArrVal_8064 (Array Int Int))) (let ((.cse3 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_8057) |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (or (not (= 400 (select (let ((.cse0 (select (store (store |c_#memory_int| |c_~#queue~0.base| (let ((.cse2 (store .cse3 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem39#1_109|) |c_~#queue~0.offset|) v_ArrVal_8059))) (store (store .cse2 (+ 1608 |c_~#queue~0.offset|) v_ArrVal_8060) .cse1 (+ (select .cse2 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_8064) |c_~#queue~0.base|))) (store .cse0 (+ |c_~#queue~0.offset| (* 4 (select .cse0 .cse1))) v_ArrVal_8066)) .cse1))) (< (select .cse3 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem39#1_109|)))) is different from false [2023-12-02 20:20:05,458 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8057 (Array Int Int)) (v_ArrVal_8066 Int) (v_ArrVal_8060 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem39#1_109| Int) (v_ArrVal_8059 Int) (v_ArrVal_8064 (Array Int Int))) (let ((.cse2 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse5 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse6 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (store .cse5 .cse6 (+ (select .cse5 .cse6) 1)))))) (let ((.cse4 (select (store .cse2 |c_~#stored_elements~0.base| v_ArrVal_8057) |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (or (not (= (select (let ((.cse0 (select (store (store .cse2 |c_~#queue~0.base| (let ((.cse3 (store .cse4 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem39#1_109|) |c_~#queue~0.offset|) v_ArrVal_8059))) (store (store .cse3 (+ 1608 |c_~#queue~0.offset|) v_ArrVal_8060) .cse1 (+ 1 (select .cse3 .cse1))))) |c_~#stored_elements~0.base| v_ArrVal_8064) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_8066)) .cse1) 400)) (< (select .cse4 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem39#1_109|))))) is different from false [2023-12-02 20:20:05,639 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8054 Int) (v_ArrVal_8057 (Array Int Int)) (v_ArrVal_8066 Int) (v_ArrVal_8060 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem39#1_109| Int) (v_ArrVal_8059 Int) (v_ArrVal_8064 (Array Int Int))) (let ((.cse3 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse5 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse6 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (store (store .cse5 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_8054) .cse6 (+ (select .cse5 .cse6) 1)))))) (let ((.cse0 (select (store .cse3 |c_~#stored_elements~0.base| v_ArrVal_8057) |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem39#1_109|) (not (= 400 (select (let ((.cse2 (select (store (store .cse3 |c_~#queue~0.base| (let ((.cse4 (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem39#1_109|) |c_~#queue~0.offset|) v_ArrVal_8059))) (store (store .cse4 (+ 1608 |c_~#queue~0.offset|) v_ArrVal_8060) .cse1 (+ (select .cse4 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_8064) |c_~#queue~0.base|))) (store .cse2 (+ |c_~#queue~0.offset| (* (select .cse2 .cse1) 4)) v_ArrVal_8066)) .cse1))))))) is different from false [2023-12-02 20:20:05,829 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8054 Int) (v_ArrVal_8057 (Array Int Int)) (v_ArrVal_8066 Int) (v_ArrVal_8060 Int) (v_ArrVal_8051 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem39#1_109| Int) (v_ArrVal_8059 Int) (v_ArrVal_8064 (Array Int Int))) (let ((.cse3 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse5 (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ (* |c_t1Thread1of1ForFork0_enqueue_#t~mem39#1| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_8051)) (.cse6 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (store (store .cse5 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_8054) .cse6 (+ (select .cse5 .cse6) 1)))))) (let ((.cse0 (select (store .cse3 |c_~#stored_elements~0.base| v_ArrVal_8057) |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem39#1_109|) (not (= (select (let ((.cse2 (select (store (store .cse3 |c_~#queue~0.base| (let ((.cse4 (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem39#1_109|) |c_~#queue~0.offset|) v_ArrVal_8059))) (store (store .cse4 (+ 1608 |c_~#queue~0.offset|) v_ArrVal_8060) .cse1 (+ (select .cse4 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_8064) |c_~#queue~0.base|))) (store .cse2 (+ (* 4 (select .cse2 .cse1)) |c_~#queue~0.offset|) v_ArrVal_8066)) .cse1) 400)))))) is different from false [2023-12-02 20:20:05,914 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8054 Int) (v_ArrVal_8057 (Array Int Int)) (v_ArrVal_8066 Int) (v_ArrVal_8060 Int) (v_ArrVal_8051 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem39#1_109| Int) (v_ArrVal_8059 Int) (v_ArrVal_8064 (Array Int Int))) (let ((.cse2 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse6 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse5 (let ((.cse7 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|))) (store .cse7 (+ (* (select .cse7 .cse6) 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_8051)))) (store (store .cse5 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_8054) .cse6 (+ (select .cse5 .cse6) 1))))))) (let ((.cse4 (select (store .cse2 |c_~#stored_elements~0.base| v_ArrVal_8057) |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (or (not (= 400 (select (let ((.cse0 (select (store (store .cse2 |c_~#queue~0.base| (let ((.cse3 (store .cse4 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem39#1_109|) |c_~#queue~0.offset|) v_ArrVal_8059))) (store (store .cse3 (+ 1608 |c_~#queue~0.offset|) v_ArrVal_8060) .cse1 (+ (select .cse3 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_8064) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_8066)) .cse1))) (< (select .cse4 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem39#1_109|))))) is different from false [2023-12-02 20:20:05,947 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8054 Int) (v_ArrVal_8057 (Array Int Int)) (v_ArrVal_8066 Int) (v_ArrVal_8060 Int) (v_ArrVal_8051 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem39#1_109| Int) (v_ArrVal_8059 Int) (v_ArrVal_8064 (Array Int Int))) (let ((.cse3 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| (let ((.cse6 (+ |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| 1604))) (let ((.cse5 (let ((.cse7 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|))) (store .cse7 (+ (* (select .cse7 .cse6) 4) |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_8051)))) (store (store .cse5 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_8054) .cse6 (+ (select .cse5 .cse6) 1))))))) (let ((.cse0 (select (store .cse3 |c_~#stored_elements~0.base| v_ArrVal_8057) |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem39#1_109|) (not (= 400 (select (let ((.cse2 (select (store (store .cse3 |c_~#queue~0.base| (let ((.cse4 (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem39#1_109|) |c_~#queue~0.offset|) v_ArrVal_8059))) (store (store .cse4 (+ 1608 |c_~#queue~0.offset|) v_ArrVal_8060) .cse1 (+ (select .cse4 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_8064) |c_~#queue~0.base|))) (store .cse2 (+ (* (select .cse2 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_8066)) .cse1))))))) is different from false [2023-12-02 20:20:15,873 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:20:15,873 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 1065 treesize of output 745 [2023-12-02 20:20:15,922 INFO L349 Elim1Store]: treesize reduction 157, result has 52.4 percent of original size [2023-12-02 20:20:15,923 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 941 treesize of output 775 [2023-12-02 20:20:15,985 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-12-02 20:20:16,009 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:20:16,010 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 159 treesize of output 151 [2023-12-02 20:20:16,022 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 59 treesize of output 47 [2023-12-02 20:20:16,037 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-12-02 20:20:16,081 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 8 treesize of output 4 [2023-12-02 20:20:16,142 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:20:16,142 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 315 treesize of output 303 [2023-12-02 20:20:16,189 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 142 treesize of output 130 [2023-12-02 20:20:16,198 WARN L214 Elim1Store]: Array PQE input equivalent to true [2023-12-02 20:20:16,218 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 543 treesize of output 497 [2023-12-02 20:20:16,242 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 20:20:16,244 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 20:20:16,321 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 20:20:16,344 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-12-02 20:20:16,346 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 2 case distinctions, treesize of input 73095 treesize of output 50036 [2023-12-02 20:20:16,428 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 18 [2023-12-02 20:20:16,432 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 7 treesize of output 3 [2023-12-02 20:20:16,447 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 20:20:16,449 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 84 treesize of output 72 [2023-12-02 20:20:16,460 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 20:20:16,462 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 90 treesize of output 76 [2023-12-02 20:20:16,471 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 20:20:16,472 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 20:20:16,474 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 20:20:16,475 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 35 [2023-12-02 20:20:16,484 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 20:20:16,487 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 145 treesize of output 127 [2023-12-02 20:20:16,500 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 20:20:16,501 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 20:20:16,503 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 20:20:16,504 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 20:20:16,505 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 20:20:16,508 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 20:20:16,508 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 39 [2023-12-02 20:20:16,598 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 20:20:16,602 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 517 treesize of output 463 [2023-12-02 20:20:16,625 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 20:20:16,625 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 20:20:16,629 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 20:20:16,630 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 20:20:16,648 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 20:20:16,666 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 20:20:16,675 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-12-02 20:20:16,675 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 2 case distinctions, treesize of input 8057 treesize of output 1 [2023-12-02 20:20:16,684 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 20:20:16,687 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 274 treesize of output 242 [2023-12-02 20:20:16,698 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 20:20:16,699 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 20:20:16,721 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 20:20:16,739 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-12-02 20:20:16,740 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 2 case distinctions, treesize of input 43112 treesize of output 1 [2023-12-02 20:20:16,746 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 20:20:16,749 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 375 treesize of output 335 [2023-12-02 20:20:16,763 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 20:20:16,770 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 20:20:16,773 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 20:20:16,780 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-12-02 20:20:16,781 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 2 case distinctions, treesize of input 7516 treesize of output 1 [2023-12-02 20:20:16,795 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 20:20:16,797 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 99 treesize of output 83 [2023-12-02 20:20:16,800 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 20:20:16,802 WARN L214 Elim1Store]: Array PQE input equivalent to true [2023-12-02 20:20:16,809 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 20:20:16,812 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 90 treesize of output 76 [2023-12-02 20:20:16,821 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 20:20:16,821 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 20:20:16,824 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 20:20:16,824 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 35 [2023-12-02 20:20:16,833 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 20:20:16,838 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 147 treesize of output 129 [2023-12-02 20:20:16,851 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 20:20:16,852 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 20:20:16,853 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 20:20:16,853 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 20:20:16,854 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 20:20:16,856 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 20:20:16,857 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 41 [2023-12-02 20:20:16,874 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 20:20:16,876 WARN L214 Elim1Store]: Array PQE input equivalent to true [2023-12-02 20:20:16,880 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 20:20:16,882 WARN L214 Elim1Store]: Array PQE input equivalent to true [2023-12-02 20:20:16,888 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 20:20:16,890 WARN L214 Elim1Store]: Array PQE input equivalent to true [2023-12-02 20:20:16,902 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 20:20:16,911 INFO L349 Elim1Store]: treesize reduction 288, result has 0.3 percent of original size [2023-12-02 20:20:16,911 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 3 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 5 new quantified variables, introduced 15 case distinctions, treesize of input 311 treesize of output 1 [2023-12-02 20:20:16,929 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 20:20:16,931 WARN L214 Elim1Store]: Array PQE input equivalent to true [2023-12-02 20:20:16,935 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 20:20:16,937 WARN L214 Elim1Store]: Array PQE input equivalent to true [2023-12-02 20:20:16,943 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 20:20:16,946 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 20:20:16,947 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 20:20:16,947 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 20:20:16,956 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-12-02 20:20:16,957 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 55 treesize of output 1 [2023-12-02 20:20:16,966 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 20:20:16,968 WARN L214 Elim1Store]: Array PQE input equivalent to true [2023-12-02 20:20:16,973 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 20:20:16,977 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 20:20:16,977 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 20:20:16,978 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 20:20:16,987 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-12-02 20:20:16,987 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 55 treesize of output 1 [2023-12-02 20:20:16,992 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 20:20:16,994 WARN L214 Elim1Store]: Array PQE input equivalent to true [2023-12-02 20:20:17,002 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 20:20:17,004 WARN L214 Elim1Store]: Array PQE input equivalent to true [2023-12-02 20:20:17,007 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 20:20:17,010 WARN L214 Elim1Store]: Array PQE input equivalent to true [2023-12-02 20:20:17,016 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 20:20:17,018 WARN L214 Elim1Store]: Array PQE input equivalent to true [2023-12-02 20:20:17,030 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 20:20:17,034 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 20:20:17,034 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 20:20:17,036 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 20:20:17,045 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-12-02 20:20:17,045 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 60 treesize of output 1 [2023-12-02 20:20:17,052 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 20:20:17,054 WARN L214 Elim1Store]: Array PQE input equivalent to true [2023-12-02 20:20:17,062 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 20:20:17,065 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 20:20:17,066 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 20:20:17,067 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 20:20:17,072 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 20:20:17,073 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 11 [2023-12-02 20:20:17,102 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 20:20:17,119 INFO L349 Elim1Store]: treesize reduction 442, result has 0.2 percent of original size [2023-12-02 20:20:17,119 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 4 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 6 new quantified variables, introduced 20 case distinctions, treesize of input 451 treesize of output 1 [2023-12-02 20:20:17,131 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 20:20:17,145 INFO L349 Elim1Store]: treesize reduction 219, result has 0.5 percent of original size [2023-12-02 20:20:17,145 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 10 case distinctions, treesize of input 289 treesize of output 1 [2023-12-02 20:20:17,154 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 20:20:17,161 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 20:20:17,162 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 20:20:17,162 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 20:20:17,185 INFO L349 Elim1Store]: treesize reduction 688, result has 0.1 percent of original size [2023-12-02 20:20:17,185 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 4 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 6 new quantified variables, introduced 24 case distinctions, treesize of input 490 treesize of output 1 [2023-12-02 20:20:17,195 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 20:20:17,197 WARN L214 Elim1Store]: Array PQE input equivalent to true [2023-12-02 20:20:17,208 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 20:20:17,227 INFO L349 Elim1Store]: treesize reduction 645, result has 0.2 percent of original size [2023-12-02 20:20:17,227 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 6 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 8 new quantified variables, introduced 30 case distinctions, treesize of input 497 treesize of output 1 [2023-12-02 20:20:17,235 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 20:20:17,237 WARN L214 Elim1Store]: Array PQE input equivalent to true [2023-12-02 20:20:17,242 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 20:20:17,245 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 20:20:17,246 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 20:20:17,246 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 20:20:17,254 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-12-02 20:20:17,255 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 55 treesize of output 1 [2023-12-02 20:20:17,259 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 20:20:17,261 WARN L214 Elim1Store]: Array PQE input equivalent to true [2023-12-02 20:20:17,279 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 20:20:17,281 WARN L214 Elim1Store]: Array PQE input equivalent to true [2023-12-02 20:20:17,286 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 20:20:17,287 WARN L214 Elim1Store]: Array PQE input equivalent to true [2023-12-02 20:20:17,297 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 20:20:17,299 WARN L214 Elim1Store]: Array PQE input equivalent to true [2023-12-02 20:20:17,305 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 20:20:17,309 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 20:20:17,309 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 20:20:17,310 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 20:20:17,316 INFO L349 Elim1Store]: treesize reduction 84, result has 1.2 percent of original size [2023-12-02 20:20:17,317 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 10 case distinctions, treesize of input 157 treesize of output 1 [2023-12-02 20:20:17,323 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 20:20:17,325 WARN L214 Elim1Store]: Array PQE input equivalent to true [2023-12-02 20:20:17,329 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 20:20:17,332 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 20:20:17,333 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 20:20:17,333 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 20:20:17,340 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-12-02 20:20:17,340 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 63 treesize of output 1 [2023-12-02 20:20:17,347 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 20:20:17,349 WARN L214 Elim1Store]: Array PQE input equivalent to true [2023-12-02 20:20:17,353 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 20:20:17,357 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 20:20:17,357 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 20:20:17,358 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 20:20:17,370 INFO L349 Elim1Store]: treesize reduction 318, result has 0.3 percent of original size [2023-12-02 20:20:17,370 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 12 case distinctions, treesize of input 246 treesize of output 1 [2023-12-02 20:20:17,375 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 20:20:17,377 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 20:20:17,378 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 20:20:17,378 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 20:20:17,382 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 20:20:17,383 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 11 [2023-12-02 20:20:18,902 INFO L134 CoverageAnalysis]: Checked inductivity of 14980 backedges. 8766 proven. 842 refuted. 7 times theorem prover too weak. 4236 trivial. 1129 not checked. [2023-12-02 20:20:18,902 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [429543308] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 20:20:18,902 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 20:20:18,904 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 37, 39] total 84 [2023-12-02 20:20:18,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [538700575] [2023-12-02 20:20:18,904 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 20:20:18,908 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 84 states [2023-12-02 20:20:18,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-02 20:20:18,911 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2023-12-02 20:20:18,914 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=649, Invalid=4448, Unknown=63, NotChecked=1812, Total=6972 [2023-12-02 20:20:18,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:20:18,918 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-12-02 20:20:18,919 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 84 states, 84 states have (on average 19.392857142857142) internal successors, (1629), 84 states have internal predecessors, (1629), 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:20:18,919 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:20:18,919 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:20:18,919 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-12-02 20:20:18,920 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-12-02 20:20:18,920 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-12-02 20:20:18,920 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-12-02 20:20:18,920 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-12-02 20:20:18,920 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-12-02 20:20:18,920 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2023-12-02 20:20:18,920 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-12-02 20:20:18,920 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2023-12-02 20:20:18,920 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:20:18,920 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:20:18,920 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:20:18,920 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2023-12-02 20:20:18,920 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 56 states. [2023-12-02 20:20:18,920 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:21:32,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:21:32,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:21:32,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-02 20:21:32,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-02 20:21:32,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-02 20:21:32,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-02 20:21:32,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-02 20:21:32,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-02 20:21:32,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-12-02 20:21:32,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-02 20:21:32,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-12-02 20:21:32,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:21:32,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:21:32,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:21:32,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-12-02 20:21:32,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2023-12-02 20:21:32,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 137 states. [2023-12-02 20:21:32,449 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82171be7-b9a3-4f46-8c93-6297f7d3b3be/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2023-12-02 20:21:32,636 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82171be7-b9a3-4f46-8c93-6297f7d3b3be/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2023-12-02 20:21:32,637 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting t1Err9ASSERT_VIOLATIONDATA_RACE === [t1Err0ASSERT_VIOLATIONDATA_RACE, t1Err10ASSERT_VIOLATIONDATA_RACE, t1Err11ASSERT_VIOLATIONDATA_RACE, t1Err1ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2023-12-02 20:21:32,637 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 20:21:32,637 INFO L85 PathProgramCache]: Analyzing trace with hash 1827231553, now seen corresponding path program 1 times [2023-12-02 20:21:32,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-02 20:21:32,638 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [363911292] [2023-12-02 20:21:32,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 20:21:32,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 20:21:32,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 20:21:35,754 INFO L134 CoverageAnalysis]: Checked inductivity of 3582 backedges. 27 proven. 9 refuted. 0 times theorem prover too weak. 3546 trivial. 0 not checked. [2023-12-02 20:21:35,754 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-02 20:21:35,754 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [363911292] [2023-12-02 20:21:35,754 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [363911292] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 20:21:35,754 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [400202084] [2023-12-02 20:21:35,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 20:21:35,755 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 20:21:35,755 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82171be7-b9a3-4f46-8c93-6297f7d3b3be/bin/ugemcutter-verify-Bi2udmvEmx/z3 [2023-12-02 20:21:35,755 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82171be7-b9a3-4f46-8c93-6297f7d3b3be/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 20:21:35,756 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82171be7-b9a3-4f46-8c93-6297f7d3b3be/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-12-02 20:21:36,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 20:21:36,749 INFO L262 TraceCheckSpWp]: Trace formula consists of 3007 conjuncts, 145 conjunts are in the unsatisfiable core [2023-12-02 20:21:36,766 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 20:21:36,839 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-12-02 20:21:36,839 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:21:37,088 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 15 treesize of output 1 [2023-12-02 20:21:37,204 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 19 treesize of output 18 [2023-12-02 20:21:37,670 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 23 treesize of output 16 [2023-12-02 20:21:38,051 INFO L349 Elim1Store]: treesize reduction 44, result has 25.4 percent of original size [2023-12-02 20:21:38,052 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 41 treesize of output 24 [2023-12-02 20:21:38,242 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 14 [2023-12-02 20:21:38,600 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 36 treesize of output 13 [2023-12-02 20:21:38,714 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 20:21:38,715 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-12-02 20:21:39,016 INFO L349 Elim1Store]: treesize reduction 23, result has 23.3 percent of original size [2023-12-02 20:21:39,016 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 34 treesize of output 14 [2023-12-02 20:21:39,216 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 23 treesize of output 11 [2023-12-02 20:21:39,632 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 36 treesize of output 13 [2023-12-02 20:21:39,745 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 20:21:39,746 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:21:40,065 INFO L349 Elim1Store]: treesize reduction 23, result has 23.3 percent of original size [2023-12-02 20:21:40,066 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 34 treesize of output 14 [2023-12-02 20:21:40,222 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2023-12-02 20:21:40,632 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 36 treesize of output 13 [2023-12-02 20:21:40,756 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 20:21:40,756 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:21:41,065 INFO L349 Elim1Store]: treesize reduction 23, result has 23.3 percent of original size [2023-12-02 20:21:41,065 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 34 treesize of output 14 [2023-12-02 20:21:41,217 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 23 treesize of output 11 [2023-12-02 20:21:41,583 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 36 treesize of output 13 [2023-12-02 20:21:41,692 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 20:21:41,692 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:21:41,931 INFO L349 Elim1Store]: treesize reduction 23, result has 23.3 percent of original size [2023-12-02 20:21:41,931 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 34 treesize of output 14 [2023-12-02 20:21:42,042 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 23 treesize of output 11 [2023-12-02 20:21:42,111 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 15 treesize of output 7 [2023-12-02 20:21:42,152 INFO L134 CoverageAnalysis]: Checked inductivity of 3582 backedges. 1977 proven. 700 refuted. 0 times theorem prover too weak. 905 trivial. 0 not checked. [2023-12-02 20:21:42,152 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 20:21:42,585 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_9648 (Array Int Int)) (v_ArrVal_9647 Int)) (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse1 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_9647) (< (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse0 .cse1 v_ArrVal_9647)) |c_~#stored_elements~0.base| v_ArrVal_9648) |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 400)))) is different from false [2023-12-02 20:22:10,599 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_9641 (Array Int Int)) (v_ArrVal_9639 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem39#1_186| Int) (v_ArrVal_9648 (Array Int Int)) (v_ArrVal_9647 Int) (v_ArrVal_9643 Int) (v_ArrVal_9644 Int)) (let ((.cse0 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604) v_ArrVal_9639)))) (let ((.cse4 (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_9641) |c_~#queue~0.base|))) (let ((.cse1 (store .cse4 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem39#1_186|) |c_~#queue~0.offset|) v_ArrVal_9643)) (.cse2 (+ |c_~#queue~0.offset| 1604))) (let ((.cse3 (select .cse1 .cse2))) (or (< (select (select (store (store .cse0 |c_~#queue~0.base| (store (store .cse1 (+ 1608 |c_~#queue~0.offset|) v_ArrVal_9644) .cse2 v_ArrVal_9647)) |c_~#stored_elements~0.base| v_ArrVal_9648) |c_~#queue~0.base|) .cse2) 400) (= 400 .cse3) (< (+ .cse3 1) v_ArrVal_9647) (< (+ |c_t1Thread1of1ForFork0_enqueue_#t~mem46#1| 1) v_ArrVal_9639) (< (select .cse4 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~mem39#1_186|))))))) is different from false [2023-12-02 20:22:17,139 WARN L854 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_9641 (Array Int Int)) (v_ArrVal_9639 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem39#1_186| Int) (v_ArrVal_9648 (Array Int Int)) (v_ArrVal_9647 Int) (v_ArrVal_9643 Int) (v_ArrVal_9644 Int)) (let ((.cse5 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse6 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse0 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse5 .cse6 v_ArrVal_9639)))) (let ((.cse4 (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_9641) |c_~#queue~0.base|))) (let ((.cse1 (store .cse4 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem39#1_186|) |c_~#queue~0.offset|) v_ArrVal_9643)) (.cse2 (+ |c_~#queue~0.offset| 1604))) (let ((.cse3 (select .cse1 .cse2))) (or (< (select (select (store (store .cse0 |c_~#queue~0.base| (store (store .cse1 (+ 1608 |c_~#queue~0.offset|) v_ArrVal_9644) .cse2 v_ArrVal_9647)) |c_~#stored_elements~0.base| v_ArrVal_9648) |c_~#queue~0.base|) .cse2) 400) (= 400 .cse3) (< (+ .cse3 1) v_ArrVal_9647) (< (select .cse4 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~mem39#1_186|) (< (+ (select .cse5 .cse6) 1) v_ArrVal_9639)))))))) (= 400 |c_t1Thread1of1ForFork0_enqueue_#t~mem44#1|)) is different from false [2023-12-02 20:22:20,643 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse6 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse7 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse5 (select .cse6 .cse7))) (or (forall ((v_ArrVal_9641 (Array Int Int)) (v_ArrVal_9638 Int) (v_ArrVal_9639 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem39#1_186| Int) (v_ArrVal_9648 (Array Int Int)) (v_ArrVal_9647 Int) (v_ArrVal_9643 Int) (v_ArrVal_9644 Int)) (let ((.cse1 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse6 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_9638) .cse7 v_ArrVal_9639)))) (let ((.cse4 (select (store .cse1 |c_~#stored_elements~0.base| v_ArrVal_9641) |c_~#queue~0.base|))) (let ((.cse2 (store .cse4 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem39#1_186|) |c_~#queue~0.offset|) v_ArrVal_9643)) (.cse3 (+ |c_~#queue~0.offset| 1604))) (let ((.cse0 (select .cse2 .cse3))) (or (= 400 .cse0) (< (+ .cse0 1) v_ArrVal_9647) (< (select (select (store (store .cse1 |c_~#queue~0.base| (store (store .cse2 (+ 1608 |c_~#queue~0.offset|) v_ArrVal_9644) .cse3 v_ArrVal_9647)) |c_~#stored_elements~0.base| v_ArrVal_9648) |c_~#queue~0.base|) .cse3) 400) (< (select .cse4 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~mem39#1_186|) (< (+ .cse5 1) v_ArrVal_9639))))))) (= 400 .cse5)))) is different from false [2023-12-02 20:22:21,206 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_9641 (Array Int Int)) (v_ArrVal_9638 Int) (v_ArrVal_9639 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem39#1_186| Int) (v_ArrVal_9648 (Array Int Int)) (v_ArrVal_9635 Int) (v_ArrVal_9647 Int) (v_ArrVal_9643 Int) (v_ArrVal_9644 Int)) (let ((.cse6 (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ (* |c_t1Thread1of1ForFork0_enqueue_#t~mem39#1| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_9635)) (.cse7 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse4 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse6 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_9638) .cse7 v_ArrVal_9639)))) (let ((.cse2 (select (store .cse4 |c_~#stored_elements~0.base| v_ArrVal_9641) |c_~#queue~0.base|))) (let ((.cse5 (store .cse2 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem39#1_186|) |c_~#queue~0.offset|) v_ArrVal_9643)) (.cse3 (+ |c_~#queue~0.offset| 1604))) (let ((.cse0 (select .cse6 .cse7)) (.cse1 (select .cse5 .cse3))) (or (= 400 .cse0) (< (+ .cse0 1) v_ArrVal_9639) (< (+ .cse1 1) v_ArrVal_9647) (< (select .cse2 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~mem39#1_186|) (= 400 .cse1) (< (select (select (store (store .cse4 |c_~#queue~0.base| (store (store .cse5 (+ 1608 |c_~#queue~0.offset|) v_ArrVal_9644) .cse3 v_ArrVal_9647)) |c_~#stored_elements~0.base| v_ArrVal_9648) |c_~#queue~0.base|) .cse3) 400)))))))) is different from false [2023-12-02 20:22:21,476 WARN L854 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem39#1_190| Int)) (let ((.cse1 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604)) (.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem39#1_190|) (forall ((v_ArrVal_9641 (Array Int Int)) (v_ArrVal_9638 Int) (v_ArrVal_9639 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem39#1_186| Int) (v_ArrVal_9648 (Array Int Int)) (v_ArrVal_9635 Int) (v_ArrVal_9647 Int) (v_ArrVal_9643 Int) (v_ArrVal_9644 Int)) (let ((.cse8 (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem39#1_190|) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_9635))) (let ((.cse4 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse8 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_9638) .cse1 v_ArrVal_9639)))) (let ((.cse7 (select (store .cse4 |c_~#stored_elements~0.base| v_ArrVal_9641) |c_~#queue~0.base|))) (let ((.cse5 (store .cse7 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem39#1_186|) |c_~#queue~0.offset|) v_ArrVal_9643)) (.cse6 (+ |c_~#queue~0.offset| 1604))) (let ((.cse3 (select .cse5 .cse6)) (.cse2 (select .cse8 .cse1))) (or (= .cse2 400) (= 400 .cse3) (< (select (select (store (store .cse4 |c_~#queue~0.base| (store (store .cse5 (+ 1608 |c_~#queue~0.offset|) v_ArrVal_9644) .cse6 v_ArrVal_9647)) |c_~#stored_elements~0.base| v_ArrVal_9648) |c_~#queue~0.base|) .cse6) 400) (< (+ .cse3 1) v_ArrVal_9647) (< (select .cse7 .cse6) |v_t1Thread1of1ForFork0_enqueue_#t~mem39#1_186|) (< (+ .cse2 1) v_ArrVal_9639))))))))))) is different from false [2023-12-02 20:22:21,597 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_9641 (Array Int Int)) (v_ArrVal_9638 Int) (v_ArrVal_9639 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem39#1_186| Int) (v_ArrVal_9648 (Array Int Int)) (v_ArrVal_9635 Int) (v_ArrVal_9647 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem39#1_190| Int) (v_ArrVal_9643 Int) (v_ArrVal_9644 Int)) (let ((.cse5 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|))) (let ((.cse8 (store .cse5 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem39#1_190|) |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_9635)) (.cse6 (+ |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| 1604))) (let ((.cse2 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| (store (store .cse8 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_9638) .cse6 v_ArrVal_9639)))) (let ((.cse7 (select (store .cse2 |c_~#stored_elements~0.base| v_ArrVal_9641) |c_~#queue~0.base|))) (let ((.cse3 (store .cse7 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem39#1_186|) |c_~#queue~0.offset|) v_ArrVal_9643)) (.cse4 (+ |c_~#queue~0.offset| 1604))) (let ((.cse0 (select .cse8 .cse6)) (.cse1 (select .cse3 .cse4))) (or (< (+ .cse0 1) v_ArrVal_9639) (= 400 .cse0) (< (+ .cse1 1) v_ArrVal_9647) (= 400 .cse1) (< (select (select (store (store .cse2 |c_~#queue~0.base| (store (store .cse3 (+ 1608 |c_~#queue~0.offset|) v_ArrVal_9644) .cse4 v_ArrVal_9647)) |c_~#stored_elements~0.base| v_ArrVal_9648) |c_~#queue~0.base|) .cse4) 400) (< (select .cse5 .cse6) |v_t1Thread1of1ForFork0_enqueue_#t~mem39#1_190|) (< (select .cse7 .cse4) |v_t1Thread1of1ForFork0_enqueue_#t~mem39#1_186|))))))))) is different from false [2023-12-02 20:22:40,382 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_9638 Int) (v_ArrVal_9639 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem39#1_186| Int) (v_ArrVal_9635 Int) (v_ArrVal_9647 Int) (v_ArrVal_9643 Int) (v_ArrVal_9633 Int) (v_ArrVal_9644 Int) (v_ArrVal_9641 (Array Int Int)) (v_ArrVal_9648 (Array Int Int)) (v_ArrVal_9634 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem39#1_190| Int)) (let ((.cse2 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604) v_ArrVal_9633)))) (let ((.cse7 (select (store .cse2 |c_~#stored_elements~0.base| v_ArrVal_9634) |c_~#queue~0.base|))) (let ((.cse8 (store .cse7 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem39#1_190|) |c_~#queue~0.offset|) v_ArrVal_9635)) (.cse4 (+ 1608 |c_~#queue~0.offset|)) (.cse5 (+ |c_~#queue~0.offset| 1604))) (let ((.cse6 (select (store (store .cse2 |c_~#queue~0.base| (store (store .cse8 .cse4 v_ArrVal_9638) .cse5 v_ArrVal_9639)) |c_~#stored_elements~0.base| v_ArrVal_9641) |c_~#queue~0.base|))) (let ((.cse3 (store .cse6 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem39#1_186|) |c_~#queue~0.offset|) v_ArrVal_9643))) (let ((.cse0 (select .cse8 .cse5)) (.cse1 (select .cse3 .cse5))) (or (= .cse0 400) (< (+ |c_t1Thread1of1ForFork0_enqueue_#t~mem46#1| 1) v_ArrVal_9633) (= 400 .cse1) (< (+ .cse0 1) v_ArrVal_9639) (< (select (select (store (store .cse2 |c_~#queue~0.base| (store (store .cse3 .cse4 v_ArrVal_9644) .cse5 v_ArrVal_9647)) |c_~#stored_elements~0.base| v_ArrVal_9648) |c_~#queue~0.base|) .cse5) 400) (< (select .cse6 .cse5) |v_t1Thread1of1ForFork0_enqueue_#t~mem39#1_186|) (< (+ .cse1 1) v_ArrVal_9647) (< (select .cse7 .cse5) |v_t1Thread1of1ForFork0_enqueue_#t~mem39#1_190|))))))))) is different from false [2023-12-02 20:22:40,736 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_9638 Int) (v_ArrVal_9639 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem39#1_186| Int) (v_ArrVal_9635 Int) (v_ArrVal_9647 Int) (v_ArrVal_9643 Int) (v_ArrVal_9633 Int) (v_ArrVal_9644 Int) (v_ArrVal_9641 (Array Int Int)) (v_ArrVal_9648 (Array Int Int)) (v_ArrVal_9634 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem39#1_190| Int)) (let ((.cse8 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse9 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse2 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse8 .cse9 v_ArrVal_9633)))) (let ((.cse7 (select (store .cse2 |c_~#stored_elements~0.base| v_ArrVal_9634) |c_~#queue~0.base|))) (let ((.cse10 (store .cse7 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem39#1_190|) |c_~#queue~0.offset|) v_ArrVal_9635)) (.cse4 (+ 1608 |c_~#queue~0.offset|)) (.cse5 (+ |c_~#queue~0.offset| 1604))) (let ((.cse6 (select (store (store .cse2 |c_~#queue~0.base| (store (store .cse10 .cse4 v_ArrVal_9638) .cse5 v_ArrVal_9639)) |c_~#stored_elements~0.base| v_ArrVal_9641) |c_~#queue~0.base|))) (let ((.cse3 (store .cse6 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem39#1_186|) |c_~#queue~0.offset|) v_ArrVal_9643))) (let ((.cse0 (select .cse10 .cse5)) (.cse1 (select .cse3 .cse5))) (or (= .cse0 400) (= 400 .cse1) (< (+ .cse0 1) v_ArrVal_9639) (< (select (select (store (store .cse2 |c_~#queue~0.base| (store (store .cse3 .cse4 v_ArrVal_9644) .cse5 v_ArrVal_9647)) |c_~#stored_elements~0.base| v_ArrVal_9648) |c_~#queue~0.base|) .cse5) 400) (< (select .cse6 .cse5) |v_t1Thread1of1ForFork0_enqueue_#t~mem39#1_186|) (< (+ .cse1 1) v_ArrVal_9647) (< (select .cse7 .cse5) |v_t1Thread1of1ForFork0_enqueue_#t~mem39#1_190|) (< (+ (select .cse8 .cse9) 1) v_ArrVal_9633)))))))))) is different from false [2023-12-02 20:22:40,845 WARN L854 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_9638 Int) (v_ArrVal_9639 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem39#1_186| Int) (v_ArrVal_9635 Int) (v_ArrVal_9647 Int) (v_ArrVal_9643 Int) (v_ArrVal_9633 Int) (v_ArrVal_9644 Int) (v_ArrVal_9641 (Array Int Int)) (v_ArrVal_9648 (Array Int Int)) (v_ArrVal_9634 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem39#1_190| Int)) (let ((.cse8 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse9 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse2 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse8 .cse9 v_ArrVal_9633)))) (let ((.cse7 (select (store .cse2 |c_~#stored_elements~0.base| v_ArrVal_9634) |c_~#queue~0.base|))) (let ((.cse10 (store .cse7 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem39#1_190|) |c_~#queue~0.offset|) v_ArrVal_9635)) (.cse4 (+ 1608 |c_~#queue~0.offset|)) (.cse5 (+ |c_~#queue~0.offset| 1604))) (let ((.cse6 (select (store (store .cse2 |c_~#queue~0.base| (store (store .cse10 .cse4 v_ArrVal_9638) .cse5 v_ArrVal_9639)) |c_~#stored_elements~0.base| v_ArrVal_9641) |c_~#queue~0.base|))) (let ((.cse3 (store .cse6 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem39#1_186|) |c_~#queue~0.offset|) v_ArrVal_9643))) (let ((.cse0 (select .cse10 .cse5)) (.cse1 (select .cse3 .cse5))) (or (= .cse0 400) (= 400 .cse1) (< (+ .cse0 1) v_ArrVal_9639) (< (select (select (store (store .cse2 |c_~#queue~0.base| (store (store .cse3 .cse4 v_ArrVal_9644) .cse5 v_ArrVal_9647)) |c_~#stored_elements~0.base| v_ArrVal_9648) |c_~#queue~0.base|) .cse5) 400) (< (select .cse6 .cse5) |v_t1Thread1of1ForFork0_enqueue_#t~mem39#1_186|) (< (+ .cse1 1) v_ArrVal_9647) (< (select .cse7 .cse5) |v_t1Thread1of1ForFork0_enqueue_#t~mem39#1_190|) (< (+ (select .cse8 .cse9) 1) v_ArrVal_9633)))))))))) (= 400 |c_t1Thread1of1ForFork0_enqueue_#t~mem44#1|)) is different from false [2023-12-02 20:22:57,049 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_9638 Int) (v_ArrVal_9639 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem39#1_186| Int) (v_ArrVal_9629 Int) (v_ArrVal_9635 Int) (v_ArrVal_9647 Int) (v_ArrVal_9630 Int) (v_ArrVal_9643 Int) (v_ArrVal_9633 Int) (v_ArrVal_9644 Int) (v_ArrVal_9641 (Array Int Int)) (v_ArrVal_9648 (Array Int Int)) (v_ArrVal_9634 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem39#1_190| Int)) (let ((.cse9 (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ (* |c_t1Thread1of1ForFork0_enqueue_#t~mem39#1| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_9629)) (.cse10 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse3 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse9 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_9630) .cse10 v_ArrVal_9633)))) (let ((.cse2 (select (store .cse3 |c_~#stored_elements~0.base| v_ArrVal_9634) |c_~#queue~0.base|))) (let ((.cse11 (store .cse2 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem39#1_190|) |c_~#queue~0.offset|) v_ArrVal_9635)) (.cse5 (+ 1608 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (let ((.cse0 (select (store (store .cse3 |c_~#queue~0.base| (store (store .cse11 .cse5 v_ArrVal_9638) .cse1 v_ArrVal_9639)) |c_~#stored_elements~0.base| v_ArrVal_9641) |c_~#queue~0.base|))) (let ((.cse4 (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem39#1_186|) |c_~#queue~0.offset|) v_ArrVal_9643))) (let ((.cse6 (select .cse4 .cse1)) (.cse7 (select .cse11 .cse1)) (.cse8 (select .cse9 .cse10))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem39#1_186|) (< (select .cse2 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem39#1_190|) (< (select (select (store (store .cse3 |c_~#queue~0.base| (store (store .cse4 .cse5 v_ArrVal_9644) .cse1 v_ArrVal_9647)) |c_~#stored_elements~0.base| v_ArrVal_9648) |c_~#queue~0.base|) .cse1) 400) (= 400 .cse6) (= 400 .cse7) (= 400 .cse8) (< (+ .cse6 1) v_ArrVal_9647) (< (+ .cse7 1) v_ArrVal_9639) (< (+ .cse8 1) v_ArrVal_9633)))))))))) is different from false [2023-12-02 20:23:01,824 WARN L854 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem39#1_194| Int) (v_ArrVal_9638 Int) (v_ArrVal_9639 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem39#1_186| Int) (v_ArrVal_9629 Int) (v_ArrVal_9635 Int) (v_ArrVal_9647 Int) (v_ArrVal_9630 Int) (v_ArrVal_9643 Int) (v_ArrVal_9633 Int) (v_ArrVal_9644 Int) (v_ArrVal_9641 (Array Int Int)) (v_ArrVal_9648 (Array Int Int)) (v_ArrVal_9634 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem39#1_190| Int)) (let ((.cse9 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|))) (let ((.cse12 (store .cse9 (+ |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem39#1_194|)) v_ArrVal_9629)) (.cse10 (+ |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| 1604))) (let ((.cse2 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| (store (store .cse12 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_9630) .cse10 v_ArrVal_9633)))) (let ((.cse5 (select (store .cse2 |c_~#stored_elements~0.base| v_ArrVal_9634) |c_~#queue~0.base|))) (let ((.cse11 (store .cse5 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem39#1_190|) |c_~#queue~0.offset|) v_ArrVal_9635)) (.cse4 (+ 1608 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (let ((.cse0 (select (store (store .cse2 |c_~#queue~0.base| (store (store .cse11 .cse4 v_ArrVal_9638) .cse1 v_ArrVal_9639)) |c_~#stored_elements~0.base| v_ArrVal_9641) |c_~#queue~0.base|))) (let ((.cse3 (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem39#1_186|) |c_~#queue~0.offset|) v_ArrVal_9643))) (let ((.cse6 (select .cse12 .cse10)) (.cse8 (select .cse11 .cse1)) (.cse7 (select .cse3 .cse1))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem39#1_186|) (< (select (select (store (store .cse2 |c_~#queue~0.base| (store (store .cse3 .cse4 v_ArrVal_9644) .cse1 v_ArrVal_9647)) |c_~#stored_elements~0.base| v_ArrVal_9648) |c_~#queue~0.base|) .cse1) 400) (< (select .cse5 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem39#1_190|) (< (+ .cse6 1) v_ArrVal_9633) (= 400 .cse6) (< (+ .cse7 1) v_ArrVal_9647) (= 400 .cse8) (< (+ .cse8 1) v_ArrVal_9639) (< (select .cse9 .cse10) |v_t1Thread1of1ForFork0_enqueue_#t~mem39#1_194|) (= 400 .cse7))))))))))) is different from false [2023-12-02 20:23:23,347 WARN L854 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem39#1_194| Int) (v_ArrVal_9638 Int) (v_ArrVal_9639 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem39#1_186| Int) (v_ArrVal_9629 Int) (v_ArrVal_9635 Int) (v_ArrVal_9647 Int) (v_ArrVal_9626 Int) (v_ArrVal_9630 Int) (v_ArrVal_9643 Int) (v_ArrVal_9633 Int) (v_ArrVal_9644 Int) (v_ArrVal_9641 (Array Int Int)) (v_ArrVal_9648 (Array Int Int)) (v_ArrVal_9634 (Array Int Int)) (v_ArrVal_9627 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem39#1_190| Int)) (let ((.cse5 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604) v_ArrVal_9626)))) (let ((.cse4 (select (store .cse5 |c_~#stored_elements~0.base| v_ArrVal_9627) |c_~#queue~0.base|))) (let ((.cse11 (store .cse4 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem39#1_194|)) v_ArrVal_9629)) (.cse7 (+ 1608 |c_~#queue~0.offset|)) (.cse3 (+ |c_~#queue~0.offset| 1604))) (let ((.cse9 (select (store (store .cse5 |c_~#queue~0.base| (store (store .cse11 .cse7 v_ArrVal_9630) .cse3 v_ArrVal_9633)) |c_~#stored_elements~0.base| v_ArrVal_9634) |c_~#queue~0.base|))) (let ((.cse10 (store .cse9 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem39#1_190|) |c_~#queue~0.offset|) v_ArrVal_9635))) (let ((.cse2 (select (store (store .cse5 |c_~#queue~0.base| (store (store .cse10 .cse7 v_ArrVal_9638) .cse3 v_ArrVal_9639)) |c_~#stored_elements~0.base| v_ArrVal_9641) |c_~#queue~0.base|))) (let ((.cse6 (store .cse2 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem39#1_186|) |c_~#queue~0.offset|) v_ArrVal_9643))) (let ((.cse0 (select .cse11 .cse3)) (.cse1 (select .cse6 .cse3)) (.cse8 (select .cse10 .cse3))) (or (< (+ .cse0 1) v_ArrVal_9633) (= 400 .cse1) (< (select .cse2 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~mem39#1_186|) (= 400 .cse0) (< (select .cse4 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~mem39#1_194|) (< (+ .cse1 1) v_ArrVal_9647) (< (+ |c_t1Thread1of1ForFork0_enqueue_#t~post47#1| 1) v_ArrVal_9626) (< (select (select (store (store .cse5 |c_~#queue~0.base| (store (store .cse6 .cse7 v_ArrVal_9644) .cse3 v_ArrVal_9647)) |c_~#stored_elements~0.base| v_ArrVal_9648) |c_~#queue~0.base|) .cse3) 400) (< (+ .cse8 1) v_ArrVal_9639) (= 400 .cse8) (< (select .cse9 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~mem39#1_190|))))))))))) is different from false [2023-12-02 20:23:23,437 WARN L854 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem39#1_194| Int) (v_ArrVal_9638 Int) (v_ArrVal_9639 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem39#1_186| Int) (v_ArrVal_9629 Int) (v_ArrVal_9635 Int) (v_ArrVal_9647 Int) (v_ArrVal_9626 Int) (v_ArrVal_9630 Int) (v_ArrVal_9643 Int) (v_ArrVal_9633 Int) (v_ArrVal_9644 Int) (v_ArrVal_9641 (Array Int Int)) (v_ArrVal_9648 (Array Int Int)) (v_ArrVal_9634 (Array Int Int)) (v_ArrVal_9627 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem39#1_190| Int)) (let ((.cse5 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604) v_ArrVal_9626)))) (let ((.cse4 (select (store .cse5 |c_~#stored_elements~0.base| v_ArrVal_9627) |c_~#queue~0.base|))) (let ((.cse11 (store .cse4 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem39#1_194|)) v_ArrVal_9629)) (.cse7 (+ 1608 |c_~#queue~0.offset|)) (.cse3 (+ |c_~#queue~0.offset| 1604))) (let ((.cse9 (select (store (store .cse5 |c_~#queue~0.base| (store (store .cse11 .cse7 v_ArrVal_9630) .cse3 v_ArrVal_9633)) |c_~#stored_elements~0.base| v_ArrVal_9634) |c_~#queue~0.base|))) (let ((.cse10 (store .cse9 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem39#1_190|) |c_~#queue~0.offset|) v_ArrVal_9635))) (let ((.cse2 (select (store (store .cse5 |c_~#queue~0.base| (store (store .cse10 .cse7 v_ArrVal_9638) .cse3 v_ArrVal_9639)) |c_~#stored_elements~0.base| v_ArrVal_9641) |c_~#queue~0.base|))) (let ((.cse6 (store .cse2 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem39#1_186|) |c_~#queue~0.offset|) v_ArrVal_9643))) (let ((.cse0 (select .cse11 .cse3)) (.cse1 (select .cse6 .cse3)) (.cse8 (select .cse10 .cse3))) (or (< (+ .cse0 1) v_ArrVal_9633) (= 400 .cse1) (< (select .cse2 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~mem39#1_186|) (= 400 .cse0) (< (select .cse4 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~mem39#1_194|) (< (+ .cse1 1) v_ArrVal_9647) (< (select (select (store (store .cse5 |c_~#queue~0.base| (store (store .cse6 .cse7 v_ArrVal_9644) .cse3 v_ArrVal_9647)) |c_~#stored_elements~0.base| v_ArrVal_9648) |c_~#queue~0.base|) .cse3) 400) (< (+ .cse8 1) v_ArrVal_9639) (< (+ |c_t1Thread1of1ForFork0_enqueue_#t~mem46#1| 1) v_ArrVal_9626) (= 400 .cse8) (< (select .cse9 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~mem39#1_190|))))))))))) is different from false [2023-12-02 20:23:33,865 WARN L854 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem39#1_194| Int) (v_ArrVal_9638 Int) (v_ArrVal_9639 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem39#1_186| Int) (v_ArrVal_9629 Int) (v_ArrVal_9623 Int) (v_ArrVal_9635 Int) (v_ArrVal_9647 Int) (v_ArrVal_9626 Int) (v_ArrVal_9630 Int) (v_ArrVal_9643 Int) (v_ArrVal_9633 Int) (v_ArrVal_9644 Int) (v_ArrVal_9641 (Array Int Int)) (v_ArrVal_9648 (Array Int Int)) (v_ArrVal_9634 (Array Int Int)) (v_ArrVal_9627 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem39#1_190| Int)) (let ((.cse10 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse11 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse6 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse10 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_9623) .cse11 v_ArrVal_9626)))) (let ((.cse9 (select (store .cse6 |c_~#stored_elements~0.base| v_ArrVal_9627) |c_~#queue~0.base|))) (let ((.cse13 (store .cse9 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem39#1_194|)) v_ArrVal_9629)) (.cse8 (+ 1608 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (let ((.cse3 (select (store (store .cse6 |c_~#queue~0.base| (store (store .cse13 .cse8 v_ArrVal_9630) .cse1 v_ArrVal_9633)) |c_~#stored_elements~0.base| v_ArrVal_9634) |c_~#queue~0.base|))) (let ((.cse12 (store .cse3 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem39#1_190|) |c_~#queue~0.offset|) v_ArrVal_9635))) (let ((.cse0 (select (store (store .cse6 |c_~#queue~0.base| (store (store .cse12 .cse8 v_ArrVal_9638) .cse1 v_ArrVal_9639)) |c_~#stored_elements~0.base| v_ArrVal_9641) |c_~#queue~0.base|))) (let ((.cse7 (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem39#1_186|) |c_~#queue~0.offset|) v_ArrVal_9643))) (let ((.cse2 (select .cse7 .cse1)) (.cse5 (select .cse13 .cse1)) (.cse4 (select .cse12 .cse1))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem39#1_186|) (= 400 .cse2) (< (+ .cse2 1) v_ArrVal_9647) (< (select .cse3 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem39#1_190|) (= 400 .cse4) (= 400 .cse5) (< (select (select (store (store .cse6 |c_~#queue~0.base| (store (store .cse7 .cse8 v_ArrVal_9644) .cse1 v_ArrVal_9647)) |c_~#stored_elements~0.base| v_ArrVal_9648) |c_~#queue~0.base|) .cse1) 400) (< (+ .cse5 1) v_ArrVal_9633) (< (select .cse9 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem39#1_194|) (< (+ (select .cse10 .cse11) 1) v_ArrVal_9626) (< (+ .cse4 1) v_ArrVal_9639)))))))))))) is different from false [2023-12-02 20:23:35,523 WARN L854 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem39#1_194| Int) (v_ArrVal_9638 Int) (v_ArrVal_9639 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem39#1_186| Int) (v_ArrVal_9629 Int) (v_ArrVal_9623 Int) (v_ArrVal_9635 Int) (v_ArrVal_9647 Int) (v_ArrVal_9626 Int) (v_ArrVal_9630 Int) (v_ArrVal_9643 Int) (v_ArrVal_9622 Int) (v_ArrVal_9633 Int) (v_ArrVal_9644 Int) (v_ArrVal_9641 (Array Int Int)) (v_ArrVal_9648 (Array Int Int)) (v_ArrVal_9634 (Array Int Int)) (v_ArrVal_9627 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem39#1_190| Int)) (let ((.cse9 (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ (* |c_t1Thread1of1ForFork0_enqueue_#t~mem39#1| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_9622)) (.cse10 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse5 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse9 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_9623) .cse10 v_ArrVal_9626)))) (let ((.cse8 (select (store .cse5 |c_~#stored_elements~0.base| v_ArrVal_9627) |c_~#queue~0.base|))) (let ((.cse12 (store .cse8 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem39#1_194|)) v_ArrVal_9629)) (.cse7 (+ 1608 |c_~#queue~0.offset|)) (.cse2 (+ |c_~#queue~0.offset| 1604))) (let ((.cse1 (select (store (store .cse5 |c_~#queue~0.base| (store (store .cse12 .cse7 v_ArrVal_9630) .cse2 v_ArrVal_9633)) |c_~#stored_elements~0.base| v_ArrVal_9634) |c_~#queue~0.base|))) (let ((.cse13 (store .cse1 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem39#1_190|) |c_~#queue~0.offset|) v_ArrVal_9635))) (let ((.cse11 (select (store (store .cse5 |c_~#queue~0.base| (store (store .cse13 .cse7 v_ArrVal_9638) .cse2 v_ArrVal_9639)) |c_~#stored_elements~0.base| v_ArrVal_9641) |c_~#queue~0.base|))) (let ((.cse6 (store .cse11 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem39#1_186|) |c_~#queue~0.offset|) v_ArrVal_9643))) (let ((.cse0 (select .cse13 .cse2)) (.cse4 (select .cse6 .cse2)) (.cse3 (select .cse12 .cse2))) (or (= 400 .cse0) (< (+ .cse0 1) v_ArrVal_9639) (< (select .cse1 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~mem39#1_190|) (= 400 .cse3) (< (+ .cse4 1) v_ArrVal_9647) (< (select (select (store (store .cse5 |c_~#queue~0.base| (store (store .cse6 .cse7 v_ArrVal_9644) .cse2 v_ArrVal_9647)) |c_~#stored_elements~0.base| v_ArrVal_9648) |c_~#queue~0.base|) .cse2) 400) (< (select .cse8 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~mem39#1_194|) (= 400 .cse4) (< (+ .cse3 1) v_ArrVal_9633) (< (+ (select .cse9 .cse10) 1) v_ArrVal_9626) (< (select .cse11 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~mem39#1_186|)))))))))))) is different from false [2023-12-02 20:23:36,328 WARN L854 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem39#1_198| Int)) (let ((.cse14 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse10 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (or (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem39#1_194| Int) (v_ArrVal_9638 Int) (v_ArrVal_9639 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem39#1_186| Int) (v_ArrVal_9629 Int) (v_ArrVal_9623 Int) (v_ArrVal_9635 Int) (v_ArrVal_9647 Int) (v_ArrVal_9626 Int) (v_ArrVal_9630 Int) (v_ArrVal_9643 Int) (v_ArrVal_9622 Int) (v_ArrVal_9633 Int) (v_ArrVal_9644 Int) (v_ArrVal_9641 (Array Int Int)) (v_ArrVal_9648 (Array Int Int)) (v_ArrVal_9634 (Array Int Int)) (v_ArrVal_9627 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem39#1_190| Int)) (let ((.cse9 (store .cse14 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem39#1_198|) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_9622))) (let ((.cse5 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse9 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_9623) .cse10 v_ArrVal_9626)))) (let ((.cse2 (select (store .cse5 |c_~#stored_elements~0.base| v_ArrVal_9627) |c_~#queue~0.base|))) (let ((.cse13 (store .cse2 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem39#1_194|)) v_ArrVal_9629)) (.cse7 (+ 1608 |c_~#queue~0.offset|)) (.cse3 (+ |c_~#queue~0.offset| 1604))) (let ((.cse4 (select (store (store .cse5 |c_~#queue~0.base| (store (store .cse13 .cse7 v_ArrVal_9630) .cse3 v_ArrVal_9633)) |c_~#stored_elements~0.base| v_ArrVal_9634) |c_~#queue~0.base|))) (let ((.cse12 (store .cse4 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem39#1_190|) |c_~#queue~0.offset|) v_ArrVal_9635))) (let ((.cse8 (select (store (store .cse5 |c_~#queue~0.base| (store (store .cse12 .cse7 v_ArrVal_9638) .cse3 v_ArrVal_9639)) |c_~#stored_elements~0.base| v_ArrVal_9641) |c_~#queue~0.base|))) (let ((.cse6 (store .cse8 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem39#1_186|) |c_~#queue~0.offset|) v_ArrVal_9643))) (let ((.cse0 (select .cse6 .cse3)) (.cse1 (select .cse13 .cse3)) (.cse11 (select .cse12 .cse3))) (or (< (+ .cse0 1) v_ArrVal_9647) (= 400 .cse1) (< (select .cse2 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~mem39#1_194|) (< (select .cse4 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~mem39#1_190|) (< (select (select (store (store .cse5 |c_~#queue~0.base| (store (store .cse6 .cse7 v_ArrVal_9644) .cse3 v_ArrVal_9647)) |c_~#stored_elements~0.base| v_ArrVal_9648) |c_~#queue~0.base|) .cse3) 400) (< (select .cse8 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~mem39#1_186|) (< (+ (select .cse9 .cse10) 1) v_ArrVal_9626) (= 400 .cse0) (< (+ .cse11 1) v_ArrVal_9639) (< (+ .cse1 1) v_ArrVal_9633) (= 400 .cse11)))))))))))) (< (select .cse14 .cse10) |v_t1Thread1of1ForFork0_enqueue_#t~mem39#1_198|)))) is different from false [2023-12-02 20:24:05,371 WARN L854 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem39#1_194| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem39#1_198| Int) (v_ArrVal_9638 Int) (v_ArrVal_9639 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem39#1_186| Int) (v_ArrVal_9629 Int) (v_ArrVal_9623 Int) (v_ArrVal_9635 Int) (v_ArrVal_9647 Int) (v_ArrVal_9626 Int) (v_ArrVal_9630 Int) (v_ArrVal_9643 Int) (v_ArrVal_9622 Int) (v_ArrVal_9633 Int) (v_ArrVal_9644 Int) (v_ArrVal_9641 (Array Int Int)) (v_ArrVal_9620 (Array Int Int)) (v_ArrVal_9648 (Array Int Int)) (v_ArrVal_9634 (Array Int Int)) (v_ArrVal_9627 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem39#1_190| Int)) (let ((.cse6 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id1~0#1.base| v_ArrVal_9620))) (let ((.cse2 (select .cse6 |c_~#queue~0.base|))) (let ((.cse10 (store .cse2 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem39#1_198|) |c_~#queue~0.offset|) v_ArrVal_9622)) (.cse8 (+ 1608 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (let ((.cse0 (select (store (store .cse6 |c_~#queue~0.base| (store (store .cse10 .cse8 v_ArrVal_9623) .cse1 v_ArrVal_9626)) |c_~#stored_elements~0.base| v_ArrVal_9627) |c_~#queue~0.base|))) (let ((.cse12 (store .cse0 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem39#1_194|)) v_ArrVal_9629))) (let ((.cse3 (select (store (store .cse6 |c_~#queue~0.base| (store (store .cse12 .cse8 v_ArrVal_9630) .cse1 v_ArrVal_9633)) |c_~#stored_elements~0.base| v_ArrVal_9634) |c_~#queue~0.base|))) (let ((.cse13 (store .cse3 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem39#1_190|) |c_~#queue~0.offset|) v_ArrVal_9635))) (let ((.cse11 (select (store (store .cse6 |c_~#queue~0.base| (store (store .cse13 .cse8 v_ArrVal_9638) .cse1 v_ArrVal_9639)) |c_~#stored_elements~0.base| v_ArrVal_9641) |c_~#queue~0.base|))) (let ((.cse7 (store .cse11 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem39#1_186|) |c_~#queue~0.offset|) v_ArrVal_9643))) (let ((.cse4 (select .cse13 .cse1)) (.cse5 (select .cse12 .cse1)) (.cse9 (select .cse7 .cse1))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem39#1_194|) (< (select .cse2 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem39#1_198|) (< (select .cse3 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem39#1_190|) (< (+ .cse4 1) v_ArrVal_9639) (= 400 .cse5) (= 400 .cse4) (< (select (select (store (store .cse6 |c_~#queue~0.base| (store (store .cse7 .cse8 v_ArrVal_9644) .cse1 v_ArrVal_9647)) |c_~#stored_elements~0.base| v_ArrVal_9648) |c_~#queue~0.base|) .cse1) 400) (< (+ .cse9 1) v_ArrVal_9647) (< (+ (select .cse10 .cse1) 1) v_ArrVal_9626) (< (select .cse11 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem39#1_186|) (< (+ .cse5 1) v_ArrVal_9633) (= 400 .cse9))))))))))))) is different from false [2023-12-02 20:24:09,668 WARN L854 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem39#1_194| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem39#1_198| Int) (v_ArrVal_9638 Int) (v_ArrVal_9639 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem39#1_186| Int) (v_ArrVal_9629 Int) (v_ArrVal_9623 Int) (v_ArrVal_9635 Int) (v_ArrVal_9647 Int) (v_ArrVal_9626 Int) (v_ArrVal_9630 Int) (v_ArrVal_9643 Int) (v_ArrVal_9622 Int) (v_ArrVal_9633 Int) (v_ArrVal_9644 Int) (v_ArrVal_9641 (Array Int Int)) (v_ArrVal_9620 (Array Int Int)) (v_ArrVal_9648 (Array Int Int)) (v_ArrVal_9634 (Array Int Int)) (v_ArrVal_9627 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem39#1_190| Int)) (let ((.cse0 (store (store |c_#memory_int| |c_ULTIMATE.start_init_~q#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_init_~q#1.base|) (+ 1608 |c_ULTIMATE.start_init_~q#1.offset|) 0)) |c_ULTIMATE.start_main_~#id1~0#1.base| v_ArrVal_9620))) (let ((.cse8 (select .cse0 |c_~#queue~0.base|))) (let ((.cse7 (store .cse8 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem39#1_198|) |c_~#queue~0.offset|) v_ArrVal_9622)) (.cse2 (+ 1608 |c_~#queue~0.offset|)) (.cse3 (+ |c_~#queue~0.offset| 1604))) (let ((.cse5 (select (store (store .cse0 |c_~#queue~0.base| (store (store .cse7 .cse2 v_ArrVal_9623) .cse3 v_ArrVal_9626)) |c_~#stored_elements~0.base| v_ArrVal_9627) |c_~#queue~0.base|))) (let ((.cse12 (store .cse5 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem39#1_194|)) v_ArrVal_9629))) (let ((.cse9 (select (store (store .cse0 |c_~#queue~0.base| (store (store .cse12 .cse2 v_ArrVal_9630) .cse3 v_ArrVal_9633)) |c_~#stored_elements~0.base| v_ArrVal_9634) |c_~#queue~0.base|))) (let ((.cse13 (store .cse9 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem39#1_190|) |c_~#queue~0.offset|) v_ArrVal_9635))) (let ((.cse10 (select (store (store .cse0 |c_~#queue~0.base| (store (store .cse13 .cse2 v_ArrVal_9638) .cse3 v_ArrVal_9639)) |c_~#stored_elements~0.base| v_ArrVal_9641) |c_~#queue~0.base|))) (let ((.cse1 (store .cse10 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem39#1_186|) |c_~#queue~0.offset|) v_ArrVal_9643))) (let ((.cse6 (select .cse13 .cse3)) (.cse11 (select .cse1 .cse3)) (.cse4 (select .cse12 .cse3))) (or (< (select (select (store (store .cse0 |c_~#queue~0.base| (store (store .cse1 .cse2 v_ArrVal_9644) .cse3 v_ArrVal_9647)) |c_~#stored_elements~0.base| v_ArrVal_9648) |c_~#queue~0.base|) .cse3) 400) (= 400 .cse4) (< (select .cse5 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~mem39#1_194|) (< (+ .cse6 1) v_ArrVal_9639) (< (+ (select .cse7 .cse3) 1) v_ArrVal_9626) (< (select .cse8 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~mem39#1_198|) (< (select .cse9 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~mem39#1_190|) (= 400 .cse6) (< (select .cse10 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~mem39#1_186|) (< (+ .cse11 1) v_ArrVal_9647) (= 400 .cse11) (< (+ .cse4 1) v_ArrVal_9633))))))))))))) is different from false [2023-12-02 20:24:10,475 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:24:10,475 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 1328 treesize of output 838 [2023-12-02 20:24:10,525 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:24:10,526 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 2348 treesize of output 2336 [2023-12-02 20:24:10,657 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 324 treesize of output 316 [2023-12-02 20:24:10,702 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 332 treesize of output 308 [2023-12-02 20:24:10,748 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 304 treesize of output 280 [2023-12-02 20:24:10,797 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 318 treesize of output 294 [2023-12-02 20:24:10,848 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 50 treesize of output 42 [2023-12-02 20:24:10,925 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:24:10,926 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 16 treesize of output 8 [2023-12-02 20:24:13,900 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:24:13,900 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 576 treesize of output 578 [2023-12-02 20:24:15,299 INFO L134 CoverageAnalysis]: Checked inductivity of 3582 backedges. 1977 proven. 279 refuted. 129 times theorem prover too weak. 905 trivial. 292 not checked. [2023-12-02 20:24:15,299 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [400202084] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 20:24:15,299 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 20:24:15,300 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 45, 57] total 108 [2023-12-02 20:24:15,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1657025446] [2023-12-02 20:24:15,300 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 20:24:15,302 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 108 states [2023-12-02 20:24:15,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-02 20:24:15,304 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 108 interpolants. [2023-12-02 20:24:15,307 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1199, Invalid=6335, Unknown=374, NotChecked=3648, Total=11556 [2023-12-02 20:24:15,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:24:15,309 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-12-02 20:24:15,309 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 108 states, 108 states have (on average 11.768518518518519) internal successors, (1271), 108 states have internal predecessors, (1271), 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:24:15,309 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:24:15,309 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:24:15,310 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-12-02 20:24:15,310 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-12-02 20:24:15,310 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-12-02 20:24:15,310 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-12-02 20:24:15,310 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-12-02 20:24:15,310 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-12-02 20:24:15,310 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2023-12-02 20:24:15,310 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-12-02 20:24:15,310 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2023-12-02 20:24:15,310 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:24:15,310 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:24:15,310 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:24:15,310 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2023-12-02 20:24:15,310 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 56 states. [2023-12-02 20:24:15,310 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 137 states. [2023-12-02 20:24:15,310 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:24:46,075 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 [1] [2023-12-02 20:24:47,457 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.38s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 20:24:49,742 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 [1] [2023-12-02 20:24:52,492 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 [1] [2023-12-02 20:24:54,870 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 [1] [2023-12-02 20:24:57,406 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 [1] [2023-12-02 20:24:58,689 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.28s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 20:25:00,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 [1] [2023-12-02 20:25:03,158 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 [1] [2023-12-02 20:25:05,255 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 [1] [2023-12-02 20:25:21,498 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 [1] [2023-12-02 20:25:23,516 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 [1] [2023-12-02 20:25:25,537 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 [1] [2023-12-02 20:25:27,559 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 [1] [2023-12-02 20:25:29,576 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 [1] [2023-12-02 20:25:32,333 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 [1] [2023-12-02 20:25:43,725 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 [1] [2023-12-02 20:26:37,531 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 [1] [2023-12-02 20:26:39,548 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 [1] [2023-12-02 20:26:42,519 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 [1] [2023-12-02 20:26:44,541 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 [1] [2023-12-02 20:27:09,534 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 [1] [2023-12-02 20:27:11,680 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 [1] [2023-12-02 20:27:35,118 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 [1] [2023-12-02 20:27:37,138 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 [1] [2023-12-02 20:28:03,795 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 [1] [2023-12-02 20:28:06,036 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 [1] [2023-12-02 20:28:28,481 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 [1] [2023-12-02 20:28:31,277 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 [1] [2023-12-02 20:28:58,024 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 [1] [2023-12-02 20:29:01,010 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 [1] [2023-12-02 20:29:02,858 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.72s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 20:29:04,888 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 [1] [2023-12-02 20:29:07,212 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 [1] [2023-12-02 20:29:11,455 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 [1] [2023-12-02 20:29:13,473 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 [1] [2023-12-02 20:29:16,971 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 [1] [2023-12-02 20:29:18,978 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 [1] [2023-12-02 20:29:20,987 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 [1] [2023-12-02 20:29:25,146 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 [1] [2023-12-02 20:29:27,154 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 [1] [2023-12-02 20:30:08,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 [1] [2023-12-02 20:31:05,076 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.13s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 20:32:52,405 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.01s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1]