./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/pthread-divine/divinefifo-bug_1w1r.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 9a849f68 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/GemCutterReach.xml -i ../sv-benchmarks/c/pthread-divine/divinefifo-bug_1w1r.i -s /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/svcomp-DataRace-32bit-GemCutter_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux --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 32482febe38d61a93fd0705f3ad97c9c1ccc991b1238f75e4d1dd99bfb01c35e --- Real Ultimate output --- This is Ultimate 0.2.5-dev-9a849f6-m [2024-10-26 01:45:35,566 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-26 01:45:35,650 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/svcomp-DataRace-32bit-GemCutter_Default.epf [2024-10-26 01:45:35,655 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-26 01:45:35,658 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-26 01:45:35,691 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-26 01:45:35,691 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-26 01:45:35,692 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-26 01:45:35,693 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-26 01:45:35,693 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-26 01:45:35,693 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-26 01:45:35,694 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-26 01:45:35,694 INFO L153 SettingsManager]: * Use SBE=true [2024-10-26 01:45:35,695 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-26 01:45:35,695 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-26 01:45:35,695 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-26 01:45:35,698 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-26 01:45:35,701 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-26 01:45:35,702 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-26 01:45:35,702 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-26 01:45:35,702 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-26 01:45:35,703 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-26 01:45:35,703 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2024-10-26 01:45:35,703 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-26 01:45:35,704 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-26 01:45:35,704 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-26 01:45:35,704 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-26 01:45:35,704 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-26 01:45:35,705 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-26 01:45:35,705 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-26 01:45:35,705 INFO L153 SettingsManager]: * To the following directory=./dump/ [2024-10-26 01:45:35,705 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-26 01:45:35,705 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-10-26 01:45:35,706 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-26 01:45:35,706 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-26 01:45:35,706 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-26 01:45:35,706 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-26 01:45:35,707 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-26 01:45:35,707 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-26 01:45:35,707 INFO L153 SettingsManager]: * Abstraction used for commutativity in POR=VARIABLES_GLOBAL [2024-10-26 01:45:35,707 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2024-10-26 01:45:35,708 INFO L153 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2024-10-26 01:45:35,708 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2024-10-26 01:45:35,708 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:/storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/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 -> /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux 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 -> 32482febe38d61a93fd0705f3ad97c9c1ccc991b1238f75e4d1dd99bfb01c35e [2024-10-26 01:45:35,953 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-26 01:45:35,976 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-26 01:45:35,980 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-26 01:45:35,981 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-26 01:45:35,981 INFO L274 PluginConnector]: CDTParser initialized [2024-10-26 01:45:35,983 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../sv-benchmarks/c/pthread-divine/divinefifo-bug_1w1r.i [2024-10-26 01:45:37,364 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-26 01:45:37,622 INFO L384 CDTParser]: Found 1 translation units. [2024-10-26 01:45:37,623 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-divine/divinefifo-bug_1w1r.i [2024-10-26 01:45:37,640 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/e0829919a/96d2ef6bd9984d269ce48383f2ae1cec/FLAG6b7451b78 [2024-10-26 01:45:37,929 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/e0829919a/96d2ef6bd9984d269ce48383f2ae1cec [2024-10-26 01:45:37,931 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-26 01:45:37,932 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-26 01:45:37,934 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-26 01:45:37,934 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-26 01:45:37,938 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-26 01:45:37,939 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.10 01:45:37" (1/1) ... [2024-10-26 01:45:37,940 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@402e5898 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 01:45:37, skipping insertion in model container [2024-10-26 01:45:37,940 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.10 01:45:37" (1/1) ... [2024-10-26 01:45:37,991 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-26 01:45:38,467 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-26 01:45:38,480 INFO L200 MainTranslator]: Completed pre-run [2024-10-26 01:45:38,564 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-26 01:45:38,616 INFO L204 MainTranslator]: Completed translation [2024-10-26 01:45:38,617 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 01:45:38 WrapperNode [2024-10-26 01:45:38,617 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-26 01:45:38,618 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-26 01:45:38,618 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-26 01:45:38,618 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-26 01:45:38,625 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 01:45:38" (1/1) ... [2024-10-26 01:45:38,664 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 01:45:38" (1/1) ... [2024-10-26 01:45:38,747 INFO L138 Inliner]: procedures = 277, calls = 106, calls flagged for inlining = 27, calls inlined = 29, statements flattened = 999 [2024-10-26 01:45:38,748 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-26 01:45:38,748 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-26 01:45:38,748 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-26 01:45:38,749 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-26 01:45:38,758 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 01:45:38" (1/1) ... [2024-10-26 01:45:38,759 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 01:45:38" (1/1) ... [2024-10-26 01:45:38,786 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 01:45:38" (1/1) ... [2024-10-26 01:45:38,787 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 01:45:38" (1/1) ... [2024-10-26 01:45:38,864 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 01:45:38" (1/1) ... [2024-10-26 01:45:38,875 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 01:45:38" (1/1) ... [2024-10-26 01:45:38,884 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 01:45:38" (1/1) ... [2024-10-26 01:45:38,890 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 01:45:38" (1/1) ... [2024-10-26 01:45:38,905 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-26 01:45:38,906 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-26 01:45:38,906 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-26 01:45:38,906 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-26 01:45:38,907 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 01:45:38" (1/1) ... [2024-10-26 01:45:38,914 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-10-26 01:45:38,926 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-26 01:45:38,942 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-10-26 01:45:38,949 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-10-26 01:45:38,991 INFO L130 BoogieDeclarations]: Found specification of procedure pusher [2024-10-26 01:45:38,992 INFO L138 BoogieDeclarations]: Found implementation of procedure pusher [2024-10-26 01:45:38,992 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-26 01:45:38,992 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2024-10-26 01:45:38,992 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-26 01:45:38,993 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-10-26 01:45:38,993 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-10-26 01:45:38,993 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-26 01:45:38,993 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-26 01:45:38,993 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2024-10-26 01:45:38,993 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-10-26 01:45:38,994 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-26 01:45:38,995 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-26 01:45:38,996 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-10-26 01:45:39,256 INFO L238 CfgBuilder]: Building ICFG [2024-10-26 01:45:39,258 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-26 01:45:40,669 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-10-26 01:45:40,670 INFO L287 CfgBuilder]: Performing block encoding [2024-10-26 01:45:40,718 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-26 01:45:40,719 INFO L314 CfgBuilder]: Removed 4 assume(true) statements. [2024-10-26 01:45:40,719 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 01:45:40 BoogieIcfgContainer [2024-10-26 01:45:40,720 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-26 01:45:40,721 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-26 01:45:40,722 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-26 01:45:40,725 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-26 01:45:40,725 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.10 01:45:37" (1/3) ... [2024-10-26 01:45:40,726 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7eb2ca66 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.10 01:45:40, skipping insertion in model container [2024-10-26 01:45:40,726 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 01:45:38" (2/3) ... [2024-10-26 01:45:40,726 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7eb2ca66 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.10 01:45:40, skipping insertion in model container [2024-10-26 01:45:40,726 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 01:45:40" (3/3) ... [2024-10-26 01:45:40,730 INFO L112 eAbstractionObserver]: Analyzing ICFG divinefifo-bug_1w1r.i [2024-10-26 01:45:40,746 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-26 01:45:40,746 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 98 error locations. [2024-10-26 01:45:40,746 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-10-26 01:45:40,977 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2024-10-26 01:45:41,054 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-26 01:45:41,055 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-10-26 01:45:41,055 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-26 01:45:41,057 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-10-26 01:45:41,059 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2024-10-26 01:45:41,095 INFO L157 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-10-26 01:45:41,106 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == pusherThread1of1ForFork0 ======== [2024-10-26 01:45:41,113 INFO L333 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, 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;@6bf411e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-26 01:45:41,113 INFO L334 AbstractCegarLoop]: Starting to check reachability of 15 error locations. [2024-10-26 01:45:41,851 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting pusherErr0ASSERT_VIOLATIONDATA_RACE === [pusherErr0ASSERT_VIOLATIONDATA_RACE, pusherErr1ASSERT_VIOLATIONDATA_RACE, pusherErr2ASSERT_VIOLATIONDATA_RACE, pusherErr6ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2024-10-26 01:45:41,856 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-26 01:45:41,857 INFO L85 PathProgramCache]: Analyzing trace with hash -264673479, now seen corresponding path program 1 times [2024-10-26 01:45:41,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-26 01:45:41,866 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [66377113] [2024-10-26 01:45:41,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 01:45:41,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-26 01:45:42,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 01:45:42,311 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-26 01:45:42,315 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-26 01:45:42,316 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [66377113] [2024-10-26 01:45:42,316 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [66377113] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-26 01:45:42,317 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-26 01:45:42,317 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-26 01:45:42,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1099615043] [2024-10-26 01:45:42,322 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-26 01:45:42,328 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-26 01:45:42,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-26 01:45:42,349 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-26 01:45:42,350 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-26 01:45:42,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-26 01:45:42,360 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-26 01:45:42,361 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 77.5) internal successors, (155), 2 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-26 01:45:42,361 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-26 01:45:42,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-26 01:45:42,420 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-26 01:45:42,421 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting pusherErr0ASSERT_VIOLATIONDATA_RACE === [pusherErr0ASSERT_VIOLATIONDATA_RACE, pusherErr1ASSERT_VIOLATIONDATA_RACE, pusherErr2ASSERT_VIOLATIONDATA_RACE, pusherErr6ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2024-10-26 01:45:42,421 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-26 01:45:42,421 INFO L85 PathProgramCache]: Analyzing trace with hash 999957958, now seen corresponding path program 1 times [2024-10-26 01:45:42,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-26 01:45:42,422 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1943821298] [2024-10-26 01:45:42,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 01:45:42,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-26 01:45:42,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 01:45:43,718 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-26 01:45:43,720 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-26 01:45:43,720 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1943821298] [2024-10-26 01:45:43,721 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1943821298] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-26 01:45:43,721 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-26 01:45:43,721 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-26 01:45:43,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1666139291] [2024-10-26 01:45:43,721 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-26 01:45:43,724 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-26 01:45:43,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-26 01:45:43,727 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-26 01:45:43,728 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-26 01:45:43,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-26 01:45:43,731 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-26 01:45:43,731 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 30.4) internal successors, (152), 6 states have internal predecessors, (152), 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) [2024-10-26 01:45:43,732 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-26 01:45:43,733 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-26 01:45:44,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-26 01:45:44,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 01:45:44,582 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-26 01:45:44,583 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting pusherErr1ASSERT_VIOLATIONDATA_RACE === [pusherErr0ASSERT_VIOLATIONDATA_RACE, pusherErr1ASSERT_VIOLATIONDATA_RACE, pusherErr2ASSERT_VIOLATIONDATA_RACE, pusherErr6ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2024-10-26 01:45:44,584 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-26 01:45:44,584 INFO L85 PathProgramCache]: Analyzing trace with hash 1749717770, now seen corresponding path program 1 times [2024-10-26 01:45:44,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-26 01:45:44,584 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2130923339] [2024-10-26 01:45:44,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 01:45:44,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-26 01:45:44,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 01:45:45,398 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-26 01:45:45,399 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-26 01:45:45,399 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2130923339] [2024-10-26 01:45:45,400 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2130923339] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-26 01:45:45,400 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-26 01:45:45,401 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-26 01:45:45,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [884115956] [2024-10-26 01:45:45,402 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-26 01:45:45,402 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-26 01:45:45,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-26 01:45:45,403 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-26 01:45:45,405 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-26 01:45:45,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-26 01:45:45,407 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-26 01:45:45,408 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 31.6) internal successors, (158), 6 states have internal predecessors, (158), 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) [2024-10-26 01:45:45,408 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-26 01:45:45,408 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 01:45:45,409 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-26 01:45:46,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-26 01:45:46,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 01:45:46,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 01:45:46,307 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-26 01:45:46,307 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting pusherErr3ASSERT_VIOLATIONDATA_RACE === [pusherErr0ASSERT_VIOLATIONDATA_RACE, pusherErr1ASSERT_VIOLATIONDATA_RACE, pusherErr2ASSERT_VIOLATIONDATA_RACE, pusherErr6ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2024-10-26 01:45:46,307 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-26 01:45:46,308 INFO L85 PathProgramCache]: Analyzing trace with hash 1536855135, now seen corresponding path program 1 times [2024-10-26 01:45:46,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-26 01:45:46,308 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1071761951] [2024-10-26 01:45:46,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 01:45:46,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-26 01:45:46,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 01:45:47,063 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-26 01:45:47,063 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-26 01:45:47,063 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1071761951] [2024-10-26 01:45:47,063 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1071761951] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-26 01:45:47,064 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-26 01:45:47,064 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-26 01:45:47,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [222268165] [2024-10-26 01:45:47,064 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-26 01:45:47,065 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-26 01:45:47,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-26 01:45:47,066 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-26 01:45:47,066 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-26 01:45:47,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-26 01:45:47,069 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-26 01:45:47,069 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 36.0) internal successors, (180), 6 states have internal predecessors, (180), 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) [2024-10-26 01:45:47,069 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-26 01:45:47,070 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 01:45:47,070 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 01:45:47,070 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-26 01:45:47,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-26 01:45:47,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 01:45:47,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 01:45:47,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 01:45:47,459 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-26 01:45:47,460 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting pusherErr4ASSERT_VIOLATIONDATA_RACE === [pusherErr0ASSERT_VIOLATIONDATA_RACE, pusherErr1ASSERT_VIOLATIONDATA_RACE, pusherErr2ASSERT_VIOLATIONDATA_RACE, pusherErr6ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2024-10-26 01:45:47,460 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-26 01:45:47,460 INFO L85 PathProgramCache]: Analyzing trace with hash -1847521710, now seen corresponding path program 1 times [2024-10-26 01:45:47,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-26 01:45:47,460 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [775317443] [2024-10-26 01:45:47,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 01:45:47,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-26 01:45:47,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 01:45:48,105 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-26 01:45:48,106 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-26 01:45:48,106 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [775317443] [2024-10-26 01:45:48,106 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [775317443] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-26 01:45:48,106 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-26 01:45:48,106 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-26 01:45:48,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1184369938] [2024-10-26 01:45:48,107 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-26 01:45:48,107 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-26 01:45:48,107 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-26 01:45:48,108 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-26 01:45:48,110 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-26 01:45:48,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-26 01:45:48,113 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-26 01:45:48,113 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 37.4) internal successors, (187), 6 states have internal predecessors, (187), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-26 01:45:48,114 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-26 01:45:48,114 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 01:45:48,114 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 01:45:48,114 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 01:45:48,114 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-26 01:45:48,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-26 01:45:48,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 01:45:48,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 01:45:48,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 01:45:48,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 01:45:48,569 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-26 01:45:48,569 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting pusherErr5ASSERT_VIOLATIONDATA_RACE === [pusherErr0ASSERT_VIOLATIONDATA_RACE, pusherErr1ASSERT_VIOLATIONDATA_RACE, pusherErr2ASSERT_VIOLATIONDATA_RACE, pusherErr6ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2024-10-26 01:45:48,569 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-26 01:45:48,569 INFO L85 PathProgramCache]: Analyzing trace with hash 654113969, now seen corresponding path program 1 times [2024-10-26 01:45:48,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-26 01:45:48,570 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [224292910] [2024-10-26 01:45:48,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 01:45:48,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-26 01:45:48,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 01:45:49,277 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-26 01:45:49,278 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-26 01:45:49,278 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [224292910] [2024-10-26 01:45:49,278 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [224292910] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-26 01:45:49,279 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-26 01:45:49,279 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-26 01:45:49,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [3820627] [2024-10-26 01:45:49,279 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-26 01:45:49,280 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-26 01:45:49,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-26 01:45:49,280 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-26 01:45:49,281 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-26 01:45:49,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-26 01:45:49,283 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-26 01:45:49,284 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 39.2) internal successors, (196), 6 states have internal predecessors, (196), 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) [2024-10-26 01:45:49,284 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-26 01:45:49,284 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 01:45:49,284 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 01:45:49,284 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 01:45:49,285 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 01:45:49,285 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-26 01:45:49,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-26 01:45:49,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 01:45:49,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 01:45:49,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 01:45:49,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 01:45:49,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 01:45:49,947 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-26 01:45:49,948 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting pusherErr7ASSERT_VIOLATIONDATA_RACE === [pusherErr0ASSERT_VIOLATIONDATA_RACE, pusherErr1ASSERT_VIOLATIONDATA_RACE, pusherErr2ASSERT_VIOLATIONDATA_RACE, pusherErr6ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2024-10-26 01:45:49,948 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-26 01:45:49,948 INFO L85 PathProgramCache]: Analyzing trace with hash 455415934, now seen corresponding path program 1 times [2024-10-26 01:45:49,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-26 01:45:49,949 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1920021482] [2024-10-26 01:45:49,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 01:45:49,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-26 01:45:49,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 01:45:50,600 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-26 01:45:50,601 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-26 01:45:50,601 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1920021482] [2024-10-26 01:45:50,601 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1920021482] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-26 01:45:50,602 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-26 01:45:50,602 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-26 01:45:50,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1373461082] [2024-10-26 01:45:50,602 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-26 01:45:50,603 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-26 01:45:50,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-26 01:45:50,604 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-26 01:45:50,604 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-26 01:45:50,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-26 01:45:50,606 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-26 01:45:50,607 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 41.6) internal successors, (208), 6 states have internal predecessors, (208), 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) [2024-10-26 01:45:50,607 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-26 01:45:50,607 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 01:45:50,607 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 01:45:50,607 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 01:45:50,608 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 01:45:50,608 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 01:45:50,608 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-26 01:45:51,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-26 01:45:51,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 01:45:51,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 01:45:51,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 01:45:51,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 01:45:51,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 01:45:51,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 01:45:51,250 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-26 01:45:51,250 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting pusherErr8ASSERT_VIOLATIONDATA_RACE === [pusherErr0ASSERT_VIOLATIONDATA_RACE, pusherErr1ASSERT_VIOLATIONDATA_RACE, pusherErr2ASSERT_VIOLATIONDATA_RACE, pusherErr6ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2024-10-26 01:45:51,251 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-26 01:45:51,251 INFO L85 PathProgramCache]: Analyzing trace with hash -1261922409, now seen corresponding path program 1 times [2024-10-26 01:45:51,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-26 01:45:51,251 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1819905670] [2024-10-26 01:45:51,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 01:45:51,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-26 01:45:51,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 01:45:52,051 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-26 01:45:52,051 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-26 01:45:52,052 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1819905670] [2024-10-26 01:45:52,052 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1819905670] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-26 01:45:52,052 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-26 01:45:52,052 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-26 01:45:52,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [906542287] [2024-10-26 01:45:52,053 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-26 01:45:52,053 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-26 01:45:52,053 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-26 01:45:52,054 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-26 01:45:52,054 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-26 01:45:52,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-26 01:45:52,057 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-26 01:45:52,058 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 43.0) internal successors, (215), 6 states have internal predecessors, (215), 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) [2024-10-26 01:45:52,058 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-26 01:45:52,058 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 01:45:52,058 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 01:45:52,059 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 01:45:52,059 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 01:45:52,059 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 01:45:52,059 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 01:45:52,059 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-26 01:45:52,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-26 01:45:52,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 01:45:52,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 01:45:52,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 01:45:52,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 01:45:52,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 01:45:52,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 01:45:52,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 01:45:52,944 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-26 01:45:52,944 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting pusherErr10ASSERT_VIOLATIONDATA_RACE === [pusherErr0ASSERT_VIOLATIONDATA_RACE, pusherErr1ASSERT_VIOLATIONDATA_RACE, pusherErr2ASSERT_VIOLATIONDATA_RACE, pusherErr6ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2024-10-26 01:45:52,944 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-26 01:45:52,945 INFO L85 PathProgramCache]: Analyzing trace with hash 1035200137, now seen corresponding path program 1 times [2024-10-26 01:45:52,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-26 01:45:52,945 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [301592200] [2024-10-26 01:45:52,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 01:45:52,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-26 01:45:53,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 01:45:53,574 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-26 01:45:53,574 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-26 01:45:53,575 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [301592200] [2024-10-26 01:45:53,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [301592200] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-26 01:45:53,575 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-26 01:45:53,575 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-26 01:45:53,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2039225726] [2024-10-26 01:45:53,575 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-26 01:45:53,576 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-26 01:45:53,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-26 01:45:53,577 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-26 01:45:53,577 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-26 01:45:53,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-26 01:45:53,580 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-26 01:45:53,580 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 46.2) internal successors, (231), 6 states have internal predecessors, (231), 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) [2024-10-26 01:45:53,580 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-26 01:45:53,580 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 01:45:53,580 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 01:45:53,580 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 01:45:53,581 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 01:45:53,581 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 01:45:53,581 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 01:45:53,581 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 01:45:53,581 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-26 01:45:54,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-26 01:45:54,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 01:45:54,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 01:45:54,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 01:45:54,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 01:45:54,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 01:45:54,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 01:45:54,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 01:45:54,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 01:45:54,676 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-26 01:45:54,677 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting pusherErr13ASSERT_VIOLATIONDATA_RACE === [pusherErr0ASSERT_VIOLATIONDATA_RACE, pusherErr1ASSERT_VIOLATIONDATA_RACE, pusherErr2ASSERT_VIOLATIONDATA_RACE, pusherErr6ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2024-10-26 01:45:54,677 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-26 01:45:54,677 INFO L85 PathProgramCache]: Analyzing trace with hash 1948571385, now seen corresponding path program 1 times [2024-10-26 01:45:54,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-26 01:45:54,677 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1225043886] [2024-10-26 01:45:54,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 01:45:54,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-26 01:45:54,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 01:45:55,437 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-26 01:45:55,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-26 01:45:55,438 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1225043886] [2024-10-26 01:45:55,440 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1225043886] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-26 01:45:55,440 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-26 01:45:55,440 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-26 01:45:55,440 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2034438156] [2024-10-26 01:45:55,440 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-26 01:45:55,441 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-26 01:45:55,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-26 01:45:55,441 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-26 01:45:55,442 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-26 01:45:55,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-26 01:45:55,446 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-26 01:45:55,446 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 51.0) internal successors, (255), 6 states have internal predecessors, (255), 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) [2024-10-26 01:45:55,447 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-26 01:45:55,447 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 01:45:55,447 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 01:45:55,447 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 01:45:55,447 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 01:45:55,447 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 01:45:55,447 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 01:45:55,447 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 01:45:55,448 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 01:45:55,448 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-26 01:45:56,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-26 01:45:56,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 01:45:56,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 01:45:56,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 01:45:56,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 01:45:56,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 01:45:56,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 01:45:56,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 01:45:56,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 01:45:56,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 01:45:56,121 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-26 01:45:56,121 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting pusherErr14ASSERT_VIOLATIONDATA_RACE === [pusherErr0ASSERT_VIOLATIONDATA_RACE, pusherErr1ASSERT_VIOLATIONDATA_RACE, pusherErr2ASSERT_VIOLATIONDATA_RACE, pusherErr6ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2024-10-26 01:45:56,122 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-26 01:45:56,122 INFO L85 PathProgramCache]: Analyzing trace with hash 1266459692, now seen corresponding path program 1 times [2024-10-26 01:45:56,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-26 01:45:56,122 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1582571672] [2024-10-26 01:45:56,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 01:45:56,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-26 01:45:56,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 01:45:57,018 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-26 01:45:57,018 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-26 01:45:57,018 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1582571672] [2024-10-26 01:45:57,018 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1582571672] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-26 01:45:57,018 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-26 01:45:57,018 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-26 01:45:57,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [770887226] [2024-10-26 01:45:57,019 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-26 01:45:57,019 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-26 01:45:57,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-26 01:45:57,020 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-26 01:45:57,020 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-26 01:45:57,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-26 01:45:57,021 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-26 01:45:57,022 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 52.8) internal successors, (264), 6 states have internal predecessors, (264), 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) [2024-10-26 01:45:57,022 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-26 01:45:57,022 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 01:45:57,022 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 01:45:57,022 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 01:45:57,022 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 01:45:57,022 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 01:45:57,022 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 01:45:57,022 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 01:45:57,022 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 01:45:57,022 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 01:45:57,023 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-26 01:45:57,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-26 01:45:57,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 01:45:57,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 01:45:57,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 01:45:57,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 01:45:57,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 01:45:57,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 01:45:57,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 01:45:57,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 01:45:57,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 01:45:57,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 01:45:57,691 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-26 01:45:57,691 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting pusherErr14ASSERT_VIOLATIONDATA_RACE === [pusherErr0ASSERT_VIOLATIONDATA_RACE, pusherErr1ASSERT_VIOLATIONDATA_RACE, pusherErr2ASSERT_VIOLATIONDATA_RACE, pusherErr6ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2024-10-26 01:45:57,691 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-26 01:45:57,691 INFO L85 PathProgramCache]: Analyzing trace with hash 662423835, now seen corresponding path program 1 times [2024-10-26 01:45:57,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-26 01:45:57,692 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [872116631] [2024-10-26 01:45:57,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 01:45:57,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-26 01:45:57,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 01:45:59,826 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-26 01:45:59,826 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-26 01:45:59,826 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [872116631] [2024-10-26 01:45:59,827 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [872116631] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-26 01:45:59,827 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-26 01:45:59,827 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2024-10-26 01:45:59,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [343007219] [2024-10-26 01:45:59,827 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-26 01:45:59,828 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-10-26 01:45:59,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-26 01:45:59,829 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-10-26 01:45:59,829 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=217, Unknown=0, NotChecked=0, Total=272 [2024-10-26 01:45:59,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-26 01:45:59,831 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-26 01:45:59,831 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 17.5625) internal successors, (281), 17 states have internal predecessors, (281), 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) [2024-10-26 01:45:59,831 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-26 01:45:59,831 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 01:45:59,831 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 01:45:59,831 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 01:45:59,832 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 01:45:59,832 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 01:45:59,832 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 01:45:59,832 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 01:45:59,832 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 01:45:59,832 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 01:45:59,832 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 01:45:59,832 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-26 01:46:05,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-26 01:46:05,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 01:46:05,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 01:46:05,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 01:46:05,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 01:46:05,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 01:46:05,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 01:46:05,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 01:46:05,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 01:46:05,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 01:46:05,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 01:46:05,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-26 01:46:05,371 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-26 01:46:05,371 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting pusherErr14ASSERT_VIOLATIONDATA_RACE === [pusherErr0ASSERT_VIOLATIONDATA_RACE, pusherErr1ASSERT_VIOLATIONDATA_RACE, pusherErr2ASSERT_VIOLATIONDATA_RACE, pusherErr6ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2024-10-26 01:46:05,371 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-26 01:46:05,371 INFO L85 PathProgramCache]: Analyzing trace with hash 1224965384, now seen corresponding path program 1 times [2024-10-26 01:46:05,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-26 01:46:05,371 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1659989473] [2024-10-26 01:46:05,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 01:46:05,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-26 01:46:05,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 01:46:07,869 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 0 proven. 124 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-26 01:46:07,870 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-26 01:46:07,870 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1659989473] [2024-10-26 01:46:07,870 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1659989473] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-26 01:46:07,870 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1384366883] [2024-10-26 01:46:07,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 01:46:07,870 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-26 01:46:07,870 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-26 01:46:07,871 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-26 01:46:07,872 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-26 01:46:08,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 01:46:08,308 INFO L255 TraceCheckSpWp]: Trace formula consists of 1613 conjuncts, 44 conjuncts are in the unsatisfiable core [2024-10-26 01:46:08,335 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-26 01:46:09,305 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 [2024-10-26 01:46:09,349 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 22 [2024-10-26 01:46:09,387 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 32 treesize of output 34 [2024-10-26 01:46:09,428 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 41 treesize of output 46 [2024-10-26 01:46:09,481 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 01:46:09,483 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 01:46:09,484 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 01:46:09,485 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 01:46:09,487 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 01:46:09,487 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 50 treesize of output 58 [2024-10-26 01:46:09,556 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 0 proven. 124 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-26 01:46:09,556 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-26 01:46:12,648 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 0 proven. 124 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-26 01:46:12,648 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1384366883] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-26 01:46:12,648 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-26 01:46:12,648 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 15] total 45 [2024-10-26 01:46:12,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1578972122] [2024-10-26 01:46:12,648 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-26 01:46:12,650 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2024-10-26 01:46:12,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-26 01:46:12,652 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2024-10-26 01:46:12,652 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=194, Invalid=1876, Unknown=0, NotChecked=0, Total=2070 [2024-10-26 01:46:12,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-26 01:46:12,654 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-26 01:46:12,655 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 45 states have (on average 24.11111111111111) internal successors, (1085), 46 states have internal predecessors, (1085), 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) [2024-10-26 01:46:12,655 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-26 01:46:12,656 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 01:46:12,656 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 01:46:12,656 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 01:46:12,656 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 01:46:12,656 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 01:46:12,656 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 01:46:12,656 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 01:46:12,656 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 01:46:12,656 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 01:46:12,657 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 01:46:12,657 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 16 states. [2024-10-26 01:46:12,657 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-26 01:46:21,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-26 01:46:21,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 01:46:21,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 01:46:21,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 01:46:21,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 01:46:21,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 01:46:21,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 01:46:21,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 01:46:21,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 01:46:21,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 01:46:21,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 01:46:21,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-26 01:46:21,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-10-26 01:46:21,557 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-26 01:46:21,742 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2024-10-26 01:46:21,743 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting pusherErr14ASSERT_VIOLATIONDATA_RACE === [pusherErr0ASSERT_VIOLATIONDATA_RACE, pusherErr1ASSERT_VIOLATIONDATA_RACE, pusherErr2ASSERT_VIOLATIONDATA_RACE, pusherErr6ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2024-10-26 01:46:21,743 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-26 01:46:21,744 INFO L85 PathProgramCache]: Analyzing trace with hash 440612516, now seen corresponding path program 1 times [2024-10-26 01:46:21,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-26 01:46:21,744 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1782717457] [2024-10-26 01:46:21,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 01:46:21,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-26 01:46:28,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 01:46:45,512 INFO L134 CoverageAnalysis]: Checked inductivity of 1276 backedges. 564 proven. 25 refuted. 0 times theorem prover too weak. 687 trivial. 0 not checked. [2024-10-26 01:46:45,513 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-26 01:46:45,513 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1782717457] [2024-10-26 01:46:45,513 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1782717457] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-26 01:46:45,513 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [713054617] [2024-10-26 01:46:45,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 01:46:45,514 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-26 01:46:45,514 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-26 01:46:45,515 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-26 01:46:45,516 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-26 01:46:46,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 01:46:46,323 INFO L255 TraceCheckSpWp]: Trace formula consists of 3248 conjuncts, 185 conjuncts are in the unsatisfiable core [2024-10-26 01:46:46,340 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-26 01:46:47,574 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 [2024-10-26 01:46:47,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 11 [2024-10-26 01:46:47,750 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2024-10-26 01:46:48,080 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 01:46:48,081 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 7 [2024-10-26 01:46:48,403 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 [2024-10-26 01:46:48,412 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-10-26 01:46:49,030 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 [2024-10-26 01:46:49,049 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 01:46:49,051 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 25 treesize of output 13 [2024-10-26 01:46:49,219 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 01:46:49,220 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2024-10-26 01:46:49,230 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 [2024-10-26 01:46:49,346 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 [2024-10-26 01:46:49,356 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 01:46:49,356 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2024-10-26 01:46:50,176 INFO L349 Elim1Store]: treesize reduction 23, result has 4.2 percent of original size [2024-10-26 01:46:50,176 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 58 treesize of output 46 [2024-10-26 01:46:50,180 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 22 [2024-10-26 01:46:50,184 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 01:46:50,192 INFO L349 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2024-10-26 01:46:50,192 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 1 case distinctions, treesize of input 39 treesize of output 26 [2024-10-26 01:46:50,530 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 8 treesize of output 1 [2024-10-26 01:46:50,539 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 01:46:50,540 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 45 treesize of output 25 [2024-10-26 01:46:51,008 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 20 treesize of output 8 [2024-10-26 01:46:51,154 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 01:46:51,163 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-10-26 01:46:51,163 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 27 [2024-10-26 01:46:51,174 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 [2024-10-26 01:46:51,365 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-10-26 01:46:51,373 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 01:46:51,374 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 26 [2024-10-26 01:46:51,901 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 01:46:51,902 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 10 [2024-10-26 01:46:51,992 INFO L134 CoverageAnalysis]: Checked inductivity of 1276 backedges. 804 proven. 463 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-10-26 01:46:51,992 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-26 01:46:52,375 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 130 treesize of output 124 [2024-10-26 01:46:52,650 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse7 (+ |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| 4)) (.cse5 (+ |c_pusherThread1of1ForFork0_~q~0#1.offset| 4))) (let ((.cse1 (forall ((v_ArrVal_5123 (Array Int Int)) (v_arrayElimCell_36 Int)) (let ((.cse10 (store |c_#memory_$Pointer$.offset| |c_pusherThread1of1ForFork0_fifo_push_#t~mem38#1.base| v_ArrVal_5123))) (let ((.cse11 (select (select .cse10 |c_pusherThread1of1ForFork0_~q~0#1.base|) .cse5))) (<= (select (select (store .cse10 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| (store (select .cse10 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse7 |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.offset|)) v_arrayElimCell_36) (+ .cse11 12)) (+ .cse11 11)))))) (.cse6 (+ 12 |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.offset|)) (.cse8 (= |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| |c_pusherThread1of1ForFork0_~q~0#1.offset|)) (.cse0 (= |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| |c_pusherThread1of1ForFork0_~q~0#1.base|))) (and (or .cse0 .cse1) (forall ((v_ArrVal_5123 (Array Int Int))) (let ((.cse4 (store |c_#memory_$Pointer$.offset| |c_pusherThread1of1ForFork0_fifo_push_#t~mem38#1.base| v_ArrVal_5123))) (let ((.cse2 (store .cse4 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| (store (select .cse4 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse7 |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.offset|)))) (or (forall ((v_arrayElimCell_36 Int)) (let ((.cse3 (select (select .cse4 |c_pusherThread1of1ForFork0_~q~0#1.base|) .cse5))) (<= (select (select .cse2 v_arrayElimCell_36) (+ .cse3 12)) (+ .cse3 11)))) (< (select (select .cse2 |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.base|) .cse6) .cse6))))) (or .cse1 .cse8) (or (forall ((v_ArrVal_5123 (Array Int Int))) (< (select (select (let ((.cse9 (store |c_#memory_$Pointer$.offset| |c_pusherThread1of1ForFork0_fifo_push_#t~mem38#1.base| v_ArrVal_5123))) (store .cse9 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| (store (select .cse9 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse7 |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.offset|))) |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.base|) .cse6) .cse6)) (not .cse8) (not .cse0))))) is different from false [2024-10-26 01:46:52,846 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| 4))) (let ((.cse10 (+ |c_pusherThread1of1ForFork0_~q~0#1.offset| 4)) (.cse4 (select (select |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse3))) (let ((.cse0 (= |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| |c_pusherThread1of1ForFork0_~q~0#1.base|)) (.cse5 (+ 12 |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.offset|)) (.cse6 (= |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| |c_pusherThread1of1ForFork0_~q~0#1.offset|)) (.cse1 (forall ((v_ArrVal_5123 (Array Int Int)) (v_arrayElimCell_36 Int)) (let ((.cse11 (store |c_#memory_$Pointer$.offset| .cse4 v_ArrVal_5123))) (let ((.cse12 (select (select .cse11 |c_pusherThread1of1ForFork0_~q~0#1.base|) .cse10))) (<= (select (select (store .cse11 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| (store (select .cse11 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse3 |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.offset|)) v_arrayElimCell_36) (+ .cse12 12)) (+ .cse12 11))))))) (and (or .cse0 .cse1) (or (forall ((v_ArrVal_5123 (Array Int Int))) (< (select (select (let ((.cse2 (store |c_#memory_$Pointer$.offset| .cse4 v_ArrVal_5123))) (store .cse2 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| (store (select .cse2 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse3 |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.offset|))) |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.base|) .cse5) .cse5)) (not .cse6) (not .cse0)) (forall ((v_ArrVal_5123 (Array Int Int))) (let ((.cse9 (store |c_#memory_$Pointer$.offset| .cse4 v_ArrVal_5123))) (let ((.cse7 (store .cse9 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| (store (select .cse9 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse3 |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.offset|)))) (or (forall ((v_arrayElimCell_36 Int)) (let ((.cse8 (select (select .cse9 |c_pusherThread1of1ForFork0_~q~0#1.base|) .cse10))) (<= (select (select .cse7 v_arrayElimCell_36) (+ .cse8 12)) (+ .cse8 11)))) (< (select (select .cse7 |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.base|) .cse5) .cse5))))) (or .cse6 .cse1))))) is different from false [2024-10-26 01:46:53,992 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse5 (+ 12 |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.offset|))) (let ((.cse7 (store |c_#memory_$Pointer$.offset| |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.base|) .cse5 (+ |c_pusherThread1of1ForFork0_fifo_push_#t~mem34#1.offset| 4)))) (.cse6 (+ |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| 4))) (let ((.cse0 (= (select (select .cse7 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse6) |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.offset|)) (.cse4 (+ |c_pusherThread1of1ForFork0_~q~0#1.offset| 4))) (let ((.cse9 (= |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| |c_pusherThread1of1ForFork0_~q~0#1.offset|)) (.cse13 (= |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| |c_pusherThread1of1ForFork0_~q~0#1.base|)) (.cse8 (and (or .cse0 (forall ((v_ArrVal_5121 (Array Int Int)) (v_ArrVal_5123 (Array Int Int)) (v_arrayElimCell_36 Int)) (let ((.cse18 (store .cse7 (select (select (store |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.base| v_ArrVal_5121) |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse6) v_ArrVal_5123))) (let ((.cse19 (+ (select (select .cse18 |c_pusherThread1of1ForFork0_~q~0#1.base|) .cse4) 12))) (< (select (select (store .cse18 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| (store (select .cse18 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse6 |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.offset|)) v_arrayElimCell_36) .cse19) .cse19))))) (forall ((v_ArrVal_5121 (Array Int Int)) (v_ArrVal_5123 (Array Int Int)) (v_arrayElimCell_36 Int)) (let ((.cse22 (select (select (store |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.base| v_ArrVal_5121) |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse6))) (or (let ((.cse20 (store .cse7 .cse22 v_ArrVal_5123))) (let ((.cse21 (+ (select (select .cse20 |c_pusherThread1of1ForFork0_~q~0#1.base|) .cse4) 12))) (< (select (select (store .cse20 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| (store (select .cse20 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse6 |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.offset|)) v_arrayElimCell_36) .cse21) .cse21))) (= |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.base| .cse22))))))) (and (or .cse0 (forall ((v_ArrVal_5121 (Array Int Int)) (v_ArrVal_5123 (Array Int Int)) (v_arrayElimCell_36 Int)) (let ((.cse3 (store .cse7 (select (select (store |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.base| v_ArrVal_5121) |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse6) v_ArrVal_5123))) (let ((.cse1 (store .cse3 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| (store (select .cse3 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse6 |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.offset|)))) (or (let ((.cse2 (+ (select (select .cse3 |c_pusherThread1of1ForFork0_~q~0#1.base|) .cse4) 12))) (< (select (select .cse1 v_arrayElimCell_36) .cse2) .cse2)) (< (select (select .cse1 |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.base|) .cse5) .cse5)))))) (or .cse8 .cse9) (or (and (or (forall ((v_ArrVal_5121 (Array Int Int)) (v_ArrVal_5123 (Array Int Int))) (< (select (select (let ((.cse10 (store .cse7 (select (select (store |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.base| v_ArrVal_5121) |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse6) v_ArrVal_5123))) (store .cse10 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| (store (select .cse10 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse6 |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.offset|))) |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.base|) .cse5) .cse5)) .cse0) (forall ((v_ArrVal_5121 (Array Int Int)) (v_ArrVal_5123 (Array Int Int))) (let ((.cse12 (select (select (store |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.base| v_ArrVal_5121) |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse6))) (or (< (select (select (let ((.cse11 (store .cse7 .cse12 v_ArrVal_5123))) (store .cse11 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| (store (select .cse11 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse6 |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.offset|))) |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.base|) .cse5) .cse5) (= |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.base| .cse12))))) (not .cse9) (not .cse13)) (forall ((v_ArrVal_5121 (Array Int Int)) (v_ArrVal_5123 (Array Int Int)) (v_arrayElimCell_36 Int)) (let ((.cse17 (select (select (store |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.base| v_ArrVal_5121) |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse6))) (let ((.cse16 (store .cse7 .cse17 v_ArrVal_5123))) (let ((.cse14 (store .cse16 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| (store (select .cse16 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse6 |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.offset|)))) (or (let ((.cse15 (+ (select (select .cse16 |c_pusherThread1of1ForFork0_~q~0#1.base|) .cse4) 12))) (< (select (select .cse14 v_arrayElimCell_36) .cse15) .cse15)) (< (select (select .cse14 |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.base|) .cse5) .cse5) (= |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.base| .cse17)))))) (or .cse13 .cse8)))))) is different from false [2024-10-26 01:47:05,259 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_$Pointer$.offset| |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.base|)) (.cse4 (+ 12 |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.offset|))) (let ((.cse5 (select .cse3 .cse4)) (.cse13 (+ |c_pusherThread1of1ForFork0_~q~0#1.offset| 4)) (.cse2 (+ |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| 4))) (let ((.cse0 (= (select (select |c_#memory_$Pointer$.offset| |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse2) |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.offset|)) (.cse8 (= |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| |c_pusherThread1of1ForFork0_~q~0#1.offset|)) (.cse9 (= |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| |c_pusherThread1of1ForFork0_~q~0#1.base|)) (.cse14 (and (forall ((|v_pusherThread1of1ForFork0_fifo_push_#t~mem34#1.offset_28| Int)) (or (< .cse5 |v_pusherThread1of1ForFork0_fifo_push_#t~mem34#1.offset_28|) (forall ((v_ArrVal_5121 (Array Int Int)) (v_ArrVal_5123 (Array Int Int)) (v_arrayElimCell_36 Int)) (let ((.cse21 (select (select (store |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.base| v_ArrVal_5121) |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse2))) (or (let ((.cse19 (store (store |c_#memory_$Pointer$.offset| |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.base| (store .cse3 .cse4 (+ |v_pusherThread1of1ForFork0_fifo_push_#t~mem34#1.offset_28| 4))) .cse21 v_ArrVal_5123))) (let ((.cse20 (+ (select (select .cse19 |c_pusherThread1of1ForFork0_~q~0#1.base|) .cse13) 12))) (< (select (select (store .cse19 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| (store (select .cse19 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse2 |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.offset|)) v_arrayElimCell_36) .cse20) .cse20))) (= |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.base| .cse21)))))) (forall ((|v_pusherThread1of1ForFork0_fifo_push_#t~mem34#1.offset_28| Int)) (let ((.cse22 (store |c_#memory_$Pointer$.offset| |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.base| (store .cse3 .cse4 (+ |v_pusherThread1of1ForFork0_fifo_push_#t~mem34#1.offset_28| 4))))) (or (< .cse5 |v_pusherThread1of1ForFork0_fifo_push_#t~mem34#1.offset_28|) (= (select (select .cse22 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse2) |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.offset|) (forall ((v_ArrVal_5121 (Array Int Int)) (v_ArrVal_5123 (Array Int Int)) (v_arrayElimCell_36 Int)) (let ((.cse23 (store .cse22 (select (select (store |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.base| v_ArrVal_5121) |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse2) v_ArrVal_5123))) (let ((.cse24 (+ (select (select .cse23 |c_pusherThread1of1ForFork0_~q~0#1.base|) .cse13) 12))) (< (select (select (store .cse23 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| (store (select .cse23 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse2 |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.offset|)) v_arrayElimCell_36) .cse24) .cse24)))))))))) (and (or (and (or .cse0 (forall ((v_ArrVal_5121 (Array Int Int)) (v_ArrVal_5123 (Array Int Int)) (|v_pusherThread1of1ForFork0_fifo_push_#t~mem34#1.offset_28| Int)) (or (< (select (select (let ((.cse1 (store (store |c_#memory_$Pointer$.offset| |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.base| (store .cse3 .cse4 (+ |v_pusherThread1of1ForFork0_fifo_push_#t~mem34#1.offset_28| 4))) (select (select (store |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.base| v_ArrVal_5121) |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse2) v_ArrVal_5123))) (store .cse1 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| (store (select .cse1 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse2 |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.offset|))) |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.base|) .cse4) .cse4) (< .cse5 |v_pusherThread1of1ForFork0_fifo_push_#t~mem34#1.offset_28|)))) (forall ((|v_pusherThread1of1ForFork0_fifo_push_#t~mem34#1.offset_28| Int)) (or (< .cse5 |v_pusherThread1of1ForFork0_fifo_push_#t~mem34#1.offset_28|) (forall ((v_ArrVal_5121 (Array Int Int)) (v_ArrVal_5123 (Array Int Int))) (let ((.cse7 (select (select (store |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.base| v_ArrVal_5121) |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse2))) (or (< (select (select (let ((.cse6 (store (store |c_#memory_$Pointer$.offset| |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.base| (store .cse3 .cse4 (+ |v_pusherThread1of1ForFork0_fifo_push_#t~mem34#1.offset_28| 4))) .cse7 v_ArrVal_5123))) (store .cse6 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| (store (select .cse6 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse2 |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.offset|))) |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.base|) .cse4) .cse4) (= |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.base| .cse7))))))) (not .cse8) (not .cse9)) (or .cse0 (forall ((v_ArrVal_5121 (Array Int Int)) (v_ArrVal_5123 (Array Int Int)) (v_arrayElimCell_36 Int) (|v_pusherThread1of1ForFork0_fifo_push_#t~mem34#1.offset_28| Int)) (let ((.cse12 (store (store |c_#memory_$Pointer$.offset| |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.base| (store .cse3 .cse4 (+ |v_pusherThread1of1ForFork0_fifo_push_#t~mem34#1.offset_28| 4))) (select (select (store |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.base| v_ArrVal_5121) |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse2) v_ArrVal_5123))) (let ((.cse10 (store .cse12 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| (store (select .cse12 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse2 |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.offset|)))) (or (< (select (select .cse10 |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.base|) .cse4) .cse4) (< .cse5 |v_pusherThread1of1ForFork0_fifo_push_#t~mem34#1.offset_28|) (let ((.cse11 (+ (select (select .cse12 |c_pusherThread1of1ForFork0_~q~0#1.base|) .cse13) 12))) (< (select (select .cse10 v_arrayElimCell_36) .cse11) .cse11))))))) (or .cse14 .cse8) (forall ((|v_pusherThread1of1ForFork0_fifo_push_#t~mem34#1.offset_28| Int)) (or (forall ((v_ArrVal_5121 (Array Int Int)) (v_ArrVal_5123 (Array Int Int)) (v_arrayElimCell_36 Int)) (let ((.cse18 (select (select (store |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.base| v_ArrVal_5121) |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse2))) (let ((.cse17 (store (store |c_#memory_$Pointer$.offset| |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.base| (store .cse3 .cse4 (+ |v_pusherThread1of1ForFork0_fifo_push_#t~mem34#1.offset_28| 4))) .cse18 v_ArrVal_5123))) (let ((.cse15 (store .cse17 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| (store (select .cse17 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse2 |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.offset|)))) (or (< (select (select .cse15 |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.base|) .cse4) .cse4) (let ((.cse16 (+ (select (select .cse17 |c_pusherThread1of1ForFork0_~q~0#1.base|) .cse13) 12))) (< (select (select .cse15 v_arrayElimCell_36) .cse16) .cse16)) (= |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.base| .cse18)))))) (< .cse5 |v_pusherThread1of1ForFork0_fifo_push_#t~mem34#1.offset_28|))) (or .cse9 .cse14))))) is different from false [2024-10-26 01:47:12,059 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse5 (+ 12 |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.offset|))) (let ((.cse12 (select (select |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.base|) .cse5))) (let ((.cse3 (select (select |c_#memory_$Pointer$.offset| |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.base|) .cse5)) (.cse9 (+ |c_pusherThread1of1ForFork0_~q~0#1.offset| 4)) (.cse10 (+ |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| 4)) (.cse13 (select |c_#memory_$Pointer$.offset| .cse12))) (let ((.cse1 (and (forall ((|v_pusherThread1of1ForFork0_fifo_push_#t~mem32#1.offset_38| Int)) (or (forall ((v_ArrVal_5118 (Array Int Int)) (|v_pusherThread1of1ForFork0_fifo_push_#t~mem34#1.offset_28| Int) (v_ArrVal_5120 Int)) (let ((.cse31 (store |c_#memory_$Pointer$.offset| .cse12 (store .cse13 |v_pusherThread1of1ForFork0_fifo_push_#t~mem32#1.offset_38| v_ArrVal_5120)))) (let ((.cse30 (select .cse31 |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.base|))) (let ((.cse29 (store .cse31 |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.base| (store .cse30 .cse5 (+ |v_pusherThread1of1ForFork0_fifo_push_#t~mem34#1.offset_28| 4))))) (or (forall ((v_ArrVal_5121 (Array Int Int)) (v_ArrVal_5123 (Array Int Int)) (v_arrayElimCell_36 Int)) (let ((.cse27 (store .cse29 (select (select (store (store |c_#memory_$Pointer$.base| .cse12 v_ArrVal_5118) |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.base| v_ArrVal_5121) |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse10) v_ArrVal_5123))) (let ((.cse28 (+ (select (select .cse27 |c_pusherThread1of1ForFork0_~q~0#1.base|) .cse9) 12))) (< (select (select (store .cse27 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| (store (select .cse27 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse10 |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.offset|)) v_arrayElimCell_36) .cse28) .cse28)))) (< (select .cse30 .cse5) |v_pusherThread1of1ForFork0_fifo_push_#t~mem34#1.offset_28|) (= (select (select .cse29 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse10) |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.offset|)))))) (< .cse3 |v_pusherThread1of1ForFork0_fifo_push_#t~mem32#1.offset_38|))) (forall ((|v_pusherThread1of1ForFork0_fifo_push_#t~mem32#1.offset_38| Int)) (or (< .cse3 |v_pusherThread1of1ForFork0_fifo_push_#t~mem32#1.offset_38|) (forall ((v_ArrVal_5118 (Array Int Int)) (|v_pusherThread1of1ForFork0_fifo_push_#t~mem34#1.offset_28| Int) (v_ArrVal_5120 Int)) (let ((.cse36 (store |c_#memory_$Pointer$.offset| .cse12 (store .cse13 |v_pusherThread1of1ForFork0_fifo_push_#t~mem32#1.offset_38| v_ArrVal_5120)))) (let ((.cse32 (select .cse36 |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.base|))) (or (< (select .cse32 .cse5) |v_pusherThread1of1ForFork0_fifo_push_#t~mem34#1.offset_28|) (forall ((v_ArrVal_5121 (Array Int Int)) (v_ArrVal_5123 (Array Int Int)) (v_arrayElimCell_36 Int)) (let ((.cse33 (select (select (store (store |c_#memory_$Pointer$.base| .cse12 v_ArrVal_5118) |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.base| v_ArrVal_5121) |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse10))) (or (= |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.base| .cse33) (let ((.cse34 (store (store .cse36 |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.base| (store .cse32 .cse5 (+ |v_pusherThread1of1ForFork0_fifo_push_#t~mem34#1.offset_28| 4))) .cse33 v_ArrVal_5123))) (let ((.cse35 (+ (select (select .cse34 |c_pusherThread1of1ForFork0_~q~0#1.base|) .cse9) 12))) (< (select (select (store .cse34 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| (store (select .cse34 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse10 |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.offset|)) v_arrayElimCell_36) .cse35) .cse35)))))))))))))) (.cse0 (= |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| |c_pusherThread1of1ForFork0_~q~0#1.offset|)) (.cse2 (= |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| |c_pusherThread1of1ForFork0_~q~0#1.base|))) (and (or .cse0 .cse1) (or .cse2 .cse1) (forall ((|v_pusherThread1of1ForFork0_fifo_push_#t~mem32#1.offset_38| Int)) (or (< .cse3 |v_pusherThread1of1ForFork0_fifo_push_#t~mem32#1.offset_38|) (forall ((v_ArrVal_5118 (Array Int Int)) (v_ArrVal_5120 Int)) (let ((.cse11 (store |c_#memory_$Pointer$.offset| .cse12 (store .cse13 |v_pusherThread1of1ForFork0_fifo_push_#t~mem32#1.offset_38| v_ArrVal_5120)))) (or (forall ((v_ArrVal_5121 (Array Int Int)) (v_ArrVal_5123 (Array Int Int)) (v_arrayElimCell_36 Int) (|v_pusherThread1of1ForFork0_fifo_push_#t~mem34#1.offset_28| Int)) (let ((.cse4 (select .cse11 |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.base|))) (let ((.cse8 (store (store .cse11 |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.base| (store .cse4 .cse5 (+ |v_pusherThread1of1ForFork0_fifo_push_#t~mem34#1.offset_28| 4))) (select (select (store (store |c_#memory_$Pointer$.base| .cse12 v_ArrVal_5118) |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.base| v_ArrVal_5121) |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse10) v_ArrVal_5123))) (let ((.cse6 (store .cse8 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| (store (select .cse8 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse10 |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.offset|)))) (or (< (select .cse4 .cse5) |v_pusherThread1of1ForFork0_fifo_push_#t~mem34#1.offset_28|) (let ((.cse7 (+ (select (select .cse8 |c_pusherThread1of1ForFork0_~q~0#1.base|) .cse9) 12))) (< (select (select .cse6 v_arrayElimCell_36) .cse7) .cse7)) (< (select (select .cse6 |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.base|) .cse5) .cse5)))))) (= (select (select .cse11 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse10) |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.offset|)))))) (forall ((|v_pusherThread1of1ForFork0_fifo_push_#t~mem32#1.offset_38| Int)) (or (< .cse3 |v_pusherThread1of1ForFork0_fifo_push_#t~mem32#1.offset_38|) (forall ((v_ArrVal_5118 (Array Int Int)) (|v_pusherThread1of1ForFork0_fifo_push_#t~mem34#1.offset_28| Int) (v_ArrVal_5120 Int)) (let ((.cse19 (store |c_#memory_$Pointer$.offset| .cse12 (store .cse13 |v_pusherThread1of1ForFork0_fifo_push_#t~mem32#1.offset_38| v_ArrVal_5120)))) (let ((.cse14 (select .cse19 |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.base|))) (or (< (select .cse14 .cse5) |v_pusherThread1of1ForFork0_fifo_push_#t~mem34#1.offset_28|) (forall ((v_ArrVal_5121 (Array Int Int)) (v_ArrVal_5123 (Array Int Int)) (v_arrayElimCell_36 Int)) (let ((.cse15 (select (select (store (store |c_#memory_$Pointer$.base| .cse12 v_ArrVal_5118) |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.base| v_ArrVal_5121) |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse10))) (let ((.cse18 (store (store .cse19 |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.base| (store .cse14 .cse5 (+ |v_pusherThread1of1ForFork0_fifo_push_#t~mem34#1.offset_28| 4))) .cse15 v_ArrVal_5123))) (let ((.cse16 (store .cse18 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| (store (select .cse18 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse10 |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.offset|)))) (or (= |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.base| .cse15) (let ((.cse17 (+ (select (select .cse18 |c_pusherThread1of1ForFork0_~q~0#1.base|) .cse9) 12))) (< (select (select .cse16 v_arrayElimCell_36) .cse17) .cse17)) (< (select (select .cse16 |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.base|) .cse5) .cse5)))))))))))) (or (and (forall ((|v_pusherThread1of1ForFork0_fifo_push_#t~mem32#1.offset_38| Int)) (or (< .cse3 |v_pusherThread1of1ForFork0_fifo_push_#t~mem32#1.offset_38|) (forall ((v_ArrVal_5118 (Array Int Int)) (|v_pusherThread1of1ForFork0_fifo_push_#t~mem34#1.offset_28| Int) (v_ArrVal_5120 Int)) (let ((.cse23 (store |c_#memory_$Pointer$.offset| .cse12 (store .cse13 |v_pusherThread1of1ForFork0_fifo_push_#t~mem32#1.offset_38| v_ArrVal_5120)))) (let ((.cse20 (select .cse23 |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.base|))) (or (< (select .cse20 .cse5) |v_pusherThread1of1ForFork0_fifo_push_#t~mem34#1.offset_28|) (forall ((v_ArrVal_5121 (Array Int Int)) (v_ArrVal_5123 (Array Int Int))) (let ((.cse21 (select (select (store (store |c_#memory_$Pointer$.base| .cse12 v_ArrVal_5118) |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.base| v_ArrVal_5121) |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse10))) (or (= |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.base| .cse21) (< (select (select (let ((.cse22 (store (store .cse23 |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.base| (store .cse20 .cse5 (+ |v_pusherThread1of1ForFork0_fifo_push_#t~mem34#1.offset_28| 4))) .cse21 v_ArrVal_5123))) (store .cse22 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| (store (select .cse22 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse10 |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.offset|))) |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.base|) .cse5) .cse5)))))))))) (forall ((|v_pusherThread1of1ForFork0_fifo_push_#t~mem32#1.offset_38| Int)) (or (< .cse3 |v_pusherThread1of1ForFork0_fifo_push_#t~mem32#1.offset_38|) (forall ((v_ArrVal_5118 (Array Int Int)) (v_ArrVal_5120 Int)) (let ((.cse24 (store |c_#memory_$Pointer$.offset| .cse12 (store .cse13 |v_pusherThread1of1ForFork0_fifo_push_#t~mem32#1.offset_38| v_ArrVal_5120)))) (or (= (select (select .cse24 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse10) |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.offset|) (forall ((v_ArrVal_5121 (Array Int Int)) (v_ArrVal_5123 (Array Int Int)) (|v_pusherThread1of1ForFork0_fifo_push_#t~mem34#1.offset_28| Int)) (let ((.cse25 (select .cse24 |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.base|))) (or (< (select .cse25 .cse5) |v_pusherThread1of1ForFork0_fifo_push_#t~mem34#1.offset_28|) (< (select (select (let ((.cse26 (store (store .cse24 |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.base| (store .cse25 .cse5 (+ |v_pusherThread1of1ForFork0_fifo_push_#t~mem34#1.offset_28| 4))) (select (select (store (store |c_#memory_$Pointer$.base| .cse12 v_ArrVal_5118) |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.base| v_ArrVal_5121) |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse10) v_ArrVal_5123))) (store .cse26 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| (store (select .cse26 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse10 |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.offset|))) |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.base|) .cse5) .cse5)))))))))) (not .cse0) (not .cse2))))))) is different from false [2024-10-26 01:47:25,721 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_pusherThread1of1ForFork0_fifo_node_init_#res#1.offset| 12))) (let ((.cse10 (select (select |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_fifo_node_init_#res#1.base|) .cse2))) (let ((.cse0 (select (select |c_#memory_$Pointer$.offset| |c_pusherThread1of1ForFork0_fifo_node_init_#res#1.base|) .cse2)) (.cse7 (+ |c_pusherThread1of1ForFork0_~q~0#1.offset| 4)) (.cse8 (+ |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| 4)) (.cse11 (select |c_#memory_$Pointer$.offset| .cse10))) (let ((.cse12 (= |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| |c_pusherThread1of1ForFork0_~q~0#1.offset|)) (.cse21 (= |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| |c_pusherThread1of1ForFork0_~q~0#1.base|)) (.cse13 (and (forall ((|v_pusherThread1of1ForFork0_fifo_push_#t~mem32#1.offset_38| Int)) (or (< .cse0 |v_pusherThread1of1ForFork0_fifo_push_#t~mem32#1.offset_38|) (forall ((v_ArrVal_5118 (Array Int Int)) (|v_pusherThread1of1ForFork0_fifo_push_#t~mem34#1.offset_28| Int) (v_ArrVal_5120 Int)) (let ((.cse30 (store |c_#memory_$Pointer$.offset| .cse10 (store .cse11 |v_pusherThread1of1ForFork0_fifo_push_#t~mem32#1.offset_38| v_ArrVal_5120)))) (let ((.cse31 (select .cse30 |c_pusherThread1of1ForFork0_fifo_node_init_#res#1.base|))) (or (forall ((v_ArrVal_5121 (Array Int Int)) (v_ArrVal_5123 (Array Int Int)) (v_arrayElimCell_36 Int)) (let ((.cse27 (select (select (store (store |c_#memory_$Pointer$.base| .cse10 v_ArrVal_5118) |c_pusherThread1of1ForFork0_fifo_node_init_#res#1.base| v_ArrVal_5121) |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse8))) (or (= |c_pusherThread1of1ForFork0_fifo_node_init_#res#1.base| .cse27) (let ((.cse28 (store (store .cse30 |c_pusherThread1of1ForFork0_fifo_node_init_#res#1.base| (store .cse31 .cse2 (+ |v_pusherThread1of1ForFork0_fifo_push_#t~mem34#1.offset_28| 4))) .cse27 v_ArrVal_5123))) (let ((.cse29 (+ (select (select .cse28 |c_pusherThread1of1ForFork0_~q~0#1.base|) .cse7) 12))) (< (select (select (store .cse28 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| (store (select .cse28 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse8 |c_pusherThread1of1ForFork0_fifo_node_init_#res#1.offset|)) v_arrayElimCell_36) .cse29) .cse29)))))) (< (select .cse31 .cse2) |v_pusherThread1of1ForFork0_fifo_push_#t~mem34#1.offset_28|))))))) (forall ((|v_pusherThread1of1ForFork0_fifo_push_#t~mem32#1.offset_38| Int)) (or (< .cse0 |v_pusherThread1of1ForFork0_fifo_push_#t~mem32#1.offset_38|) (forall ((v_ArrVal_5118 (Array Int Int)) (|v_pusherThread1of1ForFork0_fifo_push_#t~mem34#1.offset_28| Int) (v_ArrVal_5120 Int)) (let ((.cse36 (store |c_#memory_$Pointer$.offset| .cse10 (store .cse11 |v_pusherThread1of1ForFork0_fifo_push_#t~mem32#1.offset_38| v_ArrVal_5120)))) (let ((.cse35 (select .cse36 |c_pusherThread1of1ForFork0_fifo_node_init_#res#1.base|))) (let ((.cse32 (store .cse36 |c_pusherThread1of1ForFork0_fifo_node_init_#res#1.base| (store .cse35 .cse2 (+ |v_pusherThread1of1ForFork0_fifo_push_#t~mem34#1.offset_28| 4))))) (or (= (select (select .cse32 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse8) |c_pusherThread1of1ForFork0_fifo_node_init_#res#1.offset|) (forall ((v_ArrVal_5121 (Array Int Int)) (v_ArrVal_5123 (Array Int Int)) (v_arrayElimCell_36 Int)) (let ((.cse33 (store .cse32 (select (select (store (store |c_#memory_$Pointer$.base| .cse10 v_ArrVal_5118) |c_pusherThread1of1ForFork0_fifo_node_init_#res#1.base| v_ArrVal_5121) |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse8) v_ArrVal_5123))) (let ((.cse34 (+ (select (select .cse33 |c_pusherThread1of1ForFork0_~q~0#1.base|) .cse7) 12))) (< (select (select (store .cse33 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| (store (select .cse33 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse8 |c_pusherThread1of1ForFork0_fifo_node_init_#res#1.offset|)) v_arrayElimCell_36) .cse34) .cse34)))) (< (select .cse35 .cse2) |v_pusherThread1of1ForFork0_fifo_push_#t~mem34#1.offset_28|))))))))))) (and (forall ((|v_pusherThread1of1ForFork0_fifo_push_#t~mem32#1.offset_38| Int)) (or (< .cse0 |v_pusherThread1of1ForFork0_fifo_push_#t~mem32#1.offset_38|) (forall ((v_ArrVal_5118 (Array Int Int)) (|v_pusherThread1of1ForFork0_fifo_push_#t~mem34#1.offset_28| Int) (v_ArrVal_5120 Int)) (let ((.cse9 (store |c_#memory_$Pointer$.offset| .cse10 (store .cse11 |v_pusherThread1of1ForFork0_fifo_push_#t~mem32#1.offset_38| v_ArrVal_5120)))) (let ((.cse1 (select .cse9 |c_pusherThread1of1ForFork0_fifo_node_init_#res#1.base|))) (or (< (select .cse1 .cse2) |v_pusherThread1of1ForFork0_fifo_push_#t~mem34#1.offset_28|) (forall ((v_ArrVal_5121 (Array Int Int)) (v_ArrVal_5123 (Array Int Int)) (v_arrayElimCell_36 Int)) (let ((.cse4 (select (select (store (store |c_#memory_$Pointer$.base| .cse10 v_ArrVal_5118) |c_pusherThread1of1ForFork0_fifo_node_init_#res#1.base| v_ArrVal_5121) |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse8))) (let ((.cse6 (store (store .cse9 |c_pusherThread1of1ForFork0_fifo_node_init_#res#1.base| (store .cse1 .cse2 (+ |v_pusherThread1of1ForFork0_fifo_push_#t~mem34#1.offset_28| 4))) .cse4 v_ArrVal_5123))) (let ((.cse3 (store .cse6 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| (store (select .cse6 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse8 |c_pusherThread1of1ForFork0_fifo_node_init_#res#1.offset|)))) (or (< (select (select .cse3 |c_pusherThread1of1ForFork0_fifo_node_init_#res#1.base|) .cse2) .cse2) (= |c_pusherThread1of1ForFork0_fifo_node_init_#res#1.base| .cse4) (let ((.cse5 (+ (select (select .cse6 |c_pusherThread1of1ForFork0_~q~0#1.base|) .cse7) 12))) (< (select (select .cse3 v_arrayElimCell_36) .cse5) .cse5))))))))))))) (or .cse12 .cse13) (or (and (forall ((|v_pusherThread1of1ForFork0_fifo_push_#t~mem32#1.offset_38| Int)) (or (< .cse0 |v_pusherThread1of1ForFork0_fifo_push_#t~mem32#1.offset_38|) (forall ((v_ArrVal_5118 (Array Int Int)) (v_ArrVal_5120 Int)) (let ((.cse14 (store |c_#memory_$Pointer$.offset| .cse10 (store .cse11 |v_pusherThread1of1ForFork0_fifo_push_#t~mem32#1.offset_38| v_ArrVal_5120)))) (or (= (select (select .cse14 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse8) |c_pusherThread1of1ForFork0_fifo_node_init_#res#1.offset|) (forall ((v_ArrVal_5121 (Array Int Int)) (v_ArrVal_5123 (Array Int Int)) (|v_pusherThread1of1ForFork0_fifo_push_#t~mem34#1.offset_28| Int)) (let ((.cse16 (select .cse14 |c_pusherThread1of1ForFork0_fifo_node_init_#res#1.base|))) (or (< (select (select (let ((.cse15 (store (store .cse14 |c_pusherThread1of1ForFork0_fifo_node_init_#res#1.base| (store .cse16 .cse2 (+ |v_pusherThread1of1ForFork0_fifo_push_#t~mem34#1.offset_28| 4))) (select (select (store (store |c_#memory_$Pointer$.base| .cse10 v_ArrVal_5118) |c_pusherThread1of1ForFork0_fifo_node_init_#res#1.base| v_ArrVal_5121) |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse8) v_ArrVal_5123))) (store .cse15 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| (store (select .cse15 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse8 |c_pusherThread1of1ForFork0_fifo_node_init_#res#1.offset|))) |c_pusherThread1of1ForFork0_fifo_node_init_#res#1.base|) .cse2) .cse2) (< (select .cse16 .cse2) |v_pusherThread1of1ForFork0_fifo_push_#t~mem34#1.offset_28|))))))))) (forall ((|v_pusherThread1of1ForFork0_fifo_push_#t~mem32#1.offset_38| Int)) (or (< .cse0 |v_pusherThread1of1ForFork0_fifo_push_#t~mem32#1.offset_38|) (forall ((v_ArrVal_5118 (Array Int Int)) (|v_pusherThread1of1ForFork0_fifo_push_#t~mem34#1.offset_28| Int) (v_ArrVal_5120 Int)) (let ((.cse19 (store |c_#memory_$Pointer$.offset| .cse10 (store .cse11 |v_pusherThread1of1ForFork0_fifo_push_#t~mem32#1.offset_38| v_ArrVal_5120)))) (let ((.cse17 (select .cse19 |c_pusherThread1of1ForFork0_fifo_node_init_#res#1.base|))) (or (< (select .cse17 .cse2) |v_pusherThread1of1ForFork0_fifo_push_#t~mem34#1.offset_28|) (forall ((v_ArrVal_5121 (Array Int Int)) (v_ArrVal_5123 (Array Int Int))) (let ((.cse20 (select (select (store (store |c_#memory_$Pointer$.base| .cse10 v_ArrVal_5118) |c_pusherThread1of1ForFork0_fifo_node_init_#res#1.base| v_ArrVal_5121) |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse8))) (or (< (select (select (let ((.cse18 (store (store .cse19 |c_pusherThread1of1ForFork0_fifo_node_init_#res#1.base| (store .cse17 .cse2 (+ |v_pusherThread1of1ForFork0_fifo_push_#t~mem34#1.offset_28| 4))) .cse20 v_ArrVal_5123))) (store .cse18 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| (store (select .cse18 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse8 |c_pusherThread1of1ForFork0_fifo_node_init_#res#1.offset|))) |c_pusherThread1of1ForFork0_fifo_node_init_#res#1.base|) .cse2) .cse2) (= |c_pusherThread1of1ForFork0_fifo_node_init_#res#1.base| .cse20))))))))))) (not .cse12) (not .cse21)) (or .cse21 .cse13) (forall ((|v_pusherThread1of1ForFork0_fifo_push_#t~mem32#1.offset_38| Int)) (or (< .cse0 |v_pusherThread1of1ForFork0_fifo_push_#t~mem32#1.offset_38|) (forall ((v_ArrVal_5118 (Array Int Int)) (v_ArrVal_5120 Int)) (let ((.cse22 (store |c_#memory_$Pointer$.offset| .cse10 (store .cse11 |v_pusherThread1of1ForFork0_fifo_push_#t~mem32#1.offset_38| v_ArrVal_5120)))) (or (= (select (select .cse22 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse8) |c_pusherThread1of1ForFork0_fifo_node_init_#res#1.offset|) (forall ((v_ArrVal_5121 (Array Int Int)) (v_ArrVal_5123 (Array Int Int)) (v_arrayElimCell_36 Int) (|v_pusherThread1of1ForFork0_fifo_push_#t~mem34#1.offset_28| Int)) (let ((.cse24 (select .cse22 |c_pusherThread1of1ForFork0_fifo_node_init_#res#1.base|))) (let ((.cse26 (store (store .cse22 |c_pusherThread1of1ForFork0_fifo_node_init_#res#1.base| (store .cse24 .cse2 (+ |v_pusherThread1of1ForFork0_fifo_push_#t~mem34#1.offset_28| 4))) (select (select (store (store |c_#memory_$Pointer$.base| .cse10 v_ArrVal_5118) |c_pusherThread1of1ForFork0_fifo_node_init_#res#1.base| v_ArrVal_5121) |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse8) v_ArrVal_5123))) (let ((.cse23 (store .cse26 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| (store (select .cse26 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse8 |c_pusherThread1of1ForFork0_fifo_node_init_#res#1.offset|)))) (or (< (select (select .cse23 |c_pusherThread1of1ForFork0_fifo_node_init_#res#1.base|) .cse2) .cse2) (< (select .cse24 .cse2) |v_pusherThread1of1ForFork0_fifo_push_#t~mem34#1.offset_28|) (let ((.cse25 (+ (select (select .cse26 |c_pusherThread1of1ForFork0_~q~0#1.base|) .cse7) 12))) (< (select (select .cse23 v_arrayElimCell_36) .cse25) .cse25))))))))))))))))) is different from false [2024-10-26 01:47:26,009 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse10 (+ 12 |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.offset|))) (let ((.cse11 (select (select |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base|) .cse10))) (let ((.cse2 (select (select |c_#memory_$Pointer$.offset| |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base|) .cse10)) (.cse8 (+ |c_pusherThread1of1ForFork0_~q~0#1.offset| 4)) (.cse4 (+ |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| 4)) (.cse12 (select |c_#memory_$Pointer$.offset| .cse11))) (let ((.cse1 (and (forall ((|v_pusherThread1of1ForFork0_fifo_push_#t~mem32#1.offset_38| Int)) (or (forall ((v_ArrVal_5118 (Array Int Int)) (|v_pusherThread1of1ForFork0_fifo_push_#t~mem34#1.offset_28| Int) (v_ArrVal_5120 Int)) (let ((.cse31 (store |c_#memory_$Pointer$.offset| .cse11 (store .cse12 |v_pusherThread1of1ForFork0_fifo_push_#t~mem32#1.offset_38| v_ArrVal_5120)))) (let ((.cse30 (select .cse31 |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base|))) (let ((.cse27 (store .cse31 |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| (store .cse30 .cse10 (+ |v_pusherThread1of1ForFork0_fifo_push_#t~mem34#1.offset_28| 4))))) (or (= (select (select .cse27 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse4) |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.offset|) (forall ((v_ArrVal_5121 (Array Int Int)) (v_ArrVal_5123 (Array Int Int)) (v_arrayElimCell_36 Int)) (let ((.cse28 (store .cse27 (select (select (store (store |c_#memory_$Pointer$.base| .cse11 v_ArrVal_5118) |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| v_ArrVal_5121) |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse4) v_ArrVal_5123))) (let ((.cse29 (+ (select (select .cse28 |c_pusherThread1of1ForFork0_~q~0#1.base|) .cse8) 12))) (< (select (select (store .cse28 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| (store (select .cse28 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse4 |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.offset|)) v_arrayElimCell_36) .cse29) .cse29)))) (< (select .cse30 .cse10) |v_pusherThread1of1ForFork0_fifo_push_#t~mem34#1.offset_28|)))))) (< .cse2 |v_pusherThread1of1ForFork0_fifo_push_#t~mem32#1.offset_38|))) (forall ((|v_pusherThread1of1ForFork0_fifo_push_#t~mem32#1.offset_38| Int)) (or (< .cse2 |v_pusherThread1of1ForFork0_fifo_push_#t~mem32#1.offset_38|) (forall ((v_ArrVal_5118 (Array Int Int)) (|v_pusherThread1of1ForFork0_fifo_push_#t~mem34#1.offset_28| Int) (v_ArrVal_5120 Int)) (let ((.cse35 (store |c_#memory_$Pointer$.offset| .cse11 (store .cse12 |v_pusherThread1of1ForFork0_fifo_push_#t~mem32#1.offset_38| v_ArrVal_5120)))) (let ((.cse36 (select .cse35 |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base|))) (or (forall ((v_ArrVal_5121 (Array Int Int)) (v_ArrVal_5123 (Array Int Int)) (v_arrayElimCell_36 Int)) (let ((.cse32 (select (select (store (store |c_#memory_$Pointer$.base| .cse11 v_ArrVal_5118) |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| v_ArrVal_5121) |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse4))) (or (= |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| .cse32) (let ((.cse33 (store (store .cse35 |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| (store .cse36 .cse10 (+ |v_pusherThread1of1ForFork0_fifo_push_#t~mem34#1.offset_28| 4))) .cse32 v_ArrVal_5123))) (let ((.cse34 (+ (select (select .cse33 |c_pusherThread1of1ForFork0_~q~0#1.base|) .cse8) 12))) (< (select (select (store .cse33 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| (store (select .cse33 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse4 |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.offset|)) v_arrayElimCell_36) .cse34) .cse34)))))) (< (select .cse36 .cse10) |v_pusherThread1of1ForFork0_fifo_push_#t~mem34#1.offset_28|))))))))) (.cse0 (= |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| |c_pusherThread1of1ForFork0_~q~0#1.offset|)) (.cse19 (= |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| |c_pusherThread1of1ForFork0_~q~0#1.base|))) (and (or .cse0 .cse1) (forall ((|v_pusherThread1of1ForFork0_fifo_push_#t~mem32#1.offset_38| Int)) (or (< .cse2 |v_pusherThread1of1ForFork0_fifo_push_#t~mem32#1.offset_38|) (forall ((v_ArrVal_5118 (Array Int Int)) (v_ArrVal_5120 Int)) (let ((.cse3 (store |c_#memory_$Pointer$.offset| .cse11 (store .cse12 |v_pusherThread1of1ForFork0_fifo_push_#t~mem32#1.offset_38| v_ArrVal_5120)))) (or (= (select (select .cse3 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse4) |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.offset|) (forall ((v_ArrVal_5121 (Array Int Int)) (v_ArrVal_5123 (Array Int Int)) (v_arrayElimCell_36 Int) (|v_pusherThread1of1ForFork0_fifo_push_#t~mem34#1.offset_28| Int)) (let ((.cse9 (select .cse3 |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base|))) (let ((.cse7 (store (store .cse3 |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| (store .cse9 .cse10 (+ |v_pusherThread1of1ForFork0_fifo_push_#t~mem34#1.offset_28| 4))) (select (select (store (store |c_#memory_$Pointer$.base| .cse11 v_ArrVal_5118) |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| v_ArrVal_5121) |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse4) v_ArrVal_5123))) (let ((.cse5 (store .cse7 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| (store (select .cse7 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse4 |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.offset|)))) (or (let ((.cse6 (+ (select (select .cse7 |c_pusherThread1of1ForFork0_~q~0#1.base|) .cse8) 12))) (< (select (select .cse5 v_arrayElimCell_36) .cse6) .cse6)) (< (select .cse9 .cse10) |v_pusherThread1of1ForFork0_fifo_push_#t~mem34#1.offset_28|) (< (select (select .cse5 |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base|) .cse10) .cse10))))))))))) (forall ((|v_pusherThread1of1ForFork0_fifo_push_#t~mem32#1.offset_38| Int)) (or (forall ((v_ArrVal_5118 (Array Int Int)) (|v_pusherThread1of1ForFork0_fifo_push_#t~mem34#1.offset_28| Int) (v_ArrVal_5120 Int)) (let ((.cse18 (store |c_#memory_$Pointer$.offset| .cse11 (store .cse12 |v_pusherThread1of1ForFork0_fifo_push_#t~mem32#1.offset_38| v_ArrVal_5120)))) (let ((.cse13 (select .cse18 |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base|))) (or (< (select .cse13 .cse10) |v_pusherThread1of1ForFork0_fifo_push_#t~mem34#1.offset_28|) (forall ((v_ArrVal_5121 (Array Int Int)) (v_ArrVal_5123 (Array Int Int)) (v_arrayElimCell_36 Int)) (let ((.cse14 (select (select (store (store |c_#memory_$Pointer$.base| .cse11 v_ArrVal_5118) |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| v_ArrVal_5121) |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse4))) (let ((.cse17 (store (store .cse18 |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| (store .cse13 .cse10 (+ |v_pusherThread1of1ForFork0_fifo_push_#t~mem34#1.offset_28| 4))) .cse14 v_ArrVal_5123))) (let ((.cse15 (store .cse17 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| (store (select .cse17 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse4 |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.offset|)))) (or (= |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| .cse14) (let ((.cse16 (+ (select (select .cse17 |c_pusherThread1of1ForFork0_~q~0#1.base|) .cse8) 12))) (< (select (select .cse15 v_arrayElimCell_36) .cse16) .cse16)) (< (select (select .cse15 |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base|) .cse10) .cse10)))))))))) (< .cse2 |v_pusherThread1of1ForFork0_fifo_push_#t~mem32#1.offset_38|))) (or .cse19 .cse1) (or (and (forall ((|v_pusherThread1of1ForFork0_fifo_push_#t~mem32#1.offset_38| Int)) (or (forall ((v_ArrVal_5118 (Array Int Int)) (|v_pusherThread1of1ForFork0_fifo_push_#t~mem34#1.offset_28| Int) (v_ArrVal_5120 Int)) (let ((.cse22 (store |c_#memory_$Pointer$.offset| .cse11 (store .cse12 |v_pusherThread1of1ForFork0_fifo_push_#t~mem32#1.offset_38| v_ArrVal_5120)))) (let ((.cse23 (select .cse22 |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base|))) (or (forall ((v_ArrVal_5121 (Array Int Int)) (v_ArrVal_5123 (Array Int Int))) (let ((.cse20 (select (select (store (store |c_#memory_$Pointer$.base| .cse11 v_ArrVal_5118) |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| v_ArrVal_5121) |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse4))) (or (= |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| .cse20) (< (select (select (let ((.cse21 (store (store .cse22 |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| (store .cse23 .cse10 (+ |v_pusherThread1of1ForFork0_fifo_push_#t~mem34#1.offset_28| 4))) .cse20 v_ArrVal_5123))) (store .cse21 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| (store (select .cse21 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse4 |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.offset|))) |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base|) .cse10) .cse10)))) (< (select .cse23 .cse10) |v_pusherThread1of1ForFork0_fifo_push_#t~mem34#1.offset_28|))))) (< .cse2 |v_pusherThread1of1ForFork0_fifo_push_#t~mem32#1.offset_38|))) (forall ((|v_pusherThread1of1ForFork0_fifo_push_#t~mem32#1.offset_38| Int)) (or (< .cse2 |v_pusherThread1of1ForFork0_fifo_push_#t~mem32#1.offset_38|) (forall ((v_ArrVal_5118 (Array Int Int)) (v_ArrVal_5120 Int)) (let ((.cse24 (store |c_#memory_$Pointer$.offset| .cse11 (store .cse12 |v_pusherThread1of1ForFork0_fifo_push_#t~mem32#1.offset_38| v_ArrVal_5120)))) (or (= (select (select .cse24 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse4) |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.offset|) (forall ((v_ArrVal_5121 (Array Int Int)) (v_ArrVal_5123 (Array Int Int)) (|v_pusherThread1of1ForFork0_fifo_push_#t~mem34#1.offset_28| Int)) (let ((.cse25 (select .cse24 |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base|))) (or (< (select .cse25 .cse10) |v_pusherThread1of1ForFork0_fifo_push_#t~mem34#1.offset_28|) (< (select (select (let ((.cse26 (store (store .cse24 |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| (store .cse25 .cse10 (+ |v_pusherThread1of1ForFork0_fifo_push_#t~mem34#1.offset_28| 4))) (select (select (store (store |c_#memory_$Pointer$.base| .cse11 v_ArrVal_5118) |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| v_ArrVal_5121) |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse4) v_ArrVal_5123))) (store .cse26 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| (store (select .cse26 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse4 |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.offset|))) |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base|) .cse10) .cse10)))))))))) (not .cse0) (not .cse19))))))) is different from false [2024-10-26 01:47:27,974 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse12 (select |c_#memory_$Pointer$.offset| |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base|)) (.cse3 (+ 12 |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.offset|))) (let ((.cse0 (select .cse12 .cse3)) (.cse6 (+ |c_pusherThread1of1ForFork0_~q~0#1.offset| 4)) (.cse7 (+ |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| 4)) (.cse8 (select (select |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base|) .cse3)) (.cse13 (+ 16 |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.offset|))) (let ((.cse14 (= |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| |c_pusherThread1of1ForFork0_~q~0#1.base|)) (.cse15 (and (forall ((v_ArrVal_5116 Int) (|v_pusherThread1of1ForFork0_fifo_push_#t~mem32#1.offset_38| Int)) (or (< .cse0 |v_pusherThread1of1ForFork0_fifo_push_#t~mem32#1.offset_38|) (forall ((v_ArrVal_5118 (Array Int Int)) (|v_pusherThread1of1ForFork0_fifo_push_#t~mem34#1.offset_28| Int) (v_ArrVal_5120 Int)) (let ((.cse39 (store |c_#memory_$Pointer$.offset| |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| (store .cse12 .cse13 v_ArrVal_5116)))) (let ((.cse38 (store (select .cse39 .cse8) |v_pusherThread1of1ForFork0_fifo_push_#t~mem32#1.offset_38| v_ArrVal_5120))) (let ((.cse37 (select (store .cse39 .cse8 .cse38) |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base|))) (let ((.cse36 (store (store |c_#memory_$Pointer$.offset| .cse8 .cse38) |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| (store .cse37 .cse3 (+ |v_pusherThread1of1ForFork0_fifo_push_#t~mem34#1.offset_28| 4))))) (or (forall ((v_ArrVal_5121 (Array Int Int)) (v_ArrVal_5123 (Array Int Int)) (v_arrayElimCell_36 Int)) (let ((.cse34 (store .cse36 (select (select (store (store |c_#memory_$Pointer$.base| .cse8 v_ArrVal_5118) |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| v_ArrVal_5121) |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse7) v_ArrVal_5123))) (let ((.cse35 (+ 12 (select (select .cse34 |c_pusherThread1of1ForFork0_~q~0#1.base|) .cse6)))) (< (select (select (store .cse34 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| (store (select .cse34 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse7 |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.offset|)) v_arrayElimCell_36) .cse35) .cse35)))) (= (select (select .cse36 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse7) |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.offset|) (< (select .cse37 .cse3) |v_pusherThread1of1ForFork0_fifo_push_#t~mem34#1.offset_28|))))))))) (forall ((v_ArrVal_5116 Int) (|v_pusherThread1of1ForFork0_fifo_push_#t~mem32#1.offset_38| Int)) (or (< .cse0 |v_pusherThread1of1ForFork0_fifo_push_#t~mem32#1.offset_38|) (forall ((v_ArrVal_5118 (Array Int Int)) (|v_pusherThread1of1ForFork0_fifo_push_#t~mem34#1.offset_28| Int) (v_ArrVal_5120 Int)) (let ((.cse45 (store |c_#memory_$Pointer$.offset| |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| (store .cse12 .cse13 v_ArrVal_5116)))) (let ((.cse44 (store (select .cse45 .cse8) |v_pusherThread1of1ForFork0_fifo_push_#t~mem32#1.offset_38| v_ArrVal_5120))) (let ((.cse40 (select (store .cse45 .cse8 .cse44) |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base|))) (or (< (select .cse40 .cse3) |v_pusherThread1of1ForFork0_fifo_push_#t~mem34#1.offset_28|) (forall ((v_ArrVal_5121 (Array Int Int)) (v_ArrVal_5123 (Array Int Int)) (v_arrayElimCell_36 Int)) (let ((.cse41 (select (select (store (store |c_#memory_$Pointer$.base| .cse8 v_ArrVal_5118) |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| v_ArrVal_5121) |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse7))) (or (= |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| .cse41) (let ((.cse42 (store (store (store |c_#memory_$Pointer$.offset| .cse8 .cse44) |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| (store .cse40 .cse3 (+ |v_pusherThread1of1ForFork0_fifo_push_#t~mem34#1.offset_28| 4))) .cse41 v_ArrVal_5123))) (let ((.cse43 (+ 12 (select (select .cse42 |c_pusherThread1of1ForFork0_~q~0#1.base|) .cse6)))) (< (select (select (store .cse42 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| (store (select .cse42 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse7 |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.offset|)) v_arrayElimCell_36) .cse43) .cse43))))))))))))))) (.cse26 (= |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| |c_pusherThread1of1ForFork0_~q~0#1.offset|))) (and (forall ((v_ArrVal_5116 Int) (|v_pusherThread1of1ForFork0_fifo_push_#t~mem32#1.offset_38| Int)) (or (< .cse0 |v_pusherThread1of1ForFork0_fifo_push_#t~mem32#1.offset_38|) (forall ((v_ArrVal_5118 (Array Int Int)) (|v_pusherThread1of1ForFork0_fifo_push_#t~mem34#1.offset_28| Int) (v_ArrVal_5120 Int)) (let ((.cse11 (store |c_#memory_$Pointer$.offset| |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| (store .cse12 .cse13 v_ArrVal_5116)))) (let ((.cse9 (store (select .cse11 .cse8) |v_pusherThread1of1ForFork0_fifo_push_#t~mem32#1.offset_38| v_ArrVal_5120))) (let ((.cse10 (select (store .cse11 .cse8 .cse9) |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base|))) (or (forall ((v_ArrVal_5121 (Array Int Int)) (v_ArrVal_5123 (Array Int Int)) (v_arrayElimCell_36 Int)) (let ((.cse1 (select (select (store (store |c_#memory_$Pointer$.base| .cse8 v_ArrVal_5118) |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| v_ArrVal_5121) |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse7))) (let ((.cse5 (store (store (store |c_#memory_$Pointer$.offset| .cse8 .cse9) |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| (store .cse10 .cse3 (+ |v_pusherThread1of1ForFork0_fifo_push_#t~mem34#1.offset_28| 4))) .cse1 v_ArrVal_5123))) (let ((.cse2 (store .cse5 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| (store (select .cse5 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse7 |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.offset|)))) (or (= |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| .cse1) (< (select (select .cse2 |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base|) .cse3) .cse3) (let ((.cse4 (+ 12 (select (select .cse5 |c_pusherThread1of1ForFork0_~q~0#1.base|) .cse6)))) (< (select (select .cse2 v_arrayElimCell_36) .cse4) .cse4))))))) (< (select .cse10 .cse3) |v_pusherThread1of1ForFork0_fifo_push_#t~mem34#1.offset_28|)))))))) (or .cse14 .cse15) (or (and (forall ((v_ArrVal_5116 Int) (|v_pusherThread1of1ForFork0_fifo_push_#t~mem32#1.offset_38| Int)) (or (< .cse0 |v_pusherThread1of1ForFork0_fifo_push_#t~mem32#1.offset_38|) (forall ((v_ArrVal_5118 (Array Int Int)) (|v_pusherThread1of1ForFork0_fifo_push_#t~mem34#1.offset_28| Int) (v_ArrVal_5120 Int)) (let ((.cse20 (store |c_#memory_$Pointer$.offset| |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| (store .cse12 .cse13 v_ArrVal_5116)))) (let ((.cse18 (store (select .cse20 .cse8) |v_pusherThread1of1ForFork0_fifo_push_#t~mem32#1.offset_38| v_ArrVal_5120))) (let ((.cse19 (select (store .cse20 .cse8 .cse18) |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base|))) (or (forall ((v_ArrVal_5121 (Array Int Int)) (v_ArrVal_5123 (Array Int Int))) (let ((.cse16 (select (select (store (store |c_#memory_$Pointer$.base| .cse8 v_ArrVal_5118) |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| v_ArrVal_5121) |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse7))) (or (= |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| .cse16) (< (select (select (let ((.cse17 (store (store (store |c_#memory_$Pointer$.offset| .cse8 .cse18) |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| (store .cse19 .cse3 (+ |v_pusherThread1of1ForFork0_fifo_push_#t~mem34#1.offset_28| 4))) .cse16 v_ArrVal_5123))) (store .cse17 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| (store (select .cse17 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse7 |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.offset|))) |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base|) .cse3) .cse3)))) (< (select .cse19 .cse3) |v_pusherThread1of1ForFork0_fifo_push_#t~mem34#1.offset_28|)))))))) (forall ((v_ArrVal_5116 Int) (|v_pusherThread1of1ForFork0_fifo_push_#t~mem32#1.offset_38| Int)) (or (forall ((v_ArrVal_5118 (Array Int Int)) (v_ArrVal_5120 Int)) (let ((.cse25 (store |c_#memory_$Pointer$.offset| |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| (store .cse12 .cse13 v_ArrVal_5116)))) (let ((.cse22 (store (select .cse25 .cse8) |v_pusherThread1of1ForFork0_fifo_push_#t~mem32#1.offset_38| v_ArrVal_5120))) (let ((.cse24 (store .cse25 .cse8 .cse22))) (or (forall ((v_ArrVal_5121 (Array Int Int)) (v_ArrVal_5123 (Array Int Int)) (|v_pusherThread1of1ForFork0_fifo_push_#t~mem34#1.offset_28| Int)) (let ((.cse23 (select .cse24 |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base|))) (or (< (select (select (let ((.cse21 (store (store (store |c_#memory_$Pointer$.offset| .cse8 .cse22) |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| (store .cse23 .cse3 (+ |v_pusherThread1of1ForFork0_fifo_push_#t~mem34#1.offset_28| 4))) (select (select (store (store |c_#memory_$Pointer$.base| .cse8 v_ArrVal_5118) |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| v_ArrVal_5121) |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse7) v_ArrVal_5123))) (store .cse21 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| (store (select .cse21 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse7 |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.offset|))) |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base|) .cse3) .cse3) (< (select .cse23 .cse3) |v_pusherThread1of1ForFork0_fifo_push_#t~mem34#1.offset_28|)))) (= (select (select .cse24 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse7) |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.offset|)))))) (< .cse0 |v_pusherThread1of1ForFork0_fifo_push_#t~mem32#1.offset_38|)))) (not .cse26) (not .cse14)) (or .cse15 .cse26) (forall ((v_ArrVal_5116 Int) (|v_pusherThread1of1ForFork0_fifo_push_#t~mem32#1.offset_38| Int)) (or (< .cse0 |v_pusherThread1of1ForFork0_fifo_push_#t~mem32#1.offset_38|) (forall ((v_ArrVal_5118 (Array Int Int)) (v_ArrVal_5120 Int)) (let ((.cse33 (store |c_#memory_$Pointer$.offset| |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| (store .cse12 .cse13 v_ArrVal_5116)))) (let ((.cse31 (store (select .cse33 .cse8) |v_pusherThread1of1ForFork0_fifo_push_#t~mem32#1.offset_38| v_ArrVal_5120))) (let ((.cse32 (store .cse33 .cse8 .cse31))) (or (forall ((v_ArrVal_5121 (Array Int Int)) (v_ArrVal_5123 (Array Int Int)) (v_arrayElimCell_36 Int) (|v_pusherThread1of1ForFork0_fifo_push_#t~mem34#1.offset_28| Int)) (let ((.cse30 (select .cse32 |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base|))) (let ((.cse29 (store (store (store |c_#memory_$Pointer$.offset| .cse8 .cse31) |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| (store .cse30 .cse3 (+ |v_pusherThread1of1ForFork0_fifo_push_#t~mem34#1.offset_28| 4))) (select (select (store (store |c_#memory_$Pointer$.base| .cse8 v_ArrVal_5118) |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| v_ArrVal_5121) |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse7) v_ArrVal_5123))) (let ((.cse27 (store .cse29 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| (store (select .cse29 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse7 |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.offset|)))) (or (< (select (select .cse27 |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base|) .cse3) .cse3) (let ((.cse28 (+ 12 (select (select .cse29 |c_pusherThread1of1ForFork0_~q~0#1.base|) .cse6)))) (< (select (select .cse27 v_arrayElimCell_36) .cse28) .cse28)) (< (select .cse30 .cse3) |v_pusherThread1of1ForFork0_fifo_push_#t~mem34#1.offset_28|)))))) (= (select (select .cse32 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse7) |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.offset|)))))))))))) is different from false [2024-10-26 01:47:29,985 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse12 (select |c_#memory_$Pointer$.offset| |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base|)) (.cse3 (+ 12 |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.offset|))) (let ((.cse0 (select .cse12 .cse3)) (.cse6 (+ |c_pusherThread1of1ForFork0_~q~0#1.offset| 4)) (.cse7 (+ |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| 4)) (.cse8 (select (select |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base|) .cse3)) (.cse13 (+ 16 |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.offset|))) (let ((.cse14 (= |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| |c_pusherThread1of1ForFork0_~q~0#1.base|)) (.cse15 (and (forall ((v_ArrVal_5116 Int) (|v_pusherThread1of1ForFork0_fifo_push_#t~mem32#1.offset_38| Int)) (or (< .cse0 |v_pusherThread1of1ForFork0_fifo_push_#t~mem32#1.offset_38|) (forall ((v_ArrVal_5118 (Array Int Int)) (|v_pusherThread1of1ForFork0_fifo_push_#t~mem34#1.offset_28| Int) (v_ArrVal_5120 Int)) (let ((.cse39 (store |c_#memory_$Pointer$.offset| |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| (store .cse12 .cse13 v_ArrVal_5116)))) (let ((.cse38 (store (select .cse39 .cse8) |v_pusherThread1of1ForFork0_fifo_push_#t~mem32#1.offset_38| v_ArrVal_5120))) (let ((.cse37 (select (store .cse39 .cse8 .cse38) |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base|))) (let ((.cse36 (store (store |c_#memory_$Pointer$.offset| .cse8 .cse38) |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| (store .cse37 .cse3 (+ |v_pusherThread1of1ForFork0_fifo_push_#t~mem34#1.offset_28| 4))))) (or (forall ((v_ArrVal_5121 (Array Int Int)) (v_ArrVal_5123 (Array Int Int)) (v_arrayElimCell_36 Int)) (let ((.cse34 (store .cse36 (select (select (store (store |c_#memory_$Pointer$.base| .cse8 v_ArrVal_5118) |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| v_ArrVal_5121) |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse7) v_ArrVal_5123))) (let ((.cse35 (+ 12 (select (select .cse34 |c_pusherThread1of1ForFork0_~q~0#1.base|) .cse6)))) (< (select (select (store .cse34 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| (store (select .cse34 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse7 |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.offset|)) v_arrayElimCell_36) .cse35) .cse35)))) (= (select (select .cse36 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse7) |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.offset|) (< (select .cse37 .cse3) |v_pusherThread1of1ForFork0_fifo_push_#t~mem34#1.offset_28|))))))))) (forall ((v_ArrVal_5116 Int) (|v_pusherThread1of1ForFork0_fifo_push_#t~mem32#1.offset_38| Int)) (or (< .cse0 |v_pusherThread1of1ForFork0_fifo_push_#t~mem32#1.offset_38|) (forall ((v_ArrVal_5118 (Array Int Int)) (|v_pusherThread1of1ForFork0_fifo_push_#t~mem34#1.offset_28| Int) (v_ArrVal_5120 Int)) (let ((.cse45 (store |c_#memory_$Pointer$.offset| |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| (store .cse12 .cse13 v_ArrVal_5116)))) (let ((.cse44 (store (select .cse45 .cse8) |v_pusherThread1of1ForFork0_fifo_push_#t~mem32#1.offset_38| v_ArrVal_5120))) (let ((.cse40 (select (store .cse45 .cse8 .cse44) |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base|))) (or (< (select .cse40 .cse3) |v_pusherThread1of1ForFork0_fifo_push_#t~mem34#1.offset_28|) (forall ((v_ArrVal_5121 (Array Int Int)) (v_ArrVal_5123 (Array Int Int)) (v_arrayElimCell_36 Int)) (let ((.cse41 (select (select (store (store |c_#memory_$Pointer$.base| .cse8 v_ArrVal_5118) |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| v_ArrVal_5121) |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse7))) (or (= |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| .cse41) (let ((.cse42 (store (store (store |c_#memory_$Pointer$.offset| .cse8 .cse44) |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| (store .cse40 .cse3 (+ |v_pusherThread1of1ForFork0_fifo_push_#t~mem34#1.offset_28| 4))) .cse41 v_ArrVal_5123))) (let ((.cse43 (+ 12 (select (select .cse42 |c_pusherThread1of1ForFork0_~q~0#1.base|) .cse6)))) (< (select (select (store .cse42 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| (store (select .cse42 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse7 |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.offset|)) v_arrayElimCell_36) .cse43) .cse43))))))))))))))) (.cse26 (= |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| |c_pusherThread1of1ForFork0_~q~0#1.offset|))) (and (forall ((v_ArrVal_5116 Int) (|v_pusherThread1of1ForFork0_fifo_push_#t~mem32#1.offset_38| Int)) (or (< .cse0 |v_pusherThread1of1ForFork0_fifo_push_#t~mem32#1.offset_38|) (forall ((v_ArrVal_5118 (Array Int Int)) (|v_pusherThread1of1ForFork0_fifo_push_#t~mem34#1.offset_28| Int) (v_ArrVal_5120 Int)) (let ((.cse11 (store |c_#memory_$Pointer$.offset| |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| (store .cse12 .cse13 v_ArrVal_5116)))) (let ((.cse9 (store (select .cse11 .cse8) |v_pusherThread1of1ForFork0_fifo_push_#t~mem32#1.offset_38| v_ArrVal_5120))) (let ((.cse10 (select (store .cse11 .cse8 .cse9) |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base|))) (or (forall ((v_ArrVal_5121 (Array Int Int)) (v_ArrVal_5123 (Array Int Int)) (v_arrayElimCell_36 Int)) (let ((.cse1 (select (select (store (store |c_#memory_$Pointer$.base| .cse8 v_ArrVal_5118) |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| v_ArrVal_5121) |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse7))) (let ((.cse5 (store (store (store |c_#memory_$Pointer$.offset| .cse8 .cse9) |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| (store .cse10 .cse3 (+ |v_pusherThread1of1ForFork0_fifo_push_#t~mem34#1.offset_28| 4))) .cse1 v_ArrVal_5123))) (let ((.cse2 (store .cse5 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| (store (select .cse5 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse7 |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.offset|)))) (or (= |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| .cse1) (< (select (select .cse2 |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base|) .cse3) .cse3) (let ((.cse4 (+ 12 (select (select .cse5 |c_pusherThread1of1ForFork0_~q~0#1.base|) .cse6)))) (< (select (select .cse2 v_arrayElimCell_36) .cse4) .cse4))))))) (< (select .cse10 .cse3) |v_pusherThread1of1ForFork0_fifo_push_#t~mem34#1.offset_28|)))))))) (or .cse14 .cse15) (or (and (forall ((v_ArrVal_5116 Int) (|v_pusherThread1of1ForFork0_fifo_push_#t~mem32#1.offset_38| Int)) (or (< .cse0 |v_pusherThread1of1ForFork0_fifo_push_#t~mem32#1.offset_38|) (forall ((v_ArrVal_5118 (Array Int Int)) (|v_pusherThread1of1ForFork0_fifo_push_#t~mem34#1.offset_28| Int) (v_ArrVal_5120 Int)) (let ((.cse20 (store |c_#memory_$Pointer$.offset| |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| (store .cse12 .cse13 v_ArrVal_5116)))) (let ((.cse18 (store (select .cse20 .cse8) |v_pusherThread1of1ForFork0_fifo_push_#t~mem32#1.offset_38| v_ArrVal_5120))) (let ((.cse19 (select (store .cse20 .cse8 .cse18) |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base|))) (or (forall ((v_ArrVal_5121 (Array Int Int)) (v_ArrVal_5123 (Array Int Int))) (let ((.cse16 (select (select (store (store |c_#memory_$Pointer$.base| .cse8 v_ArrVal_5118) |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| v_ArrVal_5121) |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse7))) (or (= |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| .cse16) (< (select (select (let ((.cse17 (store (store (store |c_#memory_$Pointer$.offset| .cse8 .cse18) |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| (store .cse19 .cse3 (+ |v_pusherThread1of1ForFork0_fifo_push_#t~mem34#1.offset_28| 4))) .cse16 v_ArrVal_5123))) (store .cse17 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| (store (select .cse17 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse7 |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.offset|))) |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base|) .cse3) .cse3)))) (< (select .cse19 .cse3) |v_pusherThread1of1ForFork0_fifo_push_#t~mem34#1.offset_28|)))))))) (forall ((v_ArrVal_5116 Int) (|v_pusherThread1of1ForFork0_fifo_push_#t~mem32#1.offset_38| Int)) (or (forall ((v_ArrVal_5118 (Array Int Int)) (v_ArrVal_5120 Int)) (let ((.cse25 (store |c_#memory_$Pointer$.offset| |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| (store .cse12 .cse13 v_ArrVal_5116)))) (let ((.cse22 (store (select .cse25 .cse8) |v_pusherThread1of1ForFork0_fifo_push_#t~mem32#1.offset_38| v_ArrVal_5120))) (let ((.cse24 (store .cse25 .cse8 .cse22))) (or (forall ((v_ArrVal_5121 (Array Int Int)) (v_ArrVal_5123 (Array Int Int)) (|v_pusherThread1of1ForFork0_fifo_push_#t~mem34#1.offset_28| Int)) (let ((.cse23 (select .cse24 |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base|))) (or (< (select (select (let ((.cse21 (store (store (store |c_#memory_$Pointer$.offset| .cse8 .cse22) |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| (store .cse23 .cse3 (+ |v_pusherThread1of1ForFork0_fifo_push_#t~mem34#1.offset_28| 4))) (select (select (store (store |c_#memory_$Pointer$.base| .cse8 v_ArrVal_5118) |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| v_ArrVal_5121) |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse7) v_ArrVal_5123))) (store .cse21 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| (store (select .cse21 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse7 |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.offset|))) |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base|) .cse3) .cse3) (< (select .cse23 .cse3) |v_pusherThread1of1ForFork0_fifo_push_#t~mem34#1.offset_28|)))) (= (select (select .cse24 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse7) |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.offset|)))))) (< .cse0 |v_pusherThread1of1ForFork0_fifo_push_#t~mem32#1.offset_38|)))) (not .cse26) (not .cse14)) (or .cse15 .cse26) (forall ((v_ArrVal_5116 Int) (|v_pusherThread1of1ForFork0_fifo_push_#t~mem32#1.offset_38| Int)) (or (< .cse0 |v_pusherThread1of1ForFork0_fifo_push_#t~mem32#1.offset_38|) (forall ((v_ArrVal_5118 (Array Int Int)) (v_ArrVal_5120 Int)) (let ((.cse33 (store |c_#memory_$Pointer$.offset| |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| (store .cse12 .cse13 v_ArrVal_5116)))) (let ((.cse31 (store (select .cse33 .cse8) |v_pusherThread1of1ForFork0_fifo_push_#t~mem32#1.offset_38| v_ArrVal_5120))) (let ((.cse32 (store .cse33 .cse8 .cse31))) (or (forall ((v_ArrVal_5121 (Array Int Int)) (v_ArrVal_5123 (Array Int Int)) (v_arrayElimCell_36 Int) (|v_pusherThread1of1ForFork0_fifo_push_#t~mem34#1.offset_28| Int)) (let ((.cse30 (select .cse32 |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base|))) (let ((.cse29 (store (store (store |c_#memory_$Pointer$.offset| .cse8 .cse31) |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| (store .cse30 .cse3 (+ |v_pusherThread1of1ForFork0_fifo_push_#t~mem34#1.offset_28| 4))) (select (select (store (store |c_#memory_$Pointer$.base| .cse8 v_ArrVal_5118) |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| v_ArrVal_5121) |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse7) v_ArrVal_5123))) (let ((.cse27 (store .cse29 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| (store (select .cse29 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse7 |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.offset|)))) (or (< (select (select .cse27 |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base|) .cse3) .cse3) (let ((.cse28 (+ 12 (select (select .cse29 |c_pusherThread1of1ForFork0_~q~0#1.base|) .cse6)))) (< (select (select .cse27 v_arrayElimCell_36) .cse28) .cse28)) (< (select .cse30 .cse3) |v_pusherThread1of1ForFork0_fifo_push_#t~mem34#1.offset_28|)))))) (= (select (select .cse32 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse7) |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.offset|)))))))))))) is different from true [2024-10-26 01:50:54,581 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse5 (+ |c_pusherThread1of1ForFork0_~q~0#1.offset| 4)) (.cse1 (+ |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| 4))) (let ((.cse8 (and (forall ((|v_pusherThread1of1ForFork0_fifo_push_#t~malloc29#1.base_20| Int)) (or (forall ((v_ArrVal_5107 Int)) (or (< 4 v_ArrVal_5107) (forall ((v_ArrVal_5116 Int) (v_ArrVal_5112 Int) (|v_pusherThread1of1ForFork0_fifo_push_#t~mem32#1.offset_38| Int)) (or (< v_ArrVal_5107 |v_pusherThread1of1ForFork0_fifo_push_#t~mem32#1.offset_38|) (forall ((|v_pusherThread1of1ForFork0_fifo_push_#t~mem34#1.offset_28| Int) (v_ArrVal_5120 Int)) (let ((.cse16 (select |c_#memory_$Pointer$.offset| |v_pusherThread1of1ForFork0_fifo_push_#t~malloc29#1.base_20|))) (or (forall ((v_ArrVal_5121 (Array Int Int)) (v_ArrVal_5123 (Array Int Int)) (v_arrayElimCell_36 Int)) (let ((.cse13 (select (select (store |c_#memory_$Pointer$.base| |v_pusherThread1of1ForFork0_fifo_push_#t~malloc29#1.base_20| v_ArrVal_5121) |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse1))) (or (= .cse13 |v_pusherThread1of1ForFork0_fifo_push_#t~malloc29#1.base_20|) (let ((.cse14 (store (store |c_#memory_$Pointer$.offset| |v_pusherThread1of1ForFork0_fifo_push_#t~malloc29#1.base_20| (store (store (store (store .cse16 0 v_ArrVal_5112) 16 v_ArrVal_5116) |v_pusherThread1of1ForFork0_fifo_push_#t~mem32#1.offset_38| v_ArrVal_5120) 12 (+ |v_pusherThread1of1ForFork0_fifo_push_#t~mem34#1.offset_28| 4))) .cse13 v_ArrVal_5123))) (let ((.cse15 (+ (select (select .cse14 |c_pusherThread1of1ForFork0_~q~0#1.base|) .cse5) 12))) (< (select (select (store .cse14 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| (store (select .cse14 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse1 0)) v_arrayElimCell_36) .cse15) .cse15)))))) (< (select (store (store (store (store .cse16 12 v_ArrVal_5107) 0 v_ArrVal_5112) 16 v_ArrVal_5116) |v_pusherThread1of1ForFork0_fifo_push_#t~mem32#1.offset_38| v_ArrVal_5120) 12) |v_pusherThread1of1ForFork0_fifo_push_#t~mem34#1.offset_28|)))))))) (< |c_#StackHeapBarrier| (+ |v_pusherThread1of1ForFork0_fifo_push_#t~malloc29#1.base_20| 1)))) (forall ((|v_pusherThread1of1ForFork0_fifo_push_#t~malloc29#1.base_20| Int)) (or (forall ((v_ArrVal_5107 Int)) (or (< 4 v_ArrVal_5107) (forall ((v_ArrVal_5116 Int) (v_ArrVal_5112 Int) (|v_pusherThread1of1ForFork0_fifo_push_#t~mem32#1.offset_38| Int)) (or (< v_ArrVal_5107 |v_pusherThread1of1ForFork0_fifo_push_#t~mem32#1.offset_38|) (forall ((|v_pusherThread1of1ForFork0_fifo_push_#t~mem34#1.offset_28| Int) (v_ArrVal_5120 Int)) (let ((.cse20 (select |c_#memory_$Pointer$.offset| |v_pusherThread1of1ForFork0_fifo_push_#t~malloc29#1.base_20|))) (let ((.cse19 (store |c_#memory_$Pointer$.offset| |v_pusherThread1of1ForFork0_fifo_push_#t~malloc29#1.base_20| (store (store (store (store .cse20 0 v_ArrVal_5112) 16 v_ArrVal_5116) |v_pusherThread1of1ForFork0_fifo_push_#t~mem32#1.offset_38| v_ArrVal_5120) 12 (+ |v_pusherThread1of1ForFork0_fifo_push_#t~mem34#1.offset_28| 4))))) (or (forall ((v_ArrVal_5121 (Array Int Int)) (v_ArrVal_5123 (Array Int Int)) (v_arrayElimCell_36 Int)) (let ((.cse17 (store .cse19 (select (select (store |c_#memory_$Pointer$.base| |v_pusherThread1of1ForFork0_fifo_push_#t~malloc29#1.base_20| v_ArrVal_5121) |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse1) v_ArrVal_5123))) (let ((.cse18 (+ (select (select .cse17 |c_pusherThread1of1ForFork0_~q~0#1.base|) .cse5) 12))) (< (select (select (store .cse17 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| (store (select .cse17 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse1 0)) v_arrayElimCell_36) .cse18) .cse18)))) (< (select (store (store (store (store .cse20 12 v_ArrVal_5107) 0 v_ArrVal_5112) 16 v_ArrVal_5116) |v_pusherThread1of1ForFork0_fifo_push_#t~mem32#1.offset_38| v_ArrVal_5120) 12) |v_pusherThread1of1ForFork0_fifo_push_#t~mem34#1.offset_28|) (= (select (select .cse19 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse1) 0))))))))) (< |c_#StackHeapBarrier| (+ |v_pusherThread1of1ForFork0_fifo_push_#t~malloc29#1.base_20| 1)))))) (.cse9 (= |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| |c_pusherThread1of1ForFork0_~q~0#1.offset|)) (.cse7 (= |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| |c_pusherThread1of1ForFork0_~q~0#1.base|))) (and (forall ((|v_pusherThread1of1ForFork0_fifo_push_#t~malloc29#1.base_20| Int)) (or (< |c_#StackHeapBarrier| (+ |v_pusherThread1of1ForFork0_fifo_push_#t~malloc29#1.base_20| 1)) (forall ((v_ArrVal_5107 Int)) (or (< 4 v_ArrVal_5107) (forall ((v_ArrVal_5116 Int) (v_ArrVal_5112 Int) (|v_pusherThread1of1ForFork0_fifo_push_#t~mem32#1.offset_38| Int)) (or (< v_ArrVal_5107 |v_pusherThread1of1ForFork0_fifo_push_#t~mem32#1.offset_38|) (forall ((v_ArrVal_5120 Int)) (let ((.cse6 (select |c_#memory_$Pointer$.offset| |v_pusherThread1of1ForFork0_fifo_push_#t~malloc29#1.base_20|))) (let ((.cse0 (store (store (store (store .cse6 12 v_ArrVal_5107) 0 v_ArrVal_5112) 16 v_ArrVal_5116) |v_pusherThread1of1ForFork0_fifo_push_#t~mem32#1.offset_38| v_ArrVal_5120))) (or (= 0 (select (select (store |c_#memory_$Pointer$.offset| |v_pusherThread1of1ForFork0_fifo_push_#t~malloc29#1.base_20| .cse0) |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse1)) (forall ((v_ArrVal_5121 (Array Int Int)) (v_ArrVal_5123 (Array Int Int)) (v_arrayElimCell_36 Int) (|v_pusherThread1of1ForFork0_fifo_push_#t~mem34#1.offset_28| Int)) (let ((.cse4 (store (store |c_#memory_$Pointer$.offset| |v_pusherThread1of1ForFork0_fifo_push_#t~malloc29#1.base_20| (store (store (store (store .cse6 0 v_ArrVal_5112) 16 v_ArrVal_5116) |v_pusherThread1of1ForFork0_fifo_push_#t~mem32#1.offset_38| v_ArrVal_5120) 12 (+ |v_pusherThread1of1ForFork0_fifo_push_#t~mem34#1.offset_28| 4))) (select (select (store |c_#memory_$Pointer$.base| |v_pusherThread1of1ForFork0_fifo_push_#t~malloc29#1.base_20| v_ArrVal_5121) |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse1) v_ArrVal_5123))) (let ((.cse2 (store .cse4 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| (store (select .cse4 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse1 0)))) (or (let ((.cse3 (+ (select (select .cse4 |c_pusherThread1of1ForFork0_~q~0#1.base|) .cse5) 12))) (< (select (select .cse2 v_arrayElimCell_36) .cse3) .cse3)) (< (select .cse0 12) |v_pusherThread1of1ForFork0_fifo_push_#t~mem34#1.offset_28|) (< (select (select .cse2 |v_pusherThread1of1ForFork0_fifo_push_#t~malloc29#1.base_20|) 12) 12))))))))))))))) (or .cse7 .cse8) (or .cse9 .cse8) (or (forall ((v_ArrVal_5121 (Array Int Int)) (v_ArrVal_5123 (Array Int Int)) (v_ArrVal_5107 Int) (|v_pusherThread1of1ForFork0_fifo_push_#t~malloc29#1.base_20| Int) (v_ArrVal_5116 Int) (v_ArrVal_5112 Int) (|v_pusherThread1of1ForFork0_fifo_push_#t~mem34#1.offset_28| Int) (|v_pusherThread1of1ForFork0_fifo_push_#t~mem32#1.offset_38| Int) (v_ArrVal_5120 Int)) (let ((.cse12 (select |c_#memory_$Pointer$.offset| |v_pusherThread1of1ForFork0_fifo_push_#t~malloc29#1.base_20|))) (let ((.cse10 (store (store (store (store .cse12 12 v_ArrVal_5107) 0 v_ArrVal_5112) 16 v_ArrVal_5116) |v_pusherThread1of1ForFork0_fifo_push_#t~mem32#1.offset_38| v_ArrVal_5120))) (or (< v_ArrVal_5107 |v_pusherThread1of1ForFork0_fifo_push_#t~mem32#1.offset_38|) (< 4 v_ArrVal_5107) (= 0 (select (select (store |c_#memory_$Pointer$.offset| |v_pusherThread1of1ForFork0_fifo_push_#t~malloc29#1.base_20| .cse10) |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse1)) (< (select .cse10 12) |v_pusherThread1of1ForFork0_fifo_push_#t~mem34#1.offset_28|) (< |c_#StackHeapBarrier| (+ |v_pusherThread1of1ForFork0_fifo_push_#t~malloc29#1.base_20| 1)) (< (select (select (let ((.cse11 (store (store |c_#memory_$Pointer$.offset| |v_pusherThread1of1ForFork0_fifo_push_#t~malloc29#1.base_20| (store (store (store (store .cse12 0 v_ArrVal_5112) 16 v_ArrVal_5116) |v_pusherThread1of1ForFork0_fifo_push_#t~mem32#1.offset_38| v_ArrVal_5120) 12 (+ |v_pusherThread1of1ForFork0_fifo_push_#t~mem34#1.offset_28| 4))) (select (select (store |c_#memory_$Pointer$.base| |v_pusherThread1of1ForFork0_fifo_push_#t~malloc29#1.base_20| v_ArrVal_5121) |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse1) v_ArrVal_5123))) (store .cse11 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| (store (select .cse11 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse1 0))) |v_pusherThread1of1ForFork0_fifo_push_#t~malloc29#1.base_20|) 12) 12))))) (not .cse9) (not .cse7))))) is different from false [2024-10-26 01:51:03,314 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse7 (+ |c_pusherThread1of1ForFork0_~q~0#1.offset| 4)) (.cse3 (+ |c_pusherThread1of1ForFork0_fifo_push_#in~self#1.offset| 4))) (let ((.cse1 (= |c_pusherThread1of1ForFork0_~q~0#1.base| |c_pusherThread1of1ForFork0_fifo_push_#in~self#1.base|)) (.cse0 (and (forall ((|v_pusherThread1of1ForFork0_fifo_push_#t~malloc29#1.base_20| Int)) (or (< |c_#StackHeapBarrier| (+ |v_pusherThread1of1ForFork0_fifo_push_#t~malloc29#1.base_20| 1)) (forall ((v_ArrVal_5107 Int)) (or (< 4 v_ArrVal_5107) (forall ((v_ArrVal_5116 Int) (v_ArrVal_5112 Int) (|v_pusherThread1of1ForFork0_fifo_push_#t~mem32#1.offset_38| Int)) (or (< v_ArrVal_5107 |v_pusherThread1of1ForFork0_fifo_push_#t~mem32#1.offset_38|) (forall ((|v_pusherThread1of1ForFork0_fifo_push_#t~mem34#1.offset_28| Int) (v_ArrVal_5120 Int)) (let ((.cse16 (select |c_#memory_$Pointer$.offset| |v_pusherThread1of1ForFork0_fifo_push_#t~malloc29#1.base_20|))) (or (forall ((v_ArrVal_5121 (Array Int Int)) (v_ArrVal_5123 (Array Int Int)) (v_arrayElimCell_36 Int)) (let ((.cse13 (select (select (store |c_#memory_$Pointer$.base| |v_pusherThread1of1ForFork0_fifo_push_#t~malloc29#1.base_20| v_ArrVal_5121) |c_pusherThread1of1ForFork0_fifo_push_#in~self#1.base|) .cse3))) (or (= .cse13 |v_pusherThread1of1ForFork0_fifo_push_#t~malloc29#1.base_20|) (let ((.cse14 (store (store |c_#memory_$Pointer$.offset| |v_pusherThread1of1ForFork0_fifo_push_#t~malloc29#1.base_20| (store (store (store (store .cse16 0 v_ArrVal_5112) 16 v_ArrVal_5116) |v_pusherThread1of1ForFork0_fifo_push_#t~mem32#1.offset_38| v_ArrVal_5120) 12 (+ |v_pusherThread1of1ForFork0_fifo_push_#t~mem34#1.offset_28| 4))) .cse13 v_ArrVal_5123))) (let ((.cse15 (+ (select (select .cse14 |c_pusherThread1of1ForFork0_~q~0#1.base|) .cse7) 12))) (< (select (select (store .cse14 |c_pusherThread1of1ForFork0_fifo_push_#in~self#1.base| (store (select .cse14 |c_pusherThread1of1ForFork0_fifo_push_#in~self#1.base|) .cse3 0)) v_arrayElimCell_36) .cse15) .cse15)))))) (< (select (store (store (store (store .cse16 12 v_ArrVal_5107) 0 v_ArrVal_5112) 16 v_ArrVal_5116) |v_pusherThread1of1ForFork0_fifo_push_#t~mem32#1.offset_38| v_ArrVal_5120) 12) |v_pusherThread1of1ForFork0_fifo_push_#t~mem34#1.offset_28|)))))))))) (forall ((|v_pusherThread1of1ForFork0_fifo_push_#t~malloc29#1.base_20| Int)) (or (forall ((v_ArrVal_5107 Int)) (or (< 4 v_ArrVal_5107) (forall ((v_ArrVal_5116 Int) (v_ArrVal_5112 Int) (|v_pusherThread1of1ForFork0_fifo_push_#t~mem32#1.offset_38| Int)) (or (< v_ArrVal_5107 |v_pusherThread1of1ForFork0_fifo_push_#t~mem32#1.offset_38|) (forall ((|v_pusherThread1of1ForFork0_fifo_push_#t~mem34#1.offset_28| Int) (v_ArrVal_5120 Int)) (let ((.cse20 (select |c_#memory_$Pointer$.offset| |v_pusherThread1of1ForFork0_fifo_push_#t~malloc29#1.base_20|))) (let ((.cse19 (store |c_#memory_$Pointer$.offset| |v_pusherThread1of1ForFork0_fifo_push_#t~malloc29#1.base_20| (store (store (store (store .cse20 0 v_ArrVal_5112) 16 v_ArrVal_5116) |v_pusherThread1of1ForFork0_fifo_push_#t~mem32#1.offset_38| v_ArrVal_5120) 12 (+ |v_pusherThread1of1ForFork0_fifo_push_#t~mem34#1.offset_28| 4))))) (or (forall ((v_ArrVal_5121 (Array Int Int)) (v_ArrVal_5123 (Array Int Int)) (v_arrayElimCell_36 Int)) (let ((.cse17 (store .cse19 (select (select (store |c_#memory_$Pointer$.base| |v_pusherThread1of1ForFork0_fifo_push_#t~malloc29#1.base_20| v_ArrVal_5121) |c_pusherThread1of1ForFork0_fifo_push_#in~self#1.base|) .cse3) v_ArrVal_5123))) (let ((.cse18 (+ (select (select .cse17 |c_pusherThread1of1ForFork0_~q~0#1.base|) .cse7) 12))) (< (select (select (store .cse17 |c_pusherThread1of1ForFork0_fifo_push_#in~self#1.base| (store (select .cse17 |c_pusherThread1of1ForFork0_fifo_push_#in~self#1.base|) .cse3 0)) v_arrayElimCell_36) .cse18) .cse18)))) (< (select (store (store (store (store .cse20 12 v_ArrVal_5107) 0 v_ArrVal_5112) 16 v_ArrVal_5116) |v_pusherThread1of1ForFork0_fifo_push_#t~mem32#1.offset_38| v_ArrVal_5120) 12) |v_pusherThread1of1ForFork0_fifo_push_#t~mem34#1.offset_28|) (= (select (select .cse19 |c_pusherThread1of1ForFork0_fifo_push_#in~self#1.base|) .cse3) 0))))))))) (< |c_#StackHeapBarrier| (+ |v_pusherThread1of1ForFork0_fifo_push_#t~malloc29#1.base_20| 1)))))) (.cse9 (= |c_pusherThread1of1ForFork0_fifo_push_#in~self#1.offset| |c_pusherThread1of1ForFork0_~q~0#1.offset|))) (and (or .cse0 .cse1) (forall ((|v_pusherThread1of1ForFork0_fifo_push_#t~malloc29#1.base_20| Int)) (or (forall ((v_ArrVal_5107 Int)) (or (< 4 v_ArrVal_5107) (forall ((v_ArrVal_5116 Int) (v_ArrVal_5112 Int) (|v_pusherThread1of1ForFork0_fifo_push_#t~mem32#1.offset_38| Int)) (or (< v_ArrVal_5107 |v_pusherThread1of1ForFork0_fifo_push_#t~mem32#1.offset_38|) (forall ((v_ArrVal_5120 Int)) (let ((.cse8 (select |c_#memory_$Pointer$.offset| |v_pusherThread1of1ForFork0_fifo_push_#t~malloc29#1.base_20|))) (let ((.cse2 (store (store (store (store .cse8 12 v_ArrVal_5107) 0 v_ArrVal_5112) 16 v_ArrVal_5116) |v_pusherThread1of1ForFork0_fifo_push_#t~mem32#1.offset_38| v_ArrVal_5120))) (or (= (select (select (store |c_#memory_$Pointer$.offset| |v_pusherThread1of1ForFork0_fifo_push_#t~malloc29#1.base_20| .cse2) |c_pusherThread1of1ForFork0_fifo_push_#in~self#1.base|) .cse3) 0) (forall ((v_ArrVal_5121 (Array Int Int)) (v_ArrVal_5123 (Array Int Int)) (v_arrayElimCell_36 Int) (|v_pusherThread1of1ForFork0_fifo_push_#t~mem34#1.offset_28| Int)) (let ((.cse6 (store (store |c_#memory_$Pointer$.offset| |v_pusherThread1of1ForFork0_fifo_push_#t~malloc29#1.base_20| (store (store (store (store .cse8 0 v_ArrVal_5112) 16 v_ArrVal_5116) |v_pusherThread1of1ForFork0_fifo_push_#t~mem32#1.offset_38| v_ArrVal_5120) 12 (+ |v_pusherThread1of1ForFork0_fifo_push_#t~mem34#1.offset_28| 4))) (select (select (store |c_#memory_$Pointer$.base| |v_pusherThread1of1ForFork0_fifo_push_#t~malloc29#1.base_20| v_ArrVal_5121) |c_pusherThread1of1ForFork0_fifo_push_#in~self#1.base|) .cse3) v_ArrVal_5123))) (let ((.cse4 (store .cse6 |c_pusherThread1of1ForFork0_fifo_push_#in~self#1.base| (store (select .cse6 |c_pusherThread1of1ForFork0_fifo_push_#in~self#1.base|) .cse3 0)))) (or (< (select (select .cse4 |v_pusherThread1of1ForFork0_fifo_push_#t~malloc29#1.base_20|) 12) 12) (< (select .cse2 12) |v_pusherThread1of1ForFork0_fifo_push_#t~mem34#1.offset_28|) (let ((.cse5 (+ (select (select .cse6 |c_pusherThread1of1ForFork0_~q~0#1.base|) .cse7) 12))) (< (select (select .cse4 v_arrayElimCell_36) .cse5) .cse5)))))))))))))) (< |c_#StackHeapBarrier| (+ |v_pusherThread1of1ForFork0_fifo_push_#t~malloc29#1.base_20| 1)))) (or (not .cse9) (not .cse1) (forall ((v_ArrVal_5121 (Array Int Int)) (v_ArrVal_5123 (Array Int Int)) (v_ArrVal_5107 Int) (|v_pusherThread1of1ForFork0_fifo_push_#t~malloc29#1.base_20| Int) (v_ArrVal_5116 Int) (v_ArrVal_5112 Int) (|v_pusherThread1of1ForFork0_fifo_push_#t~mem34#1.offset_28| Int) (|v_pusherThread1of1ForFork0_fifo_push_#t~mem32#1.offset_38| Int) (v_ArrVal_5120 Int)) (let ((.cse12 (select |c_#memory_$Pointer$.offset| |v_pusherThread1of1ForFork0_fifo_push_#t~malloc29#1.base_20|))) (let ((.cse10 (store (store (store (store .cse12 12 v_ArrVal_5107) 0 v_ArrVal_5112) 16 v_ArrVal_5116) |v_pusherThread1of1ForFork0_fifo_push_#t~mem32#1.offset_38| v_ArrVal_5120))) (or (= (select (select (store |c_#memory_$Pointer$.offset| |v_pusherThread1of1ForFork0_fifo_push_#t~malloc29#1.base_20| .cse10) |c_pusherThread1of1ForFork0_fifo_push_#in~self#1.base|) .cse3) 0) (< v_ArrVal_5107 |v_pusherThread1of1ForFork0_fifo_push_#t~mem32#1.offset_38|) (< 4 v_ArrVal_5107) (< (select (select (let ((.cse11 (store (store |c_#memory_$Pointer$.offset| |v_pusherThread1of1ForFork0_fifo_push_#t~malloc29#1.base_20| (store (store (store (store .cse12 0 v_ArrVal_5112) 16 v_ArrVal_5116) |v_pusherThread1of1ForFork0_fifo_push_#t~mem32#1.offset_38| v_ArrVal_5120) 12 (+ |v_pusherThread1of1ForFork0_fifo_push_#t~mem34#1.offset_28| 4))) (select (select (store |c_#memory_$Pointer$.base| |v_pusherThread1of1ForFork0_fifo_push_#t~malloc29#1.base_20| v_ArrVal_5121) |c_pusherThread1of1ForFork0_fifo_push_#in~self#1.base|) .cse3) v_ArrVal_5123))) (store .cse11 |c_pusherThread1of1ForFork0_fifo_push_#in~self#1.base| (store (select .cse11 |c_pusherThread1of1ForFork0_fifo_push_#in~self#1.base|) .cse3 0))) |v_pusherThread1of1ForFork0_fifo_push_#t~malloc29#1.base_20|) 12) 12) (< (select .cse10 12) |v_pusherThread1of1ForFork0_fifo_push_#t~mem34#1.offset_28|) (< |c_#StackHeapBarrier| (+ |v_pusherThread1of1ForFork0_fifo_push_#t~malloc29#1.base_20| 1))))))) (or .cse0 .cse9)))) is different from false [2024-10-26 01:51:05,666 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (+ |c_pusherThread1of1ForFork0_~q~0#1.offset| 4))) (and (forall ((|v_pusherThread1of1ForFork0_fifo_push_#t~malloc29#1.base_20| Int)) (or (forall ((v_ArrVal_5107 Int)) (or (forall ((v_ArrVal_5116 Int) (v_ArrVal_5112 Int) (|v_pusherThread1of1ForFork0_fifo_push_#t~mem32#1.offset_38| Int)) (or (< v_ArrVal_5107 |v_pusherThread1of1ForFork0_fifo_push_#t~mem32#1.offset_38|) (forall ((v_ArrVal_5120 Int)) (let ((.cse6 (select |c_#memory_$Pointer$.offset| |v_pusherThread1of1ForFork0_fifo_push_#t~malloc29#1.base_20|))) (let ((.cse0 (store (store (store (store .cse6 12 v_ArrVal_5107) 0 v_ArrVal_5112) 16 v_ArrVal_5116) |v_pusherThread1of1ForFork0_fifo_push_#t~mem32#1.offset_38| v_ArrVal_5120))) (or (forall ((v_ArrVal_5121 (Array Int Int)) (v_ArrVal_5123 (Array Int Int)) (v_arrayElimCell_36 Int) (|v_pusherThread1of1ForFork0_fifo_push_#t~mem34#1.offset_28| Int)) (let ((.cse5 (store (store |c_#memory_$Pointer$.offset| |v_pusherThread1of1ForFork0_fifo_push_#t~malloc29#1.base_20| (store (store (store (store .cse6 0 v_ArrVal_5112) 16 v_ArrVal_5116) |v_pusherThread1of1ForFork0_fifo_push_#t~mem32#1.offset_38| v_ArrVal_5120) 12 (+ |v_pusherThread1of1ForFork0_fifo_push_#t~mem34#1.offset_28| 4))) (select (select (store |c_#memory_$Pointer$.base| |v_pusherThread1of1ForFork0_fifo_push_#t~malloc29#1.base_20| v_ArrVal_5121) |c_pusherThread1of1ForFork0_~q~0#1.base|) .cse4) v_ArrVal_5123))) (let ((.cse3 (select .cse5 |c_pusherThread1of1ForFork0_~q~0#1.base|))) (let ((.cse1 (store .cse5 |c_pusherThread1of1ForFork0_~q~0#1.base| (store .cse3 .cse4 0)))) (or (< (select .cse0 12) |v_pusherThread1of1ForFork0_fifo_push_#t~mem34#1.offset_28|) (let ((.cse2 (+ (select .cse3 .cse4) 12))) (< (select (select .cse1 v_arrayElimCell_36) .cse2) .cse2)) (< (select (select .cse1 |v_pusherThread1of1ForFork0_fifo_push_#t~malloc29#1.base_20|) 12) 12)))))) (= (select (select (store |c_#memory_$Pointer$.offset| |v_pusherThread1of1ForFork0_fifo_push_#t~malloc29#1.base_20| .cse0) |c_pusherThread1of1ForFork0_~q~0#1.base|) .cse4) 0))))))) (< 4 v_ArrVal_5107))) (< |c_#StackHeapBarrier| (+ |v_pusherThread1of1ForFork0_fifo_push_#t~malloc29#1.base_20| 1)))) (forall ((v_ArrVal_5121 (Array Int Int)) (v_ArrVal_5123 (Array Int Int)) (v_ArrVal_5107 Int) (|v_pusherThread1of1ForFork0_fifo_push_#t~malloc29#1.base_20| Int) (v_ArrVal_5116 Int) (v_ArrVal_5112 Int) (|v_pusherThread1of1ForFork0_fifo_push_#t~mem34#1.offset_28| Int) (|v_pusherThread1of1ForFork0_fifo_push_#t~mem32#1.offset_38| Int) (v_ArrVal_5120 Int)) (let ((.cse9 (select |c_#memory_$Pointer$.offset| |v_pusherThread1of1ForFork0_fifo_push_#t~malloc29#1.base_20|))) (let ((.cse7 (store (store (store (store .cse9 12 v_ArrVal_5107) 0 v_ArrVal_5112) 16 v_ArrVal_5116) |v_pusherThread1of1ForFork0_fifo_push_#t~mem32#1.offset_38| v_ArrVal_5120))) (or (< v_ArrVal_5107 |v_pusherThread1of1ForFork0_fifo_push_#t~mem32#1.offset_38|) (< 4 v_ArrVal_5107) (< (select .cse7 12) |v_pusherThread1of1ForFork0_fifo_push_#t~mem34#1.offset_28|) (< |c_#StackHeapBarrier| (+ |v_pusherThread1of1ForFork0_fifo_push_#t~malloc29#1.base_20| 1)) (= (select (select (store |c_#memory_$Pointer$.offset| |v_pusherThread1of1ForFork0_fifo_push_#t~malloc29#1.base_20| .cse7) |c_pusherThread1of1ForFork0_~q~0#1.base|) .cse4) 0) (< (select (select (let ((.cse8 (store (store |c_#memory_$Pointer$.offset| |v_pusherThread1of1ForFork0_fifo_push_#t~malloc29#1.base_20| (store (store (store (store .cse9 0 v_ArrVal_5112) 16 v_ArrVal_5116) |v_pusherThread1of1ForFork0_fifo_push_#t~mem32#1.offset_38| v_ArrVal_5120) 12 (+ |v_pusherThread1of1ForFork0_fifo_push_#t~mem34#1.offset_28| 4))) (select (select (store |c_#memory_$Pointer$.base| |v_pusherThread1of1ForFork0_fifo_push_#t~malloc29#1.base_20| v_ArrVal_5121) |c_pusherThread1of1ForFork0_~q~0#1.base|) .cse4) v_ArrVal_5123))) (store .cse8 |c_pusherThread1of1ForFork0_~q~0#1.base| (store (select .cse8 |c_pusherThread1of1ForFork0_~q~0#1.base|) .cse4 0))) |v_pusherThread1of1ForFork0_fifo_push_#t~malloc29#1.base_20|) 12) 12))))))) is different from false [2024-10-26 01:51:06,943 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-26 01:51:06,945 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-26 01:51:07,391 INFO L349 Elim1Store]: treesize reduction 359, result has 32.4 percent of original size [2024-10-26 01:51:07,392 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 8 case distinctions, treesize of input 90386 treesize of output 89715 [2024-10-26 01:51:08,871 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 01:51:08,872 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 73 treesize of output 64 [2024-10-26 01:51:08,975 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 01:51:08,976 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 1736 treesize of output 1744 [2024-10-26 01:51:09,108 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 01:51:09,108 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 694 treesize of output 591 [2024-10-26 01:51:09,245 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 336 treesize of output 296 [2024-10-26 01:51:09,317 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 312 treesize of output 296 [2024-10-26 01:51:09,434 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-26 01:51:09,503 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 [2024-10-26 01:51:09,522 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-26 01:51:09,530 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2024-10-26 01:51:09,764 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 01:51:09,764 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 111 treesize of output 111 [2024-10-26 01:51:09,904 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-26 01:51:09,931 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 01:51:09,932 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 63 treesize of output 63 [2024-10-26 01:51:12,523 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 01:51:12,524 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 67 treesize of output 81 [2024-10-26 01:51:12,654 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 01:51:12,655 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 01:51:12,666 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-26 01:51:12,667 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-26 01:51:12,696 INFO L349 Elim1Store]: treesize reduction 244, result has 0.4 percent of original size [2024-10-26 01:51:12,696 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 6 case distinctions, treesize of input 6039 treesize of output 1 [2024-10-26 01:51:24,382 INFO L134 CoverageAnalysis]: Checked inductivity of 1276 backedges. 396 proven. 472 refuted. 0 times theorem prover too weak. 134 trivial. 274 not checked. [2024-10-26 01:51:24,382 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [713054617] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-26 01:51:24,383 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-26 01:51:24,383 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 49, 42] total 138 [2024-10-26 01:51:24,383 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1452293060] [2024-10-26 01:51:24,383 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-26 01:51:24,385 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 138 states [2024-10-26 01:51:24,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-26 01:51:24,388 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 138 interpolants. [2024-10-26 01:51:24,393 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=770, Invalid=15022, Unknown=254, NotChecked=2860, Total=18906 [2024-10-26 01:51:24,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-26 01:51:24,397 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-26 01:51:24,398 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 138 states, 138 states have (on average 12.246376811594203) internal successors, (1690), 138 states have internal predecessors, (1690), 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) [2024-10-26 01:51:24,399 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-26 01:51:24,399 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 01:51:24,399 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 01:51:24,399 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 01:51:24,399 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 01:51:24,399 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 01:51:24,399 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 01:51:24,399 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 01:51:24,399 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 01:51:24,399 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 01:51:24,400 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 01:51:24,400 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 16 states. [2024-10-26 01:51:24,400 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2024-10-26 01:51:24,400 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-26 01:51:33,379 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] [2024-10-26 01:51:38,407 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] [2024-10-26 01:51:45,956 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] [2024-10-26 01:51:47,895 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] [2024-10-26 01:51:51,854 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] [2024-10-26 01:51:54,560 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] [2024-10-26 01:51:58,472 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.24s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-26 01:52:03,102 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] [2024-10-26 01:52:08,366 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.93s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-26 01:52:10,376 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] [2024-10-26 01:52:13,073 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] [2024-10-26 01:52:16,089 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.99s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-26 01:52:19,770 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.22s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-26 01:52:22,091 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] [2024-10-26 01:52:24,328 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.57s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-26 01:52:34,476 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.04s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-26 01:52:42,227 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] [2024-10-26 01:52:45,928 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.76s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-26 01:52:47,939 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] [2024-10-26 01:52:51,581 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] [2024-10-26 01:52:55,529 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.85s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-26 01:52:57,816 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.31s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-26 01:53:00,333 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] [2024-10-26 01:53:06,833 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] [2024-10-26 01:53:08,856 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] [2024-10-26 01:53:11,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] [2024-10-26 01:53:14,966 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] [2024-10-26 01:53:22,768 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] [2024-10-26 01:53:28,224 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] [2024-10-26 01:53:30,666 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] [2024-10-26 01:53:33,153 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] [2024-10-26 01:53:38,334 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.06s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-26 01:53:41,011 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] [2024-10-26 01:53:43,580 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] [2024-10-26 01:53:46,548 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] [2024-10-26 01:53:50,445 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] [2024-10-26 01:53:52,592 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.27s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-26 01:53:57,986 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.16s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-26 01:54:10,761 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] [2024-10-26 01:54:13,501 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.54s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-26 01:54:17,250 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.78s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-26 01:54:20,028 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] [2024-10-26 01:54:23,935 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] [2024-10-26 01:54:26,625 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.37s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-26 01:54:28,637 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] [2024-10-26 01:54:30,648 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] [2024-10-26 01:54:37,712 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] [2024-10-26 01:54:40,839 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] [2024-10-26 01:54:44,351 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] [2024-10-26 01:54:49,925 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] [2024-10-26 01:54:53,185 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] [2024-10-26 01:54:58,140 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.07s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-26 01:55:15,162 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] [2024-10-26 01:55:43,601 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.45s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-26 01:56:12,537 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.20s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-26 01:56:58,467 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.95s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-26 01:57:07,087 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] [2024-10-26 01:57:09,326 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.25s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-26 01:57:13,322 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] [2024-10-26 01:57:19,336 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] [2024-10-26 01:57:20,882 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-26 01:57:22,894 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] [2024-10-26 01:57:29,402 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] [2024-10-26 01:57:34,092 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.08s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-26 01:57:45,950 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] [2024-10-26 01:58:02,612 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.20s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-26 01:58:30,113 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.46s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-26 01:58:32,414 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] [2024-10-26 01:58:34,494 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.77s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-26 01:58:39,072 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] [2024-10-26 01:59:16,050 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.64s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-26 01:59:17,606 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.14s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-26 01:59:20,992 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] Killed by 15