/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 -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 03:12:13,917 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-14 03:12:13,962 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/../benchexec/../../../trunk/examples/settings/gemcutter/NewStatesSleepPersistentFixedOrder.epf [2024-11-14 03:12:13,965 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-14 03:12:13,966 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-14 03:12:13,986 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-14 03:12:13,988 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-14 03:12:13,989 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-14 03:12:13,989 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-14 03:12:13,989 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-14 03:12:13,989 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-14 03:12:13,989 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-14 03:12:13,989 INFO L153 SettingsManager]: * Use SBE=true [2024-11-14 03:12:13,989 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-14 03:12:13,989 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-14 03:12:13,990 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-14 03:12:13,990 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-14 03:12:13,990 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-14 03:12:13,990 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-14 03:12:13,990 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-14 03:12:13,990 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-14 03:12:13,990 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-14 03:12:13,990 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-14 03:12:13,990 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-14 03:12:13,990 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-14 03:12:13,990 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-14 03:12:13,990 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-14 03:12:13,990 INFO L153 SettingsManager]: * To the following directory=./dump/ [2024-11-14 03:12:13,990 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-14 03:12:13,990 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-14 03:12:13,991 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-14 03:12:13,991 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-14 03:12:13,991 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-14 03:12:13,991 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-14 03:12:13,991 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-14 03:12:13,991 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-14 03:12:13,991 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2024-11-14 03:12:13,991 INFO L153 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2024-11-14 03:12:13,992 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2024-11-14 03:12:13,992 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 [2024-11-14 03:12:14,201 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-14 03:12:14,207 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-14 03:12:14,209 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-14 03:12:14,210 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-14 03:12:14,211 INFO L274 PluginConnector]: CDTParser initialized [2024-11-14 03:12:14,212 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 03:12:15,378 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-14 03:12:15,570 INFO L384 CDTParser]: Found 1 translation units. [2024-11-14 03:12:15,571 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/trunk/examples/svcomp/weaver/mult-comm.wvr.c [2024-11-14 03:12:15,577 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/data/356871c7d/46d592a1290a4658942a316619a1b780/FLAG004f3467a [2024-11-14 03:12:15,950 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/data/356871c7d/46d592a1290a4658942a316619a1b780 [2024-11-14 03:12:15,952 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-14 03:12:15,953 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-11-14 03:12:15,954 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-14 03:12:15,954 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-14 03:12:15,957 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-14 03:12:15,958 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 03:12:15" (1/1) ... [2024-11-14 03:12:15,958 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5198871 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:12:15, skipping insertion in model container [2024-11-14 03:12:15,959 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 03:12:15" (1/1) ... [2024-11-14 03:12:15,968 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-14 03:12:16,091 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 03:12:16,095 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-14 03:12:16,101 INFO L200 MainTranslator]: Completed pre-run [2024-11-14 03:12:16,114 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 03:12:16,115 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-14 03:12:16,125 INFO L204 MainTranslator]: Completed translation [2024-11-14 03:12:16,125 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:12:16 WrapperNode [2024-11-14 03:12:16,126 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-14 03:12:16,127 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-14 03:12:16,127 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-14 03:12:16,127 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-14 03:12:16,131 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:12:16" (1/1) ... [2024-11-14 03:12:16,137 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:12:16" (1/1) ... [2024-11-14 03:12:16,147 INFO L138 Inliner]: procedures = 20, calls = 9, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 41 [2024-11-14 03:12:16,147 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-14 03:12:16,148 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-14 03:12:16,148 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-14 03:12:16,148 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-14 03:12:16,152 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:12:16" (1/1) ... [2024-11-14 03:12:16,153 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:12:16" (1/1) ... [2024-11-14 03:12:16,158 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:12:16" (1/1) ... [2024-11-14 03:12:16,159 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:12:16" (1/1) ... [2024-11-14 03:12:16,161 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:12:16" (1/1) ... [2024-11-14 03:12:16,164 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:12:16" (1/1) ... [2024-11-14 03:12:16,165 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:12:16" (1/1) ... [2024-11-14 03:12:16,165 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:12:16" (1/1) ... [2024-11-14 03:12:16,166 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-14 03:12:16,166 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-14 03:12:16,166 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-14 03:12:16,167 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-14 03:12:16,172 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:12:16" (1/1) ... [2024-11-14 03:12:16,176 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-14 03:12:16,186 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 [2024-11-14 03:12:16,199 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 03:12:16,204 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 03:12:16,219 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-14 03:12:16,220 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-11-14 03:12:16,220 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-11-14 03:12:16,220 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-11-14 03:12:16,220 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-11-14 03:12:16,220 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-14 03:12:16,220 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-14 03:12:16,220 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-14 03:12:16,221 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 03:12:16,288 INFO L238 CfgBuilder]: Building ICFG [2024-11-14 03:12:16,289 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-14 03:12:16,395 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-14 03:12:16,395 INFO L287 CfgBuilder]: Performing block encoding [2024-11-14 03:12:16,402 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-14 03:12:16,402 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-14 03:12:16,402 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 03:12:16 BoogieIcfgContainer [2024-11-14 03:12:16,402 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-14 03:12:16,404 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-14 03:12:16,404 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-14 03:12:16,407 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-14 03:12:16,407 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.11 03:12:15" (1/3) ... [2024-11-14 03:12:16,408 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c2112cc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 03:12:16, skipping insertion in model container [2024-11-14 03:12:16,408 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:12:16" (2/3) ... [2024-11-14 03:12:16,408 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c2112cc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 03:12:16, skipping insertion in model container [2024-11-14 03:12:16,408 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 03:12:16" (3/3) ... [2024-11-14 03:12:16,409 INFO L112 eAbstractionObserver]: Analyzing ICFG mult-comm.wvr.c [2024-11-14 03:12:16,418 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-14 03:12:16,419 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 03:12:16,419 INFO L492 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-14 03:12:16,473 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-11-14 03:12:16,506 INFO L123 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-14 03:12:16,506 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-11-14 03:12:16,506 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 [2024-11-14 03:12:16,508 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 03:12:16,509 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 03:12:16,569 INFO L185 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-14 03:12:16,576 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-11-14 03:12:16,581 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;@29a6af18, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-14 03:12:16,581 INFO L334 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2024-11-14 03:12:16,747 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 03:12:16,750 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:12:16,751 INFO L85 PathProgramCache]: Analyzing trace with hash -1808911534, now seen corresponding path program 1 times [2024-11-14 03:12:16,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-14 03:12:16,756 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [518094244] [2024-11-14 03:12:16,756 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:12:16,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:12:16,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:12:16,884 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 03:12:16,885 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-14 03:12:16,885 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [518094244] [2024-11-14 03:12:16,885 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [518094244] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:12:16,885 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 03:12:16,886 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-14 03:12:16,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1555950597] [2024-11-14 03:12:16,887 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:12:16,891 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-14 03:12:16,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-14 03:12:16,905 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-14 03:12:16,905 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-14 03:12:16,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-14 03:12:16,907 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-14 03:12:16,908 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 03:12:16,908 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-14 03:12:16,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-14 03:12:16,931 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-14 03:12:16,931 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 03:12:16,932 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:12:16,932 INFO L85 PathProgramCache]: Analyzing trace with hash 1188606341, now seen corresponding path program 1 times [2024-11-14 03:12:16,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-14 03:12:16,932 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1899183162] [2024-11-14 03:12:16,932 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:12:16,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:12:16,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:12:17,483 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 03:12:17,483 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-14 03:12:17,483 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1899183162] [2024-11-14 03:12:17,483 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1899183162] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:12:17,483 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 03:12:17,483 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-14 03:12:17,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2062813412] [2024-11-14 03:12:17,483 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:12:17,484 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-14 03:12:17,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-14 03:12:17,485 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-14 03:12:17,485 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-11-14 03:12:17,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-14 03:12:17,485 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-14 03:12:17,485 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 03:12:17,485 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-14 03:12:17,485 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-14 03:12:17,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-14 03:12:17,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-14 03:12:17,576 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-14 03:12:17,577 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 03:12:17,577 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:12:17,577 INFO L85 PathProgramCache]: Analyzing trace with hash -742018735, now seen corresponding path program 1 times [2024-11-14 03:12:17,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-14 03:12:17,577 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [943744298] [2024-11-14 03:12:17,577 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:12:17,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:12:17,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:12:19,838 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 03:12:19,838 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-14 03:12:19,838 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [943744298] [2024-11-14 03:12:19,838 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [943744298] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 03:12:19,838 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [661584168] [2024-11-14 03:12:19,839 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:12:19,839 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 03:12:19,839 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 [2024-11-14 03:12:19,841 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 03:12:19,842 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 03:12:19,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:12:19,983 INFO L256 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 36 conjuncts are in the unsatisfiable core [2024-11-14 03:12:19,988 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:12:20,972 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 03:12:20,973 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 03:12:42,885 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 03:12:42,885 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [661584168] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 03:12:42,885 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 03:12:42,885 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 22, 21] total 51 [2024-11-14 03:12:42,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [924934316] [2024-11-14 03:12:42,885 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 03:12:42,886 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2024-11-14 03:12:42,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-14 03:12:42,887 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2024-11-14 03:12:42,888 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=306, Invalid=2236, Unknown=8, NotChecked=0, Total=2550 [2024-11-14 03:12:42,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-14 03:12:42,888 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-14 03:12:42,888 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 03:12:42,888 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-14 03:12:42,888 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-11-14 03:12:42,888 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-14 03:12:54,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-14 03:12:54,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-14 03:12:54,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2024-11-14 03:12:54,341 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 03:12:54,529 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 03:12:54,529 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 03:12:54,530 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:12:54,530 INFO L85 PathProgramCache]: Analyzing trace with hash -480672791, now seen corresponding path program 2 times [2024-11-14 03:12:54,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-14 03:12:54,530 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1025235061] [2024-11-14 03:12:54,530 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:12:54,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:12:54,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:12:56,407 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 03:12:56,407 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-14 03:12:56,408 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1025235061] [2024-11-14 03:12:56,408 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1025235061] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 03:12:56,408 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1185593616] [2024-11-14 03:12:56,408 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-14 03:12:56,408 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 03:12:56,408 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 [2024-11-14 03:12:56,410 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 03:12:56,410 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 03:12:56,516 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-14 03:12:56,517 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-14 03:12:56,518 INFO L256 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 60 conjuncts are in the unsatisfiable core [2024-11-14 03:12:56,522 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:12:59,392 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 03:12:59,392 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 03:13:44,117 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 03:13:46,636 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 03:13:49,282 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 03:14:01,412 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 03:14:03,418 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 03:14:53,685 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 03:14:53,685 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1185593616] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 03:14:53,685 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 03:14:53,686 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 34, 34] total 86 [2024-11-14 03:14:53,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1647780113] [2024-11-14 03:14:53,686 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 03:14:53,686 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 86 states [2024-11-14 03:14:53,686 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-14 03:14:53,689 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2024-11-14 03:14:53,691 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=422, Invalid=6218, Unknown=18, NotChecked=652, Total=7310 [2024-11-14 03:14:53,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-14 03:14:53,691 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-14 03:14:53,692 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 03:14:53,692 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-14 03:14:53,692 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-11-14 03:14:53,692 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 89 states. [2024-11-14 03:14:53,692 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-14 03:14:55,791 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 03:14:57,883 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 03:14:59,913 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 03:15:01,929 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 03:15:32,875 WARN L286 SmtUtils]: Spent 18.48s 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 03:15:34,949 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 03:15:36,965 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 03:15:38,996 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 03:15:41,008 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 03:15:43,033 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 03:15:45,078 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 03:15:47,190 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 03:15:49,207 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 03:15:51,326 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 03:15:53,357 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 03:15:58,005 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 03:16:00,029 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 03:16:02,069 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 03:16:04,190 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.12s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-14 03:16:06,231 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 03:16:08,256 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 03:16:10,273 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 03:16:12,384 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 03:16:14,425 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 03:16:38,848 WARN L286 SmtUtils]: Spent 18.11s 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 03:16:40,867 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 03:16:42,946 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 03:16:45,031 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 03:16:47,084 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 03:16:49,167 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 03:16:51,251 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 03:16:53,282 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 03:16:55,319 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 03:16:57,331 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 03:16:59,346 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 03:17:03,961 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 03:17:06,138 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 03:17:08,214 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 03:17:25,324 WARN L286 SmtUtils]: Spent 12.70s 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 03:17:27,406 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 03:17:29,521 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 03:17:31,641 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.12s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-14 03:17:33,760 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.12s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-14 03:18:33,119 WARN L286 SmtUtils]: Spent 18.10s on a formula simplification. DAG size of input: 57 DAG size of output: 36 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-14 03:18:35,245 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 03:18:37,397 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.14s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-14 03:18:59,969 WARN L286 SmtUtils]: Spent 18.17s 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 03:19:02,392 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 03:19:04,410 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 03:19:06,427 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 03:19:08,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 03:19:11,132 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 03:19:13,191 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 03:19:15,217 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 03:19:17,282 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (mod c_~x_2~0 4294967296))) (and (= c_~x_1~0 c_~a~0) (= c_~x_2~0 0) (= c_thread2Thread1of1ForFork1_~i~1 0) (= c_thread1Thread1of1ForFork0_~i~0 1) (or (< (mod c_thread1Thread1of1ForFork0_~i~0 4294967296) (mod c_~b~0 4294967296)) (= (mod c_~x_1~0 4294967296) .cse0)) (let ((.cse11 (mod c_~a~0 4294967296))) (or (let ((.cse7 (mod (+ c_~x_1~0 (* 3 c_~a~0)) 4294967296))) (let ((.cse5 (+ .cse7 4294967296)) (.cse1 (mod (+ 3 c_thread1Thread1of1ForFork0_~i~0) 4294967296)) (.cse3 (+ (mod (+ 2 c_thread1Thread1of1ForFork0_~i~0) 4294967296) 1))) (and (forall ((v_y_23 Int) (v_z_23 Int)) (let ((.cse2 (+ (* v_y_23 4294967296) (* 2863311531 v_z_23))) (.cse4 (+ v_z_23 .cse0))) (or (< .cse1 .cse2) (< .cse2 .cse3) (< 4294967295 v_z_23) (< .cse4 4294967296) (= .cse5 .cse4)))) (forall ((v_y_23 Int) (v_z_23 Int)) (let ((.cse6 (+ (* v_y_23 4294967296) (* 2863311531 v_z_23))) (.cse8 (+ v_z_23 .cse0))) (or (< v_z_23 0) (< .cse1 .cse6) (= .cse7 .cse8) (< .cse6 .cse3) (< 4294967295 v_z_23) (= .cse5 .cse8)))) (forall ((v_y_23 Int) (v_z_23 Int)) (let ((.cse10 (+ v_z_23 .cse0)) (.cse9 (+ (* v_y_23 4294967296) (* 2863311531 v_z_23)))) (or (< v_z_23 0) (< .cse1 .cse9) (= .cse7 .cse10) (< 4294967295 .cse10) (< .cse9 .cse3))))))) (< (mod (+ c_thread2Thread1of1ForFork1_~i~1 3) 4294967296) .cse11) (< .cse11 (+ (mod (+ 2 c_thread2Thread1of1ForFork1_~i~1) 4294967296) 1)))))) is different from false [2024-11-14 03:19:19,395 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 03:19:21,425 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 03:19:59,121 WARN L286 SmtUtils]: Spent 28.72s on a formula simplification. DAG size of input: 117 DAG size of output: 79 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-14 03:20:01,472 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 03:20:07,854 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 03:21:08,516 WARN L286 SmtUtils]: Spent 54.85s 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 03:21:23,160 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse46 (* 2 c_~a~0)) (.cse60 (mod (+ 2 c_thread1Thread1of1ForFork0_~i~0) 4294967296))) (let ((.cse28 (mod (+ 3 c_thread1Thread1of1ForFork0_~i~0) 4294967296)) (.cse48 (+ .cse60 1)) (.cse24 (mod (+ c_~x_1~0 (* 3 c_~a~0)) 4294967296)) (.cse15 (mod c_~x_1~0 4294967296)) (.cse12 (mod c_~x_2~0 4294967296)) (.cse55 (mod (+ c_~x_2~0 (* 2 c_~b~0)) 4294967296)) (.cse54 (mod (+ 2 c_thread2Thread1of1ForFork1_~i~1) 4294967296)) (.cse45 (mod c_thread2Thread1of1ForFork1_~i~1 4294967296)) (.cse58 (mod (+ c_thread2Thread1of1ForFork1_~i~1 1) 4294967296)) (.cse5 (mod c_~a~0 4294967296)) (.cse8 (mod c_~b~0 4294967296)) (.cse56 (mod (+ c_thread1Thread1of1ForFork0_~i~0 1) 4294967296)) (.cse59 (mod (+ c_~x_2~0 c_~b~0) 4294967296)) (.cse57 (mod (+ c_~x_1~0 .cse46) 4294967296))) (let ((.cse3 (= .cse59 .cse57)) (.cse16 (div c_thread1Thread1of1ForFork0_~i~0 4294967296)) (.cse1 (< .cse8 (+ .cse56 1))) (.cse4 (< .cse60 .cse8)) (.cse6 (< .cse58 .cse5)) (.cse7 (= .cse59 (mod (+ c_~x_1~0 c_~a~0) 4294967296))) (.cse9 (< .cse5 (+ .cse45 1))) (.cse41 (mod (+ |c_thread1Thread1of1ForFork0_#t~post1| 3) 4294967296)) (.cse0 (< .cse5 (+ .cse58 1))) (.cse32 (mod (+ |c_thread1Thread1of1ForFork0_#t~post1| 2) 4294967296)) (.cse2 (< .cse54 .cse5)) (.cse31 (= .cse55 .cse57)) (.cse17 (= .cse15 .cse12)) (.cse10 (< .cse56 .cse8)) (.cse22 (+ .cse24 4294967296)) (.cse42 (= .cse24 .cse55)) (.cse43 (< .cse8 .cse48)) (.cse29 (< (mod (+ c_thread2Thread1of1ForFork1_~i~1 3) 4294967296) .cse5)) (.cse44 (< .cse28 .cse8)) (.cse30 (< .cse5 (+ .cse54 1)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4) (<= 1 .cse5) (or .cse6 .cse7 (< .cse8 (+ (mod c_thread1Thread1of1ForFork0_~i~0 4294967296) 1)) .cse9 .cse10) (or .cse6 .cse1 .cse3 .cse9 .cse4) (let ((.cse11 (* 12884901888 (div c_~b~0 4294967296))) (.cse13 (* 3 c_thread1Thread1of1ForFork0_~i~0)) (.cse14 (* 3 c_~b~0))) (or (< (+ 4294967283 .cse11 .cse12 .cse13) .cse14) (and (<= .cse15 .cse12) (or (< (+ .cse11 .cse12 .cse13) (+ .cse15 (* .cse16 12884901888) .cse14 1)) .cse17)))) (<= 0 .cse16) (= c_thread2Thread1of1ForFork1_~i~1 1) (or (let ((.cse18 (mod (+ c_thread1Thread1of1ForFork0_~i~0 4) 4294967296)) (.cse20 (+ .cse28 1))) (and (forall ((v_y_23 Int) (v_z_23 Int)) (let ((.cse19 (+ (* v_y_23 4294967296) (* 2863311531 v_z_23))) (.cse21 (+ v_z_23 .cse12))) (or (< .cse18 .cse19) (< .cse19 .cse20) (< 4294967295 v_z_23) (< .cse21 4294967296) (= .cse22 .cse21)))) (forall ((v_y_23 Int) (v_z_23 Int)) (let ((.cse25 (+ v_z_23 .cse12)) (.cse23 (+ (* v_y_23 4294967296) (* 2863311531 v_z_23)))) (or (< .cse18 .cse23) (< v_z_23 0) (= .cse24 .cse25) (< 4294967295 .cse25) (< .cse23 .cse20)))) (forall ((v_y_23 Int) (v_z_23 Int)) (let ((.cse26 (+ (* v_y_23 4294967296) (* 2863311531 v_z_23))) (.cse27 (+ v_z_23 .cse12))) (or (< .cse18 .cse26) (< v_z_23 0) (= .cse24 .cse27) (< .cse26 .cse20) (< 4294967295 v_z_23) (= .cse22 .cse27)))))) .cse29 .cse9 .cse30) (or .cse0 .cse1 .cse2 .cse31 .cse4) (or .cse6 (< .cse8 (+ (mod (+ |c_thread1Thread1of1ForFork0_#t~post1| 1) 4294967296) 1)) .cse7 (< .cse32 .cse8) .cse9) (or (let ((.cse34 (+ .cse41 1)) (.cse36 (mod (+ |c_thread1Thread1of1ForFork0_#t~post1| 4) 4294967296))) (and (forall ((v_y_23 Int) (v_z_23 Int)) (let ((.cse33 (+ (* v_y_23 4294967296) (* 2863311531 v_z_23))) (.cse35 (+ v_z_23 .cse12))) (or (< .cse33 .cse34) (< 4294967295 v_z_23) (< .cse35 4294967296) (< .cse36 .cse33) (= .cse22 .cse35)))) (forall ((v_y_23 Int) (v_z_23 Int)) (let ((.cse38 (+ (* v_y_23 4294967296) (* 2863311531 v_z_23))) (.cse37 (+ v_z_23 .cse12))) (or (< v_z_23 0) (= .cse24 .cse37) (< .cse38 .cse34) (< 4294967295 v_z_23) (< .cse36 .cse38) (= .cse22 .cse37)))) (forall ((v_y_23 Int) (v_z_23 Int)) (let ((.cse39 (+ v_z_23 .cse12)) (.cse40 (+ (* v_y_23 4294967296) (* 2863311531 v_z_23)))) (or (< v_z_23 0) (= .cse24 .cse39) (< 4294967295 .cse39) (< .cse40 .cse34) (< .cse36 .cse40)))))) .cse29 .cse9 .cse30) (or .cse0 .cse42 .cse43 .cse2 .cse44) (or (< .cse41 .cse8) .cse0 (< .cse8 (+ .cse32 1)) .cse2 .cse31) (= c_thread1Thread1of1ForFork0_~i~0 1) (or (< .cse45 .cse5) .cse17 .cse10) (= 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 .cse12))) (or (< .cse28 .cse47) (< .cse47 .cse48) (< 4294967295 v_z_23) (< .cse49 4294967296) (= .cse22 .cse49)))) (forall ((v_y_23 Int) (v_z_23 Int)) (let ((.cse50 (+ (* v_y_23 4294967296) (* 2863311531 v_z_23))) (.cse51 (+ v_z_23 .cse12))) (or (< v_z_23 0) (< .cse28 .cse50) (= .cse24 .cse51) (< .cse50 .cse48) (< 4294967295 v_z_23) (= .cse22 .cse51)))) (forall ((v_y_23 Int) (v_z_23 Int)) (let ((.cse53 (+ v_z_23 .cse12)) (.cse52 (+ (* v_y_23 4294967296) (* 2863311531 v_z_23)))) (or (< v_z_23 0) (< .cse28 .cse52) (= .cse24 .cse53) (< 4294967295 .cse53) (< .cse52 .cse48))))) .cse29 .cse30) (or .cse42 .cse43 .cse29 .cse44 .cse30) (= c_~x_2~0 c_~b~0))))) is different from false [2024-11-14 03:21:26,230 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse45 (* 2 c_~a~0)) (.cse57 (mod (+ 2 c_thread1Thread1of1ForFork0_~i~0) 4294967296))) (let ((.cse29 (mod (+ 3 c_thread1Thread1of1ForFork0_~i~0) 4294967296)) (.cse47 (+ .cse57 1)) (.cse32 (mod (+ c_~x_2~0 (* 2 c_~b~0)) 4294967296)) (.cse25 (mod (+ c_~x_1~0 (* 3 c_~a~0)) 4294967296)) (.cse15 (mod c_~x_1~0 4294967296)) (.cse12 (mod c_~x_2~0 4294967296)) (.cse53 (mod (+ 2 c_thread2Thread1of1ForFork1_~i~1) 4294967296)) (.cse55 (mod c_thread2Thread1of1ForFork1_~i~1 4294967296)) (.cse8 (mod c_~b~0 4294967296)) (.cse54 (mod (+ c_thread1Thread1of1ForFork0_~i~0 1) 4294967296)) (.cse7 (mod (+ c_~x_2~0 c_~b~0) 4294967296)) (.cse33 (mod (+ c_~x_1~0 .cse45) 4294967296)) (.cse56 (mod (+ c_thread2Thread1of1ForFork1_~i~1 1) 4294967296)) (.cse5 (mod c_~a~0 4294967296))) (let ((.cse6 (< .cse56 .cse5)) (.cse3 (= .cse7 .cse33)) (.cse16 (div c_thread1Thread1of1ForFork0_~i~0 4294967296)) (.cse1 (< .cse8 (+ .cse54 1))) (.cse4 (< .cse57 .cse8)) (.cse9 (< .cse5 (+ .cse55 1))) (.cse0 (< .cse5 (+ .cse56 1))) (.cse2 (< .cse53 .cse5)) (.cse18 (< .cse55 .cse5)) (.cse17 (= .cse15 .cse12)) (.cse10 (< .cse54 .cse8)) (.cse23 (+ .cse25 4294967296)) (.cse42 (= .cse25 .cse32)) (.cse43 (< .cse8 .cse47)) (.cse30 (< (mod (+ c_thread2Thread1of1ForFork1_~i~1 3) 4294967296) .cse5)) (.cse44 (< .cse29 .cse8)) (.cse31 (< .cse5 (+ .cse53 1)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4) (<= 1 .cse5) (or .cse6 (= .cse7 (mod (+ c_~x_1~0 c_~a~0) 4294967296)) (< .cse8 (+ (mod c_thread1Thread1of1ForFork0_~i~0 4294967296) 1)) .cse9 .cse10) (or .cse6 .cse1 .cse3 .cse9 .cse4) (let ((.cse11 (* 12884901888 (div c_~b~0 4294967296))) (.cse13 (* 3 c_thread1Thread1of1ForFork0_~i~0)) (.cse14 (* 3 c_~b~0))) (or (< (+ 4294967283 .cse11 .cse12 .cse13) .cse14) (and (<= .cse15 .cse12) (or (< (+ .cse11 .cse12 .cse13) (+ .cse15 (* .cse16 12884901888) .cse14 1)) .cse17)))) (<= 0 .cse16) (= c_thread2Thread1of1ForFork1_~i~1 1) (or .cse18 .cse17 (< (mod (+ |c_thread1Thread1of1ForFork0_#t~post1| 1) 4294967296) .cse8)) (or (let ((.cse19 (mod (+ c_thread1Thread1of1ForFork0_~i~0 4) 4294967296)) (.cse21 (+ .cse29 1))) (and (forall ((v_y_23 Int) (v_z_23 Int)) (let ((.cse20 (+ (* v_y_23 4294967296) (* 2863311531 v_z_23))) (.cse22 (+ v_z_23 .cse12))) (or (< .cse19 .cse20) (< .cse20 .cse21) (< 4294967295 v_z_23) (< .cse22 4294967296) (= .cse23 .cse22)))) (forall ((v_y_23 Int) (v_z_23 Int)) (let ((.cse26 (+ v_z_23 .cse12)) (.cse24 (+ (* v_y_23 4294967296) (* 2863311531 v_z_23)))) (or (< .cse19 .cse24) (< v_z_23 0) (= .cse25 .cse26) (< 4294967295 .cse26) (< .cse24 .cse21)))) (forall ((v_y_23 Int) (v_z_23 Int)) (let ((.cse27 (+ (* v_y_23 4294967296) (* 2863311531 v_z_23))) (.cse28 (+ v_z_23 .cse12))) (or (< .cse19 .cse27) (< v_z_23 0) (= .cse25 .cse28) (< .cse27 .cse21) (< 4294967295 v_z_23) (= .cse23 .cse28)))))) .cse30 .cse9 .cse31) (or .cse0 .cse1 .cse2 (= .cse32 .cse33) .cse4) (= |c_thread1Thread1of1ForFork0_#t~post1| 1) (or (let ((.cse35 (+ (mod (+ |c_thread1Thread1of1ForFork0_#t~post1| 3) 4294967296) 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 .cse12))) (or (< .cse34 .cse35) (< 4294967295 v_z_23) (< .cse36 4294967296) (< .cse37 .cse34) (= .cse23 .cse36)))) (forall ((v_y_23 Int) (v_z_23 Int)) (let ((.cse39 (+ (* v_y_23 4294967296) (* 2863311531 v_z_23))) (.cse38 (+ v_z_23 .cse12))) (or (< v_z_23 0) (= .cse25 .cse38) (< .cse39 .cse35) (< 4294967295 v_z_23) (< .cse37 .cse39) (= .cse23 .cse38)))) (forall ((v_y_23 Int) (v_z_23 Int)) (let ((.cse40 (+ v_z_23 .cse12)) (.cse41 (+ (* v_y_23 4294967296) (* 2863311531 v_z_23)))) (or (< v_z_23 0) (= .cse25 .cse40) (< 4294967295 .cse40) (< .cse41 .cse35) (< .cse37 .cse41)))))) .cse30 .cse9 .cse31) (or .cse0 .cse42 .cse43 .cse2 .cse44) (= c_thread1Thread1of1ForFork0_~i~0 1) (or .cse18 .cse17 .cse10) (= c_~x_1~0 .cse45) (or (and (forall ((v_y_23 Int) (v_z_23 Int)) (let ((.cse46 (+ (* v_y_23 4294967296) (* 2863311531 v_z_23))) (.cse48 (+ v_z_23 .cse12))) (or (< .cse29 .cse46) (< .cse46 .cse47) (< 4294967295 v_z_23) (< .cse48 4294967296) (= .cse23 .cse48)))) (forall ((v_y_23 Int) (v_z_23 Int)) (let ((.cse49 (+ (* v_y_23 4294967296) (* 2863311531 v_z_23))) (.cse50 (+ v_z_23 .cse12))) (or (< v_z_23 0) (< .cse29 .cse49) (= .cse25 .cse50) (< .cse49 .cse47) (< 4294967295 v_z_23) (= .cse23 .cse50)))) (forall ((v_y_23 Int) (v_z_23 Int)) (let ((.cse52 (+ v_z_23 .cse12)) (.cse51 (+ (* v_y_23 4294967296) (* 2863311531 v_z_23)))) (or (< v_z_23 0) (< .cse29 .cse51) (= .cse25 .cse52) (< 4294967295 .cse52) (< .cse51 .cse47))))) .cse30 .cse31) (or .cse42 .cse43 .cse30 .cse44 .cse31) (= c_~x_2~0 c_~b~0))))) is different from false [2024-11-14 03:21:29,115 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 03:21:46,662 WARN L286 SmtUtils]: Spent 12.62s 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 03:22:06,973 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.71s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-14 03:22:49,192 WARN L286 SmtUtils]: Spent 7.80s 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 03:22:50,916 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.69s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-14 03:24:00,931 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 03:24:08,927 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.30s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-14 03:25:25,096 WARN L286 SmtUtils]: Spent 57.05s 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 03:26:02,644 WARN L286 SmtUtils]: Spent 23.75s on a formula simplification. DAG size of input: 168 DAG size of output: 138 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) Received shutdown request... [2024-11-14 03:26:53,930 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 03:26:53,932 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 03:26:53,932 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 03:26:54,950 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 03:26:54,954 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 03:26:55,135 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forcibly destroying the process [2024-11-14 03:26:55,154 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 137 [2024-11-14 03:26:55,154 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-14 03:26:55,154 WARN L596 AbstractCegarLoop]: Verification canceled: while PredicateUnifier was unifying predicates,while executing Executor. [2024-11-14 03:26:55,156 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2024-11-14 03:26:55,156 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 3 remaining) [2024-11-14 03:26:55,156 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2024-11-14 03:26:55,159 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1, 1] [2024-11-14 03:26:55,161 INFO L242 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-14 03:26:55,161 INFO L173 ceAbstractionStarter]: Computing trace abstraction results [2024-11-14 03:26:55,163 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.11 03:26:55 BasicIcfg [2024-11-14 03:26:55,163 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-14 03:26:55,163 INFO L158 Benchmark]: Toolchain (without parser) took 879210.14ms. Allocated memory was 83.9MB in the beginning and 234.9MB in the end (delta: 151.0MB). Free memory was 57.4MB in the beginning and 96.8MB in the end (delta: -39.4MB). Peak memory consumption was 147.9MB. Max. memory is 8.0GB. [2024-11-14 03:26:55,163 INFO L158 Benchmark]: CDTParser took 0.27ms. Allocated memory is still 83.9MB. Free memory is still 37.9MB. There was no memory consumed. Max. memory is 8.0GB. [2024-11-14 03:26:55,163 INFO L158 Benchmark]: CACSL2BoogieTranslator took 172.14ms. Allocated memory is still 83.9MB. Free memory was 57.2MB in the beginning and 45.9MB in the end (delta: 11.2MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2024-11-14 03:26:55,164 INFO L158 Benchmark]: Boogie Procedure Inliner took 20.93ms. Allocated memory is still 83.9MB. Free memory was 45.9MB in the beginning and 44.7MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 8.0GB. [2024-11-14 03:26:55,164 INFO L158 Benchmark]: Boogie Preprocessor took 18.04ms. Allocated memory is still 83.9MB. Free memory was 44.7MB in the beginning and 44.1MB in the end (delta: 635.1kB). There was no memory consumed. Max. memory is 8.0GB. [2024-11-14 03:26:55,164 INFO L158 Benchmark]: RCFGBuilder took 235.83ms. Allocated memory is still 83.9MB. Free memory was 43.9MB in the beginning and 33.4MB in the end (delta: 10.5MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. [2024-11-14 03:26:55,164 INFO L158 Benchmark]: TraceAbstraction took 878758.86ms. Allocated memory was 83.9MB in the beginning and 234.9MB in the end (delta: 151.0MB). Free memory was 32.7MB in the beginning and 96.8MB in the end (delta: -64.2MB). Peak memory consumption was 122.7MB. Max. memory is 8.0GB. [2024-11-14 03:26:55,165 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.27ms. Allocated memory is still 83.9MB. Free memory is still 37.9MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 172.14ms. Allocated memory is still 83.9MB. Free memory was 57.2MB in the beginning and 45.9MB in the end (delta: 11.2MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 20.93ms. Allocated memory is still 83.9MB. Free memory was 45.9MB in the beginning and 44.7MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 18.04ms. Allocated memory is still 83.9MB. Free memory was 44.7MB in the beginning and 44.1MB in the end (delta: 635.1kB). There was no memory consumed. Max. memory is 8.0GB. * RCFGBuilder took 235.83ms. Allocated memory is still 83.9MB. Free memory was 43.9MB in the beginning and 33.4MB in the end (delta: 10.5MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. * TraceAbstraction took 878758.86ms. Allocated memory was 83.9MB in the beginning and 234.9MB in the end (delta: 151.0MB). Free memory was 32.7MB in the beginning and 96.8MB in the end (delta: -64.2MB). Peak memory consumption was 122.7MB. 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: 1446, independent: 1180, independent conditional: 584, independent unconditional: 596, dependent: 266, dependent conditional: 264, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1182, independent: 1180, independent conditional: 584, 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: 1182, independent: 1180, independent conditional: 584, 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: 1182, independent: 1180, independent conditional: 584, 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: 1182, independent: 1180, independent conditional: 0, independent unconditional: 1180, 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: 1182, independent: 1180, independent conditional: 0, independent unconditional: 1180, 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: 566, independent: 564, independent conditional: 0, independent unconditional: 564, 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: 566, independent: 563, independent conditional: 0, independent unconditional: 563, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 3, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 3, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 93, independent: 41, independent conditional: 0, independent unconditional: 41, dependent: 52, dependent conditional: 0, dependent unconditional: 52, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Symbolic Condition Computations: 0, Protected Queries: 0 ], Cache Queries: [ total: 1182, independent: 616, independent conditional: 0, independent unconditional: 616, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 566, unknown conditional: 0, unknown unconditional: 566] , Statistics on independence cache: Total cache size (in pairs): 566, Positive cache size: 564, Positive conditional cache size: 0, Positive unconditional cache size: 564, 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: 584, Maximal queried relation: 0, Independence queries for same thread: 264, 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: 1446, independent: 1180, independent conditional: 584, independent unconditional: 596, dependent: 266, dependent conditional: 264, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1182, independent: 1180, independent conditional: 584, 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: 1182, independent: 1180, independent conditional: 584, 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: 1182, independent: 1180, independent conditional: 584, 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: 1182, independent: 1180, independent conditional: 0, independent unconditional: 1180, 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: 1182, independent: 1180, independent conditional: 0, independent unconditional: 1180, 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: 566, independent: 564, independent conditional: 0, independent unconditional: 564, 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: 566, independent: 563, independent conditional: 0, independent unconditional: 563, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 3, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 3, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 93, independent: 41, independent conditional: 0, independent unconditional: 41, dependent: 52, dependent conditional: 0, dependent unconditional: 52, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Symbolic Condition Computations: 0, Protected Queries: 0 ], Cache Queries: [ total: 1182, independent: 616, independent conditional: 0, independent unconditional: 616, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 566, unknown conditional: 0, unknown unconditional: 566] , Statistics on independence cache: Total cache size (in pairs): 566, Positive cache size: 564, Positive conditional cache size: 0, Positive unconditional cache size: 564, 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: 584, Maximal queried relation: 0, Independence queries for same thread: 264 - TimeoutResultAtElement [Line: 70]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable Cancelled while PredicateUnifier was unifying predicates,while executing Executor. - TimeoutResultAtElement [Line: 65]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while PredicateUnifier was unifying predicates,while executing Executor. - TimeoutResultAtElement [Line: 64]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while PredicateUnifier was unifying predicates,while executing Executor. - 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: 878.6s, OverallIterations: 4, TraceHistogramMax: 0, PathProgramHistogramMax: 2, EmptinessCheckTime: 733.2s, 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: 201, 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, 144.7s 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: 0, TraceChecks: 0, UnknownTraceChecks: 0, ImperfectProofs: 0, QuantifiedConditions: 0, FalseConditions: 0 RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown