/root/.sdkman/candidates/java/21.0.5-tem/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata ./data -s ../benchexec/../../../trunk/examples/settings/gemcutter/NewStatesSleepPersistentFixedOrder.epf --traceabstraction.dfs.order.used.in.por LOOP_LOCKSTEP --traceabstraction.commutativity.condition.synthesis NECESSARY_AND_SUFFICIENT --traceabstraction.refinement.strategy.for.commutativity.condition.synthesis BADGER -tc ../benchexec/../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/mult-comm.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.conditional-comm-158c277 [2024-11-14 16:49:28,403 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-14 16:49:28,436 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/../benchexec/../../../trunk/examples/settings/gemcutter/NewStatesSleepPersistentFixedOrder.epf [2024-11-14 16:49:28,439 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-14 16:49:28,439 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-14 16:49:28,453 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-14 16:49:28,454 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-14 16:49:28,454 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-14 16:49:28,454 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-14 16:49:28,454 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-14 16:49:28,454 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-14 16:49:28,454 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-14 16:49:28,454 INFO L153 SettingsManager]: * Use SBE=true [2024-11-14 16:49:28,454 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-14 16:49:28,454 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-14 16:49:28,455 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-14 16:49:28,455 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-14 16:49:28,455 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-14 16:49:28,455 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-14 16:49:28,455 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-14 16:49:28,455 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-14 16:49:28,455 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-14 16:49:28,455 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-14 16:49:28,455 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-14 16:49:28,455 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-14 16:49:28,455 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-14 16:49:28,455 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-14 16:49:28,455 INFO L153 SettingsManager]: * To the following directory=./dump/ [2024-11-14 16:49:28,455 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-14 16:49:28,455 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-14 16:49:28,456 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-14 16:49:28,456 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-14 16:49:28,456 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-14 16:49:28,456 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-14 16:49:28,456 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-14 16:49:28,456 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-14 16:49:28,456 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2024-11-14 16:49:28,456 INFO L153 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2024-11-14 16:49:28,456 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2024-11-14 16:49:28,456 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: DFS Order used in POR -> LOOP_LOCKSTEP Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Commutativity condition synthesis -> NECESSARY_AND_SUFFICIENT Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Refinement strategy for commutativity condition synthesis -> BADGER [2024-11-14 16:49:28,685 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-14 16:49:28,692 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-14 16:49:28,694 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-14 16:49:28,695 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-14 16:49:28,697 INFO L274 PluginConnector]: CDTParser initialized [2024-11-14 16:49:28,699 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/svcomp/weaver/mult-comm.wvr.c [2024-11-14 16:49:29,878 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-14 16:49:30,062 INFO L384 CDTParser]: Found 1 translation units. [2024-11-14 16:49:30,063 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/trunk/examples/svcomp/weaver/mult-comm.wvr.c [2024-11-14 16:49:30,069 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/data/d114ceada/6d3899fb279f4a6495f0ea92e58a5c85/FLAG4f701ef31 [2024-11-14 16:49:30,440 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/data/d114ceada/6d3899fb279f4a6495f0ea92e58a5c85 [2024-11-14 16:49:30,441 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-14 16:49:30,442 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-11-14 16:49:30,443 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-14 16:49:30,443 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-14 16:49:30,446 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-14 16:49:30,447 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 04:49:30" (1/1) ... [2024-11-14 16:49:30,447 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5c08a399 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:49:30, skipping insertion in model container [2024-11-14 16:49:30,447 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 04:49:30" (1/1) ... [2024-11-14 16:49:30,457 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-14 16:49:30,560 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/trunk/examples/svcomp/weaver/mult-comm.wvr.c[1936,1949] [2024-11-14 16:49:30,563 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-14 16:49:30,569 INFO L200 MainTranslator]: Completed pre-run [2024-11-14 16:49:30,579 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/trunk/examples/svcomp/weaver/mult-comm.wvr.c[1936,1949] [2024-11-14 16:49:30,579 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-14 16:49:30,588 INFO L204 MainTranslator]: Completed translation [2024-11-14 16:49:30,588 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:49:30 WrapperNode [2024-11-14 16:49:30,588 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-14 16:49:30,589 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-14 16:49:30,589 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-14 16:49:30,589 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-14 16:49:30,593 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:49:30" (1/1) ... [2024-11-14 16:49:30,597 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:49:30" (1/1) ... [2024-11-14 16:49:30,604 INFO L138 Inliner]: procedures = 20, calls = 9, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 41 [2024-11-14 16:49:30,604 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-14 16:49:30,605 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-14 16:49:30,605 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-14 16:49:30,605 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-14 16:49:30,608 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:49:30" (1/1) ... [2024-11-14 16:49:30,608 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:49:30" (1/1) ... [2024-11-14 16:49:30,609 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:49:30" (1/1) ... [2024-11-14 16:49:30,609 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:49:30" (1/1) ... [2024-11-14 16:49:30,611 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:49:30" (1/1) ... [2024-11-14 16:49:30,613 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:49:30" (1/1) ... [2024-11-14 16:49:30,613 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:49:30" (1/1) ... [2024-11-14 16:49:30,613 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:49:30" (1/1) ... [2024-11-14 16:49:30,614 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-14 16:49:30,614 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-14 16:49:30,615 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-14 16:49:30,615 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-14 16:49:30,615 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:49:30" (1/1) ... [2024-11-14 16:49:30,619 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-14 16:49:30,626 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 [2024-11-14 16:49:30,636 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-11-14 16:49:30,642 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-11-14 16:49:30,655 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-14 16:49:30,655 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-11-14 16:49:30,655 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-11-14 16:49:30,655 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-11-14 16:49:30,656 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-11-14 16:49:30,656 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-14 16:49:30,656 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-14 16:49:30,656 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-14 16:49:30,656 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-14 16:49:30,715 INFO L238 CfgBuilder]: Building ICFG [2024-11-14 16:49:30,716 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-14 16:49:30,837 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-14 16:49:30,837 INFO L287 CfgBuilder]: Performing block encoding [2024-11-14 16:49:30,844 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-14 16:49:30,844 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-14 16:49:30,844 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 04:49:30 BoogieIcfgContainer [2024-11-14 16:49:30,844 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-14 16:49:30,846 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-14 16:49:30,846 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-14 16:49:30,849 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-14 16:49:30,849 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.11 04:49:30" (1/3) ... [2024-11-14 16:49:30,849 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@169fbf6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 04:49:30, skipping insertion in model container [2024-11-14 16:49:30,849 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:49:30" (2/3) ... [2024-11-14 16:49:30,850 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@169fbf6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 04:49:30, skipping insertion in model container [2024-11-14 16:49:30,850 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 04:49:30" (3/3) ... [2024-11-14 16:49:30,850 INFO L112 eAbstractionObserver]: Analyzing ICFG mult-comm.wvr.c [2024-11-14 16:49:30,860 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-14 16:49:30,861 INFO L154 ceAbstractionStarter]: Applying trace abstraction to ICFG mult-comm.wvr.c that has 3 procedures, 70 locations, 1 initial locations, 2 loop locations, and 1 error locations. [2024-11-14 16:49:30,861 INFO L492 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-14 16:49:30,915 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-11-14 16:49:30,945 INFO L123 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-14 16:49:30,945 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-11-14 16:49:30,945 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 [2024-11-14 16:49:30,947 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-11-14 16:49:30,950 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2024-11-14 16:49:31,001 INFO L185 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-14 16:49:31,010 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-11-14 16:49:31,015 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@7d173af5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-14 16:49:31,015 INFO L334 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2024-11-14 16:49:31,137 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-14 16:49:31,140 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 16:49:31,140 INFO L85 PathProgramCache]: Analyzing trace with hash -1808911534, now seen corresponding path program 1 times [2024-11-14 16:49:31,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-14 16:49:31,145 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1484295704] [2024-11-14 16:49:31,145 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 16:49:31,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 16:49:31,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 16:49:31,273 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 16:49:31,274 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-14 16:49:31,274 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1484295704] [2024-11-14 16:49:31,274 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1484295704] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 16:49:31,274 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 16:49:31,275 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-14 16:49:31,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2051544972] [2024-11-14 16:49:31,276 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 16:49:31,278 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-14 16:49:31,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-14 16:49:31,290 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-14 16:49:31,291 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-14 16:49:31,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-14 16:49:31,292 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-14 16:49:31,293 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 29.5) internal successors, (59), 2 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 16:49:31,293 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-14 16:49:31,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-14 16:49:31,318 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-14 16:49:31,319 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-14 16:49:31,319 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 16:49:31,319 INFO L85 PathProgramCache]: Analyzing trace with hash 1188606341, now seen corresponding path program 1 times [2024-11-14 16:49:31,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-14 16:49:31,319 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [370207577] [2024-11-14 16:49:31,319 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 16:49:31,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 16:49:31,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 16:49:31,839 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 16:49:31,839 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-14 16:49:31,839 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [370207577] [2024-11-14 16:49:31,839 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [370207577] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 16:49:31,839 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 16:49:31,839 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-14 16:49:31,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [71405789] [2024-11-14 16:49:31,839 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 16:49:31,840 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-14 16:49:31,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-14 16:49:31,841 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-14 16:49:31,841 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-11-14 16:49:31,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-14 16:49:31,841 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-14 16:49:31,841 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.444444444444445) internal successors, (58), 9 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 16:49:31,841 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-14 16:49:31,841 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-14 16:49:31,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-14 16:49:31,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-14 16:49:31,938 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-14 16:49:31,938 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-14 16:49:31,939 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 16:49:31,939 INFO L85 PathProgramCache]: Analyzing trace with hash -742018735, now seen corresponding path program 1 times [2024-11-14 16:49:31,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-14 16:49:31,939 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1478734671] [2024-11-14 16:49:31,939 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 16:49:31,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 16:49:31,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 16:49:34,278 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 16:49:34,278 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-14 16:49:34,278 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1478734671] [2024-11-14 16:49:34,278 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1478734671] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 16:49:34,278 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [646211574] [2024-11-14 16:49:34,278 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 16:49:34,278 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 16:49:34,278 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 [2024-11-14 16:49:34,283 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 16:49:34,285 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-14 16:49:34,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 16:49:34,417 INFO L256 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 36 conjuncts are in the unsatisfiable core [2024-11-14 16:49:34,420 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 16:49:35,378 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 16:49:35,378 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 16:50:01,942 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 16:50:01,942 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [646211574] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 16:50:01,942 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 16:50:01,942 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 22, 21] total 51 [2024-11-14 16:50:01,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1791988523] [2024-11-14 16:50:01,942 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 16:50:01,943 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2024-11-14 16:50:01,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-14 16:50:01,943 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2024-11-14 16:50:01,945 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=306, Invalid=2237, Unknown=7, NotChecked=0, Total=2550 [2024-11-14 16:50:01,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-14 16:50:01,945 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-14 16:50:01,949 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 51 states have (on average 2.823529411764706) internal successors, (144), 51 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 16:50:01,950 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-14 16:50:01,950 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-11-14 16:50:01,950 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-14 16:50:13,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-14 16:50:13,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-14 16:50:13,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2024-11-14 16:50:13,253 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-14 16:50:13,444 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 16:50:13,445 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-14 16:50:13,457 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 16:50:13,457 INFO L85 PathProgramCache]: Analyzing trace with hash -480672791, now seen corresponding path program 2 times [2024-11-14 16:50:13,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-14 16:50:13,457 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [500567799] [2024-11-14 16:50:13,457 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 16:50:13,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 16:50:13,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 16:50:15,338 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 16:50:15,338 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-14 16:50:15,338 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [500567799] [2024-11-14 16:50:15,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [500567799] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 16:50:15,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1214298036] [2024-11-14 16:50:15,339 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-14 16:50:15,339 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 16:50:15,339 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 [2024-11-14 16:50:15,341 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 16:50:15,342 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-14 16:50:15,455 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-14 16:50:15,455 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-14 16:50:15,456 INFO L256 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 60 conjuncts are in the unsatisfiable core [2024-11-14 16:50:15,459 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 16:50:19,475 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 16:50:19,475 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 16:51:10,479 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (mod (+ c_~x_1~0 12) 4294967296))) (let ((.cse0 (mod (+ c_thread1Thread1of1ForFork0_~i~0 4) 4294967296)) (.cse7 (+ .cse3 4294967296)) (.cse4 (+ (mod (+ 3 c_thread1Thread1of1ForFork0_~i~0) 4294967296) 1)) (.cse5 (mod c_~x_2~0 4294967296))) (and (forall ((v_y_23 Int) (v_z_23 Int)) (let ((.cse2 (+ v_z_23 .cse5)) (.cse1 (+ (* v_y_23 4294967296) (* 2863311531 v_z_23)))) (or (< .cse0 .cse1) (< v_z_23 0) (< 4294967295 .cse2) (= .cse3 .cse2) (< .cse1 .cse4)))) (forall ((v_y_23 Int) (v_z_23 Int)) (let ((.cse8 (+ v_z_23 .cse5)) (.cse6 (+ (* v_y_23 4294967296) (* 2863311531 v_z_23)))) (or (< .cse0 .cse6) (= .cse7 .cse8) (< v_z_23 0) (= .cse3 .cse8) (< .cse6 .cse4) (< 4294967295 v_z_23)))) (forall ((v_y_23 Int) (v_z_23 Int)) (let ((.cse9 (+ (* v_y_23 4294967296) (* 2863311531 v_z_23))) (.cse10 (+ v_z_23 .cse5))) (or (< .cse0 .cse9) (= .cse7 .cse10) (< .cse9 .cse4) (< 4294967295 v_z_23) (< .cse10 4294967296))))))) is different from false [2024-11-14 16:51:12,993 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (mod (+ c_~x_1~0 12) 4294967296))) (let ((.cse0 (+ .cse2 4294967296)) (.cse3 (mod c_~x_2~0 4294967296))) (and (forall ((v_y_23 Int) (v_z_23 Int)) (let ((.cse1 (+ v_z_23 .cse3))) (or (= .cse0 .cse1) (< v_z_23 0) (not (= (+ (* v_y_23 4294967296) (* 2863311531 v_z_23)) 4)) (= .cse2 .cse1) (< 4294967295 v_z_23)))) (forall ((v_y_23 Int) (v_z_23 Int)) (let ((.cse4 (+ v_z_23 .cse3))) (or (= .cse0 .cse4) (not (= (+ (* v_y_23 4294967296) (* 2863311531 v_z_23)) 4)) (< 4294967295 v_z_23) (< .cse4 4294967296)))) (forall ((v_y_23 Int) (v_z_23 Int)) (let ((.cse5 (+ v_z_23 .cse3))) (or (< v_z_23 0) (not (= (+ (* v_y_23 4294967296) (* 2863311531 v_z_23)) 4)) (< 4294967295 .cse5) (= .cse2 .cse5))))))) is different from false [2024-11-14 16:51:15,801 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_y_23 Int) (v_z_23 Int)) (or (< v_z_23 0) (not (= (+ (* v_y_23 4294967296) (* 2863311531 v_z_23)) 4)) (< 4294967295 v_z_23) (= (mod (+ c_~x_1~0 12) 4294967296) v_z_23))) is different from false [2024-11-14 16:51:27,927 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_y_23 Int) (v_z_23 Int)) (or (< v_z_23 0) (not (= (+ (* v_y_23 4294967296) (* 2863311531 v_z_23)) 4)) (< 4294967295 v_z_23) (= v_z_23 12))) is different from false [2024-11-14 16:51:29,936 WARN L873 $PredicateComparison]: unable to prove that (forall ((v_y_23 Int) (v_z_23 Int)) (or (< v_z_23 0) (not (= (+ (* v_y_23 4294967296) (* 2863311531 v_z_23)) 4)) (< 4294967295 v_z_23) (= v_z_23 12))) is different from true [2024-11-14 16:52:20,322 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 16:52:20,323 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1214298036] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 16:52:20,323 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 16:52:20,323 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 34, 34] total 86 [2024-11-14 16:52:20,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [55116909] [2024-11-14 16:52:20,323 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 16:52:20,323 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 86 states [2024-11-14 16:52:20,323 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-14 16:52:20,324 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2024-11-14 16:52:20,327 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=422, Invalid=6217, Unknown=19, NotChecked=652, Total=7310 [2024-11-14 16:52:20,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-14 16:52:20,327 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-14 16:52:20,327 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 86 states, 86 states have (on average 2.383720930232558) internal successors, (205), 86 states have internal predecessors, (205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 16:52:20,327 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-14 16:52:20,327 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-11-14 16:52:20,327 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 89 states. [2024-11-14 16:52:20,327 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-14 16:52:22,401 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_y_23 Int) (v_z_23 Int)) (or (< v_z_23 0) (not (= (+ (* v_y_23 4294967296) (* 2863311531 v_z_23)) 4)) (< 4294967295 v_z_23) (= (mod (+ c_~x_1~0 12) 4294967296) v_z_23))) (= c_~x_1~0 0)) is different from false [2024-11-14 16:52:24,488 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (mod (+ c_~x_1~0 12) 4294967296))) (let ((.cse0 (+ .cse2 4294967296)) (.cse3 (mod c_~x_2~0 4294967296))) (and (= c_~x_2~0 0) (forall ((v_y_23 Int) (v_z_23 Int)) (let ((.cse1 (+ v_z_23 .cse3))) (or (= .cse0 .cse1) (< v_z_23 0) (not (= (+ (* v_y_23 4294967296) (* 2863311531 v_z_23)) 4)) (= .cse2 .cse1) (< 4294967295 v_z_23)))) (forall ((v_y_23 Int) (v_z_23 Int)) (let ((.cse4 (+ v_z_23 .cse3))) (or (= .cse0 .cse4) (not (= (+ (* v_y_23 4294967296) (* 2863311531 v_z_23)) 4)) (< 4294967295 v_z_23) (< .cse4 4294967296)))) (= c_~x_1~0 0) (forall ((v_y_23 Int) (v_z_23 Int)) (let ((.cse5 (+ v_z_23 .cse3))) (or (< v_z_23 0) (not (= (+ (* v_y_23 4294967296) (* 2863311531 v_z_23)) 4)) (< 4294967295 .cse5) (= .cse2 .cse5))))))) is different from false [2024-11-14 16:52:26,546 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (mod (+ c_~x_1~0 12) 4294967296))) (let ((.cse0 (mod (+ c_thread1Thread1of1ForFork0_~i~0 4) 4294967296)) (.cse7 (+ .cse3 4294967296)) (.cse4 (+ (mod (+ 3 c_thread1Thread1of1ForFork0_~i~0) 4294967296) 1)) (.cse5 (mod c_~x_2~0 4294967296))) (and (forall ((v_y_23 Int) (v_z_23 Int)) (let ((.cse2 (+ v_z_23 .cse5)) (.cse1 (+ (* v_y_23 4294967296) (* 2863311531 v_z_23)))) (or (< .cse0 .cse1) (< v_z_23 0) (< 4294967295 .cse2) (= .cse3 .cse2) (< .cse1 .cse4)))) (= c_~x_2~0 0) (= c_thread1Thread1of1ForFork0_~i~0 0) (forall ((v_y_23 Int) (v_z_23 Int)) (let ((.cse8 (+ v_z_23 .cse5)) (.cse6 (+ (* v_y_23 4294967296) (* 2863311531 v_z_23)))) (or (< .cse0 .cse6) (= .cse7 .cse8) (< v_z_23 0) (= .cse3 .cse8) (< .cse6 .cse4) (< 4294967295 v_z_23)))) (= c_~x_1~0 0) (forall ((v_y_23 Int) (v_z_23 Int)) (let ((.cse9 (+ (* v_y_23 4294967296) (* 2863311531 v_z_23))) (.cse10 (+ v_z_23 .cse5))) (or (< .cse0 .cse9) (= .cse7 .cse10) (< .cse9 .cse4) (< 4294967295 v_z_23) (< .cse10 4294967296))))))) is different from false [2024-11-14 16:52:28,564 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (mod (+ c_thread2Thread1of1ForFork1_~i~1 3) 4294967296)) (.cse1 (+ (mod c_thread2Thread1of1ForFork1_~i~1 4294967296) 1)) (.cse3 (mod (+ c_thread1Thread1of1ForFork0_~i~0 4) 4294967296)) (.cse6 (+ (mod (+ 3 c_thread1Thread1of1ForFork0_~i~0) 4294967296) 1)) (.cse7 (mod c_~x_2~0 4294967296)) (.cse2 (+ (mod (+ 2 c_thread2Thread1of1ForFork1_~i~1) 4294967296) 1))) (and (forall ((v_z_25 Int)) (or (< .cse0 v_z_25) (< v_z_25 .cse1) (< v_z_25 .cse2) (forall ((v_y_23 Int) (v_z_23 Int)) (let ((.cse4 (+ (* v_y_23 4294967296) (* 2863311531 v_z_23))) (.cse5 (+ v_z_23 .cse7))) (or (< .cse3 .cse4) (< v_z_23 0) (< 4294967295 .cse5) (< .cse4 .cse6) (= (mod (+ (* v_z_25 4) c_~x_1~0) 4294967296) .cse5)))))) (= c_~x_2~0 0) (= c_thread1Thread1of1ForFork0_~i~0 0) (= c_thread2Thread1of1ForFork1_~i~1 0) (forall ((v_z_25 Int)) (or (< .cse0 v_z_25) (forall ((v_y_23 Int) (v_z_23 Int)) (let ((.cse8 (+ (* v_y_23 4294967296) (* 2863311531 v_z_23))) (.cse9 (+ v_z_23 .cse7))) (or (< .cse3 .cse8) (< .cse8 .cse6) (< 4294967295 v_z_23) (< .cse9 4294967296) (= (+ (mod (+ (* v_z_25 4) c_~x_1~0) 4294967296) 4294967296) .cse9)))) (< v_z_25 .cse1) (< v_z_25 .cse2))) (forall ((v_z_25 Int)) (or (< .cse0 v_z_25) (< v_z_25 .cse1) (forall ((v_y_23 Int) (v_z_23 Int)) (let ((.cse10 (+ (* v_y_23 4294967296) (* 2863311531 v_z_23))) (.cse11 (mod (+ (* v_z_25 4) c_~x_1~0) 4294967296)) (.cse12 (+ v_z_23 .cse7))) (or (< .cse3 .cse10) (< v_z_23 0) (< .cse10 .cse6) (< 4294967295 v_z_23) (= .cse11 .cse12) (= (+ .cse11 4294967296) .cse12)))) (< v_z_25 .cse2))) (= c_~x_1~0 0))) is different from false [2024-11-14 16:52:59,345 WARN L286 SmtUtils]: Spent 18.38s on a formula simplification. DAG size of input: 61 DAG size of output: 35 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-14 16:53:01,472 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.11s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-14 16:53:03,491 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-14 16:53:05,609 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.09s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-14 16:53:07,694 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.08s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-14 16:53:09,713 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-14 16:53:11,762 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-14 16:53:18,476 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.10s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-14 16:53:20,575 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.09s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-14 16:53:22,594 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-14 16:54:27,969 WARN L286 SmtUtils]: Spent 18.13s on a formula simplification. DAG size of input: 78 DAG size of output: 37 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-14 16:54:29,989 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-14 16:54:32,071 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-14 16:54:34,191 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.11s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-14 16:54:36,245 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-14 16:54:38,288 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-14 16:54:40,307 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-14 16:54:44,896 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-14 16:54:46,932 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-14 16:54:49,027 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.09s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-14 16:54:51,085 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.06s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-14 16:54:53,157 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-14 16:55:15,577 WARN L286 SmtUtils]: Spent 18.12s on a formula simplification. DAG size of input: 78 DAG size of output: 38 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-14 16:55:17,670 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.09s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-14 16:55:19,687 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-14 16:55:21,704 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-14 16:55:23,813 WARN L851 $PredicateComparison]: unable to prove that (and (= c_~x_1~0 c_~a~0) (= c_~x_2~0 0) (= c_thread2Thread1of1ForFork1_~i~1 0) (= c_thread1Thread1of1ForFork0_~i~0 1) (let ((.cse11 (mod c_~a~0 4294967296))) (or (let ((.cse7 (mod (+ c_~x_1~0 (* 3 c_~a~0)) 4294967296))) (let ((.cse4 (+ .cse7 4294967296)) (.cse0 (mod (+ 3 c_thread1Thread1of1ForFork0_~i~0) 4294967296)) (.cse2 (+ (mod (+ 2 c_thread1Thread1of1ForFork0_~i~0) 4294967296) 1)) (.cse5 (mod c_~x_2~0 4294967296))) (and (forall ((v_y_23 Int) (v_z_23 Int)) (let ((.cse1 (+ (* v_y_23 4294967296) (* 2863311531 v_z_23))) (.cse3 (+ v_z_23 .cse5))) (or (< .cse0 .cse1) (< .cse1 .cse2) (< 4294967295 v_z_23) (< .cse3 4294967296) (= .cse4 .cse3)))) (forall ((v_y_23 Int) (v_z_23 Int)) (let ((.cse6 (+ (* v_y_23 4294967296) (* 2863311531 v_z_23))) (.cse8 (+ v_z_23 .cse5))) (or (< v_z_23 0) (< .cse0 .cse6) (= .cse7 .cse8) (< .cse6 .cse2) (< 4294967295 v_z_23) (= .cse4 .cse8)))) (forall ((v_y_23 Int) (v_z_23 Int)) (let ((.cse10 (+ v_z_23 .cse5)) (.cse9 (+ (* v_y_23 4294967296) (* 2863311531 v_z_23)))) (or (< v_z_23 0) (< .cse0 .cse9) (= .cse7 .cse10) (< 4294967295 .cse10) (< .cse9 .cse2))))))) (< (mod (+ c_thread2Thread1of1ForFork1_~i~1 3) 4294967296) .cse11) (< .cse11 (+ (mod (+ 2 c_thread2Thread1of1ForFork1_~i~1) 4294967296) 1))))) is different from false [2024-11-14 16:55:26,092 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.09s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-14 16:55:28,191 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.10s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-14 16:55:30,235 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-14 16:55:32,348 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.11s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-14 16:55:34,793 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-14 16:55:36,880 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.09s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-14 16:55:38,905 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-14 16:55:40,928 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-14 16:55:43,026 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.10s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-14 16:55:45,100 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.07s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-14 16:55:47,173 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.07s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-14 16:55:49,224 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-14 16:55:51,294 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.07s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-14 16:55:53,391 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.10s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-14 16:55:55,403 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-14 16:56:17,968 WARN L286 SmtUtils]: Spent 18.11s on a formula simplification. DAG size of input: 79 DAG size of output: 39 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-14 16:56:20,530 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (mod c_~a~0 4294967296))) (and (<= 1 .cse0) (= c_~x_1~0 c_~a~0) (= c_~x_2~0 0) (= c_thread2Thread1of1ForFork1_~i~1 0) (= c_thread1Thread1of1ForFork0_~i~0 1) (or (let ((.cse8 (mod (+ c_~x_1~0 (* 3 c_~a~0)) 4294967296))) (let ((.cse5 (+ .cse8 4294967296)) (.cse1 (mod (+ 3 c_thread1Thread1of1ForFork0_~i~0) 4294967296)) (.cse3 (+ (mod (+ 2 c_thread1Thread1of1ForFork0_~i~0) 4294967296) 1)) (.cse6 (mod c_~x_2~0 4294967296))) (and (forall ((v_y_23 Int) (v_z_23 Int)) (let ((.cse2 (+ (* v_y_23 4294967296) (* 2863311531 v_z_23))) (.cse4 (+ v_z_23 .cse6))) (or (< .cse1 .cse2) (< .cse2 .cse3) (< 4294967295 v_z_23) (< .cse4 4294967296) (= .cse5 .cse4)))) (forall ((v_y_23 Int) (v_z_23 Int)) (let ((.cse7 (+ (* v_y_23 4294967296) (* 2863311531 v_z_23))) (.cse9 (+ v_z_23 .cse6))) (or (< v_z_23 0) (< .cse1 .cse7) (= .cse8 .cse9) (< .cse7 .cse3) (< 4294967295 v_z_23) (= .cse5 .cse9)))) (forall ((v_y_23 Int) (v_z_23 Int)) (let ((.cse11 (+ v_z_23 .cse6)) (.cse10 (+ (* v_y_23 4294967296) (* 2863311531 v_z_23)))) (or (< v_z_23 0) (< .cse1 .cse10) (= .cse8 .cse11) (< 4294967295 .cse11) (< .cse10 .cse3))))))) (< (mod (+ c_thread2Thread1of1ForFork1_~i~1 3) 4294967296) .cse0) (< .cse0 (+ (mod (+ 2 c_thread2Thread1of1ForFork1_~i~1) 4294967296) 1))))) is different from false [2024-11-14 16:57:12,087 WARN L286 SmtUtils]: Spent 30.13s on a formula simplification. DAG size of input: 147 DAG size of output: 116 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-14 16:57:16,095 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse59 (mod (+ 2 c_thread1Thread1of1ForFork0_~i~0) 4294967296))) (let ((.cse30 (mod (+ 3 c_thread1Thread1of1ForFork0_~i~0) 4294967296)) (.cse48 (+ .cse59 1)) (.cse26 (mod (+ c_~x_1~0 (* 3 c_~a~0)) 4294967296)) (.cse54 (mod (+ c_~x_2~0 (* 2 c_~b~0)) 4294967296)) (.cse7 (mod (+ c_~x_1~0 (* 2 c_~a~0)) 4294967296)) (.cse55 (mod (+ 2 c_thread2Thread1of1ForFork1_~i~1) 4294967296)) (.cse11 (mod c_~x_2~0 4294967296)) (.cse46 (mod c_thread2Thread1of1ForFork1_~i~1 4294967296)) (.cse6 (mod (+ c_~x_2~0 c_~b~0) 4294967296)) (.cse58 (mod (+ c_~x_1~0 c_~a~0) 4294967296)) (.cse56 (mod (+ c_thread2Thread1of1ForFork1_~i~1 1) 4294967296)) (.cse9 (mod c_~a~0 4294967296)) (.cse57 (mod (+ c_thread1Thread1of1ForFork0_~i~0 1) 4294967296)) (.cse35 (mod c_~b~0 4294967296))) (let ((.cse15 (div c_thread1Thread1of1ForFork0_~i~0 4294967296)) (.cse18 (< .cse35 (+ (mod c_thread1Thread1of1ForFork0_~i~0 4294967296) 1))) (.cse5 (< .cse35 (+ .cse57 1))) (.cse8 (< .cse59 .cse35)) (.cse16 (< .cse56 .cse9)) (.cse34 (= .cse6 .cse58)) (.cse32 (< .cse9 (+ .cse46 1))) (.cse17 (= .cse11 .cse58)) (.cse19 (< .cse57 .cse35)) (.cse45 (mod (+ |c_thread1Thread1of1ForFork0_#t~post1| 3) 4294967296)) (.cse0 (< .cse9 (+ .cse56 1))) (.cse36 (mod (+ |c_thread1Thread1of1ForFork0_#t~post1| 2) 4294967296)) (.cse2 (< .cse55 .cse9)) (.cse3 (= .cse54 .cse7)) (.cse24 (+ .cse26 4294967296)) (.cse1 (< .cse35 .cse48)) (.cse31 (< (mod (+ c_thread2Thread1of1ForFork1_~i~1 3) 4294967296) .cse9)) (.cse4 (< .cse30 .cse35)) (.cse33 (< .cse9 (+ .cse55 1)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4) (or .cse0 .cse5 .cse2 (= .cse6 .cse7) .cse8) (<= 1 .cse9) (let ((.cse10 (* 12884901888 (div c_~b~0 4294967296))) (.cse12 (* 3 c_thread1Thread1of1ForFork0_~i~0)) (.cse13 (* 3 c_~b~0))) (or (< (+ 4294967283 .cse10 .cse11 .cse12) .cse13) (let ((.cse14 (mod c_~x_1~0 4294967296))) (and (<= .cse14 .cse11) (or (< (+ .cse10 .cse11 .cse12) (+ .cse14 (* .cse15 12884901888) .cse13 1)) (= .cse14 .cse11)))))) (<= 0 .cse15) (= c_thread2Thread1of1ForFork1_~i~1 1) (or .cse16 .cse17 .cse18 .cse19) (or .cse17 (< (mod (+ |c_thread2Thread1of1ForFork1_#t~post2| 1) 4294967296) .cse9) .cse18 .cse19) (= c_~x_1~0 c_~a~0) (or (let ((.cse20 (mod (+ c_thread1Thread1of1ForFork0_~i~0 4) 4294967296)) (.cse22 (+ .cse30 1))) (and (forall ((v_y_23 Int) (v_z_23 Int)) (let ((.cse21 (+ (* v_y_23 4294967296) (* 2863311531 v_z_23))) (.cse23 (+ v_z_23 .cse11))) (or (< .cse20 .cse21) (< .cse21 .cse22) (< 4294967295 v_z_23) (< .cse23 4294967296) (= .cse24 .cse23)))) (forall ((v_y_23 Int) (v_z_23 Int)) (let ((.cse27 (+ v_z_23 .cse11)) (.cse25 (+ (* v_y_23 4294967296) (* 2863311531 v_z_23)))) (or (< .cse20 .cse25) (< v_z_23 0) (= .cse26 .cse27) (< 4294967295 .cse27) (< .cse25 .cse22)))) (forall ((v_y_23 Int) (v_z_23 Int)) (let ((.cse28 (+ (* v_y_23 4294967296) (* 2863311531 v_z_23))) (.cse29 (+ v_z_23 .cse11))) (or (< .cse20 .cse28) (< v_z_23 0) (= .cse26 .cse29) (< .cse28 .cse22) (< 4294967295 v_z_23) (= .cse24 .cse29)))))) .cse31 .cse32 .cse33) (or .cse16 .cse5 .cse34 .cse32 .cse8) (or .cse16 (< .cse35 (+ (mod (+ |c_thread1Thread1of1ForFork0_#t~post1| 1) 4294967296) 1)) .cse34 (< .cse36 .cse35) .cse32) (or (let ((.cse38 (+ .cse45 1)) (.cse40 (mod (+ |c_thread1Thread1of1ForFork0_#t~post1| 4) 4294967296))) (and (forall ((v_y_23 Int) (v_z_23 Int)) (let ((.cse37 (+ (* v_y_23 4294967296) (* 2863311531 v_z_23))) (.cse39 (+ v_z_23 .cse11))) (or (< .cse37 .cse38) (< 4294967295 v_z_23) (< .cse39 4294967296) (< .cse40 .cse37) (= .cse24 .cse39)))) (forall ((v_y_23 Int) (v_z_23 Int)) (let ((.cse42 (+ (* v_y_23 4294967296) (* 2863311531 v_z_23))) (.cse41 (+ v_z_23 .cse11))) (or (< v_z_23 0) (= .cse26 .cse41) (< .cse42 .cse38) (< 4294967295 v_z_23) (< .cse40 .cse42) (= .cse24 .cse41)))) (forall ((v_y_23 Int) (v_z_23 Int)) (let ((.cse43 (+ v_z_23 .cse11)) (.cse44 (+ (* v_y_23 4294967296) (* 2863311531 v_z_23)))) (or (< v_z_23 0) (= .cse26 .cse43) (< 4294967295 .cse43) (< .cse44 .cse38) (< .cse40 .cse44)))))) .cse31 .cse32 .cse33) (or .cse17 (< .cse46 .cse9) .cse19) (or (< .cse45 .cse35) .cse0 (< .cse35 (+ .cse36 1)) .cse2 .cse3) (= c_thread1Thread1of1ForFork0_~i~0 1) (or (and (forall ((v_y_23 Int) (v_z_23 Int)) (let ((.cse47 (+ (* v_y_23 4294967296) (* 2863311531 v_z_23))) (.cse49 (+ v_z_23 .cse11))) (or (< .cse30 .cse47) (< .cse47 .cse48) (< 4294967295 v_z_23) (< .cse49 4294967296) (= .cse24 .cse49)))) (forall ((v_y_23 Int) (v_z_23 Int)) (let ((.cse50 (+ (* v_y_23 4294967296) (* 2863311531 v_z_23))) (.cse51 (+ v_z_23 .cse11))) (or (< v_z_23 0) (< .cse30 .cse50) (= .cse26 .cse51) (< .cse50 .cse48) (< 4294967295 v_z_23) (= .cse24 .cse51)))) (forall ((v_y_23 Int) (v_z_23 Int)) (let ((.cse53 (+ v_z_23 .cse11)) (.cse52 (+ (* v_y_23 4294967296) (* 2863311531 v_z_23)))) (or (< v_z_23 0) (< .cse30 .cse52) (= .cse26 .cse53) (< 4294967295 .cse53) (< .cse52 .cse48))))) .cse31 .cse33) (or (= .cse26 .cse54) .cse1 .cse31 .cse4 .cse33) (= c_~x_2~0 c_~b~0))))) is different from false [2024-11-14 16:57:27,871 WARN L286 SmtUtils]: Spent 7.84s on a formula simplification. DAG size of input: 164 DAG size of output: 116 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-14 16:57:49,889 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse55 (mod (+ 2 c_thread1Thread1of1ForFork0_~i~0) 4294967296))) (let ((.cse33 (mod (+ 3 c_thread1Thread1of1ForFork0_~i~0) 4294967296)) (.cse48 (+ .cse55 1)) (.cse29 (mod (+ c_~x_1~0 (* 3 c_~a~0)) 4294967296)) (.cse21 (mod c_thread2Thread1of1ForFork1_~i~1 4294967296)) (.cse14 (mod c_~x_1~0 4294967296)) (.cse56 (mod (+ c_thread1Thread1of1ForFork0_~i~0 1) 4294967296)) (.cse22 (mod c_~b~0 4294967296)) (.cse11 (mod c_~x_2~0 4294967296)) (.cse37 (mod (+ c_~x_1~0 c_~a~0) 4294967296)) (.cse46 (* 2 c_~a~0)) (.cse54 (mod (+ 2 c_thread2Thread1of1ForFork1_~i~1) 4294967296)) (.cse9 (mod c_~a~0 4294967296)) (.cse57 (mod (+ c_thread2Thread1of1ForFork1_~i~1 1) 4294967296))) (let ((.cse0 (< .cse9 (+ .cse57 1))) (.cse2 (< .cse54 .cse9)) (.cse4 (mod (+ c_~x_1~0 .cse46) 4294967296)) (.cse15 (div c_thread1Thread1of1ForFork0_~i~0 4294967296)) (.cse18 (= .cse11 .cse37)) (.cse19 (< .cse22 (+ (mod c_thread1Thread1of1ForFork0_~i~0 4294967296) 1))) (.cse20 (< .cse56 .cse22)) (.cse16 (= .cse14 .cse11)) (.cse17 (< .cse57 .cse9)) (.cse6 (< .cse22 (+ .cse56 1))) (.cse7 (mod (+ c_~x_2~0 c_~b~0) 4294967296)) (.cse8 (< .cse55 .cse22)) (.cse35 (< .cse9 (+ .cse21 1))) (.cse27 (+ .cse29 4294967296)) (.cse3 (mod (+ c_~x_2~0 (* 2 c_~b~0)) 4294967296)) (.cse1 (< .cse22 .cse48)) (.cse34 (< (mod (+ c_thread2Thread1of1ForFork1_~i~1 3) 4294967296) .cse9)) (.cse5 (< .cse33 .cse22)) (.cse36 (< .cse9 (+ .cse54 1)))) (and (or .cse0 .cse1 .cse2 (= .cse3 .cse4) .cse5) (or .cse0 .cse6 .cse2 (= .cse7 .cse4) .cse8) (<= 1 .cse9) (let ((.cse10 (* 12884901888 (div c_~b~0 4294967296))) (.cse12 (* 3 c_thread1Thread1of1ForFork0_~i~0)) (.cse13 (* 3 c_~b~0))) (or (< (+ 4294967283 .cse10 .cse11 .cse12) .cse13) (and (<= .cse14 .cse11) (or (< (+ .cse10 .cse11 .cse12) (+ .cse14 (* .cse15 12884901888) .cse13 1)) .cse16)))) (<= 0 .cse15) (= c_thread2Thread1of1ForFork1_~i~1 1) (or .cse17 .cse18 .cse19 .cse20) (or .cse18 (< (mod (+ |c_thread2Thread1of1ForFork1_#t~post2| 1) 4294967296) .cse9) .cse19 .cse20) (or (< .cse21 .cse9) .cse16 (< (mod (+ |c_thread1Thread1of1ForFork0_#t~post1| 1) 4294967296) .cse22)) (or (let ((.cse23 (mod (+ c_thread1Thread1of1ForFork0_~i~0 4) 4294967296)) (.cse25 (+ .cse33 1))) (and (forall ((v_y_23 Int) (v_z_23 Int)) (let ((.cse24 (+ (* v_y_23 4294967296) (* 2863311531 v_z_23))) (.cse26 (+ v_z_23 .cse11))) (or (< .cse23 .cse24) (< .cse24 .cse25) (< 4294967295 v_z_23) (< .cse26 4294967296) (= .cse27 .cse26)))) (forall ((v_y_23 Int) (v_z_23 Int)) (let ((.cse30 (+ v_z_23 .cse11)) (.cse28 (+ (* v_y_23 4294967296) (* 2863311531 v_z_23)))) (or (< .cse23 .cse28) (< v_z_23 0) (= .cse29 .cse30) (< 4294967295 .cse30) (< .cse28 .cse25)))) (forall ((v_y_23 Int) (v_z_23 Int)) (let ((.cse31 (+ (* v_y_23 4294967296) (* 2863311531 v_z_23))) (.cse32 (+ v_z_23 .cse11))) (or (< .cse23 .cse31) (< v_z_23 0) (= .cse29 .cse32) (< .cse31 .cse25) (< 4294967295 v_z_23) (= .cse27 .cse32)))))) .cse34 .cse35 .cse36) (or .cse17 .cse6 (= .cse7 .cse37) .cse35 .cse8) (= 2 c_thread1Thread1of1ForFork0_~i~0) (= |c_thread1Thread1of1ForFork0_#t~post1| 1) (or (let ((.cse39 (+ (mod (+ |c_thread1Thread1of1ForFork0_#t~post1| 3) 4294967296) 1)) (.cse41 (mod (+ |c_thread1Thread1of1ForFork0_#t~post1| 4) 4294967296))) (and (forall ((v_y_23 Int) (v_z_23 Int)) (let ((.cse38 (+ (* v_y_23 4294967296) (* 2863311531 v_z_23))) (.cse40 (+ v_z_23 .cse11))) (or (< .cse38 .cse39) (< 4294967295 v_z_23) (< .cse40 4294967296) (< .cse41 .cse38) (= .cse27 .cse40)))) (forall ((v_y_23 Int) (v_z_23 Int)) (let ((.cse43 (+ (* v_y_23 4294967296) (* 2863311531 v_z_23))) (.cse42 (+ v_z_23 .cse11))) (or (< v_z_23 0) (= .cse29 .cse42) (< .cse43 .cse39) (< 4294967295 v_z_23) (< .cse41 .cse43) (= .cse27 .cse42)))) (forall ((v_y_23 Int) (v_z_23 Int)) (let ((.cse44 (+ v_z_23 .cse11)) (.cse45 (+ (* v_y_23 4294967296) (* 2863311531 v_z_23)))) (or (< v_z_23 0) (= .cse29 .cse44) (< 4294967295 .cse44) (< .cse45 .cse39) (< .cse41 .cse45)))))) .cse34 .cse35 .cse36) (= c_~x_1~0 .cse46) (or (and (forall ((v_y_23 Int) (v_z_23 Int)) (let ((.cse47 (+ (* v_y_23 4294967296) (* 2863311531 v_z_23))) (.cse49 (+ v_z_23 .cse11))) (or (< .cse33 .cse47) (< .cse47 .cse48) (< 4294967295 v_z_23) (< .cse49 4294967296) (= .cse27 .cse49)))) (forall ((v_y_23 Int) (v_z_23 Int)) (let ((.cse50 (+ (* v_y_23 4294967296) (* 2863311531 v_z_23))) (.cse51 (+ v_z_23 .cse11))) (or (< v_z_23 0) (< .cse33 .cse50) (= .cse29 .cse51) (< .cse50 .cse48) (< 4294967295 v_z_23) (= .cse27 .cse51)))) (forall ((v_y_23 Int) (v_z_23 Int)) (let ((.cse53 (+ v_z_23 .cse11)) (.cse52 (+ (* v_y_23 4294967296) (* 2863311531 v_z_23)))) (or (< v_z_23 0) (< .cse33 .cse52) (= .cse29 .cse53) (< 4294967295 .cse53) (< .cse52 .cse48))))) .cse34 .cse36) (or (= .cse29 .cse3) .cse1 .cse34 .cse5 .cse36) (= c_~x_2~0 c_~b~0))))) is different from false [2024-11-14 16:58:02,603 WARN L286 SmtUtils]: Spent 8.53s on a formula simplification. DAG size of input: 167 DAG size of output: 128 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-14 16:58:10,838 WARN L286 SmtUtils]: Spent 6.94s on a formula simplification. DAG size of input: 138 DAG size of output: 78 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-14 16:58:21,119 WARN L286 SmtUtils]: Spent 7.77s on a formula simplification. DAG size of input: 139 DAG size of output: 68 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-14 16:58:33,871 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse43 (* 2 c_~a~0)) (.cse0 (* 2 c_~b~0)) (.cse55 (mod (+ 2 c_thread1Thread1of1ForFork0_~i~0) 4294967296))) (let ((.cse27 (mod (+ 3 c_thread1Thread1of1ForFork0_~i~0) 4294967296)) (.cse45 (+ .cse55 1)) (.cse23 (mod (+ c_~x_1~0 (* 3 c_~a~0)) 4294967296)) (.cse51 (mod (+ c_~x_2~0 .cse0) 4294967296)) (.cse8 (mod (+ c_~x_1~0 .cse43) 4294967296)) (.cse52 (mod (+ 2 c_thread2Thread1of1ForFork1_~i~1) 4294967296)) (.cse12 (mod c_thread2Thread1of1ForFork1_~i~1 4294967296)) (.cse7 (mod (+ c_~x_2~0 c_~b~0) 4294967296)) (.cse53 (mod (+ c_thread2Thread1of1ForFork1_~i~1 1) 4294967296)) (.cse10 (mod c_~a~0 4294967296)) (.cse56 (mod (+ c_thread1Thread1of1ForFork0_~i~0 1) 4294967296)) (.cse32 (mod c_~b~0 4294967296)) (.cse21 (mod c_~x_2~0 4294967296)) (.cse54 (mod (+ c_~x_1~0 c_~a~0) 4294967296))) (let ((.cse11 (= .cse21 .cse54)) (.cse13 (< .cse32 (+ (mod c_thread1Thread1of1ForFork0_~i~0 4294967296) 1))) (.cse14 (< .cse56 .cse32)) (.cse6 (< .cse32 (+ .cse56 1))) (.cse9 (< .cse55 .cse32)) (.cse15 (< .cse53 .cse10)) (.cse31 (= .cse7 .cse54)) (.cse29 (< .cse10 (+ .cse12 1))) (.cse42 (mod (+ |c_thread1Thread1of1ForFork0_#t~post1| 3) 4294967296)) (.cse1 (< .cse10 (+ .cse53 1))) (.cse33 (mod (+ |c_thread1Thread1of1ForFork0_#t~post1| 2) 4294967296)) (.cse3 (< .cse52 .cse10)) (.cse4 (= .cse51 .cse8)) (.cse20 (+ .cse23 4294967296)) (.cse2 (< .cse32 .cse45)) (.cse28 (< (mod (+ c_thread2Thread1of1ForFork1_~i~1 3) 4294967296) .cse10)) (.cse5 (< .cse27 .cse32)) (.cse30 (< .cse10 (+ .cse52 1)))) (and (= c_~x_2~0 .cse0) (or .cse1 .cse2 .cse3 .cse4 .cse5) (or .cse1 .cse6 .cse3 (= .cse7 .cse8) .cse9) (<= 1 .cse10) (or .cse11 (< .cse12 .cse10) .cse13 .cse14) (or .cse15 .cse11 .cse13 .cse14) (or .cse11 (< (mod (+ |c_thread2Thread1of1ForFork1_#t~post2| 1) 4294967296) .cse10) .cse13 .cse14) (or (let ((.cse16 (mod (+ c_thread1Thread1of1ForFork0_~i~0 4) 4294967296)) (.cse18 (+ .cse27 1))) (and (forall ((v_y_23 Int) (v_z_23 Int)) (let ((.cse17 (+ (* v_y_23 4294967296) (* 2863311531 v_z_23))) (.cse19 (+ v_z_23 .cse21))) (or (< .cse16 .cse17) (< .cse17 .cse18) (< 4294967295 v_z_23) (< .cse19 4294967296) (= .cse20 .cse19)))) (forall ((v_y_23 Int) (v_z_23 Int)) (let ((.cse24 (+ v_z_23 .cse21)) (.cse22 (+ (* v_y_23 4294967296) (* 2863311531 v_z_23)))) (or (< .cse16 .cse22) (< v_z_23 0) (= .cse23 .cse24) (< 4294967295 .cse24) (< .cse22 .cse18)))) (forall ((v_y_23 Int) (v_z_23 Int)) (let ((.cse25 (+ (* v_y_23 4294967296) (* 2863311531 v_z_23))) (.cse26 (+ v_z_23 .cse21))) (or (< .cse16 .cse25) (< v_z_23 0) (= .cse23 .cse26) (< .cse25 .cse18) (< 4294967295 v_z_23) (= .cse20 .cse26)))))) .cse28 .cse29 .cse30) (or .cse15 .cse6 .cse31 .cse29 .cse9) (or .cse15 (< .cse32 (+ (mod (+ |c_thread1Thread1of1ForFork0_#t~post1| 1) 4294967296) 1)) .cse31 (< .cse33 .cse32) .cse29) (= 2 c_thread1Thread1of1ForFork0_~i~0) (or (let ((.cse35 (+ .cse42 1)) (.cse37 (mod (+ |c_thread1Thread1of1ForFork0_#t~post1| 4) 4294967296))) (and (forall ((v_y_23 Int) (v_z_23 Int)) (let ((.cse34 (+ (* v_y_23 4294967296) (* 2863311531 v_z_23))) (.cse36 (+ v_z_23 .cse21))) (or (< .cse34 .cse35) (< 4294967295 v_z_23) (< .cse36 4294967296) (< .cse37 .cse34) (= .cse20 .cse36)))) (forall ((v_y_23 Int) (v_z_23 Int)) (let ((.cse39 (+ (* v_y_23 4294967296) (* 2863311531 v_z_23))) (.cse38 (+ v_z_23 .cse21))) (or (< v_z_23 0) (= .cse23 .cse38) (< .cse39 .cse35) (< 4294967295 v_z_23) (< .cse37 .cse39) (= .cse20 .cse38)))) (forall ((v_y_23 Int) (v_z_23 Int)) (let ((.cse40 (+ v_z_23 .cse21)) (.cse41 (+ (* v_y_23 4294967296) (* 2863311531 v_z_23)))) (or (< v_z_23 0) (= .cse23 .cse40) (< 4294967295 .cse40) (< .cse41 .cse35) (< .cse37 .cse41)))))) .cse28 .cse29 .cse30) (or (< .cse42 .cse32) .cse1 (< .cse32 (+ .cse33 1)) .cse3 .cse4) (= 2 c_thread2Thread1of1ForFork1_~i~1) (= c_~x_1~0 .cse43) (or (and (forall ((v_y_23 Int) (v_z_23 Int)) (let ((.cse44 (+ (* v_y_23 4294967296) (* 2863311531 v_z_23))) (.cse46 (+ v_z_23 .cse21))) (or (< .cse27 .cse44) (< .cse44 .cse45) (< 4294967295 v_z_23) (< .cse46 4294967296) (= .cse20 .cse46)))) (forall ((v_y_23 Int) (v_z_23 Int)) (let ((.cse47 (+ (* v_y_23 4294967296) (* 2863311531 v_z_23))) (.cse48 (+ v_z_23 .cse21))) (or (< v_z_23 0) (< .cse27 .cse47) (= .cse23 .cse48) (< .cse47 .cse45) (< 4294967295 v_z_23) (= .cse20 .cse48)))) (forall ((v_y_23 Int) (v_z_23 Int)) (let ((.cse50 (+ v_z_23 .cse21)) (.cse49 (+ (* v_y_23 4294967296) (* 2863311531 v_z_23)))) (or (< v_z_23 0) (< .cse27 .cse49) (= .cse23 .cse50) (< 4294967295 .cse50) (< .cse49 .cse45))))) .cse28 .cse30) (or (= .cse23 .cse51) .cse2 .cse28 .cse5 .cse30))))) is different from false [2024-11-14 16:59:10,133 WARN L286 SmtUtils]: Spent 15.46s on a formula simplification. DAG size of input: 169 DAG size of output: 141 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-14 16:59:31,493 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.09s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-14 16:59:33,909 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-14 16:59:51,146 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.29s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-14 17:01:20,716 WARN L286 SmtUtils]: Spent 54.85s on a formula simplification. DAG size of input: 148 DAG size of output: 119 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-14 17:01:46,679 WARN L286 SmtUtils]: Spent 14.22s on a formula simplification. DAG size of input: 168 DAG size of output: 131 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-14 17:02:39,283 WARN L286 SmtUtils]: Spent 33.52s on a formula simplification. DAG size of input: 164 DAG size of output: 124 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-14 17:03:16,680 WARN L286 SmtUtils]: Spent 27.66s on a formula simplification. DAG size of input: 153 DAG size of output: 78 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-14 17:03:32,104 WARN L286 SmtUtils]: Spent 8.01s on a formula simplification. DAG size of input: 153 DAG size of output: 87 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-14 17:03:45,143 WARN L286 SmtUtils]: Spent 7.07s on a formula simplification. DAG size of input: 154 DAG size of output: 84 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) Received shutdown request... [2024-11-14 17:04:10,137 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2024-11-14 17:04:10,139 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2024-11-14 17:04:10,140 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2024-11-14 17:04:10,377 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-14 17:04:10,558 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 17:04:10,558 WARN L596 AbstractCegarLoop]: Verification canceled: while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 199 known predicates. [2024-11-14 17:04:10,560 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2024-11-14 17:04:10,560 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 3 remaining) [2024-11-14 17:04:10,560 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2024-11-14 17:04:10,563 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1, 1] [2024-11-14 17:04:10,565 INFO L242 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-14 17:04:10,565 INFO L173 ceAbstractionStarter]: Computing trace abstraction results [2024-11-14 17:04:10,580 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Ended with exit code 0 [2024-11-14 17:04:10,581 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.11 05:04:10 BasicIcfg [2024-11-14 17:04:10,581 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-14 17:04:10,583 INFO L158 Benchmark]: Toolchain (without parser) took 880139.65ms. Allocated memory was 100.7MB in the beginning and 268.4MB in the end (delta: 167.8MB). Free memory was 73.5MB in the beginning and 225.6MB in the end (delta: -152.1MB). Peak memory consumption was 171.7MB. Max. memory is 8.0GB. [2024-11-14 17:04:10,583 INFO L158 Benchmark]: CDTParser took 0.37ms. Allocated memory is still 100.7MB. Free memory is still 53.2MB. There was no memory consumed. Max. memory is 8.0GB. [2024-11-14 17:04:10,584 INFO L158 Benchmark]: CACSL2BoogieTranslator took 145.07ms. Allocated memory is still 100.7MB. Free memory was 73.3MB in the beginning and 62.1MB in the end (delta: 11.2MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2024-11-14 17:04:10,584 INFO L158 Benchmark]: Boogie Procedure Inliner took 15.71ms. Allocated memory is still 100.7MB. Free memory was 62.1MB in the beginning and 60.8MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 8.0GB. [2024-11-14 17:04:10,584 INFO L158 Benchmark]: Boogie Preprocessor took 9.30ms. Allocated memory is still 100.7MB. Free memory was 60.8MB in the beginning and 60.2MB in the end (delta: 617.7kB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2024-11-14 17:04:10,584 INFO L158 Benchmark]: RCFGBuilder took 229.92ms. Allocated memory is still 100.7MB. Free memory was 60.2MB in the beginning and 49.2MB in the end (delta: 11.0MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. [2024-11-14 17:04:10,584 INFO L158 Benchmark]: TraceAbstraction took 879735.85ms. Allocated memory was 100.7MB in the beginning and 268.4MB in the end (delta: 167.8MB). Free memory was 48.7MB in the beginning and 225.6MB in the end (delta: -177.0MB). Peak memory consumption was 146.5MB. Max. memory is 8.0GB. [2024-11-14 17:04:10,586 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.37ms. Allocated memory is still 100.7MB. Free memory is still 53.2MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 145.07ms. Allocated memory is still 100.7MB. Free memory was 73.3MB in the beginning and 62.1MB in the end (delta: 11.2MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 15.71ms. Allocated memory is still 100.7MB. Free memory was 62.1MB in the beginning and 60.8MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 9.30ms. Allocated memory is still 100.7MB. Free memory was 60.8MB in the beginning and 60.2MB in the end (delta: 617.7kB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * RCFGBuilder took 229.92ms. Allocated memory is still 100.7MB. Free memory was 60.2MB in the beginning and 49.2MB in the end (delta: 11.0MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. * TraceAbstraction took 879735.85ms. Allocated memory was 100.7MB in the beginning and 268.4MB in the end (delta: 167.8MB). Free memory was 48.7MB in the beginning and 225.6MB in the end (delta: -177.0MB). Peak memory consumption was 146.5MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Partial order reduction statistics Independence relation #1 benchmarks: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 1495, independent: 1205, independent conditional: 609, independent unconditional: 596, dependent: 290, dependent conditional: 288, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1207, independent: 1205, independent conditional: 609, independent unconditional: 596, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1207, independent: 1205, independent conditional: 609, independent unconditional: 596, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1207, independent: 1205, independent conditional: 609, independent unconditional: 596, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1207, independent: 1205, independent conditional: 0, independent unconditional: 1205, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1207, independent: 1205, independent conditional: 0, independent unconditional: 1205, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 568, independent: 566, independent conditional: 0, independent unconditional: 566, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 568, independent: 564, independent conditional: 0, independent unconditional: 564, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 4, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 4, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 78, independent: 44, independent conditional: 0, independent unconditional: 44, dependent: 34, dependent conditional: 0, dependent unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Symbolic Condition Computations: 0, Protected Queries: 0 ], Cache Queries: [ total: 1207, independent: 639, independent conditional: 0, independent unconditional: 639, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 568, unknown conditional: 0, unknown unconditional: 568] , Statistics on independence cache: Total cache size (in pairs): 568, Positive cache size: 566, Positive conditional cache size: 0, Positive unconditional cache size: 566, Negative cache size: 2, Negative conditional cache size: 0, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 609, Maximal queried relation: 0, Independence queries for same thread: 288, Persistent sets #1 benchmarks: Persistent set computation time: 0.1s, Number of persistent set computation: 67, Number of trivial persistent sets: 52, Underlying independence relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 598, independent: 596, independent conditional: 0, independent unconditional: 596, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 1495, independent: 1205, independent conditional: 609, independent unconditional: 596, dependent: 290, dependent conditional: 288, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1207, independent: 1205, independent conditional: 609, independent unconditional: 596, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1207, independent: 1205, independent conditional: 609, independent unconditional: 596, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1207, independent: 1205, independent conditional: 609, independent unconditional: 596, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1207, independent: 1205, independent conditional: 0, independent unconditional: 1205, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1207, independent: 1205, independent conditional: 0, independent unconditional: 1205, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 568, independent: 566, independent conditional: 0, independent unconditional: 566, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 568, independent: 564, independent conditional: 0, independent unconditional: 564, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 4, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 4, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 78, independent: 44, independent conditional: 0, independent unconditional: 44, dependent: 34, dependent conditional: 0, dependent unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Symbolic Condition Computations: 0, Protected Queries: 0 ], Cache Queries: [ total: 1207, independent: 639, independent conditional: 0, independent unconditional: 639, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 568, unknown conditional: 0, unknown unconditional: 568] , Statistics on independence cache: Total cache size (in pairs): 568, Positive cache size: 566, Positive conditional cache size: 0, Positive unconditional cache size: 566, Negative cache size: 2, Negative conditional cache size: 0, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 609, Maximal queried relation: 0, Independence queries for same thread: 288 - TimeoutResultAtElement [Line: 70]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable Cancelled while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 199 known predicates. - TimeoutResultAtElement [Line: 65]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 199 known predicates. - TimeoutResultAtElement [Line: 64]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 199 known predicates. - StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: ULTIMATE.start with 1 thread instances CFG has 5 procedures, 94 locations, 3 error locations. Started 1 CEGAR loops. OverallTime: 879.6s, OverallIterations: 4, TraceHistogramMax: 0, PathProgramHistogramMax: 2, EmptinessCheckTime: 721.6s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 224, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 157.0s InterpolantComputationTime, 429 NumberOfCodeBlocks, 429 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 577 ConstructedInterpolants, 46 QuantifiedInterpolants, 15779 SizeOfPredicates, 38 NumberOfNonLiveVariables, 312 ConjunctsInSsa, 96 ConjunctsInUnsatCore, 8 InterpolantComputations, 2 PerfectInterpolantSequences, 0/162 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: CheckTime: 0.0s, ConditionCalculationTime: 0.0s, CommutingCounterexamples: 0, ConditionCalculations: 15, TraceChecks: 0, UnknownTraceChecks: 0, ImperfectProofs: 0, QuantifiedConditions: 0, FalseConditions: 0 RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown