/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/gemcutter/NewStatesSleep-VarAbsGlobalSyntactic.epf -tc ../../../trunk/examples/toolchains/AutomizerBpl.xml -i ../../../trunk/examples/boogie-benchmarks-from-svcomp-memsafety-concurrent/queue_ok_longest.line363.bpl -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.por-optimizations-5c708e3-m [2022-09-30 06:23:00,992 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-09-30 06:23:00,993 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-09-30 06:23:01,018 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-09-30 06:23:01,018 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-09-30 06:23:01,019 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-09-30 06:23:01,020 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-09-30 06:23:01,022 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-09-30 06:23:01,028 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-09-30 06:23:01,029 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-09-30 06:23:01,029 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-09-30 06:23:01,030 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-09-30 06:23:01,031 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-09-30 06:23:01,031 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-09-30 06:23:01,032 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-09-30 06:23:01,033 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-09-30 06:23:01,034 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-09-30 06:23:01,034 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-09-30 06:23:01,036 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-09-30 06:23:01,037 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-09-30 06:23:01,039 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-09-30 06:23:01,042 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-09-30 06:23:01,043 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-09-30 06:23:01,044 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-09-30 06:23:01,050 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-09-30 06:23:01,050 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-09-30 06:23:01,051 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-09-30 06:23:01,051 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-09-30 06:23:01,052 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-09-30 06:23:01,052 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-09-30 06:23:01,053 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-09-30 06:23:01,053 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-09-30 06:23:01,054 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-09-30 06:23:01,054 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-09-30 06:23:01,055 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-09-30 06:23:01,055 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-09-30 06:23:01,056 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-09-30 06:23:01,056 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-09-30 06:23:01,056 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-09-30 06:23:01,057 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-09-30 06:23:01,057 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-09-30 06:23:01,064 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/gemcutter/NewStatesSleep-VarAbsGlobalSyntactic.epf [2022-09-30 06:23:01,096 INFO L113 SettingsManager]: Loading preferences was successful [2022-09-30 06:23:01,096 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-09-30 06:23:01,096 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-09-30 06:23:01,096 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-09-30 06:23:01,097 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-09-30 06:23:01,097 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-09-30 06:23:01,097 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-09-30 06:23:01,098 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-09-30 06:23:01,098 INFO L138 SettingsManager]: * Use SBE=true [2022-09-30 06:23:01,098 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-09-30 06:23:01,098 INFO L138 SettingsManager]: * sizeof long=4 [2022-09-30 06:23:01,098 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-09-30 06:23:01,098 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-09-30 06:23:01,098 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-09-30 06:23:01,098 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-09-30 06:23:01,099 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-09-30 06:23:01,099 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-09-30 06:23:01,099 INFO L138 SettingsManager]: * sizeof long double=12 [2022-09-30 06:23:01,103 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-09-30 06:23:01,103 INFO L138 SettingsManager]: * Use constant arrays=true [2022-09-30 06:23:01,103 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-09-30 06:23:01,104 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-09-30 06:23:01,104 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-09-30 06:23:01,104 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-09-30 06:23:01,104 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-09-30 06:23:01,104 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-09-30 06:23:01,104 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-09-30 06:23:01,104 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-09-30 06:23:01,105 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-09-30 06:23:01,105 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-09-30 06:23:01,105 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-09-30 06:23:01,105 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-09-30 06:23:01,105 INFO L138 SettingsManager]: * Abstraction used for commutativity in POR=VARIABLES_GLOBAL [2022-09-30 06:23:01,105 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2022-09-30 06:23:01,105 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-09-30 06:23:01,105 INFO L138 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_ERROR_LOCATION [2022-09-30 06:23:01,106 INFO L138 SettingsManager]: * Partial Order Reduction in concurrent analysis=SLEEP_NEW_STATES [2022-09-30 06:23:01,106 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-09-30 06:23:01,106 INFO L138 SettingsManager]: * Independence relation used for POR in concurrent analysis=SYNTACTIC 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/UAutomizer-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 [2022-09-30 06:23:01,324 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-09-30 06:23:01,344 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-09-30 06:23:01,346 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-09-30 06:23:01,346 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2022-09-30 06:23:01,350 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2022-09-30 06:23:01,351 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/boogie-benchmarks-from-svcomp-memsafety-concurrent/queue_ok_longest.line363.bpl [2022-09-30 06:23:01,352 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/boogie-benchmarks-from-svcomp-memsafety-concurrent/queue_ok_longest.line363.bpl' [2022-09-30 06:23:01,412 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-09-30 06:23:01,414 INFO L131 ToolchainWalker]: Walking toolchain with 3 elements. [2022-09-30 06:23:01,416 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-09-30 06:23:01,416 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-09-30 06:23:01,416 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-09-30 06:23:01,431 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "queue_ok_longest.line363.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 06:23:01" (1/1) ... [2022-09-30 06:23:01,432 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "queue_ok_longest.line363.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 06:23:01" (1/1) ... [2022-09-30 06:23:01,456 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "queue_ok_longest.line363.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 06:23:01" (1/1) ... [2022-09-30 06:23:01,456 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "queue_ok_longest.line363.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 06:23:01" (1/1) ... [2022-09-30 06:23:01,480 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "queue_ok_longest.line363.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 06:23:01" (1/1) ... [2022-09-30 06:23:01,485 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "queue_ok_longest.line363.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 06:23:01" (1/1) ... [2022-09-30 06:23:01,488 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "queue_ok_longest.line363.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 06:23:01" (1/1) ... [2022-09-30 06:23:01,498 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-09-30 06:23:01,500 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-09-30 06:23:01,500 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-09-30 06:23:01,500 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-09-30 06:23:01,510 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "queue_ok_longest.line363.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 06:23:01" (1/1) ... [2022-09-30 06:23:01,522 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-09-30 06:23:01,529 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-30 06:23:01,547 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-09-30 06:23:01,555 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-09-30 06:23:01,588 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2022-09-30 06:23:01,588 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2022-09-30 06:23:01,588 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2022-09-30 06:23:01,588 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2022-09-30 06:23:01,589 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-09-30 06:23:01,589 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-09-30 06:23:01,590 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-09-30 06:23:01,720 INFO L234 CfgBuilder]: Building ICFG [2022-09-30 06:23:01,722 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-09-30 06:23:02,321 INFO L275 CfgBuilder]: Performing block encoding [2022-09-30 06:23:02,346 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-09-30 06:23:02,347 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-09-30 06:23:02,354 INFO L202 PluginConnector]: Adding new model queue_ok_longest.line363.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.09 06:23:02 BoogieIcfgContainer [2022-09-30 06:23:02,355 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-09-30 06:23:02,358 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-09-30 06:23:02,359 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-09-30 06:23:02,362 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-09-30 06:23:02,363 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "queue_ok_longest.line363.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 06:23:01" (1/2) ... [2022-09-30 06:23:02,364 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a09a7a9 and model type queue_ok_longest.line363.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.09 06:23:02, skipping insertion in model container [2022-09-30 06:23:02,365 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "queue_ok_longest.line363.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.09 06:23:02" (2/2) ... [2022-09-30 06:23:02,373 INFO L112 eAbstractionObserver]: Analyzing ICFG queue_ok_longest.line363.bpl [2022-09-30 06:23:02,380 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-09-30 06:23:02,388 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-09-30 06:23:02,389 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-09-30 06:23:02,389 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-09-30 06:23:02,553 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-09-30 06:23:02,615 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SYNTACTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-09-30 06:23:02,616 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2022-09-30 06:23:02,616 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-30 06:23:02,623 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2022-09-30 06:23:02,635 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2022-09-30 06:23:02,675 INFO L158 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2022-09-30 06:23:02,684 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES ======== [2022-09-30 06:23:02,693 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, 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;@78c770bb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-09-30 06:23:02,693 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-09-30 06:23:02,793 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 1 remaining) [2022-09-30 06:23:02,799 INFO L444 BasicCegarLoop]: Path program histogram: [] [2022-09-30 06:23:02,803 INFO L307 ceAbstractionStarter]: Result for error location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES was SAFE (1/4) [2022-09-30 06:23:02,818 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SYNTACTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-09-30 06:23:02,818 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2022-09-30 06:23:02,819 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-30 06:23:02,827 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2022-09-30 06:23:02,829 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (3)] Waiting until timeout for monitored process [2022-09-30 06:23:02,833 INFO L158 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2022-09-30 06:23:02,838 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES ======== [2022-09-30 06:23:02,839 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, 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;@78c770bb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-09-30 06:23:02,839 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-09-30 06:23:03,202 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 1 remaining) [2022-09-30 06:23:03,205 INFO L444 BasicCegarLoop]: Path program histogram: [] [2022-09-30 06:23:03,208 INFO L307 ceAbstractionStarter]: Result for error location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES was SAFE (2/4) [2022-09-30 06:23:03,216 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SYNTACTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-09-30 06:23:03,217 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2022-09-30 06:23:03,217 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-30 06:23:03,260 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2022-09-30 06:23:03,262 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (4)] Waiting until timeout for monitored process [2022-09-30 06:23:03,267 INFO L158 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2022-09-30 06:23:03,268 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == t1Err0ASSERT_VIOLATIONASSERT ======== [2022-09-30 06:23:03,268 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, 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;@78c770bb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-09-30 06:23:03,268 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-09-30 06:23:03,269 WARN L124 DepthFirstTraversal]: Depth first traversal did not find any initial state. Returning directly. [2022-09-30 06:23:03,269 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t1Err0ASSERT_VIOLATIONASSERT (0 of 1 remaining) [2022-09-30 06:23:03,269 INFO L444 BasicCegarLoop]: Path program histogram: [] [2022-09-30 06:23:03,270 INFO L307 ceAbstractionStarter]: Result for error location t1Err0ASSERT_VIOLATIONASSERT was SAFE (3/4) [2022-09-30 06:23:03,275 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SYNTACTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-09-30 06:23:03,275 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2022-09-30 06:23:03,275 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-30 06:23:03,277 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2022-09-30 06:23:03,284 INFO L158 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2022-09-30 06:23:03,285 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == t1Err0ASSERT_VIOLATIONASSERT ======== [2022-09-30 06:23:03,285 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, 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;@78c770bb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-09-30 06:23:03,285 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-09-30 06:23:03,305 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (5)] Waiting until timeout for monitored process [2022-09-30 06:23:04,819 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting t1Err0ASSERT_VIOLATIONASSERT === [t1Err0ASSERT_VIOLATIONASSERT] === [2022-09-30 06:23:04,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-30 06:23:04,826 INFO L85 PathProgramCache]: Analyzing trace with hash 851959826, now seen corresponding path program 1 times [2022-09-30 06:23:04,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-30 06:23:04,834 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1739110510] [2022-09-30 06:23:04,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-30 06:23:04,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-30 06:23:05,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-30 06:23:05,463 INFO L134 CoverageAnalysis]: Checked inductivity of 700 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 700 trivial. 0 not checked. [2022-09-30 06:23:05,464 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-30 06:23:05,464 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1739110510] [2022-09-30 06:23:05,465 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1739110510] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-30 06:23:05,465 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-30 06:23:05,465 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-09-30 06:23:05,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1002789533] [2022-09-30 06:23:05,467 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-30 06:23:05,479 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-09-30 06:23:05,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-30 06:23:05,500 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-09-30 06:23:05,501 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-09-30 06:23:05,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-09-30 06:23:05,504 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-09-30 06:23:05,506 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 201.0) internal successors, (402), 2 states have internal predecessors, (402), 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) [2022-09-30 06:23:05,506 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-09-30 06:23:06,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-09-30 06:23:06,487 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-09-30 06:23:06,487 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting t1Err0ASSERT_VIOLATIONASSERT === [t1Err0ASSERT_VIOLATIONASSERT] === [2022-09-30 06:23:06,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-30 06:23:06,488 INFO L85 PathProgramCache]: Analyzing trace with hash 1492845406, now seen corresponding path program 1 times [2022-09-30 06:23:06,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-30 06:23:06,493 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1680623565] [2022-09-30 06:23:06,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-30 06:23:06,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-30 06:23:06,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-30 06:23:07,056 INFO L134 CoverageAnalysis]: Checked inductivity of 700 backedges. 423 proven. 0 refuted. 0 times theorem prover too weak. 277 trivial. 0 not checked. [2022-09-30 06:23:07,057 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-30 06:23:07,057 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1680623565] [2022-09-30 06:23:07,057 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1680623565] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-30 06:23:07,057 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-30 06:23:07,057 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-09-30 06:23:07,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1462549112] [2022-09-30 06:23:07,059 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-30 06:23:07,061 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-09-30 06:23:07,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-30 06:23:07,061 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-09-30 06:23:07,061 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-09-30 06:23:07,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-09-30 06:23:07,064 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-09-30 06:23:07,065 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 80.0) internal successors, (480), 6 states have internal predecessors, (480), 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) [2022-09-30 06:23:07,065 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-09-30 06:23:07,065 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-09-30 06:23:07,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-09-30 06:23:07,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-09-30 06:23:07,230 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-09-30 06:23:07,230 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting t1Err0ASSERT_VIOLATIONASSERT === [t1Err0ASSERT_VIOLATIONASSERT] === [2022-09-30 06:23:07,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-30 06:23:07,231 INFO L85 PathProgramCache]: Analyzing trace with hash 1293043616, now seen corresponding path program 1 times [2022-09-30 06:23:07,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-30 06:23:07,232 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [387121096] [2022-09-30 06:23:07,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-30 06:23:07,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-30 06:23:07,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-30 06:23:07,640 INFO L134 CoverageAnalysis]: Checked inductivity of 405 backedges. 0 proven. 147 refuted. 0 times theorem prover too weak. 258 trivial. 0 not checked. [2022-09-30 06:23:07,641 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-30 06:23:07,641 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [387121096] [2022-09-30 06:23:07,641 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [387121096] provided 0 perfect and 1 imperfect interpolant sequences [2022-09-30 06:23:07,641 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1891890453] [2022-09-30 06:23:07,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-30 06:23:07,642 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-30 06:23:07,642 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-30 06:23:07,644 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-09-30 06:23:07,645 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-09-30 06:23:07,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-30 06:23:07,941 INFO L263 TraceCheckSpWp]: Trace formula consists of 1155 conjuncts, 63 conjunts are in the unsatisfiable core [2022-09-30 06:23:07,958 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-09-30 06:23:09,220 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-09-30 06:23:09,475 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-30 06:23:09,477 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-09-30 06:23:09,879 INFO L356 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-09-30 06:23:09,880 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 27 [2022-09-30 06:23:10,043 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-30 06:23:10,044 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-09-30 06:23:10,119 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-09-30 06:23:10,166 INFO L134 CoverageAnalysis]: Checked inductivity of 405 backedges. 270 proven. 55 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2022-09-30 06:23:10,166 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-09-30 06:23:51,882 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_222 Int) (v_ArrVal_219 (Array Int Int)) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_43| Int)) (let ((.cse0 (select (store |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_t1Thread1of1ForFork1_write~int_#ptr#1.base| v_ArrVal_219) |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 3204))) (or (< (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_43|) (not (= 800 (select (store .cse0 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_43| v_ArrVal_222) .cse1)))))) is different from false [2022-09-30 06:23:52,008 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_58| Int)) (or (forall ((v_ArrVal_222 Int) (v_ArrVal_219 (Array Int Int)) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_43| Int)) (let ((.cse0 (select (store |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_58| v_ArrVal_219) |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 3204))) (or (< (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_43|) (not (= (select (store .cse0 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_43| v_ArrVal_222) .cse1) 800))))) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_58| |c_~#stored_elements~0.base|)))) is different from false [2022-09-30 06:23:52,035 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_222 Int) (v_ArrVal_219 (Array Int Int)) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_43| Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_58| Int)) (let ((.cse0 (select (store |c_#memory_int| |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_58| v_ArrVal_219) |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 3204))) (or (< (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_43|) (not (= 800 (select (store .cse0 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_43| v_ArrVal_222) .cse1))) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_58| |c_~#stored_elements~0.base|))))) is different from false [2022-09-30 06:23:52,111 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-30 06:23:52,112 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 49 treesize of output 41 [2022-09-30 06:23:52,122 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-30 06:23:52,123 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 76 treesize of output 78 [2022-09-30 06:23:52,131 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 63 treesize of output 55 [2022-09-30 06:23:52,151 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 6 treesize of output 4 [2022-09-30 06:23:52,210 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-30 06:23:52,210 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 54 treesize of output 54 [2022-09-30 06:23:52,840 INFO L134 CoverageAnalysis]: Checked inductivity of 405 backedges. 270 proven. 55 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2022-09-30 06:23:52,840 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1891890453] provided 0 perfect and 2 imperfect interpolant sequences [2022-09-30 06:23:52,840 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-09-30 06:23:52,841 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 23, 23] total 51 [2022-09-30 06:23:52,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1146500160] [2022-09-30 06:23:52,841 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-09-30 06:23:52,842 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2022-09-30 06:23:52,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-30 06:23:52,843 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2022-09-30 06:23:52,845 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=164, Invalid=2007, Unknown=97, NotChecked=282, Total=2550 [2022-09-30 06:23:52,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-09-30 06:23:52,846 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-09-30 06:23:52,846 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 51 states have (on average 19.96078431372549) internal successors, (1018), 51 states have internal predecessors, (1018), 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) [2022-09-30 06:23:52,847 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-09-30 06:23:52,847 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2022-09-30 06:23:52,847 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-09-30 06:23:53,789 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_~#queue~0.offset| 3204))) (and (= |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 0) (<= 7 |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base|) (= |c_t1Thread1of1ForFork1_write~int_#ptr#1.base| |c_~#queue~0.base|) (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) (= |c_~#queue~0.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (<= 7 |c_~#queue~0.base|) (= |c_~#queue~0.offset| 0) (= |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset| |c_~#queue~0.offset|) (= |c_~#queue~0.base| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base|) (= |c_t1Thread1of1ForFork1_write~int_#value#1| 1) (= (select |c_#valid| |c_~#queue~0.base|) 1) (= (select (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base|) (+ |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset| 3204)) 1) (forall ((v_ArrVal_222 Int) (v_ArrVal_219 (Array Int Int)) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_43| Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_58| Int)) (let ((.cse0 (select (store |c_#memory_int| |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_58| v_ArrVal_219) |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 3204))) (or (< (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_43|) (not (= 800 (select (store .cse0 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_43| v_ArrVal_222) .cse1))) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_58| |c_~#stored_elements~0.base|))))) (= (select |c_#valid| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base|) 1) (= |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset| 0) (= .cse2 |c_t1Thread1of1ForFork1_write~int_#ptr#1.offset|) (= (select (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) 1) (= (select |c_#valid| |c_t1Thread1of1ForFork1_write~int_#ptr#1.base|) 1) (= (select (select |c_#memory_int| |c_~#queue~0.base|) .cse2) 1) (= (select |c_#valid| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) 1) (= |c_~#queue~0.base| |c_ULTIMATE.start_init_~q#1.base|) (= |c_~#queue~0.base| |c_ULTIMATE.start_init_#in~q#1.base|) (<= |c_~#stored_elements~0.base| 6) (<= 7 |c_t1Thread1of1ForFork1_enqueue_~q#1.base|))) is different from false [2022-09-30 06:23:53,795 WARN L833 $PredicateComparison]: unable to prove that (and (<= 7 |c_~#queue~0.base|) (= |c_~#queue~0.offset| 0) (= (select |c_#valid| |c_~#queue~0.base|) 1) (forall ((v_ArrVal_222 Int) (v_ArrVal_219 (Array Int Int)) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_43| Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_58| Int)) (let ((.cse0 (select (store |c_#memory_int| |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_58| v_ArrVal_219) |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 3204))) (or (< (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_43|) (not (= 800 (select (store .cse0 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_43| v_ArrVal_222) .cse1))) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_58| |c_~#stored_elements~0.base|))))) (= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 3204)) 1) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-09-30 06:23:53,801 WARN L833 $PredicateComparison]: unable to prove that (and (= (select (select |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 3204)) 1) (<= 7 |c_~#queue~0.base|) (= |c_~#queue~0.offset| 0) (= (select |c_#valid| |c_~#queue~0.base|) 1) (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_58| Int)) (or (forall ((v_ArrVal_222 Int) (v_ArrVal_219 (Array Int Int)) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_43| Int)) (let ((.cse0 (select (store |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_58| v_ArrVal_219) |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 3204))) (or (< (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_43|) (not (= (select (store .cse0 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_43| v_ArrVal_222) .cse1) 800))))) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_58| |c_~#stored_elements~0.base|)))) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-09-30 06:23:54,114 WARN L833 $PredicateComparison]: unable to prove that (and (= (select (select |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 3204)) 1) (<= 7 |c_~#queue~0.base|) (<= |c_t1Thread1of1ForFork1_write~int_#ptr#1.base| 6) (= |c_~#queue~0.offset| 0) (= (select |c_#valid| |c_~#queue~0.base|) 1) (forall ((v_ArrVal_222 Int) (v_ArrVal_219 (Array Int Int)) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_43| Int)) (let ((.cse0 (select (store |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_t1Thread1of1ForFork1_write~int_#ptr#1.base| v_ArrVal_219) |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 3204))) (or (< (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_43|) (not (= 800 (select (store .cse0 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_43| v_ArrVal_222) .cse1))))))) is different from false [2022-09-30 06:24:01,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-09-30 06:24:01,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-09-30 06:24:01,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2022-09-30 06:24:01,138 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-09-30 06:24:01,331 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-30 06:24:01,331 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting t1Err0ASSERT_VIOLATIONASSERT === [t1Err0ASSERT_VIOLATIONASSERT] === [2022-09-30 06:24:01,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-30 06:24:01,333 INFO L85 PathProgramCache]: Analyzing trace with hash -1956353559, now seen corresponding path program 1 times [2022-09-30 06:24:01,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-30 06:24:01,333 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [833218986] [2022-09-30 06:24:01,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-30 06:24:01,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-30 06:24:01,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-30 06:24:01,789 INFO L134 CoverageAnalysis]: Checked inductivity of 700 backedges. 0 proven. 196 refuted. 0 times theorem prover too weak. 504 trivial. 0 not checked. [2022-09-30 06:24:01,789 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-30 06:24:01,789 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [833218986] [2022-09-30 06:24:01,789 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [833218986] provided 0 perfect and 1 imperfect interpolant sequences [2022-09-30 06:24:01,789 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [323162102] [2022-09-30 06:24:01,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-30 06:24:01,790 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-30 06:24:01,790 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-30 06:24:01,792 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-09-30 06:24:01,798 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-09-30 06:24:02,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-30 06:24:02,085 INFO L263 TraceCheckSpWp]: Trace formula consists of 1571 conjuncts, 5 conjunts are in the unsatisfiable core [2022-09-30 06:24:02,094 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-09-30 06:24:02,125 INFO L134 CoverageAnalysis]: Checked inductivity of 700 backedges. 280 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2022-09-30 06:24:02,125 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-09-30 06:24:02,125 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [323162102] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-30 06:24:02,126 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-09-30 06:24:02,126 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [9] total 12 [2022-09-30 06:24:02,126 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2126025401] [2022-09-30 06:24:02,126 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-30 06:24:02,127 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-09-30 06:24:02,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-30 06:24:02,127 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-09-30 06:24:02,128 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2022-09-30 06:24:02,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-09-30 06:24:02,128 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-09-30 06:24:02,129 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 126.5) internal successors, (506), 4 states have internal predecessors, (506), 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) [2022-09-30 06:24:02,129 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-09-30 06:24:02,129 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2022-09-30 06:24:02,129 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 59 states. [2022-09-30 06:24:02,129 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-09-30 06:24:03,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-09-30 06:24:03,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-09-30 06:24:03,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2022-09-30 06:24:03,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-09-30 06:24:03,875 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-09-30 06:24:04,054 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-30 06:24:04,055 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting t1Err0ASSERT_VIOLATIONASSERT === [t1Err0ASSERT_VIOLATIONASSERT] === [2022-09-30 06:24:04,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-30 06:24:04,055 INFO L85 PathProgramCache]: Analyzing trace with hash 722374439, now seen corresponding path program 1 times [2022-09-30 06:24:04,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-30 06:24:04,055 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [449704674] [2022-09-30 06:24:04,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-30 06:24:04,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-30 06:24:04,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-30 06:24:04,409 INFO L134 CoverageAnalysis]: Checked inductivity of 700 backedges. 0 proven. 196 refuted. 0 times theorem prover too weak. 504 trivial. 0 not checked. [2022-09-30 06:24:04,409 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-30 06:24:04,409 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [449704674] [2022-09-30 06:24:04,409 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [449704674] provided 0 perfect and 1 imperfect interpolant sequences [2022-09-30 06:24:04,410 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [973885971] [2022-09-30 06:24:04,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-30 06:24:04,410 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-30 06:24:04,410 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-30 06:24:04,411 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-09-30 06:24:04,441 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-09-30 06:24:04,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-30 06:24:04,720 INFO L263 TraceCheckSpWp]: Trace formula consists of 1569 conjuncts, 63 conjunts are in the unsatisfiable core [2022-09-30 06:24:04,751 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-09-30 06:24:05,865 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-09-30 06:24:06,455 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-30 06:24:06,456 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-09-30 06:24:06,850 INFO L356 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-09-30 06:24:06,851 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 27 [2022-09-30 06:24:07,001 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-30 06:24:07,003 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-09-30 06:24:07,075 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-09-30 06:24:07,115 INFO L134 CoverageAnalysis]: Checked inductivity of 700 backedges. 405 proven. 55 refuted. 0 times theorem prover too weak. 240 trivial. 0 not checked. [2022-09-30 06:24:07,115 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-09-30 06:24:23,755 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_477 Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_63| Int)) (or (< (+ (* (select (select |c_#memory_int| |c_t1Thread1of1ForFork1_read~int_#ptr#1.base|) |c_t1Thread1of1ForFork1_read~int_#ptr#1.offset|) 4) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_63|) (not (= (select (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_63| v_ArrVal_477) (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) 800)))) is different from false [2022-09-30 06:24:42,148 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_477 Int) (v_ArrVal_474 (Array Int Int)) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_63| Int)) (let ((.cse0 (select (store |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_t1Thread1of1ForFork1_write~int_#ptr#1.base| v_ArrVal_474) |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 3204))) (or (not (= (select (store .cse0 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_63| v_ArrVal_477) .cse1) 800)) (< (+ |c_~#queue~0.offset| (* (select .cse0 .cse1) 4)) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_63|)))) is different from false [2022-09-30 06:24:42,664 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_78| Int)) (or (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_78| |c_~#stored_elements~0.base|)) (forall ((v_ArrVal_477 Int) (v_ArrVal_474 (Array Int Int)) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_63| Int)) (let ((.cse0 (select (store |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_78| v_ArrVal_474) |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 3204))) (or (< (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_63|) (not (= (select (store .cse0 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_63| v_ArrVal_477) .cse1) 800))))))) is different from false [2022-09-30 06:24:42,686 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_477 Int) (v_ArrVal_474 (Array Int Int)) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_63| Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_78| Int)) (let ((.cse0 (select (store |c_#memory_int| |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_78| v_ArrVal_474) |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 3204))) (or (not (= 800 (select (store .cse0 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_63| v_ArrVal_477) .cse1))) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_78| |c_~#stored_elements~0.base|)) (< (+ |c_~#queue~0.offset| (* (select .cse0 .cse1) 4)) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_63|)))) is different from false [2022-09-30 06:24:42,746 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-30 06:24:42,746 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 49 treesize of output 41 [2022-09-30 06:24:42,753 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-30 06:24:42,754 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 76 treesize of output 78 [2022-09-30 06:24:42,760 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 63 treesize of output 55 [2022-09-30 06:24:42,770 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 6 treesize of output 4 [2022-09-30 06:24:42,823 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-30 06:24:42,823 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 54 treesize of output 54 [2022-09-30 06:24:43,359 INFO L134 CoverageAnalysis]: Checked inductivity of 700 backedges. 405 proven. 51 refuted. 0 times theorem prover too weak. 240 trivial. 4 not checked. [2022-09-30 06:24:43,360 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [973885971] provided 0 perfect and 2 imperfect interpolant sequences [2022-09-30 06:24:43,360 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-09-30 06:24:43,360 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 23, 23] total 51 [2022-09-30 06:24:43,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1860504727] [2022-09-30 06:24:43,361 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-09-30 06:24:43,362 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2022-09-30 06:24:43,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-30 06:24:43,363 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2022-09-30 06:24:43,364 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=162, Invalid=1937, Unknown=79, NotChecked=372, Total=2550 [2022-09-30 06:24:43,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-09-30 06:24:43,365 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-09-30 06:24:43,366 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 51 states have (on average 26.607843137254903) internal successors, (1357), 51 states have internal predecessors, (1357), 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) [2022-09-30 06:24:43,366 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-09-30 06:24:43,366 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2022-09-30 06:24:43,366 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 59 states. [2022-09-30 06:24:43,366 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2022-09-30 06:24:43,367 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-09-30 06:24:44,112 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_~#queue~0.offset| 3204))) (and (= |c_t1Thread1of1ForFork1_write~int_#ptr#1.base| |c_~#queue~0.base|) (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) (= |c_~#queue~0.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (<= 7 |c_~#queue~0.base|) (= |c_~#queue~0.offset| 0) (= |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset| |c_~#queue~0.offset|) (= |c_~#queue~0.base| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base|) (= |c_t1Thread1of1ForFork1_write~int_#value#1| 1) (= (select |c_#valid| |c_~#queue~0.base|) 1) (= (select |c_#valid| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base|) 1) (= .cse0 |c_t1Thread1of1ForFork1_write~int_#ptr#1.offset|) (forall ((v_ArrVal_477 Int) (v_ArrVal_474 (Array Int Int)) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_63| Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_78| Int)) (let ((.cse1 (select (store |c_#memory_int| |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_78| v_ArrVal_474) |c_~#queue~0.base|)) (.cse2 (+ |c_~#queue~0.offset| 3204))) (or (not (= 800 (select (store .cse1 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_63| v_ArrVal_477) .cse2))) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_78| |c_~#stored_elements~0.base|)) (< (+ |c_~#queue~0.offset| (* (select .cse1 .cse2) 4)) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_63|)))) (= (select |c_#valid| |c_t1Thread1of1ForFork1_write~int_#ptr#1.base|) 1) (= (select (select |c_#memory_int| |c_~#queue~0.base|) .cse0) 1) (= (select |c_#valid| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) 1) (= |c_~#queue~0.base| |c_ULTIMATE.start_init_~q#1.base|) (= |c_~#queue~0.base| |c_ULTIMATE.start_init_#in~q#1.base|) (<= |c_~#stored_elements~0.base| 6))) is different from false [2022-09-30 06:24:44,115 WARN L833 $PredicateComparison]: unable to prove that (and (<= 7 |c_~#queue~0.base|) (= |c_~#queue~0.offset| 0) (= (select |c_#valid| |c_~#queue~0.base|) 1) (forall ((v_ArrVal_477 Int) (v_ArrVal_474 (Array Int Int)) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_63| Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_78| Int)) (let ((.cse0 (select (store |c_#memory_int| |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_78| v_ArrVal_474) |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 3204))) (or (not (= 800 (select (store .cse0 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_63| v_ArrVal_477) .cse1))) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_78| |c_~#stored_elements~0.base|)) (< (+ |c_~#queue~0.offset| (* (select .cse0 .cse1) 4)) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_63|)))) (= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 3204)) 1) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-09-30 06:24:44,138 WARN L833 $PredicateComparison]: unable to prove that (and (= (select (select |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 3204)) 1) (<= 7 |c_~#queue~0.base|) (= |c_~#queue~0.offset| 0) (= (select |c_#valid| |c_~#queue~0.base|) 1) (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_78| Int)) (or (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_78| |c_~#stored_elements~0.base|)) (forall ((v_ArrVal_477 Int) (v_ArrVal_474 (Array Int Int)) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_63| Int)) (let ((.cse0 (select (store |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_78| v_ArrVal_474) |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 3204))) (or (< (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_63|) (not (= (select (store .cse0 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_63| v_ArrVal_477) .cse1) 800))))))) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-09-30 06:24:44,434 WARN L833 $PredicateComparison]: unable to prove that (and (= (select (select |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 3204)) 1) (<= 7 |c_~#queue~0.base|) (<= |c_t1Thread1of1ForFork1_write~int_#ptr#1.base| 6) (= |c_~#queue~0.offset| 0) (= (select |c_#valid| |c_~#queue~0.base|) 1) (forall ((v_ArrVal_477 Int) (v_ArrVal_474 (Array Int Int)) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_63| Int)) (let ((.cse0 (select (store |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_t1Thread1of1ForFork1_write~int_#ptr#1.base| v_ArrVal_474) |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 3204))) (or (not (= (select (store .cse0 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_63| v_ArrVal_477) .cse1) 800)) (< (+ |c_~#queue~0.offset| (* (select .cse0 .cse1) 4)) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_63|))))) is different from false [2022-09-30 06:24:44,851 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (and (= |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 0) (<= 7 |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base|) (<= 7 |c_~#queue~0.base|) (= |c_t1Thread1of1ForFork1_read~int_#ptr#1.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (= |c_~#queue~0.offset| 0) (= (select |c_#valid| |c_~#queue~0.base|) 1) (= (select (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base|) (+ |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset| 3204)) 1) (= (select |c_#valid| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base|) 1) (= .cse0 |c_t1Thread1of1ForFork1_read~int_#ptr#1.offset|) (= |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset| 0) (= (select (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) .cse0) 1) (= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 3204)) 1) (= (select |c_#valid| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) 1) (forall ((v_ArrVal_477 Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_63| Int)) (or (< (+ (* (select (select |c_#memory_int| |c_t1Thread1of1ForFork1_read~int_#ptr#1.base|) |c_t1Thread1of1ForFork1_read~int_#ptr#1.offset|) 4) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_63|) (not (= (select (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_63| v_ArrVal_477) (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) 800)))) (<= 7 |c_t1Thread1of1ForFork1_enqueue_~q#1.base|))) is different from false [2022-09-30 06:24:45,163 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (and (= |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 0) (= |c_t1Thread1of1ForFork1_read~int_#ptr#1.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (= (select |c_#valid| |c_~#queue~0.base|) 1) (= .cse0 |c_t1Thread1of1ForFork1_read~int_#ptr#1.offset|) (= (select (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) .cse0) 1) (= (select |c_#valid| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) 1) (forall ((v_ArrVal_477 Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_63| Int)) (or (< (+ (* (select (select |c_#memory_int| |c_t1Thread1of1ForFork1_read~int_#ptr#1.base|) |c_t1Thread1of1ForFork1_read~int_#ptr#1.offset|) 4) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_63|) (not (= (select (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_63| v_ArrVal_477) (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) 800)))) (<= 7 |c_t1Thread1of1ForFork1_enqueue_~q#1.base|))) is different from false [2022-09-30 06:24:52,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-09-30 06:24:52,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-09-30 06:24:52,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2022-09-30 06:24:52,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-09-30 06:24:52,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2022-09-30 06:24:52,375 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-09-30 06:24:52,559 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-30 06:24:52,560 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting t1Err0ASSERT_VIOLATIONASSERT === [t1Err0ASSERT_VIOLATIONASSERT] === [2022-09-30 06:24:52,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-30 06:24:52,560 INFO L85 PathProgramCache]: Analyzing trace with hash 2142843857, now seen corresponding path program 1 times [2022-09-30 06:24:52,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-30 06:24:52,560 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [364429630] [2022-09-30 06:24:52,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-30 06:24:52,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-30 06:24:52,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-30 06:24:52,869 INFO L134 CoverageAnalysis]: Checked inductivity of 727 backedges. 430 proven. 108 refuted. 0 times theorem prover too weak. 189 trivial. 0 not checked. [2022-09-30 06:24:52,869 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-30 06:24:52,869 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [364429630] [2022-09-30 06:24:52,869 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [364429630] provided 0 perfect and 1 imperfect interpolant sequences [2022-09-30 06:24:52,870 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [598113800] [2022-09-30 06:24:52,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-30 06:24:52,870 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-30 06:24:52,870 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-30 06:24:52,871 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-09-30 06:24:52,872 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-09-30 06:24:53,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-30 06:24:53,184 INFO L263 TraceCheckSpWp]: Trace formula consists of 1635 conjuncts, 61 conjunts are in the unsatisfiable core [2022-09-30 06:24:53,199 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-09-30 06:24:54,588 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-09-30 06:24:54,712 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-30 06:24:54,713 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-09-30 06:24:54,952 INFO L356 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-09-30 06:24:54,952 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 27 [2022-09-30 06:24:55,052 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-30 06:24:55,053 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-09-30 06:24:55,105 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-09-30 06:24:55,149 INFO L134 CoverageAnalysis]: Checked inductivity of 727 backedges. 427 proven. 181 refuted. 0 times theorem prover too weak. 119 trivial. 0 not checked. [2022-09-30 06:24:55,149 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-09-30 06:25:30,566 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_605 (Array Int Int)) (v_ArrVal_608 Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_75| Int)) (let ((.cse0 (select (store |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_t1Thread1of1ForFork1_write~int_#ptr#1.base| v_ArrVal_605) |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 3204))) (or (< (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_75|) (not (= 800 (select (store .cse0 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_75| v_ArrVal_608) .cse1)))))) is different from false [2022-09-30 06:25:30,599 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_90| Int)) (or (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_90| |c_~#stored_elements~0.base|)) (forall ((v_ArrVal_605 (Array Int Int)) (v_ArrVal_608 Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_75| Int)) (let ((.cse0 (select (store |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_90| v_ArrVal_605) |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 3204))) (or (not (= (select (store .cse0 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_75| v_ArrVal_608) .cse1) 800)) (< (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_75|)))))) is different from false [2022-09-30 06:25:30,620 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_605 (Array Int Int)) (v_ArrVal_608 Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_90| Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_75| Int)) (let ((.cse0 (select (store |c_#memory_int| |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_90| v_ArrVal_605) |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 3204))) (or (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_90| |c_~#stored_elements~0.base|)) (< (+ |c_~#queue~0.offset| (* (select .cse0 .cse1) 4)) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_75|) (not (= 800 (select (store .cse0 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_75| v_ArrVal_608) .cse1)))))) is different from false [2022-09-30 06:25:30,849 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-30 06:25:30,849 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 49 treesize of output 41 [2022-09-30 06:25:30,855 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-30 06:25:30,855 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 76 treesize of output 78 [2022-09-30 06:25:30,860 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 63 treesize of output 55 [2022-09-30 06:25:30,868 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 6 treesize of output 4 [2022-09-30 06:25:30,907 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-30 06:25:30,907 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 54 treesize of output 54 [2022-09-30 06:25:31,742 INFO L134 CoverageAnalysis]: Checked inductivity of 727 backedges. 409 proven. 173 refuted. 0 times theorem prover too weak. 119 trivial. 26 not checked. [2022-09-30 06:25:31,743 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [598113800] provided 0 perfect and 2 imperfect interpolant sequences [2022-09-30 06:25:31,743 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-09-30 06:25:31,743 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 23, 23] total 51 [2022-09-30 06:25:31,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1886105814] [2022-09-30 06:25:31,743 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-09-30 06:25:31,745 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2022-09-30 06:25:31,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-30 06:25:31,746 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2022-09-30 06:25:31,746 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=168, Invalid=2011, Unknown=89, NotChecked=282, Total=2550 [2022-09-30 06:25:31,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-09-30 06:25:31,747 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-09-30 06:25:31,749 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 51 states have (on average 32.31372549019608) internal successors, (1648), 51 states have internal predecessors, (1648), 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) [2022-09-30 06:25:31,749 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-09-30 06:25:31,749 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2022-09-30 06:25:31,749 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 59 states. [2022-09-30 06:25:31,749 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2022-09-30 06:25:31,749 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 67 states. [2022-09-30 06:25:31,749 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-09-30 06:25:32,221 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_~#queue~0.offset| 3204))) (and (forall ((v_ArrVal_605 (Array Int Int)) (v_ArrVal_608 Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_90| Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_75| Int)) (let ((.cse0 (select (store |c_#memory_int| |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_90| v_ArrVal_605) |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 3204))) (or (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_90| |c_~#stored_elements~0.base|)) (< (+ |c_~#queue~0.offset| (* (select .cse0 .cse1) 4)) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_75|) (not (= 800 (select (store .cse0 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_75| v_ArrVal_608) .cse1)))))) (= |c_t1Thread1of1ForFork1_write~int_#ptr#1.base| |c_~#queue~0.base|) (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) (= (select |c_#valid| |c_t1Thread1of1ForFork1_read~int_#ptr#1.base|) 1) (= |c_~#queue~0.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (<= 7 |c_~#queue~0.base|) (= |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset| |c_~#queue~0.offset|) (= |c_~#queue~0.base| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base|) (= |c_t1Thread1of1ForFork1_write~int_#value#1| 1) (= (select |c_#valid| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base|) 1) (= .cse2 |c_t1Thread1of1ForFork1_write~int_#ptr#1.offset|) (= (select (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) 1) (= (select |c_#valid| |c_t1Thread1of1ForFork1_write~int_#ptr#1.base|) 1) (= (select (select |c_#memory_int| |c_~#queue~0.base|) .cse2) 1) (= (select |c_#valid| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) 1) (= |c_t1Thread1of1ForFork1_read~int_#ptr#1.base| |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6) (<= 7 |c_t1Thread1of1ForFork1_enqueue_~q#1.base|))) is different from false [2022-09-30 06:25:32,224 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_605 (Array Int Int)) (v_ArrVal_608 Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_90| Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_75| Int)) (let ((.cse0 (select (store |c_#memory_int| |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_90| v_ArrVal_605) |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 3204))) (or (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_90| |c_~#stored_elements~0.base|)) (< (+ |c_~#queue~0.offset| (* (select .cse0 .cse1) 4)) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_75|) (not (= 800 (select (store .cse0 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_75| v_ArrVal_608) .cse1)))))) (<= 7 |c_~#queue~0.base|) (= (select |c_#valid| |c_~#queue~0.base|) 1) (= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 3204)) 1) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-09-30 06:25:32,226 WARN L833 $PredicateComparison]: unable to prove that (and (= (select (select |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 3204)) 1) (<= 7 |c_~#queue~0.base|) (= (select |c_#valid| |c_~#queue~0.base|) 1) (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_90| Int)) (or (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_90| |c_~#stored_elements~0.base|)) (forall ((v_ArrVal_605 (Array Int Int)) (v_ArrVal_608 Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_75| Int)) (let ((.cse0 (select (store |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_90| v_ArrVal_605) |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 3204))) (or (not (= (select (store .cse0 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_75| v_ArrVal_608) .cse1) 800)) (< (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_75|)))))) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-09-30 06:25:32,671 WARN L833 $PredicateComparison]: unable to prove that (and (= (select (select |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 3204)) 1) (forall ((v_ArrVal_605 (Array Int Int)) (v_ArrVal_608 Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_75| Int)) (let ((.cse0 (select (store |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_t1Thread1of1ForFork1_write~int_#ptr#1.base| v_ArrVal_605) |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 3204))) (or (< (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_75|) (not (= 800 (select (store .cse0 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_75| v_ArrVal_608) .cse1)))))) (<= 7 |c_~#queue~0.base|) (<= |c_t1Thread1of1ForFork1_write~int_#ptr#1.base| 6) (= (select |c_#valid| |c_~#queue~0.base|) 1) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-09-30 06:25:38,471 WARN L833 $PredicateComparison]: unable to prove that (and (= (select (select |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 3204)) 1) (forall ((v_ArrVal_605 (Array Int Int)) (v_ArrVal_608 Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_75| Int)) (let ((.cse0 (select (store |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_t1Thread1of1ForFork1_write~int_#ptr#1.base| v_ArrVal_605) |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 3204))) (or (< (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_75|) (not (= 800 (select (store .cse0 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_75| v_ArrVal_608) .cse1)))))) (<= 7 |c_~#queue~0.base|) (<= |c_t1Thread1of1ForFork1_write~int_#ptr#1.base| 6) (= (select |c_#valid| |c_~#queue~0.base|) 1)) is different from false