/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/divinefifo_1w1r.line359.bpl -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.por-optimizations-5c708e3-m [2022-09-29 23:01:57,341 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-09-29 23:01:57,344 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-09-29 23:01:57,391 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-09-29 23:01:57,391 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-09-29 23:01:57,394 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-09-29 23:01:57,398 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-09-29 23:01:57,402 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-09-29 23:01:57,406 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-09-29 23:01:57,413 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-09-29 23:01:57,414 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-09-29 23:01:57,416 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-09-29 23:01:57,417 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-09-29 23:01:57,419 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-09-29 23:01:57,421 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-09-29 23:01:57,422 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-09-29 23:01:57,423 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-09-29 23:01:57,424 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-09-29 23:01:57,429 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-09-29 23:01:57,437 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-09-29 23:01:57,439 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-09-29 23:01:57,440 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-09-29 23:01:57,443 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-09-29 23:01:57,444 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-09-29 23:01:57,451 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-09-29 23:01:57,452 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-09-29 23:01:57,452 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-09-29 23:01:57,454 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-09-29 23:01:57,454 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-09-29 23:01:57,455 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-09-29 23:01:57,456 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-09-29 23:01:57,456 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-09-29 23:01:57,458 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-09-29 23:01:57,459 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-09-29 23:01:57,460 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-09-29 23:01:57,460 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-09-29 23:01:57,460 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-09-29 23:01:57,461 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-09-29 23:01:57,461 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-09-29 23:01:57,462 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-09-29 23:01:57,462 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-09-29 23:01:57,463 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/gemcutter/NewStatesSleep-VarAbsGlobalSyntactic.epf [2022-09-29 23:01:57,502 INFO L113 SettingsManager]: Loading preferences was successful [2022-09-29 23:01:57,502 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-09-29 23:01:57,503 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-09-29 23:01:57,503 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-09-29 23:01:57,504 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-09-29 23:01:57,504 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-09-29 23:01:57,504 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-09-29 23:01:57,505 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-09-29 23:01:57,505 INFO L138 SettingsManager]: * Use SBE=true [2022-09-29 23:01:57,505 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-09-29 23:01:57,506 INFO L138 SettingsManager]: * sizeof long=4 [2022-09-29 23:01:57,506 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-09-29 23:01:57,506 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-09-29 23:01:57,506 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-09-29 23:01:57,506 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-09-29 23:01:57,506 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-09-29 23:01:57,507 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-09-29 23:01:57,507 INFO L138 SettingsManager]: * sizeof long double=12 [2022-09-29 23:01:57,507 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-09-29 23:01:57,507 INFO L138 SettingsManager]: * Use constant arrays=true [2022-09-29 23:01:57,507 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-09-29 23:01:57,507 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-09-29 23:01:57,507 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-09-29 23:01:57,509 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-09-29 23:01:57,509 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-09-29 23:01:57,509 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-09-29 23:01:57,509 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-09-29 23:01:57,509 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-09-29 23:01:57,509 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-09-29 23:01:57,510 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-09-29 23:01:57,510 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-09-29 23:01:57,510 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-09-29 23:01:57,510 INFO L138 SettingsManager]: * Abstraction used for commutativity in POR=VARIABLES_GLOBAL [2022-09-29 23:01:57,510 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2022-09-29 23:01:57,510 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-09-29 23:01:57,510 INFO L138 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_ERROR_LOCATION [2022-09-29 23:01:57,511 INFO L138 SettingsManager]: * Partial Order Reduction in concurrent analysis=SLEEP_NEW_STATES [2022-09-29 23:01:57,511 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-09-29 23:01:57,511 INFO L138 SettingsManager]: * Independence relation used for POR in concurrent analysis=SYNTACTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2022-09-29 23:01:57,747 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-09-29 23:01:57,768 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-09-29 23:01:57,771 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-09-29 23:01:57,772 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2022-09-29 23:01:57,773 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2022-09-29 23:01:57,774 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/boogie-benchmarks-from-svcomp-memsafety-concurrent/divinefifo_1w1r.line359.bpl [2022-09-29 23:01:57,775 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/boogie-benchmarks-from-svcomp-memsafety-concurrent/divinefifo_1w1r.line359.bpl' [2022-09-29 23:01:57,868 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-09-29 23:01:57,870 INFO L131 ToolchainWalker]: Walking toolchain with 3 elements. [2022-09-29 23:01:57,872 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-09-29 23:01:57,872 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-09-29 23:01:57,872 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-09-29 23:01:57,888 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "divinefifo_1w1r.line359.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 29.09 11:01:57" (1/1) ... [2022-09-29 23:01:57,889 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "divinefifo_1w1r.line359.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 29.09 11:01:57" (1/1) ... [2022-09-29 23:01:57,934 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "divinefifo_1w1r.line359.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 29.09 11:01:57" (1/1) ... [2022-09-29 23:01:57,934 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "divinefifo_1w1r.line359.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 29.09 11:01:57" (1/1) ... [2022-09-29 23:01:57,998 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "divinefifo_1w1r.line359.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 29.09 11:01:57" (1/1) ... [2022-09-29 23:01:58,016 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "divinefifo_1w1r.line359.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 29.09 11:01:57" (1/1) ... [2022-09-29 23:01:58,022 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "divinefifo_1w1r.line359.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 29.09 11:01:57" (1/1) ... [2022-09-29 23:01:58,034 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-09-29 23:01:58,036 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-09-29 23:01:58,036 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-09-29 23:01:58,036 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-09-29 23:01:58,037 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "divinefifo_1w1r.line359.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 29.09 11:01:57" (1/1) ... [2022-09-29 23:01:58,057 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-09-29 23:01:58,069 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-29 23:01:58,083 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-09-29 23:01:58,093 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-09-29 23:01:58,124 INFO L130 BoogieDeclarations]: Found specification of procedure pusher [2022-09-29 23:01:58,124 INFO L138 BoogieDeclarations]: Found implementation of procedure pusher [2022-09-29 23:01:58,124 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-09-29 23:01:58,124 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-09-29 23:01:58,126 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-09-29 23:01:58,269 INFO L234 CfgBuilder]: Building ICFG [2022-09-29 23:01:58,271 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-09-29 23:01:59,433 INFO L275 CfgBuilder]: Performing block encoding [2022-09-29 23:01:59,460 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-09-29 23:01:59,460 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2022-09-29 23:01:59,463 INFO L202 PluginConnector]: Adding new model divinefifo_1w1r.line359.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.09 11:01:59 BoogieIcfgContainer [2022-09-29 23:01:59,463 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-09-29 23:01:59,465 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-09-29 23:01:59,465 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-09-29 23:01:59,469 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-09-29 23:01:59,469 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "divinefifo_1w1r.line359.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 29.09 11:01:57" (1/2) ... [2022-09-29 23:01:59,470 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29a041c4 and model type divinefifo_1w1r.line359.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.09 11:01:59, skipping insertion in model container [2022-09-29 23:01:59,470 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "divinefifo_1w1r.line359.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.09 11:01:59" (2/2) ... [2022-09-29 23:01:59,471 INFO L112 eAbstractionObserver]: Analyzing ICFG divinefifo_1w1r.line359.bpl [2022-09-29 23:01:59,478 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-09-29 23:01:59,486 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-09-29 23:01:59,486 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-09-29 23:01:59,486 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-09-29 23:01:59,611 INFO L144 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2022-09-29 23:01:59,669 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SYNTACTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-09-29 23:01:59,669 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2022-09-29 23:01:59,670 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-29 23:01:59,675 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2022-09-29 23:01:59,700 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2022-09-29 23:01:59,714 INFO L158 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2022-09-29 23:01:59,723 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == pusherErr0ASSERT_VIOLATIONASSERT ======== [2022-09-29 23:01:59,733 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;@675dbcb5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-09-29 23:01:59,733 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-09-29 23:01:59,737 WARN L124 DepthFirstTraversal]: Depth first traversal did not find any initial state. Returning directly. [2022-09-29 23:01:59,739 INFO L805 garLoopResultBuilder]: Registering result SAFE for location pusherErr0ASSERT_VIOLATIONASSERT (0 of 1 remaining) [2022-09-29 23:01:59,744 INFO L444 BasicCegarLoop]: Path program histogram: [] [2022-09-29 23:01:59,746 INFO L307 ceAbstractionStarter]: Result for error location pusherErr0ASSERT_VIOLATIONASSERT was SAFE (1/3) [2022-09-29 23:01:59,793 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SYNTACTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-09-29 23:01:59,793 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2022-09-29 23:01:59,794 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-29 23:01:59,800 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2022-09-29 23:01:59,801 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (3)] Waiting until timeout for monitored process [2022-09-29 23:01:59,805 INFO L158 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2022-09-29 23:01:59,806 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES ======== [2022-09-29 23:01:59,807 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;@675dbcb5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-09-29 23:01:59,807 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-09-29 23:01:59,898 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 1 remaining) [2022-09-29 23:01:59,899 INFO L444 BasicCegarLoop]: Path program histogram: [] [2022-09-29 23:01:59,899 INFO L307 ceAbstractionStarter]: Result for error location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES was SAFE (2/3) [2022-09-29 23:01:59,911 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SYNTACTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-09-29 23:01:59,911 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2022-09-29 23:01:59,911 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-29 23:01:59,949 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2022-09-29 23:01:59,952 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (4)] Waiting until timeout for monitored process [2022-09-29 23:01:59,956 INFO L158 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2022-09-29 23:01:59,957 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == pusherErr0ASSERT_VIOLATIONASSERT ======== [2022-09-29 23:01:59,958 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;@675dbcb5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-09-29 23:01:59,958 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-09-29 23:02:00,102 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting pusherErr0ASSERT_VIOLATIONASSERT === [pusherErr0ASSERT_VIOLATIONASSERT] === [2022-09-29 23:02:00,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-29 23:02:00,107 INFO L85 PathProgramCache]: Analyzing trace with hash -1595662237, now seen corresponding path program 1 times [2022-09-29 23:02:00,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-29 23:02:00,116 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1475399291] [2022-09-29 23:02:00,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-29 23:02:00,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-29 23:02:00,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-29 23:02:00,611 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-29 23:02:00,611 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-29 23:02:00,612 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1475399291] [2022-09-29 23:02:00,612 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1475399291] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-29 23:02:00,612 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-29 23:02:00,613 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-09-29 23:02:00,614 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [916264077] [2022-09-29 23:02:00,615 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-29 23:02:00,626 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-09-29 23:02:00,627 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-29 23:02:00,653 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-09-29 23:02:00,655 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-09-29 23:02:00,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-09-29 23:02:00,661 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-09-29 23:02:00,663 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 154.0) internal successors, (308), 2 states have internal predecessors, (308), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-29 23:02:00,663 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-09-29 23:02:00,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-09-29 23:02:00,718 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-09-29 23:02:00,721 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting pusherErr0ASSERT_VIOLATIONASSERT === [pusherErr0ASSERT_VIOLATIONASSERT] === [2022-09-29 23:02:00,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-29 23:02:00,723 INFO L85 PathProgramCache]: Analyzing trace with hash -748562621, now seen corresponding path program 1 times [2022-09-29 23:02:00,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-29 23:02:00,723 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1298360975] [2022-09-29 23:02:00,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-29 23:02:00,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-29 23:02:00,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-29 23:02:00,968 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-29 23:02:00,968 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-29 23:02:00,969 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1298360975] [2022-09-29 23:02:00,969 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1298360975] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-29 23:02:00,969 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-29 23:02:00,969 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-09-29 23:02:00,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1217500268] [2022-09-29 23:02:00,969 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-29 23:02:00,970 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-09-29 23:02:00,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-29 23:02:00,971 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-09-29 23:02:00,971 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-09-29 23:02:00,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-09-29 23:02:00,972 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-09-29 23:02:00,972 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 61.4) internal successors, (307), 6 states have internal predecessors, (307), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-29 23:02:00,973 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-09-29 23:02:00,973 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-09-29 23:02:09,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-09-29 23:02:09,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-09-29 23:02:09,149 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-09-29 23:02:09,149 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting pusherErr0ASSERT_VIOLATIONASSERT === [pusherErr0ASSERT_VIOLATIONASSERT] === [2022-09-29 23:02:09,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-29 23:02:09,151 INFO L85 PathProgramCache]: Analyzing trace with hash 1913436446, now seen corresponding path program 1 times [2022-09-29 23:02:09,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-29 23:02:09,152 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1676983987] [2022-09-29 23:02:09,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-29 23:02:09,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-29 23:02:16,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-29 23:02:37,562 INFO L134 CoverageAnalysis]: Checked inductivity of 140910 backedges. 134581 proven. 6329 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-29 23:02:37,576 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-29 23:02:37,576 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1676983987] [2022-09-29 23:02:37,577 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1676983987] provided 0 perfect and 1 imperfect interpolant sequences [2022-09-29 23:02:37,577 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1989253330] [2022-09-29 23:02:37,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-29 23:02:37,578 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-29 23:02:37,579 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-29 23:02:37,607 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-09-29 23:02:37,659 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-09-29 23:02:42,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-29 23:02:43,200 INFO L263 TraceCheckSpWp]: Trace formula consists of 25255 conjuncts, 9 conjunts are in the unsatisfiable core [2022-09-29 23:02:43,327 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-09-29 23:02:45,411 INFO L134 CoverageAnalysis]: Checked inductivity of 140910 backedges. 40422 proven. 0 refuted. 0 times theorem prover too weak. 100488 trivial. 0 not checked. [2022-09-29 23:02:45,411 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-09-29 23:02:45,411 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1989253330] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-29 23:02:45,412 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-09-29 23:02:45,414 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [48] total 49 [2022-09-29 23:02:45,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [65909725] [2022-09-29 23:02:45,415 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-29 23:02:45,420 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-09-29 23:02:45,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-29 23:02:45,421 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-09-29 23:02:45,423 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1131, Invalid=1221, Unknown=0, NotChecked=0, Total=2352 [2022-09-29 23:02:45,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-09-29 23:02:45,426 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-09-29 23:02:45,428 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 247.6) internal successors, (2476), 10 states have internal predecessors, (2476), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-29 23:02:45,428 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-09-29 23:02:45,428 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2022-09-29 23:02:45,429 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-09-29 23:02:51,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-09-29 23:02:51,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-09-29 23:02:51,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-09-29 23:02:51,939 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-09-29 23:02:52,073 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-29 23:02:52,075 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting pusherErr0ASSERT_VIOLATIONASSERT === [pusherErr0ASSERT_VIOLATIONASSERT] === [2022-09-29 23:02:52,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-29 23:02:52,076 INFO L85 PathProgramCache]: Analyzing trace with hash 1082490426, now seen corresponding path program 1 times [2022-09-29 23:02:52,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-29 23:02:52,076 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1946536573] [2022-09-29 23:02:52,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-29 23:02:52,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-29 23:03:01,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-29 23:03:35,481 INFO L134 CoverageAnalysis]: Checked inductivity of 2823 backedges. 1717 proven. 620 refuted. 0 times theorem prover too weak. 486 trivial. 0 not checked. [2022-09-29 23:03:35,482 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-29 23:03:35,482 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1946536573] [2022-09-29 23:03:35,482 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1946536573] provided 0 perfect and 1 imperfect interpolant sequences [2022-09-29 23:03:35,482 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [263274915] [2022-09-29 23:03:35,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-29 23:03:35,483 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-29 23:03:35,484 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-29 23:03:35,485 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-09-29 23:03:35,488 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-09-29 23:03:36,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-29 23:03:36,585 INFO L263 TraceCheckSpWp]: Trace formula consists of 4151 conjuncts, 311 conjunts are in the unsatisfiable core [2022-09-29 23:03:36,620 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-09-29 23:03:52,454 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-09-29 23:03:52,465 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-09-29 23:03:55,923 INFO L356 Elim1Store]: treesize reduction 4, result has 71.4 percent of original size [2022-09-29 23:03:55,923 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 17 treesize of output 17 [2022-09-29 23:03:57,562 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-29 23:03:57,570 INFO L356 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-09-29 23:03:57,570 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 73 treesize of output 75 [2022-09-29 23:03:57,580 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-29 23:03:57,583 INFO L356 Elim1Store]: treesize reduction 13, result has 7.1 percent of original size [2022-09-29 23:03:57,583 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 72 treesize of output 71 [2022-09-29 23:03:57,882 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-29 23:03:57,890 INFO L356 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-09-29 23:03:57,890 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 73 treesize of output 75 [2022-09-29 23:03:57,905 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-29 23:03:57,908 INFO L356 Elim1Store]: treesize reduction 13, result has 7.1 percent of original size [2022-09-29 23:03:57,909 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 72 treesize of output 71 [2022-09-29 23:04:10,389 INFO L173 IndexEqualityManager]: detected equality via solver [2022-09-29 23:04:10,389 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-29 23:04:10,390 INFO L173 IndexEqualityManager]: detected equality via solver [2022-09-29 23:04:10,407 INFO L356 Elim1Store]: treesize reduction 111, result has 12.6 percent of original size [2022-09-29 23:04:10,408 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 8 new quantified variables, introduced 12 case distinctions, treesize of input 164 treesize of output 102 [2022-09-29 23:04:10,947 INFO L134 CoverageAnalysis]: Checked inductivity of 2823 backedges. 804 proven. 414 refuted. 0 times theorem prover too weak. 1605 trivial. 0 not checked. [2022-09-29 23:04:10,947 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-09-29 23:04:23,727 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_4602 (Array Int Int))) (let ((.cse9 (select (store |c_pusherThread1of1ForFork0_write~$Pointer$_old_#memory_$Pointer$#1.offset| |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base| v_ArrVal_4602) |c_ULTIMATE.start_main_~#q~1#1.base|))) (let ((.cse0 (select .cse9 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (or (not (<= 0 .cse0)) (forall ((v_ArrVal_4601 (Array Int Int))) (let ((.cse8 (store |c_pusherThread1of1ForFork0_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base| v_ArrVal_4601))) (let ((.cse1 (select .cse8 |c_ULTIMATE.start_main_~#q~1#1.base|))) (let ((.cse4 (store |c_pusherThread1of1ForFork0_write~$Pointer$_old_#memory_$Pointer$#1.offset| |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base| v_ArrVal_4602)) (.cse2 (select .cse1 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (let ((.cse7 (select .cse8 .cse2)) (.cse5 (select (select .cse4 |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|))) (let ((.cse3 (select .cse7 .cse5)) (.cse6 (+ 12 .cse5))) (or (not (= (select .cse1 (+ 4 |c_ULTIMATE.start_main_~#q~1#1.offset|)) .cse2)) (not (= .cse3 .cse2)) (< (select (select .cse4 .cse2) .cse5) .cse6) (= .cse3 (select .cse7 .cse6))))))))) (not (= (select .cse9 (+ 4 |c_ULTIMATE.start_main_~#q~1#1.offset|)) .cse0)))))) (forall ((v_ArrVal_4602 (Array Int Int))) (let ((.cse19 (select (store |c_pusherThread1of1ForFork0_write~$Pointer$_old_#memory_$Pointer$#1.offset| |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base| v_ArrVal_4602) |c_ULTIMATE.start_main_~#q~1#1.base|))) (let ((.cse10 (select .cse19 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (or (not (<= 0 .cse10)) (forall ((v_ArrVal_4601 (Array Int Int))) (let ((.cse13 (store |c_pusherThread1of1ForFork0_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base| v_ArrVal_4601))) (let ((.cse11 (select .cse13 |c_ULTIMATE.start_main_~#q~1#1.base|))) (let ((.cse18 (store |c_pusherThread1of1ForFork0_write~$Pointer$_old_#memory_$Pointer$#1.offset| |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base| v_ArrVal_4602)) (.cse12 (select .cse11 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (let ((.cse17 (select .cse18 .cse12)) (.cse14 (select (select .cse18 |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|))) (let ((.cse16 (+ 12 .cse14)) (.cse15 (select .cse17 .cse14))) (or (not (= (select .cse11 (+ 4 |c_ULTIMATE.start_main_~#q~1#1.offset|)) .cse12)) (not (= (select (select .cse13 .cse12) .cse14) .cse12)) (< .cse15 .cse16) (< (select .cse17 .cse16) (+ .cse15 1))))))))) (not (= (select .cse19 (+ 4 |c_ULTIMATE.start_main_~#q~1#1.offset|)) .cse10))))))) is different from false [2022-09-29 23:04:23,890 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_4602 (Array Int Int))) (let ((.cse1 (select (store |c_pusherThread1of1ForFork0_write~$Pointer$_old_#memory_$Pointer$#1.offset| |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| v_ArrVal_4602) |c_ULTIMATE.start_main_~#q~1#1.base|))) (let ((.cse0 (select .cse1 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (or (not (<= 0 .cse0)) (not (= (select .cse1 (+ 4 |c_ULTIMATE.start_main_~#q~1#1.offset|)) .cse0)) (forall ((v_ArrVal_4601 (Array Int Int))) (let ((.cse2 (store |c_pusherThread1of1ForFork0_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| v_ArrVal_4601))) (let ((.cse8 (select .cse2 |c_ULTIMATE.start_main_~#q~1#1.base|))) (let ((.cse9 (store |c_pusherThread1of1ForFork0_write~$Pointer$_old_#memory_$Pointer$#1.offset| |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| v_ArrVal_4602)) (.cse3 (select .cse8 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (let ((.cse5 (select .cse9 .cse3)) (.cse4 (select (select .cse9 |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|))) (let ((.cse7 (select .cse5 .cse4)) (.cse6 (+ 12 .cse4))) (or (not (= (select (select .cse2 .cse3) .cse4) .cse3)) (< (select .cse5 .cse6) (+ .cse7 1)) (< .cse7 .cse6) (not (= (select .cse8 (+ 4 |c_ULTIMATE.start_main_~#q~1#1.offset|)) .cse3))))))))))))) (forall ((v_ArrVal_4602 (Array Int Int))) (let ((.cse11 (select (store |c_pusherThread1of1ForFork0_write~$Pointer$_old_#memory_$Pointer$#1.offset| |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| v_ArrVal_4602) |c_ULTIMATE.start_main_~#q~1#1.base|))) (let ((.cse10 (select .cse11 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (or (not (<= 0 .cse10)) (not (= (select .cse11 (+ 4 |c_ULTIMATE.start_main_~#q~1#1.offset|)) .cse10)) (forall ((v_ArrVal_4601 (Array Int Int))) (let ((.cse19 (store |c_pusherThread1of1ForFork0_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| v_ArrVal_4601))) (let ((.cse18 (select .cse19 |c_ULTIMATE.start_main_~#q~1#1.base|))) (let ((.cse16 (store |c_pusherThread1of1ForFork0_write~$Pointer$_old_#memory_$Pointer$#1.offset| |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| v_ArrVal_4602)) (.cse15 (select .cse18 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (let ((.cse13 (select .cse19 .cse15)) (.cse17 (select (select .cse16 |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|))) (let ((.cse12 (select .cse13 .cse17)) (.cse14 (+ 12 .cse17))) (or (= .cse12 (select .cse13 .cse14)) (not (= .cse12 .cse15)) (< (select (select .cse16 .cse15) .cse17) .cse14) (not (= (select .cse18 (+ 4 |c_ULTIMATE.start_main_~#q~1#1.offset|)) .cse15)))))))))))))) is different from false [2022-09-29 23:04:23,975 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_4602 (Array Int Int))) (let ((.cse9 (select (store |c_#memory_$Pointer$.offset| |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| v_ArrVal_4602) |c_ULTIMATE.start_main_~#q~1#1.base|))) (let ((.cse8 (select .cse9 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (or (forall ((v_ArrVal_4601 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| v_ArrVal_4601))) (let ((.cse6 (select .cse3 |c_ULTIMATE.start_main_~#q~1#1.base|))) (let ((.cse7 (store |c_#memory_$Pointer$.offset| |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| v_ArrVal_4602)) (.cse4 (select .cse6 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (let ((.cse0 (select .cse7 .cse4)) (.cse5 (select (select .cse7 |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|))) (let ((.cse2 (select .cse0 .cse5)) (.cse1 (+ 12 .cse5))) (or (< (select .cse0 .cse1) (+ .cse2 1)) (not (= (select (select .cse3 .cse4) .cse5) .cse4)) (< .cse2 .cse1) (not (= (select .cse6 (+ 4 |c_ULTIMATE.start_main_~#q~1#1.offset|)) .cse4))))))))) (not (<= 0 .cse8)) (not (= .cse8 (select .cse9 (+ 4 |c_ULTIMATE.start_main_~#q~1#1.offset|)))))))) (forall ((v_ArrVal_4602 (Array Int Int))) (let ((.cse19 (select (store |c_#memory_$Pointer$.offset| |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| v_ArrVal_4602) |c_ULTIMATE.start_main_~#q~1#1.base|))) (let ((.cse10 (select .cse19 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (or (not (<= 0 .cse10)) (forall ((v_ArrVal_4601 (Array Int Int))) (let ((.cse18 (store |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| v_ArrVal_4601))) (let ((.cse16 (select .cse18 |c_ULTIMATE.start_main_~#q~1#1.base|))) (let ((.cse13 (store |c_#memory_$Pointer$.offset| |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| v_ArrVal_4602)) (.cse12 (select .cse16 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (let ((.cse17 (select .cse18 .cse12)) (.cse14 (select (select .cse13 |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|))) (let ((.cse15 (+ 12 .cse14)) (.cse11 (select .cse17 .cse14))) (or (not (= .cse11 .cse12)) (< (select (select .cse13 .cse12) .cse14) .cse15) (not (= (select .cse16 (+ 4 |c_ULTIMATE.start_main_~#q~1#1.offset|)) .cse12)) (= (select .cse17 .cse15) .cse11)))))))) (not (= .cse10 (select .cse19 (+ 4 |c_ULTIMATE.start_main_~#q~1#1.offset|))))))))) is different from false [2022-09-29 23:04:24,077 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_4599 (Array Int Int)) (v_ArrVal_4600 (Array Int Int)) (v_ArrVal_4602 (Array Int Int))) (let ((.cse1 (select (store (store |c_pusherThread1of1ForFork0_write~$Pointer$_old_#memory_$Pointer$#1.offset| |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base| v_ArrVal_4599) |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| v_ArrVal_4602) |c_ULTIMATE.start_main_~#q~1#1.base|))) (let ((.cse0 (select .cse1 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (or (not (= .cse0 (select .cse1 (+ 4 |c_ULTIMATE.start_main_~#q~1#1.offset|)))) (not (<= 0 .cse0)) (forall ((v_ArrVal_4601 (Array Int Int))) (let ((.cse9 (store (store |c_pusherThread1of1ForFork0_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base| v_ArrVal_4600) |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| v_ArrVal_4601))) (let ((.cse8 (select .cse9 |c_ULTIMATE.start_main_~#q~1#1.base|))) (let ((.cse6 (store (store |c_pusherThread1of1ForFork0_write~$Pointer$_old_#memory_$Pointer$#1.offset| |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base| v_ArrVal_4599) |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| v_ArrVal_4602)) (.cse3 (select .cse8 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (let ((.cse4 (select .cse9 .cse3)) (.cse7 (select (select .cse6 |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|))) (let ((.cse2 (select .cse4 .cse7)) (.cse5 (+ .cse7 12))) (or (not (= .cse2 .cse3)) (= .cse2 (select .cse4 .cse5)) (< (select (select .cse6 .cse3) .cse7) .cse5) (not (= (select .cse8 (+ 4 |c_ULTIMATE.start_main_~#q~1#1.offset|)) .cse3))))))))))))) (forall ((v_ArrVal_4599 (Array Int Int)) (v_ArrVal_4600 (Array Int Int)) (v_ArrVal_4602 (Array Int Int))) (let ((.cse11 (select (store (store |c_pusherThread1of1ForFork0_write~$Pointer$_old_#memory_$Pointer$#1.offset| |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base| v_ArrVal_4599) |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| v_ArrVal_4602) |c_ULTIMATE.start_main_~#q~1#1.base|))) (let ((.cse10 (select .cse11 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (or (not (= .cse10 (select .cse11 (+ 4 |c_ULTIMATE.start_main_~#q~1#1.offset|)))) (not (<= 0 .cse10)) (forall ((v_ArrVal_4601 (Array Int Int))) (let ((.cse12 (store (store |c_pusherThread1of1ForFork0_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base| v_ArrVal_4600) |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| v_ArrVal_4601))) (let ((.cse18 (select .cse12 |c_ULTIMATE.start_main_~#q~1#1.base|))) (let ((.cse19 (store (store |c_pusherThread1of1ForFork0_write~$Pointer$_old_#memory_$Pointer$#1.offset| |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base| v_ArrVal_4599) |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| v_ArrVal_4602)) (.cse13 (select .cse18 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (let ((.cse15 (select .cse19 .cse13)) (.cse14 (select (select .cse19 |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|))) (let ((.cse17 (select .cse15 .cse14)) (.cse16 (+ .cse14 12))) (or (not (= (select (select .cse12 .cse13) .cse14) .cse13)) (< (select .cse15 .cse16) (+ .cse17 1)) (< .cse17 .cse16) (not (= (select .cse18 (+ 4 |c_ULTIMATE.start_main_~#q~1#1.offset|)) .cse13)))))))))))))) is different from false [2022-09-29 23:04:24,376 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_4602 (Array Int Int))) (let ((.cse0 (select (store |c_#memory_$Pointer$.offset| |c_pusherThread1of1ForFork0_fifo_node_init_#in~self#1.base| v_ArrVal_4602) |c_ULTIMATE.start_main_~#q~1#1.base|))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (or (not (= (select .cse0 (+ 4 |c_ULTIMATE.start_main_~#q~1#1.offset|)) .cse1)) (not (<= 0 .cse1)) (forall ((v_ArrVal_4601 (Array Int Int))) (let ((.cse7 (store |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_fifo_node_init_#in~self#1.base| v_ArrVal_4601))) (let ((.cse5 (select .cse7 |c_ULTIMATE.start_main_~#q~1#1.base|))) (let ((.cse9 (store |c_#memory_$Pointer$.offset| |c_pusherThread1of1ForFork0_fifo_node_init_#in~self#1.base| v_ArrVal_4602)) (.cse6 (select .cse5 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (let ((.cse2 (select .cse9 .cse6)) (.cse8 (select (select .cse9 |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|))) (let ((.cse4 (select .cse2 .cse8)) (.cse3 (+ .cse8 12))) (or (< (select .cse2 .cse3) (+ .cse4 1)) (< .cse4 .cse3) (not (= (select .cse5 (+ 4 |c_ULTIMATE.start_main_~#q~1#1.offset|)) .cse6)) (not (= .cse6 (select (select .cse7 .cse6) .cse8)))))))))))))) (forall ((v_ArrVal_4602 (Array Int Int))) (let ((.cse10 (select (store |c_#memory_$Pointer$.offset| |c_pusherThread1of1ForFork0_fifo_node_init_#in~self#1.base| v_ArrVal_4602) |c_ULTIMATE.start_main_~#q~1#1.base|))) (let ((.cse11 (select .cse10 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (or (not (= (select .cse10 (+ 4 |c_ULTIMATE.start_main_~#q~1#1.offset|)) .cse11)) (not (<= 0 .cse11)) (forall ((v_ArrVal_4601 (Array Int Int))) (let ((.cse19 (store |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_fifo_node_init_#in~self#1.base| v_ArrVal_4601))) (let ((.cse18 (select .cse19 |c_ULTIMATE.start_main_~#q~1#1.base|))) (let ((.cse12 (store |c_#memory_$Pointer$.offset| |c_pusherThread1of1ForFork0_fifo_node_init_#in~self#1.base| v_ArrVal_4602)) (.cse13 (select .cse18 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (let ((.cse16 (select .cse19 .cse13)) (.cse14 (select (select .cse12 |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|))) (let ((.cse15 (+ .cse14 12)) (.cse17 (select .cse16 .cse14))) (or (< (select (select .cse12 .cse13) .cse14) .cse15) (= (select .cse16 .cse15) .cse17) (not (= (select .cse18 (+ 4 |c_ULTIMATE.start_main_~#q~1#1.offset|)) .cse13)) (not (= .cse13 .cse17)))))))))))))) is different from false [2022-09-29 23:04:24,490 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_4602 (Array Int Int))) (let ((.cse0 (select (store |c_#memory_$Pointer$.offset| |c_pusherThread1of1ForFork0_fifo_push_#t~malloc23#1.base| v_ArrVal_4602) |c_ULTIMATE.start_main_~#q~1#1.base|))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (or (not (= (select .cse0 (+ 4 |c_ULTIMATE.start_main_~#q~1#1.offset|)) .cse1)) (not (<= 0 .cse1)) (forall ((v_ArrVal_4601 (Array Int Int))) (let ((.cse9 (store |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_fifo_push_#t~malloc23#1.base| v_ArrVal_4601))) (let ((.cse3 (select .cse9 |c_ULTIMATE.start_main_~#q~1#1.base|))) (let ((.cse7 (store |c_#memory_$Pointer$.offset| |c_pusherThread1of1ForFork0_fifo_push_#t~malloc23#1.base| v_ArrVal_4602)) (.cse2 (select .cse3 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (let ((.cse5 (select .cse9 .cse2)) (.cse8 (select (select .cse7 |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|))) (let ((.cse6 (+ 12 .cse8)) (.cse4 (select .cse5 .cse8))) (or (not (= .cse2 (select .cse3 (+ 4 |c_ULTIMATE.start_main_~#q~1#1.offset|)))) (= .cse4 (select .cse5 .cse6)) (< (select (select .cse7 .cse2) .cse8) .cse6) (not (= .cse4 .cse2))))))))))))) (forall ((v_ArrVal_4602 (Array Int Int))) (let ((.cse10 (select (store |c_#memory_$Pointer$.offset| |c_pusherThread1of1ForFork0_fifo_push_#t~malloc23#1.base| v_ArrVal_4602) |c_ULTIMATE.start_main_~#q~1#1.base|))) (let ((.cse11 (select .cse10 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (or (not (= (select .cse10 (+ 4 |c_ULTIMATE.start_main_~#q~1#1.offset|)) .cse11)) (not (<= 0 .cse11)) (forall ((v_ArrVal_4601 (Array Int Int))) (let ((.cse17 (store |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_fifo_push_#t~malloc23#1.base| v_ArrVal_4601))) (let ((.cse16 (select .cse17 |c_ULTIMATE.start_main_~#q~1#1.base|))) (let ((.cse19 (store |c_#memory_$Pointer$.offset| |c_pusherThread1of1ForFork0_fifo_push_#t~malloc23#1.base| v_ArrVal_4602)) (.cse15 (select .cse16 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (let ((.cse12 (select .cse19 .cse15)) (.cse18 (select (select .cse19 |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|))) (let ((.cse14 (select .cse12 .cse18)) (.cse13 (+ 12 .cse18))) (or (< (select .cse12 .cse13) (+ .cse14 1)) (not (= .cse15 (select .cse16 (+ 4 |c_ULTIMATE.start_main_~#q~1#1.offset|)))) (< .cse14 .cse13) (not (= (select (select .cse17 .cse15) .cse18) .cse15)))))))))))))) is different from false [2022-09-29 23:04:24,601 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_4602 (Array Int Int))) (let ((.cse8 (select (store |c_#memory_$Pointer$.offset| |c_pusherThread1of1ForFork0_#Ultimate.allocOnHeap_#res#1.base| v_ArrVal_4602) |c_ULTIMATE.start_main_~#q~1#1.base|))) (let ((.cse9 (select .cse8 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (or (forall ((v_ArrVal_4601 (Array Int Int))) (let ((.cse7 (store |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_#Ultimate.allocOnHeap_#res#1.base| v_ArrVal_4601))) (let ((.cse3 (select .cse7 |c_ULTIMATE.start_main_~#q~1#1.base|))) (let ((.cse5 (store |c_#memory_$Pointer$.offset| |c_pusherThread1of1ForFork0_#Ultimate.allocOnHeap_#res#1.base| v_ArrVal_4602)) (.cse4 (select .cse3 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (let ((.cse0 (select .cse7 .cse4)) (.cse6 (select (select .cse5 |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|))) (let ((.cse1 (+ 12 .cse6)) (.cse2 (select .cse0 .cse6))) (or (= (select .cse0 .cse1) .cse2) (not (= (select .cse3 (+ 4 |c_ULTIMATE.start_main_~#q~1#1.offset|)) .cse4)) (< (select (select .cse5 .cse4) .cse6) .cse1) (not (= .cse4 .cse2))))))))) (not (= (select .cse8 (+ 4 |c_ULTIMATE.start_main_~#q~1#1.offset|)) .cse9)) (not (<= 0 .cse9)))))) (forall ((v_ArrVal_4602 (Array Int Int))) (let ((.cse10 (select (store |c_#memory_$Pointer$.offset| |c_pusherThread1of1ForFork0_#Ultimate.allocOnHeap_#res#1.base| v_ArrVal_4602) |c_ULTIMATE.start_main_~#q~1#1.base|))) (let ((.cse11 (select .cse10 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (or (not (= (select .cse10 (+ 4 |c_ULTIMATE.start_main_~#q~1#1.offset|)) .cse11)) (forall ((v_ArrVal_4601 (Array Int Int))) (let ((.cse16 (store |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_#Ultimate.allocOnHeap_#res#1.base| v_ArrVal_4601))) (let ((.cse12 (select .cse16 |c_ULTIMATE.start_main_~#q~1#1.base|))) (let ((.cse19 (store |c_#memory_$Pointer$.offset| |c_pusherThread1of1ForFork0_#Ultimate.allocOnHeap_#res#1.base| v_ArrVal_4602)) (.cse13 (select .cse12 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (let ((.cse18 (select .cse19 .cse13)) (.cse17 (select (select .cse19 |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|))) (let ((.cse15 (+ 12 .cse17)) (.cse14 (select .cse18 .cse17))) (or (not (= (select .cse12 (+ 4 |c_ULTIMATE.start_main_~#q~1#1.offset|)) .cse13)) (< .cse14 .cse15) (not (= .cse13 (select (select .cse16 .cse13) .cse17))) (< (select .cse18 .cse15) (+ .cse14 1))))))))) (not (<= 0 .cse11))))))) is different from false [2022-09-29 23:04:24,688 WARN L833 $PredicateComparison]: unable to prove that (or (not (< |c_pusherThread1of1ForFork0_#Ultimate.allocOnHeap_#res#1.base| |c_#StackHeapBarrier|)) (and (forall ((v_ArrVal_4602 (Array Int Int))) (let ((.cse8 (select (store |c_#memory_$Pointer$.offset| |c_pusherThread1of1ForFork0_#Ultimate.allocOnHeap_#res#1.base| v_ArrVal_4602) |c_ULTIMATE.start_main_~#q~1#1.base|))) (let ((.cse9 (select .cse8 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (or (forall ((v_ArrVal_4601 (Array Int Int))) (let ((.cse7 (store |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_#Ultimate.allocOnHeap_#res#1.base| v_ArrVal_4601))) (let ((.cse3 (select .cse7 |c_ULTIMATE.start_main_~#q~1#1.base|))) (let ((.cse5 (store |c_#memory_$Pointer$.offset| |c_pusherThread1of1ForFork0_#Ultimate.allocOnHeap_#res#1.base| v_ArrVal_4602)) (.cse4 (select .cse3 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (let ((.cse0 (select .cse7 .cse4)) (.cse6 (select (select .cse5 |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|))) (let ((.cse1 (+ 12 .cse6)) (.cse2 (select .cse0 .cse6))) (or (= (select .cse0 .cse1) .cse2) (not (= (select .cse3 (+ 4 |c_ULTIMATE.start_main_~#q~1#1.offset|)) .cse4)) (< (select (select .cse5 .cse4) .cse6) .cse1) (not (= .cse4 .cse2))))))))) (not (= (select .cse8 (+ 4 |c_ULTIMATE.start_main_~#q~1#1.offset|)) .cse9)) (not (<= 0 .cse9)))))) (forall ((v_ArrVal_4602 (Array Int Int))) (let ((.cse10 (select (store |c_#memory_$Pointer$.offset| |c_pusherThread1of1ForFork0_#Ultimate.allocOnHeap_#res#1.base| v_ArrVal_4602) |c_ULTIMATE.start_main_~#q~1#1.base|))) (let ((.cse11 (select .cse10 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (or (not (= (select .cse10 (+ 4 |c_ULTIMATE.start_main_~#q~1#1.offset|)) .cse11)) (forall ((v_ArrVal_4601 (Array Int Int))) (let ((.cse16 (store |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_#Ultimate.allocOnHeap_#res#1.base| v_ArrVal_4601))) (let ((.cse12 (select .cse16 |c_ULTIMATE.start_main_~#q~1#1.base|))) (let ((.cse19 (store |c_#memory_$Pointer$.offset| |c_pusherThread1of1ForFork0_#Ultimate.allocOnHeap_#res#1.base| v_ArrVal_4602)) (.cse13 (select .cse12 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (let ((.cse18 (select .cse19 .cse13)) (.cse17 (select (select .cse19 |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|))) (let ((.cse15 (+ 12 .cse17)) (.cse14 (select .cse18 .cse17))) (or (not (= (select .cse12 (+ 4 |c_ULTIMATE.start_main_~#q~1#1.offset|)) .cse13)) (< .cse14 .cse15) (not (= .cse13 (select (select .cse16 .cse13) .cse17))) (< (select .cse18 .cse15) (+ .cse14 1))))))))) (not (<= 0 .cse11)))))))) is different from false