/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_longer.line363.bpl -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.por-optimizations-5c708e3-m [2022-10-04 00:53:37,990 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-10-04 00:53:37,993 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-10-04 00:53:38,032 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-10-04 00:53:38,032 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-10-04 00:53:38,035 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-10-04 00:53:38,039 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-10-04 00:53:38,044 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-10-04 00:53:38,046 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-10-04 00:53:38,052 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-10-04 00:53:38,053 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-10-04 00:53:38,054 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-10-04 00:53:38,054 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-10-04 00:53:38,056 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-10-04 00:53:38,058 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-10-04 00:53:38,061 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-10-04 00:53:38,061 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-10-04 00:53:38,062 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-10-04 00:53:38,064 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-10-04 00:53:38,069 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-10-04 00:53:38,071 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-10-04 00:53:38,072 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-10-04 00:53:38,074 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-10-04 00:53:38,075 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-10-04 00:53:38,082 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-10-04 00:53:38,082 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-10-04 00:53:38,083 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-10-04 00:53:38,084 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-10-04 00:53:38,085 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-10-04 00:53:38,085 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-10-04 00:53:38,086 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-10-04 00:53:38,086 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-10-04 00:53:38,087 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-10-04 00:53:38,087 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-10-04 00:53:38,089 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-10-04 00:53:38,089 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-10-04 00:53:38,089 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-10-04 00:53:38,090 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-10-04 00:53:38,090 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-10-04 00:53:38,091 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-10-04 00:53:38,091 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-10-04 00:53:38,092 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/gemcutter/NewStatesSleep-VarAbsGlobalSyntactic.epf [2022-10-04 00:53:38,127 INFO L113 SettingsManager]: Loading preferences was successful [2022-10-04 00:53:38,128 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-10-04 00:53:38,128 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-10-04 00:53:38,128 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-10-04 00:53:38,129 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-10-04 00:53:38,129 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-10-04 00:53:38,130 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-10-04 00:53:38,130 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-10-04 00:53:38,130 INFO L138 SettingsManager]: * Use SBE=true [2022-10-04 00:53:38,131 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-10-04 00:53:38,131 INFO L138 SettingsManager]: * sizeof long=4 [2022-10-04 00:53:38,132 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-10-04 00:53:38,132 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-10-04 00:53:38,132 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-10-04 00:53:38,132 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-10-04 00:53:38,132 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-10-04 00:53:38,132 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-10-04 00:53:38,132 INFO L138 SettingsManager]: * sizeof long double=12 [2022-10-04 00:53:38,132 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-10-04 00:53:38,132 INFO L138 SettingsManager]: * Use constant arrays=true [2022-10-04 00:53:38,132 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-10-04 00:53:38,133 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-10-04 00:53:38,133 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-10-04 00:53:38,133 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-10-04 00:53:38,133 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-10-04 00:53:38,133 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-04 00:53:38,133 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-10-04 00:53:38,134 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-10-04 00:53:38,134 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-10-04 00:53:38,134 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-10-04 00:53:38,134 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-10-04 00:53:38,134 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-10-04 00:53:38,134 INFO L138 SettingsManager]: * Abstraction used for commutativity in POR=VARIABLES_GLOBAL [2022-10-04 00:53:38,134 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2022-10-04 00:53:38,134 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-10-04 00:53:38,134 INFO L138 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_ERROR_LOCATION [2022-10-04 00:53:38,135 INFO L138 SettingsManager]: * Partial Order Reduction in concurrent analysis=SLEEP_NEW_STATES [2022-10-04 00:53:38,135 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-10-04 00:53:38,135 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-10-04 00:53:38,399 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-10-04 00:53:38,426 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-10-04 00:53:38,428 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-10-04 00:53:38,430 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2022-10-04 00:53:38,432 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2022-10-04 00:53:38,433 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_longer.line363.bpl [2022-10-04 00:53:38,434 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/boogie-benchmarks-from-svcomp-memsafety-concurrent/queue_ok_longer.line363.bpl' [2022-10-04 00:53:38,504 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-10-04 00:53:38,506 INFO L131 ToolchainWalker]: Walking toolchain with 3 elements. [2022-10-04 00:53:38,507 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-10-04 00:53:38,507 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-10-04 00:53:38,507 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-10-04 00:53:38,522 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "queue_ok_longer.line363.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:53:38" (1/1) ... [2022-10-04 00:53:38,524 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "queue_ok_longer.line363.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:53:38" (1/1) ... [2022-10-04 00:53:38,557 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "queue_ok_longer.line363.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:53:38" (1/1) ... [2022-10-04 00:53:38,558 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "queue_ok_longer.line363.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:53:38" (1/1) ... [2022-10-04 00:53:38,584 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "queue_ok_longer.line363.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:53:38" (1/1) ... [2022-10-04 00:53:38,603 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "queue_ok_longer.line363.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:53:38" (1/1) ... [2022-10-04 00:53:38,607 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "queue_ok_longer.line363.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:53:38" (1/1) ... [2022-10-04 00:53:38,616 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-10-04 00:53:38,624 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-10-04 00:53:38,624 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-10-04 00:53:38,624 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-10-04 00:53:38,626 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "queue_ok_longer.line363.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:53:38" (1/1) ... [2022-10-04 00:53:38,634 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-04 00:53:38,641 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-04 00:53:38,661 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-10-04 00:53:38,687 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-10-04 00:53:38,703 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2022-10-04 00:53:38,703 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2022-10-04 00:53:38,704 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2022-10-04 00:53:38,704 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2022-10-04 00:53:38,704 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-10-04 00:53:38,704 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-10-04 00:53:38,705 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-10-04 00:53:38,910 INFO L234 CfgBuilder]: Building ICFG [2022-10-04 00:53:38,912 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-10-04 00:53:39,459 INFO L275 CfgBuilder]: Performing block encoding [2022-10-04 00:53:39,480 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-10-04 00:53:39,480 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-10-04 00:53:39,483 INFO L202 PluginConnector]: Adding new model queue_ok_longer.line363.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.10 12:53:39 BoogieIcfgContainer [2022-10-04 00:53:39,483 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-10-04 00:53:39,486 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-10-04 00:53:39,486 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-10-04 00:53:39,493 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-10-04 00:53:39,494 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "queue_ok_longer.line363.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:53:38" (1/2) ... [2022-10-04 00:53:39,495 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34fb77e9 and model type queue_ok_longer.line363.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.10 12:53:39, skipping insertion in model container [2022-10-04 00:53:39,496 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "queue_ok_longer.line363.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.10 12:53:39" (2/2) ... [2022-10-04 00:53:39,497 INFO L112 eAbstractionObserver]: Analyzing ICFG queue_ok_longer.line363.bpl [2022-10-04 00:53:39,504 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-10-04 00:53:39,513 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-10-04 00:53:39,514 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-10-04 00:53:39,514 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-10-04 00:53:39,678 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-10-04 00:53:39,734 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SYNTACTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-10-04 00:53:39,734 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2022-10-04 00:53:39,735 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-04 00:53:39,741 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-10-04 00:53:39,758 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-10-04 00:53:39,780 INFO L158 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2022-10-04 00:53:39,788 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES ======== [2022-10-04 00:53:39,794 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;@7cc418cf, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-10-04 00:53:39,795 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-10-04 00:53:39,894 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 1 remaining) [2022-10-04 00:53:39,900 INFO L444 BasicCegarLoop]: Path program histogram: [] [2022-10-04 00:53:39,902 INFO L307 ceAbstractionStarter]: Result for error location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES was SAFE (1/4) [2022-10-04 00:53:39,925 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SYNTACTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-10-04 00:53:39,925 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2022-10-04 00:53:39,926 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-04 00:53:39,931 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-10-04 00:53:39,937 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-10-04 00:53:39,940 INFO L158 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2022-10-04 00:53:39,940 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES ======== [2022-10-04 00:53:39,941 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;@7cc418cf, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-10-04 00:53:39,941 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-10-04 00:53:40,309 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 1 remaining) [2022-10-04 00:53:40,312 INFO L444 BasicCegarLoop]: Path program histogram: [] [2022-10-04 00:53:40,315 INFO L307 ceAbstractionStarter]: Result for error location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES was SAFE (2/4) [2022-10-04 00:53:40,324 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SYNTACTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-10-04 00:53:40,325 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2022-10-04 00:53:40,325 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-04 00:53:40,357 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-10-04 00:53:40,358 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-10-04 00:53:40,361 INFO L158 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2022-10-04 00:53:40,362 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == t1Err0ASSERT_VIOLATIONASSERT ======== [2022-10-04 00:53:40,363 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;@7cc418cf, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-10-04 00:53:40,363 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-10-04 00:53:40,363 WARN L124 DepthFirstTraversal]: Depth first traversal did not find any initial state. Returning directly. [2022-10-04 00:53:40,363 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t1Err0ASSERT_VIOLATIONASSERT (0 of 1 remaining) [2022-10-04 00:53:40,364 INFO L444 BasicCegarLoop]: Path program histogram: [] [2022-10-04 00:53:40,364 INFO L307 ceAbstractionStarter]: Result for error location t1Err0ASSERT_VIOLATIONASSERT was SAFE (3/4) [2022-10-04 00:53:40,370 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SYNTACTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-10-04 00:53:40,370 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2022-10-04 00:53:40,371 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-04 00:53:40,375 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-10-04 00:53:40,379 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-10-04 00:53:40,381 INFO L158 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2022-10-04 00:53:40,381 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == t1Err0ASSERT_VIOLATIONASSERT ======== [2022-10-04 00:53:40,382 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;@7cc418cf, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-10-04 00:53:40,382 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-10-04 00:53:41,932 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting t1Err0ASSERT_VIOLATIONASSERT === [t1Err0ASSERT_VIOLATIONASSERT] === [2022-10-04 00:53:41,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-04 00:53:41,938 INFO L85 PathProgramCache]: Analyzing trace with hash 851959826, now seen corresponding path program 1 times [2022-10-04 00:53:41,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-04 00:53:41,950 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1666164010] [2022-10-04 00:53:41,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-04 00:53:41,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-04 00:53:42,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-04 00:53:42,571 INFO L134 CoverageAnalysis]: Checked inductivity of 700 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 700 trivial. 0 not checked. [2022-10-04 00:53:42,572 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-04 00:53:42,572 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1666164010] [2022-10-04 00:53:42,573 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1666164010] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-04 00:53:42,573 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-04 00:53:42,573 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-04 00:53:42,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [941788984] [2022-10-04 00:53:42,575 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-04 00:53:42,582 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-10-04 00:53:42,582 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-04 00:53:42,610 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-10-04 00:53:42,612 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-10-04 00:53:42,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-04 00:53:42,615 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-10-04 00:53:42,617 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-10-04 00:53:42,617 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-04 00:53:43,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-04 00:53:43,657 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-10-04 00:53:43,657 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting t1Err0ASSERT_VIOLATIONASSERT === [t1Err0ASSERT_VIOLATIONASSERT] === [2022-10-04 00:53:43,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-04 00:53:43,659 INFO L85 PathProgramCache]: Analyzing trace with hash 1492845406, now seen corresponding path program 1 times [2022-10-04 00:53:43,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-04 00:53:43,663 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [988010900] [2022-10-04 00:53:43,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-04 00:53:43,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-04 00:53:43,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-04 00:53:44,141 INFO L134 CoverageAnalysis]: Checked inductivity of 700 backedges. 423 proven. 0 refuted. 0 times theorem prover too weak. 277 trivial. 0 not checked. [2022-10-04 00:53:44,141 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-04 00:53:44,141 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [988010900] [2022-10-04 00:53:44,141 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [988010900] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-04 00:53:44,141 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-04 00:53:44,142 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-10-04 00:53:44,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [95202966] [2022-10-04 00:53:44,142 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-04 00:53:44,143 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-10-04 00:53:44,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-04 00:53:44,144 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-10-04 00:53:44,144 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-10-04 00:53:44,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-04 00:53:44,148 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-10-04 00:53:44,149 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-10-04 00:53:44,149 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-04 00:53:44,149 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-04 00:53:44,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-04 00:53:44,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-10-04 00:53:44,352 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-10-04 00:53:44,352 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting t1Err0ASSERT_VIOLATIONASSERT === [t1Err0ASSERT_VIOLATIONASSERT] === [2022-10-04 00:53:44,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-04 00:53:44,353 INFO L85 PathProgramCache]: Analyzing trace with hash 1293043616, now seen corresponding path program 1 times [2022-10-04 00:53:44,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-04 00:53:44,354 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1341652338] [2022-10-04 00:53:44,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-04 00:53:44,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-04 00:53:44,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-04 00:53:44,791 INFO L134 CoverageAnalysis]: Checked inductivity of 405 backedges. 0 proven. 147 refuted. 0 times theorem prover too weak. 258 trivial. 0 not checked. [2022-10-04 00:53:44,791 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-04 00:53:44,792 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1341652338] [2022-10-04 00:53:44,792 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1341652338] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-04 00:53:44,792 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1789164385] [2022-10-04 00:53:44,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-04 00:53:44,792 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-04 00:53:44,793 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-04 00:53:44,794 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-10-04 00:53:44,796 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-10-04 00:53:45,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-04 00:53:45,091 INFO L263 TraceCheckSpWp]: Trace formula consists of 1155 conjuncts, 63 conjunts are in the unsatisfiable core [2022-10-04 00:53:45,116 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-04 00:53:46,573 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-10-04 00:53:46,815 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-04 00:53:46,817 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-10-04 00:53:47,234 INFO L356 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-10-04 00:53:47,235 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-10-04 00:53:47,411 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-04 00:53:47,413 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-10-04 00:53:47,491 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-10-04 00:53:47,544 INFO L134 CoverageAnalysis]: Checked inductivity of 405 backedges. 270 proven. 55 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2022-10-04 00:53:47,545 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-04 00:54:25,357 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| 1604))) (or (not (= 400 (select (store .cse0 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_43| v_ArrVal_222) .cse1))) (< (+ |c_~#queue~0.offset| (* (select .cse0 .cse1) 4)) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_43|)))) is different from false [2022-10-04 00:54:25,501 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_58| Int)) (or (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_58| |c_~#stored_elements~0.base|)) (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| 1604))) (or (< (+ |c_~#queue~0.offset| (* (select .cse0 .cse1) 4)) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_43|) (not (= 400 (select (store .cse0 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_43| v_ArrVal_222) .cse1)))))))) is different from false [2022-10-04 00:54:25,529 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| 1604))) (or (< (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_43|) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_58| |c_~#stored_elements~0.base|)) (not (= 400 (select (store .cse0 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_43| v_ArrVal_222) .cse1)))))) is different from false [2022-10-04 00:54:25,608 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-04 00:54:25,609 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-10-04 00:54:25,619 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-04 00:54:25,620 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-10-04 00:54:25,628 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-10-04 00:54:25,647 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-10-04 00:54:25,719 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-04 00:54:25,719 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-10-04 00:54:26,467 INFO L134 CoverageAnalysis]: Checked inductivity of 405 backedges. 270 proven. 55 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2022-10-04 00:54:26,467 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1789164385] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-04 00:54:26,467 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-04 00:54:26,468 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 23, 23] total 51 [2022-10-04 00:54:26,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1140358534] [2022-10-04 00:54:26,468 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-04 00:54:26,470 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2022-10-04 00:54:26,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-04 00:54:26,470 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2022-10-04 00:54:26,473 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=164, Invalid=2015, Unknown=89, NotChecked=282, Total=2550 [2022-10-04 00:54:26,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-04 00:54:26,474 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-10-04 00:54:26,480 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-10-04 00:54:26,480 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-04 00:54:26,480 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2022-10-04 00:54:26,480 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-04 00:54:27,449 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_~#queue~0.offset| 1604))) (and (= |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 0) (<= 7 |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base|) (= (select (select |c_#memory_int| |c_~#queue~0.base|) .cse0) 1) (= |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|) (= (select (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base|) (+ |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset| 1604)) 1) (= |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) (= |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset| 0) (= .cse0 |c_t1Thread1of1ForFork1_write~int_#ptr#1.offset|) (= (select |c_#valid| |c_t1Thread1of1ForFork1_write~int_#ptr#1.base|) 1) (= (select |c_#valid| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) 1) (= |c_~#queue~0.base| |c_ULTIMATE.start_init_~q#1.base|) (= (select (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604)) 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 ((.cse1 (select (store |c_#memory_int| |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_58| v_ArrVal_219) |c_~#queue~0.base|)) (.cse2 (+ |c_~#queue~0.offset| 1604))) (or (< (+ (* (select .cse1 .cse2) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_43|) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_58| |c_~#stored_elements~0.base|)) (not (= 400 (select (store .cse1 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_43| v_ArrVal_222) .cse2)))))) (= |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-10-04 00:54:27,454 WARN L833 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 1) (<= 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| 1604))) (or (< (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_43|) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_58| |c_~#stored_elements~0.base|)) (not (= 400 (select (store .cse0 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_43| v_ArrVal_222) .cse1)))))) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-10-04 00:54:27,460 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_58| Int)) (or (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_58| |c_~#stored_elements~0.base|)) (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| 1604))) (or (< (+ |c_~#queue~0.offset| (* (select .cse0 .cse1) 4)) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_43|) (not (= 400 (select (store .cse0 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_43| v_ArrVal_222) .cse1)))))))) (<= 7 |c_~#queue~0.base|) (= |c_~#queue~0.offset| 0) (= (select |c_#valid| |c_~#queue~0.base|) 1) (= (select (select |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 1) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-10-04 00:54:27,809 WARN L833 $PredicateComparison]: unable to prove that (and (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| 1604))) (or (not (= 400 (select (store .cse0 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_43| v_ArrVal_222) .cse1))) (< (+ |c_~#queue~0.offset| (* (select .cse0 .cse1) 4)) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_43|)))) (<= 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) (= (select (select |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 1)) is different from false [2022-10-04 00:54:35,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-04 00:54:35,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-10-04 00:54:35,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2022-10-04 00:54:35,175 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-10-04 00:54:35,356 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-10-04 00:54:35,357 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting t1Err0ASSERT_VIOLATIONASSERT === [t1Err0ASSERT_VIOLATIONASSERT] === [2022-10-04 00:54:35,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-04 00:54:35,357 INFO L85 PathProgramCache]: Analyzing trace with hash -1956353559, now seen corresponding path program 1 times [2022-10-04 00:54:35,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-04 00:54:35,358 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [119489814] [2022-10-04 00:54:35,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-04 00:54:35,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-04 00:54:35,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-04 00:54:35,750 INFO L134 CoverageAnalysis]: Checked inductivity of 700 backedges. 0 proven. 196 refuted. 0 times theorem prover too weak. 504 trivial. 0 not checked. [2022-10-04 00:54:35,751 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-04 00:54:35,751 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [119489814] [2022-10-04 00:54:35,751 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [119489814] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-04 00:54:35,751 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [854678269] [2022-10-04 00:54:35,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-04 00:54:35,752 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-04 00:54:35,752 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-04 00:54:35,753 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-10-04 00:54:35,755 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-10-04 00:54:36,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-04 00:54:36,067 INFO L263 TraceCheckSpWp]: Trace formula consists of 1571 conjuncts, 5 conjunts are in the unsatisfiable core [2022-10-04 00:54:36,081 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-04 00:54:36,115 INFO L134 CoverageAnalysis]: Checked inductivity of 700 backedges. 280 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2022-10-04 00:54:36,115 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-10-04 00:54:36,116 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [854678269] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-04 00:54:36,116 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-10-04 00:54:36,116 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [9] total 12 [2022-10-04 00:54:36,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1137977018] [2022-10-04 00:54:36,116 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-04 00:54:36,117 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-04 00:54:36,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-04 00:54:36,118 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-04 00:54:36,118 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2022-10-04 00:54:36,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-04 00:54:36,119 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-10-04 00:54:36,120 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-10-04 00:54:36,120 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-04 00:54:36,120 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2022-10-04 00:54:36,120 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 59 states. [2022-10-04 00:54:36,120 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-04 00:54:38,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-04 00:54:38,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-10-04 00:54:38,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2022-10-04 00:54:38,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-10-04 00:54:38,175 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-10-04 00:54:38,351 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-10-04 00:54:38,352 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting t1Err0ASSERT_VIOLATIONASSERT === [t1Err0ASSERT_VIOLATIONASSERT] === [2022-10-04 00:54:38,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-04 00:54:38,352 INFO L85 PathProgramCache]: Analyzing trace with hash 722374439, now seen corresponding path program 1 times [2022-10-04 00:54:38,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-04 00:54:38,353 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [592142070] [2022-10-04 00:54:38,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-04 00:54:38,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-04 00:54:38,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-04 00:54:38,700 INFO L134 CoverageAnalysis]: Checked inductivity of 700 backedges. 0 proven. 196 refuted. 0 times theorem prover too weak. 504 trivial. 0 not checked. [2022-10-04 00:54:38,700 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-04 00:54:38,701 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [592142070] [2022-10-04 00:54:38,701 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [592142070] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-04 00:54:38,701 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [684148956] [2022-10-04 00:54:38,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-04 00:54:38,701 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-04 00:54:38,701 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-04 00:54:38,703 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-10-04 00:54:38,731 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-10-04 00:54:39,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-04 00:54:39,050 INFO L263 TraceCheckSpWp]: Trace formula consists of 1569 conjuncts, 63 conjunts are in the unsatisfiable core [2022-10-04 00:54:39,061 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-04 00:54:40,365 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-10-04 00:54:41,112 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-04 00:54:41,113 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-10-04 00:54:41,560 INFO L356 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-10-04 00:54:41,560 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-10-04 00:54:41,689 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-04 00:54:41,692 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-10-04 00:54:41,757 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-10-04 00:54:41,806 INFO L134 CoverageAnalysis]: Checked inductivity of 700 backedges. 405 proven. 55 refuted. 0 times theorem prover too weak. 240 trivial. 0 not checked. [2022-10-04 00:54:41,806 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-04 00:54:57,683 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 (= 400 (select (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_63| v_ArrVal_477) (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604)))))) is different from false [2022-10-04 00:55:13,246 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| 1604))) (or (< (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_63|) (not (= 400 (select (store .cse0 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_63| v_ArrVal_477) .cse1)))))) is different from false [2022-10-04 00:55:13,716 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| 1604))) (or (not (= 400 (select (store .cse0 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_63| v_ArrVal_477) .cse1))) (< (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_63|)))))) is different from false [2022-10-04 00:55:13,737 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| 1604))) (or (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|) (not (= 400 (select (store .cse0 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_63| v_ArrVal_477) .cse1)))))) is different from false [2022-10-04 00:55:13,795 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-04 00:55:13,795 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-10-04 00:55:13,806 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-04 00:55:13,807 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-10-04 00:55:13,812 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-10-04 00:55:13,821 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-10-04 00:55:13,879 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-04 00:55:13,879 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-10-04 00:55:14,508 INFO L134 CoverageAnalysis]: Checked inductivity of 700 backedges. 405 proven. 51 refuted. 0 times theorem prover too weak. 240 trivial. 4 not checked. [2022-10-04 00:55:14,509 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [684148956] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-04 00:55:14,509 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-04 00:55:14,509 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 23, 23] total 51 [2022-10-04 00:55:14,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [363914340] [2022-10-04 00:55:14,509 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-04 00:55:14,511 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2022-10-04 00:55:14,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-04 00:55:14,512 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2022-10-04 00:55:14,513 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=162, Invalid=1941, Unknown=75, NotChecked=372, Total=2550 [2022-10-04 00:55:14,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-04 00:55:14,514 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-10-04 00:55:14,515 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-10-04 00:55:14,515 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-04 00:55:14,516 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2022-10-04 00:55:14,516 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 59 states. [2022-10-04 00:55:14,516 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2022-10-04 00:55:14,516 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-04 00:55:15,279 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_~#queue~0.offset| 1604))) (and (= (select (select |c_#memory_int| |c_~#queue~0.base|) .cse0) 1) (= |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|) (= (select |c_#valid| |c_t1Thread1of1ForFork1_write~int_#ptr#1.base|) 1) (= (select |c_#valid| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) 1) (= |c_~#queue~0.base| |c_ULTIMATE.start_init_~q#1.base|) (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| 1604))) (or (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|) (not (= 400 (select (store .cse1 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_63| v_ArrVal_477) .cse2)))))) (= |c_~#queue~0.base| |c_ULTIMATE.start_init_#in~q#1.base|) (<= |c_~#stored_elements~0.base| 6))) is different from false [2022-10-04 00:55:15,282 WARN L833 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 1) (<= 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| 1604))) (or (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|) (not (= 400 (select (store .cse0 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_63| v_ArrVal_477) .cse1)))))) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-10-04 00:55:15,305 WARN L833 $PredicateComparison]: unable to prove that (and (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| 1604))) (or (not (= 400 (select (store .cse0 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_63| v_ArrVal_477) .cse1))) (< (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_63|)))))) (<= 7 |c_~#queue~0.base|) (= |c_~#queue~0.offset| 0) (= (select |c_#valid| |c_~#queue~0.base|) 1) (= (select (select |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 1) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-10-04 00:55:15,602 WARN L833 $PredicateComparison]: unable to prove that (and (<= 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) (= (select (select |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 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| 1604))) (or (< (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_63|) (not (= 400 (select (store .cse0 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_63| v_ArrVal_477) .cse1))))))) is different from false [2022-10-04 00:55:16,022 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (and (= |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 0) (<= 7 |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base|) (= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 1) (<= 7 |c_~#queue~0.base|) (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 (= 400 (select (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_63| v_ArrVal_477) (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604)))))) (= |c_t1Thread1of1ForFork1_read~int_#ptr#1.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (= |c_~#queue~0.offset| 0) (= (select (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base|) (+ |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset| 1604)) 1) (= (select |c_#valid| |c_~#queue~0.base|) 1) (= (select |c_#valid| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base|) 1) (= |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset| 0) (= .cse0 |c_t1Thread1of1ForFork1_read~int_#ptr#1.offset|) (= (select |c_#valid| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) 1) (= (select (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) .cse0) 1) (<= 7 |c_t1Thread1of1ForFork1_enqueue_~q#1.base|))) is different from false [2022-10-04 00:55:16,336 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (and (= |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 0) (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 (= 400 (select (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_63| v_ArrVal_477) (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604)))))) (= |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 |c_#valid| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) 1) (= (select (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) .cse0) 1) (<= 7 |c_t1Thread1of1ForFork1_enqueue_~q#1.base|))) is different from false [2022-10-04 00:55:23,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-04 00:55:23,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-10-04 00:55:23,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2022-10-04 00:55:23,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-10-04 00:55:23,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2022-10-04 00:55:23,629 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-10-04 00:55:23,810 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-10-04 00:55:23,811 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting t1Err0ASSERT_VIOLATIONASSERT === [t1Err0ASSERT_VIOLATIONASSERT] === [2022-10-04 00:55:23,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-04 00:55:23,811 INFO L85 PathProgramCache]: Analyzing trace with hash 2142843857, now seen corresponding path program 1 times [2022-10-04 00:55:23,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-04 00:55:23,811 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [448729760] [2022-10-04 00:55:23,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-04 00:55:23,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-04 00:55:23,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-04 00:55:24,098 INFO L134 CoverageAnalysis]: Checked inductivity of 727 backedges. 430 proven. 108 refuted. 0 times theorem prover too weak. 189 trivial. 0 not checked. [2022-10-04 00:55:24,098 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-04 00:55:24,098 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [448729760] [2022-10-04 00:55:24,099 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [448729760] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-04 00:55:24,099 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [946685910] [2022-10-04 00:55:24,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-04 00:55:24,099 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-04 00:55:24,099 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-04 00:55:24,100 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-10-04 00:55:24,102 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-10-04 00:55:24,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-04 00:55:24,407 INFO L263 TraceCheckSpWp]: Trace formula consists of 1635 conjuncts, 61 conjunts are in the unsatisfiable core [2022-10-04 00:55:24,418 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-04 00:55:25,826 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-10-04 00:55:25,953 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-04 00:55:25,954 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-10-04 00:55:26,236 INFO L356 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-10-04 00:55:26,237 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-10-04 00:55:26,351 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-04 00:55:26,352 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-10-04 00:55:26,399 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-10-04 00:55:26,444 INFO L134 CoverageAnalysis]: Checked inductivity of 727 backedges. 427 proven. 181 refuted. 0 times theorem prover too weak. 119 trivial. 0 not checked. [2022-10-04 00:55:26,444 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-04 00:56:03,624 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| 1604))) (or (< (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_75|) (not (= (select (store .cse0 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_75| v_ArrVal_608) .cse1) 400))))) is different from false [2022-10-04 00:56:03,651 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_90| Int)) (or (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| 1604))) (or (< (+ |c_~#queue~0.offset| (* (select .cse0 .cse1) 4)) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_75|) (not (= 400 (select (store .cse0 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_75| v_ArrVal_608) .cse1)))))) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_90| |c_~#stored_elements~0.base|)))) is different from false [2022-10-04 00:56:03,674 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| 1604))) (or (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_90| |c_~#stored_elements~0.base|)) (not (= 400 (select (store .cse0 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_75| v_ArrVal_608) .cse1))) (< (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_75|)))) is different from false [2022-10-04 00:56:03,735 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-04 00:56:03,735 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-10-04 00:56:03,743 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-04 00:56:03,743 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-10-04 00:56:03,749 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-10-04 00:56:03,758 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-10-04 00:56:03,803 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-04 00:56:03,803 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-10-04 00:56:04,763 INFO L134 CoverageAnalysis]: Checked inductivity of 727 backedges. 409 proven. 173 refuted. 0 times theorem prover too weak. 119 trivial. 26 not checked. [2022-10-04 00:56:04,764 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [946685910] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-04 00:56:04,764 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-04 00:56:04,764 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 23, 23] total 51 [2022-10-04 00:56:04,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [552573305] [2022-10-04 00:56:04,764 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-04 00:56:04,768 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2022-10-04 00:56:04,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-04 00:56:04,769 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2022-10-04 00:56:04,769 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=168, Invalid=2007, Unknown=93, NotChecked=282, Total=2550 [2022-10-04 00:56:04,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-04 00:56:04,771 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-10-04 00:56:04,773 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-10-04 00:56:04,774 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-04 00:56:04,774 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2022-10-04 00:56:04,774 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 59 states. [2022-10-04 00:56:04,774 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2022-10-04 00:56:04,774 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 67 states. [2022-10-04 00:56:04,774 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-04 00:56:05,246 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_~#queue~0.offset| 1604))) (and (= (select (select |c_#memory_int| |c_~#queue~0.base|) .cse0) 1) (= |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) (= .cse0 |c_t1Thread1of1ForFork1_write~int_#ptr#1.offset|) (= (select |c_#valid| |c_t1Thread1of1ForFork1_write~int_#ptr#1.base|) 1) (= (select |c_#valid| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) 1) (= (select (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604)) 1) (= |c_t1Thread1of1ForFork1_read~int_#ptr#1.base| |c_~#queue~0.base|) (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 ((.cse1 (select (store |c_#memory_int| |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_90| v_ArrVal_605) |c_~#queue~0.base|)) (.cse2 (+ |c_~#queue~0.offset| 1604))) (or (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_90| |c_~#stored_elements~0.base|)) (not (= 400 (select (store .cse1 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_75| v_ArrVal_608) .cse2))) (< (+ (* (select .cse1 .cse2) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_75|)))) (<= |c_~#stored_elements~0.base| 6) (<= 7 |c_t1Thread1of1ForFork1_enqueue_~q#1.base|))) is different from false [2022-10-04 00:56:05,249 WARN L833 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 1) (<= 7 |c_~#queue~0.base|) (= (select |c_#valid| |c_~#queue~0.base|) 1) (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| 1604))) (or (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_90| |c_~#stored_elements~0.base|)) (not (= 400 (select (store .cse0 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_75| v_ArrVal_608) .cse1))) (< (+ (* (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-10-04 00:56:05,252 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_90| Int)) (or (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| 1604))) (or (< (+ |c_~#queue~0.offset| (* (select .cse0 .cse1) 4)) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_75|) (not (= 400 (select (store .cse0 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_75| v_ArrVal_608) .cse1)))))) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_90| |c_~#stored_elements~0.base|)))) (<= 7 |c_~#queue~0.base|) (= (select |c_#valid| |c_~#queue~0.base|) 1) (= (select (select |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 1) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-10-04 00:56:05,667 WARN L833 $PredicateComparison]: unable to prove that (and (<= 7 |c_~#queue~0.base|) (<= |c_t1Thread1of1ForFork1_write~int_#ptr#1.base| 6) (= (select |c_#valid| |c_~#queue~0.base|) 1) (= (select (select |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 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| 1604))) (or (< (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_75|) (not (= (select (store .cse0 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_75| v_ArrVal_608) .cse1) 400))))) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-10-04 00:56:11,675 WARN L833 $PredicateComparison]: unable to prove that (and (<= 7 |c_~#queue~0.base|) (<= |c_t1Thread1of1ForFork1_write~int_#ptr#1.base| 6) (= (select |c_#valid| |c_~#queue~0.base|) 1) (= (select (select |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 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| 1604))) (or (< (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_75|) (not (= (select (store .cse0 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_75| v_ArrVal_608) .cse1) 400)))))) is different from false