/root/.sdkman/candidates/java/current/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../benchexec/../../../trunk/examples/settings/gemcutter/NewStatesSleep.epf --traceabstraction.dfs.order.used.in.por LOOP_LOCKSTEP --traceabstraction.additional.conditional.commutativity.checking IA --traceabstraction.criterion.for.conditional.commutativity.checking RANDOM --traceabstraction.probability.for.random.criterion 20 --traceabstraction.seed.for.random.criterion 546 -tc ../benchexec/../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/popl20-mult-4.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-wip.dk.conditional-comm-17da818-m [2024-05-05 21:49:42,315 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-05-05 21:49:42,387 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../benchexec/../../../trunk/examples/settings/gemcutter/NewStatesSleep.epf [2024-05-05 21:49:42,392 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-05-05 21:49:42,392 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-05-05 21:49:42,414 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-05-05 21:49:42,415 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-05-05 21:49:42,415 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-05-05 21:49:42,416 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-05-05 21:49:42,419 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-05-05 21:49:42,419 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-05-05 21:49:42,419 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-05-05 21:49:42,419 INFO L153 SettingsManager]: * Use SBE=true [2024-05-05 21:49:42,421 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-05-05 21:49:42,421 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-05-05 21:49:42,421 INFO L153 SettingsManager]: * sizeof long=4 [2024-05-05 21:49:42,421 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-05-05 21:49:42,421 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-05-05 21:49:42,422 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-05-05 21:49:42,422 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-05-05 21:49:42,422 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-05-05 21:49:42,422 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-05-05 21:49:42,423 INFO L153 SettingsManager]: * sizeof long double=12 [2024-05-05 21:49:42,423 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-05-05 21:49:42,423 INFO L153 SettingsManager]: * Use constant arrays=true [2024-05-05 21:49:42,423 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-05-05 21:49:42,423 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-05-05 21:49:42,423 INFO L153 SettingsManager]: * To the following directory=./dump/ [2024-05-05 21:49:42,424 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-05-05 21:49:42,424 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-05-05 21:49:42,425 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-05-05 21:49:42,425 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-05-05 21:49:42,425 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-05-05 21:49:42,425 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-05-05 21:49:42,425 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=SLEEP_NEW_STATES [2024-05-05 21:49:42,426 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-05-05 21:49:42,426 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-05-05 21:49:42,426 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2024-05-05 21:49:42,426 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-05-05 21:49:42,426 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: DFS Order used in POR -> LOOP_LOCKSTEP Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Additional conditional commutativity checking -> IA Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Criterion for conditional commutativity checking -> RANDOM Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: probability for random criterion as percentage -> 20 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: seed for random criterion -> 546 [2024-05-05 21:49:42,622 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-05-05 21:49:42,642 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-05-05 21:49:42,643 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-05-05 21:49:42,644 INFO L270 PluginConnector]: Initializing CDTParser... [2024-05-05 21:49:42,645 INFO L274 PluginConnector]: CDTParser initialized [2024-05-05 21:49:42,646 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/svcomp/weaver/popl20-mult-4.wvr.c [2024-05-05 21:49:43,785 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-05-05 21:49:43,926 INFO L384 CDTParser]: Found 1 translation units. [2024-05-05 21:49:43,926 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-mult-4.wvr.c [2024-05-05 21:49:43,931 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/c4759453b/88cffb2e799641a2b1382896f9fc0593/FLAG9cdc0d822 [2024-05-05 21:49:43,941 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/c4759453b/88cffb2e799641a2b1382896f9fc0593 [2024-05-05 21:49:43,942 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-05-05 21:49:43,943 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-05-05 21:49:43,944 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-05-05 21:49:43,944 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-05-05 21:49:43,947 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-05-05 21:49:43,948 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.05 09:49:43" (1/1) ... [2024-05-05 21:49:43,948 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@51ddbc2a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.05 09:49:43, skipping insertion in model container [2024-05-05 21:49:43,948 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.05 09:49:43" (1/1) ... [2024-05-05 21:49:43,967 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-05-05 21:49:44,081 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-mult-4.wvr.c[2612,2625] [2024-05-05 21:49:44,085 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-05-05 21:49:44,091 INFO L202 MainTranslator]: Completed pre-run [2024-05-05 21:49:44,107 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-mult-4.wvr.c[2612,2625] [2024-05-05 21:49:44,115 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-05-05 21:49:44,121 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2024-05-05 21:49:44,121 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2024-05-05 21:49:44,126 INFO L206 MainTranslator]: Completed translation [2024-05-05 21:49:44,126 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.05 09:49:44 WrapperNode [2024-05-05 21:49:44,126 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-05-05 21:49:44,127 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-05-05 21:49:44,127 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-05-05 21:49:44,127 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-05-05 21:49:44,136 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.05 09:49:44" (1/1) ... [2024-05-05 21:49:44,141 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.05 09:49:44" (1/1) ... [2024-05-05 21:49:44,194 INFO L138 Inliner]: procedures = 23, calls = 42, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 120 [2024-05-05 21:49:44,195 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-05-05 21:49:44,195 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-05-05 21:49:44,195 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-05-05 21:49:44,195 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-05-05 21:49:44,206 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.05 09:49:44" (1/1) ... [2024-05-05 21:49:44,206 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.05 09:49:44" (1/1) ... [2024-05-05 21:49:44,226 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.05 09:49:44" (1/1) ... [2024-05-05 21:49:44,226 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.05 09:49:44" (1/1) ... [2024-05-05 21:49:44,230 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.05 09:49:44" (1/1) ... [2024-05-05 21:49:44,246 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.05 09:49:44" (1/1) ... [2024-05-05 21:49:44,248 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.05 09:49:44" (1/1) ... [2024-05-05 21:49:44,248 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.05 09:49:44" (1/1) ... [2024-05-05 21:49:44,250 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-05-05 21:49:44,252 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-05-05 21:49:44,252 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-05-05 21:49:44,252 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-05-05 21:49:44,253 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.05 09:49:44" (1/1) ... [2024-05-05 21:49:44,263 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-05-05 21:49:44,273 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-05 21:49:44,291 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-05-05 21:49:44,301 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-05-05 21:49:44,330 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-05-05 21:49:44,330 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-05-05 21:49:44,330 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-05-05 21:49:44,330 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-05-05 21:49:44,330 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-05-05 21:49:44,331 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2024-05-05 21:49:44,331 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2024-05-05 21:49:44,331 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2024-05-05 21:49:44,331 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2024-05-05 21:49:44,331 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-05-05 21:49:44,331 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-05-05 21:49:44,332 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-05-05 21:49:44,332 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-05-05 21:49:44,333 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-05-05 21:49:44,333 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-05-05 21:49:44,333 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-05-05 21:49:44,333 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-05-05 21:49:44,333 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-05-05 21:49:44,334 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-05-05 21:49:44,405 INFO L241 CfgBuilder]: Building ICFG [2024-05-05 21:49:44,407 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2024-05-05 21:49:44,606 INFO L282 CfgBuilder]: Performing block encoding [2024-05-05 21:49:44,652 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-05-05 21:49:44,652 INFO L309 CfgBuilder]: Removed 4 assume(true) statements. [2024-05-05 21:49:44,653 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.05 09:49:44 BoogieIcfgContainer [2024-05-05 21:49:44,653 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-05-05 21:49:44,655 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-05-05 21:49:44,655 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-05-05 21:49:44,658 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-05-05 21:49:44,658 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.05 09:49:43" (1/3) ... [2024-05-05 21:49:44,658 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f94812c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.05 09:49:44, skipping insertion in model container [2024-05-05 21:49:44,658 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.05 09:49:44" (2/3) ... [2024-05-05 21:49:44,659 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f94812c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.05 09:49:44, skipping insertion in model container [2024-05-05 21:49:44,659 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.05 09:49:44" (3/3) ... [2024-05-05 21:49:44,660 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-mult-4.wvr.c [2024-05-05 21:49:44,666 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2024-05-05 21:49:44,673 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-05-05 21:49:44,673 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-05-05 21:49:44,673 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-05-05 21:49:44,729 INFO L144 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2024-05-05 21:49:44,777 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-05 21:49:44,778 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-05-05 21:49:44,778 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-05 21:49:44,785 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-05-05 21:49:44,786 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2024-05-05 21:49:44,812 INFO L188 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-05-05 21:49:44,821 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-05 21:49:44,823 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-05-05 21:49:44,828 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=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;@122721bb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms], mConComChecker=IA, mConComCheckerCriterion=RANDOM, mConComCheckerLimitedChecksCriterion=false, mConComCheckerCriterionLimit=1, mConComCheckerRandomProb=20, mConComCheckerRandomSeed=546, mConComCheckerConditionCriterion=false [2024-05-05 21:49:44,828 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2024-05-05 21:49:46,419 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-05-05 21:49:46,423 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-05 21:49:46,423 INFO L85 PathProgramCache]: Analyzing trace with hash 825825901, now seen corresponding path program 1 times [2024-05-05 21:49:46,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-05 21:49:46,431 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [961159221] [2024-05-05 21:49:46,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-05 21:49:46,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-05 21:49:46,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-05 21:49:46,714 INFO L134 CoverageAnalysis]: Checked inductivity of 349 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 349 trivial. 0 not checked. [2024-05-05 21:49:46,714 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-05 21:49:46,715 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [961159221] [2024-05-05 21:49:46,715 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [961159221] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-05 21:49:46,715 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-05 21:49:46,716 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-05-05 21:49:46,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [679383029] [2024-05-05 21:49:46,717 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-05 21:49:46,723 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-05-05 21:49:46,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-05 21:49:46,857 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-05-05 21:49:46,858 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-05-05 21:49:46,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-05 21:49:46,861 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-05 21:49:46,861 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 56.0) internal successors, (112), 2 states have internal predecessors, (112), 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-05-05 21:49:46,862 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-05 21:49:47,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-05 21:49:47,716 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-05-05 21:49:47,716 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-05-05 21:49:47,717 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-05 21:49:47,717 INFO L85 PathProgramCache]: Analyzing trace with hash 1856459753, now seen corresponding path program 1 times [2024-05-05 21:49:47,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-05 21:49:47,717 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [757212834] [2024-05-05 21:49:47,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-05 21:49:47,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-05 21:49:47,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-05 21:49:49,011 INFO L134 CoverageAnalysis]: Checked inductivity of 349 backedges. 142 proven. 173 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-05-05 21:49:49,012 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-05 21:49:49,012 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [757212834] [2024-05-05 21:49:49,012 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [757212834] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-05 21:49:49,012 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1617247446] [2024-05-05 21:49:49,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-05 21:49:49,013 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-05 21:49:49,013 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-05 21:49:49,054 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-05-05 21:49:49,084 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-05-05 21:49:49,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-05 21:49:49,186 INFO L262 TraceCheckSpWp]: Trace formula consists of 449 conjuncts, 38 conjunts are in the unsatisfiable core [2024-05-05 21:49:49,197 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-05 21:49:49,927 INFO L134 CoverageAnalysis]: Checked inductivity of 349 backedges. 142 proven. 189 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-05-05 21:49:49,927 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-05 21:49:50,871 INFO L134 CoverageAnalysis]: Checked inductivity of 349 backedges. 142 proven. 189 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-05-05 21:49:50,871 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1617247446] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-05 21:49:50,871 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-05 21:49:50,871 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 21, 21] total 51 [2024-05-05 21:49:50,872 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1416820377] [2024-05-05 21:49:50,872 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-05 21:49:50,873 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2024-05-05 21:49:50,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-05 21:49:51,071 INFO L85 PathProgramCache]: Analyzing trace with hash -1155650188, now seen corresponding path program 1 times [2024-05-05 21:49:51,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-05 21:49:51,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-05 21:49:51,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-05 21:49:51,418 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-05 21:49:51,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-05 21:49:51,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-05 21:49:51,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-05 21:49:51,615 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-05 21:49:51,697 INFO L85 PathProgramCache]: Analyzing trace with hash 730368557, now seen corresponding path program 1 times [2024-05-05 21:49:51,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-05 21:49:51,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-05 21:49:51,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-05 21:49:51,730 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-05 21:49:51,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-05 21:49:51,856 INFO L85 PathProgramCache]: Analyzing trace with hash 657273161, now seen corresponding path program 2 times [2024-05-05 21:49:51,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-05 21:49:51,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-05 21:49:51,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-05 21:49:52,361 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-05 21:49:52,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-05 21:49:52,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-05 21:49:52,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-05 21:49:52,699 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-05 21:49:52,802 INFO L85 PathProgramCache]: Analyzing trace with hash -1145252659, now seen corresponding path program 3 times [2024-05-05 21:49:52,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-05 21:49:52,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-05 21:49:52,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-05 21:49:52,853 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-05 21:49:52,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-05 21:49:53,037 INFO L85 PathProgramCache]: Analyzing trace with hash 891704314, now seen corresponding path program 4 times [2024-05-05 21:49:53,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-05 21:49:53,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-05 21:49:53,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-05 21:49:53,362 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-05-05 21:49:53,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-05 21:49:53,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-05 21:49:53,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-05 21:49:53,574 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-05-05 21:49:53,666 INFO L85 PathProgramCache]: Analyzing trace with hash 1873030338, now seen corresponding path program 5 times [2024-05-05 21:49:53,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-05 21:49:53,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-05 21:49:53,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-05 21:49:53,902 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-05-05 21:49:53,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-05 21:49:53,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-05 21:49:53,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-05 21:49:54,145 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-05-05 21:49:54,209 INFO L85 PathProgramCache]: Analyzing trace with hash 833318771, now seen corresponding path program 6 times [2024-05-05 21:49:54,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-05 21:49:54,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-05 21:49:54,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-05 21:49:54,414 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-05-05 21:49:54,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-05 21:49:54,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-05 21:49:54,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-05 21:49:54,618 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-05-05 21:49:54,643 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2024-05-05 21:49:54,644 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=194, Invalid=3346, Unknown=0, NotChecked=0, Total=3540 [2024-05-05 21:49:54,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-05 21:49:54,646 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-05 21:49:54,646 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 51 states have (on average 7.686274509803922) internal successors, (392), 51 states have internal predecessors, (392), 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-05-05 21:49:54,646 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-05 21:49:54,646 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-05 21:50:16,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-05 21:50:16,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 106 states. [2024-05-05 21:50:16,371 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-05-05 21:50:16,549 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable4,SelfDestructingSolverStorable3,SelfDestructingSolverStorable2,SelfDestructingSolverStorable1,SelfDestructingSolverStorable8,SelfDestructingSolverStorable7,SelfDestructingSolverStorable6,SelfDestructingSolverStorable5,SelfDestructingSolverStorable10,SelfDestructingSolverStorable11,SelfDestructingSolverStorable12,SelfDestructingSolverStorable9,SelfDestructingSolverStorable13 [2024-05-05 21:50:16,550 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-05-05 21:50:16,550 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-05 21:50:16,550 INFO L85 PathProgramCache]: Analyzing trace with hash 1547051283, now seen corresponding path program 2 times [2024-05-05 21:50:16,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-05 21:50:16,560 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1702716907] [2024-05-05 21:50:16,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-05 21:50:16,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-05 21:50:16,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-05 21:50:17,808 INFO L134 CoverageAnalysis]: Checked inductivity of 1393 backedges. 304 proven. 570 refuted. 0 times theorem prover too weak. 519 trivial. 0 not checked. [2024-05-05 21:50:17,808 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-05 21:50:17,808 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1702716907] [2024-05-05 21:50:17,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1702716907] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-05 21:50:17,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [270297264] [2024-05-05 21:50:17,809 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-05-05 21:50:17,809 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-05 21:50:17,809 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-05 21:50:17,810 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-05-05 21:50:17,816 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-05-05 21:50:17,970 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-05-05 21:50:17,970 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-05-05 21:50:17,974 INFO L262 TraceCheckSpWp]: Trace formula consists of 647 conjuncts, 94 conjunts are in the unsatisfiable core [2024-05-05 21:50:17,978 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-05 21:50:19,889 INFO L134 CoverageAnalysis]: Checked inductivity of 1393 backedges. 86 proven. 1302 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-05-05 21:50:19,889 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-05 21:50:23,695 INFO L134 CoverageAnalysis]: Checked inductivity of 1393 backedges. 86 proven. 1302 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-05-05 21:50:23,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [270297264] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-05 21:50:23,696 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-05 21:50:23,696 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 49, 49] total 111 [2024-05-05 21:50:23,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [31806620] [2024-05-05 21:50:23,696 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-05 21:50:23,697 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 111 states [2024-05-05 21:50:23,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-05 21:50:23,992 INFO L85 PathProgramCache]: Analyzing trace with hash -387435888, now seen corresponding path program 7 times [2024-05-05 21:50:23,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-05 21:50:23,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-05 21:50:24,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-05 21:50:24,077 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-05 21:50:24,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-05 21:50:24,299 INFO L85 PathProgramCache]: Analyzing trace with hash 235454221, now seen corresponding path program 8 times [2024-05-05 21:50:24,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-05 21:50:24,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-05 21:50:24,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-05 21:50:24,820 INFO L134 CoverageAnalysis]: Checked inductivity of 568 backedges. 172 proven. 110 refuted. 0 times theorem prover too weak. 286 trivial. 0 not checked. [2024-05-05 21:50:24,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-05 21:50:24,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-05 21:50:24,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-05 21:50:25,274 INFO L134 CoverageAnalysis]: Checked inductivity of 568 backedges. 172 proven. 110 refuted. 0 times theorem prover too weak. 286 trivial. 0 not checked. [2024-05-05 21:50:25,372 INFO L85 PathProgramCache]: Analyzing trace with hash -110702424, now seen corresponding path program 9 times [2024-05-05 21:50:25,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-05 21:50:25,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-05 21:50:25,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-05 21:50:25,772 INFO L134 CoverageAnalysis]: Checked inductivity of 568 backedges. 172 proven. 110 refuted. 0 times theorem prover too weak. 286 trivial. 0 not checked. [2024-05-05 21:50:25,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-05 21:50:25,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-05 21:50:25,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-05 21:50:26,155 INFO L134 CoverageAnalysis]: Checked inductivity of 568 backedges. 172 proven. 110 refuted. 0 times theorem prover too weak. 286 trivial. 0 not checked. [2024-05-05 21:50:26,312 INFO L85 PathProgramCache]: Analyzing trace with hash 55217219, now seen corresponding path program 10 times [2024-05-05 21:50:26,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-05 21:50:26,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-05 21:50:26,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-05 21:50:26,772 INFO L134 CoverageAnalysis]: Checked inductivity of 568 backedges. 172 proven. 110 refuted. 0 times theorem prover too weak. 286 trivial. 0 not checked. [2024-05-05 21:50:26,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-05 21:50:26,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-05 21:50:26,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-05 21:50:27,133 INFO L134 CoverageAnalysis]: Checked inductivity of 568 backedges. 172 proven. 110 refuted. 0 times theorem prover too weak. 286 trivial. 0 not checked. [2024-05-05 21:50:27,202 INFO L85 PathProgramCache]: Analyzing trace with hash 1672396127, now seen corresponding path program 11 times [2024-05-05 21:50:27,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-05 21:50:27,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-05 21:50:27,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-05 21:50:27,616 INFO L134 CoverageAnalysis]: Checked inductivity of 568 backedges. 172 proven. 110 refuted. 0 times theorem prover too weak. 286 trivial. 0 not checked. [2024-05-05 21:50:27,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-05 21:50:27,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-05 21:50:27,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-05 21:50:28,080 INFO L134 CoverageAnalysis]: Checked inductivity of 568 backedges. 172 proven. 110 refuted. 0 times theorem prover too weak. 286 trivial. 0 not checked. [2024-05-05 21:50:28,143 INFO L85 PathProgramCache]: Analyzing trace with hash 304672756, now seen corresponding path program 12 times [2024-05-05 21:50:28,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-05 21:50:28,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-05 21:50:28,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-05 21:50:28,651 INFO L134 CoverageAnalysis]: Checked inductivity of 568 backedges. 172 proven. 110 refuted. 0 times theorem prover too weak. 286 trivial. 0 not checked. [2024-05-05 21:50:28,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-05 21:50:28,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-05 21:50:28,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-05 21:50:29,038 INFO L134 CoverageAnalysis]: Checked inductivity of 568 backedges. 172 proven. 110 refuted. 0 times theorem prover too weak. 286 trivial. 0 not checked. [2024-05-05 21:50:29,138 INFO L85 PathProgramCache]: Analyzing trace with hash -513701226, now seen corresponding path program 13 times [2024-05-05 21:50:29,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-05 21:50:29,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-05 21:50:29,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-05 21:50:29,579 INFO L134 CoverageAnalysis]: Checked inductivity of 569 backedges. 172 proven. 110 refuted. 0 times theorem prover too weak. 287 trivial. 0 not checked. [2024-05-05 21:50:29,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-05 21:50:29,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-05 21:50:29,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-05 21:50:29,955 INFO L134 CoverageAnalysis]: Checked inductivity of 569 backedges. 172 proven. 110 refuted. 0 times theorem prover too weak. 287 trivial. 0 not checked. [2024-05-05 21:50:30,062 INFO L85 PathProgramCache]: Analyzing trace with hash 1255131530, now seen corresponding path program 14 times [2024-05-05 21:50:30,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-05 21:50:30,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-05 21:50:30,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-05 21:50:30,534 INFO L134 CoverageAnalysis]: Checked inductivity of 569 backedges. 172 proven. 110 refuted. 0 times theorem prover too weak. 287 trivial. 0 not checked. [2024-05-05 21:50:30,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-05 21:50:30,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-05 21:50:30,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-05 21:50:30,944 INFO L134 CoverageAnalysis]: Checked inductivity of 569 backedges. 172 proven. 110 refuted. 0 times theorem prover too weak. 287 trivial. 0 not checked. [2024-05-05 21:50:31,030 INFO L85 PathProgramCache]: Analyzing trace with hash 1255131530, now seen corresponding path program 15 times [2024-05-05 21:50:31,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-05 21:50:31,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-05 21:50:31,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-05 21:50:31,457 INFO L134 CoverageAnalysis]: Checked inductivity of 569 backedges. 172 proven. 110 refuted. 0 times theorem prover too weak. 287 trivial. 0 not checked. [2024-05-05 21:50:31,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-05 21:50:31,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-05 21:50:31,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-05 21:50:31,965 INFO L134 CoverageAnalysis]: Checked inductivity of 569 backedges. 172 proven. 110 refuted. 0 times theorem prover too weak. 287 trivial. 0 not checked. [2024-05-05 21:50:32,049 INFO L85 PathProgramCache]: Analyzing trace with hash 1678147406, now seen corresponding path program 16 times [2024-05-05 21:50:32,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-05 21:50:32,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-05 21:50:32,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-05 21:50:32,412 INFO L134 CoverageAnalysis]: Checked inductivity of 569 backedges. 172 proven. 110 refuted. 0 times theorem prover too weak. 287 trivial. 0 not checked. [2024-05-05 21:50:32,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-05 21:50:32,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-05 21:50:32,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-05 21:50:32,859 INFO L134 CoverageAnalysis]: Checked inductivity of 569 backedges. 172 proven. 110 refuted. 0 times theorem prover too weak. 287 trivial. 0 not checked. [2024-05-05 21:50:32,897 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 111 interpolants. [2024-05-05 21:50:32,901 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=801, Invalid=12309, Unknown=0, NotChecked=0, Total=13110 [2024-05-05 21:50:32,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-05 21:50:32,901 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-05 21:50:32,903 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 111 states, 111 states have (on average 6.378378378378378) internal successors, (708), 111 states have internal predecessors, (708), 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-05-05 21:50:32,903 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-05 21:50:32,903 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 106 states. [2024-05-05 21:50:32,903 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-05 21:50:50,841 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse4 (mod (+ 5 |c_thread4Thread1of1ForFork3_~i~3#1|) 4294967296)) (.cse7 (mod (+ 7 |c_thread4Thread1of1ForFork3_~i~3#1|) 4294967296)) (.cse5 (+ (mod (+ 5 c_thread1Thread1of1ForFork2_~i~0) 4294967296) 1)) (.cse3 (+ (mod (+ c_thread1Thread1of1ForFork2_~i~0 10) 4294967296) 1)) (.cse10 (mod |c_thread4Thread1of1ForFork3_~i~3#1| 4294967296)) (.cse13 (mod (+ |c_thread4Thread1of1ForFork3_~i~3#1| 11) 4294967296)) (.cse8 (+ (mod (+ c_thread1Thread1of1ForFork2_~i~0 6) 4294967296) 1)) (.cse15 (+ (mod c_thread1Thread1of1ForFork2_~i~0 4294967296) 1)) (.cse0 (+ 1 (mod (+ c_thread1Thread1of1ForFork2_~i~0 3) 4294967296))) (.cse2 (mod (+ |c_thread4Thread1of1ForFork3_~i~3#1| 10) 4294967296)) (.cse1 (mod (+ |c_thread4Thread1of1ForFork3_~i~3#1| 1) 4294967296)) (.cse12 (mod (+ |c_thread4Thread1of1ForFork3_~i~3#1| 4) 4294967296)) (.cse17 (+ (mod (+ c_thread1Thread1of1ForFork2_~i~0 4) 4294967296) 1)) (.cse6 (mod (+ |c_thread4Thread1of1ForFork3_~i~3#1| 8) 4294967296)) (.cse11 (+ (mod (+ 7 c_thread1Thread1of1ForFork2_~i~0) 4294967296) 1)) (.cse14 (+ (mod (+ c_thread1Thread1of1ForFork2_~i~0 9) 4294967296) 1)) (.cse16 (mod (+ |c_thread4Thread1of1ForFork3_~i~3#1| 3) 4294967296)) (.cse9 (+ (mod (+ c_thread1Thread1of1ForFork2_~i~0 8) 4294967296) 1)) (.cse18 (mod (+ |c_thread4Thread1of1ForFork3_~i~3#1| 9) 4294967296))) (and (< (mod (+ |c_thread4Thread1of1ForFork3_~i~3#1| 2) 4294967296) .cse0) (< .cse1 (+ (mod (+ |c_thread1Thread1of1ForFork2_#t~post1| 3) 4294967296) 1)) (< .cse2 .cse3) (< .cse4 (+ 1 (mod (+ |c_thread1Thread1of1ForFork2_#t~post1| 6) 4294967296))) (< .cse4 .cse5) (< .cse6 (+ (mod (+ |c_thread1Thread1of1ForFork2_#t~post1| 8) 4294967296) 1)) (< .cse1 (+ (mod (+ |c_thread1Thread1of1ForFork2_#t~post1| 2) 4294967296) 1)) (< .cse1 (+ (mod (+ |c_thread1Thread1of1ForFork2_#t~post1| 1) 4294967296) 1)) (< .cse1 (+ (mod (+ c_thread1Thread1of1ForFork2_~i~0 2) 4294967296) 1)) (< .cse7 .cse8) (< .cse7 (+ (mod (+ 7 |c_thread1Thread1of1ForFork2_#t~post1|) 4294967296) 1)) (< .cse6 .cse9) (< .cse4 .cse8) (< .cse10 (mod c_~N~0 4294967296)) (< .cse7 .cse11) (< .cse12 .cse5) (< .cse12 (+ (mod (+ |c_thread1Thread1of1ForFork2_#t~post1| 5) 4294967296) 1)) (< .cse13 .cse3) (< .cse2 .cse14) (< .cse10 .cse15) (< .cse13 (+ (mod (+ |c_thread1Thread1of1ForFork2_#t~post1| 11) 4294967296) 1)) (< (mod (+ |c_thread4Thread1of1ForFork3_~i~3#1| 6) 4294967296) .cse8) (< .cse1 .cse15) (< .cse16 .cse0) (< .cse16 .cse17) (< .cse1 .cse0) (< .cse2 (+ (mod (+ |c_thread1Thread1of1ForFork2_#t~post1| 10) 4294967296) 1)) (< .cse1 (+ (mod (+ c_thread1Thread1of1ForFork2_~i~0 1) 4294967296) 1)) (< .cse12 .cse17) (< .cse6 .cse11) (< .cse18 .cse14) (= |c_thread2Thread1of1ForFork0_~i~1#1| c_thread3Thread1of1ForFork1_~i~2) (< .cse16 (+ (mod (+ |c_thread1Thread1of1ForFork2_#t~post1| 4) 4294967296) 1)) (< .cse18 .cse9) (< .cse18 (+ (mod (+ |c_thread1Thread1of1ForFork2_#t~post1| 9) 4294967296) 1)))) is different from false [2024-05-05 21:50:52,948 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (+ (mod (+ 5 c_thread1Thread1of1ForFork2_~i~0) 4294967296) 1)) (.cse1 (+ (mod (+ c_thread1Thread1of1ForFork2_~i~0 6) 4294967296) 1)) (.cse3 (mod (+ |c_thread4Thread1of1ForFork3_~i~3#1| 1) 4294967296)) (.cse2 (mod (+ |c_thread4Thread1of1ForFork3_~i~3#1| 4) 4294967296))) (and (< (mod (+ |c_thread4Thread1of1ForFork3_~i~3#1| 2) 4294967296) (+ 1 (mod (+ c_thread1Thread1of1ForFork2_~i~0 3) 4294967296))) (< (mod (+ 5 |c_thread4Thread1of1ForFork3_~i~3#1|) 4294967296) .cse0) (< (mod (+ 7 |c_thread4Thread1of1ForFork3_~i~3#1|) 4294967296) .cse1) (< (mod |c_thread4Thread1of1ForFork3_~i~3#1| 4294967296) (mod c_~N~0 4294967296)) (< .cse2 .cse0) (< (mod (+ |c_thread4Thread1of1ForFork3_~i~3#1| 11) 4294967296) (+ (mod (+ c_thread1Thread1of1ForFork2_~i~0 10) 4294967296) 1)) (< (mod (+ |c_thread4Thread1of1ForFork3_~i~3#1| 10) 4294967296) (+ (mod (+ c_thread1Thread1of1ForFork2_~i~0 9) 4294967296) 1)) (< (mod (+ |c_thread4Thread1of1ForFork3_~i~3#1| 6) 4294967296) .cse1) (< .cse3 (+ (mod c_thread1Thread1of1ForFork2_~i~0 4294967296) 1)) (< .cse3 (+ (mod (+ c_thread1Thread1of1ForFork2_~i~0 1) 4294967296) 1)) (< .cse2 (+ (mod (+ c_thread1Thread1of1ForFork2_~i~0 4) 4294967296) 1)) (< (mod (+ |c_thread4Thread1of1ForFork3_~i~3#1| 8) 4294967296) (+ (mod (+ 7 c_thread1Thread1of1ForFork2_~i~0) 4294967296) 1)) (= |c_thread2Thread1of1ForFork0_~i~1#1| c_thread3Thread1of1ForFork1_~i~2) (< (mod (+ |c_thread4Thread1of1ForFork3_~i~3#1| 9) 4294967296) (+ (mod (+ c_thread1Thread1of1ForFork2_~i~0 8) 4294967296) 1)))) is different from false [2024-05-05 21:52:24,782 WARN L293 SmtUtils]: Spent 32.16s on a formula simplification. DAG size of input: 83 DAG size of output: 73 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-05-05 21:53:11,218 WARN L293 SmtUtils]: Spent 17.44s on a formula simplification. DAG size of input: 65 DAG size of output: 57 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-05-05 21:54:46,670 WARN L293 SmtUtils]: Spent 24.72s on a formula simplification. DAG size of input: 75 DAG size of output: 64 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-05-05 21:54:48,932 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.01s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-05 21:54:50,937 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-05-05 21:56:53,387 WARN L293 SmtUtils]: Spent 34.20s on a formula simplification. DAG size of input: 97 DAG size of output: 80 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-05-05 21:56:55,390 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-05-05 21:56:59,644 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-05-05 21:57:01,488 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.32s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-05 21:57:03,502 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (+ (mod (+ 5 c_thread1Thread1of1ForFork2_~i~0) 4294967296) 1)) (.cse3 (mod |c_thread4Thread1of1ForFork3_~i~3#1| 4294967296)) (.cse5 (+ (mod c_thread1Thread1of1ForFork2_~i~0 4294967296) 1)) (.cse6 (mod (+ |c_thread4Thread1of1ForFork3_~i~3#1| 3) 4294967296)) (.cse0 (+ 1 (mod (+ c_thread1Thread1of1ForFork2_~i~0 3) 4294967296))) (.cse2 (mod (+ |c_thread4Thread1of1ForFork3_~i~3#1| 1) 4294967296)) (.cse4 (mod (+ |c_thread4Thread1of1ForFork3_~i~3#1| 4) 4294967296)) (.cse7 (+ (mod (+ c_thread1Thread1of1ForFork2_~i~0 4) 4294967296) 1))) (and (< (mod (+ |c_thread4Thread1of1ForFork3_~i~3#1| 2) 4294967296) .cse0) (< (mod (+ 5 |c_thread4Thread1of1ForFork3_~i~3#1|) 4294967296) .cse1) (< .cse2 (+ (mod (+ c_thread1Thread1of1ForFork2_~i~0 2) 4294967296) 1)) (< (mod (+ 7 |c_thread4Thread1of1ForFork3_~i~3#1|) 4294967296) (+ (mod (+ c_thread1Thread1of1ForFork2_~i~0 6) 4294967296) 1)) (< .cse3 (mod c_~N~0 4294967296)) (< .cse4 .cse1) (< (mod (+ |c_thread4Thread1of1ForFork3_~i~3#1| 11) 4294967296) (+ (mod (+ c_thread1Thread1of1ForFork2_~i~0 10) 4294967296) 1)) (< (mod (+ |c_thread4Thread1of1ForFork3_~i~3#1| 10) 4294967296) (+ (mod (+ c_thread1Thread1of1ForFork2_~i~0 9) 4294967296) 1)) (< .cse3 .cse5) (< .cse2 .cse5) (< .cse6 .cse0) (< .cse6 .cse7) (< .cse2 .cse0) (< .cse2 (+ (mod (+ c_thread1Thread1of1ForFork2_~i~0 1) 4294967296) 1)) (< .cse4 .cse7) (< (mod (+ |c_thread4Thread1of1ForFork3_~i~3#1| 8) 4294967296) (+ (mod (+ 7 c_thread1Thread1of1ForFork2_~i~0) 4294967296) 1)) (= |c_thread2Thread1of1ForFork0_~i~1#1| c_thread3Thread1of1ForFork1_~i~2) (< (mod (+ |c_thread4Thread1of1ForFork3_~i~3#1| 9) 4294967296) (+ (mod (+ c_thread1Thread1of1ForFork2_~i~0 8) 4294967296) 1)))) is different from false [2024-05-05 21:57:05,507 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-05-05 21:57:09,345 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.33s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-05 21:57:12,270 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-05-05 21:57:14,500 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-05-05 21:57:16,505 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-05-05 21:57:20,168 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-05-05 21:57:24,433 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-05-05 21:57:26,327 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.38s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-05 21:57:29,398 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-05-05 21:57:32,234 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-05-05 21:57:34,864 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-05-05 21:57:36,871 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 [] [2024-05-05 21:57:40,345 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.35s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-05 21:57:42,422 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-05-05 21:57:44,837 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.49s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-05 21:57:48,212 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-05-05 21:57:50,882 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.34s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-05 21:57:52,259 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.38s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-05 21:57:54,977 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-05-05 21:57:59,113 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.83s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-05 21:58:01,119 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 [] [2024-05-05 21:58:02,888 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.77s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-05 21:58:06,194 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-05-05 21:58:08,859 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 [] [2024-05-05 21:58:10,768 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.03s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-05 21:58:11,856 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.09s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-05 21:58:13,866 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (+ (mod (+ 5 c_thread1Thread1of1ForFork2_~i~0) 4294967296) 1)) (.cse3 (mod |c_thread4Thread1of1ForFork3_~i~3#1| 4294967296)) (.cse5 (+ (mod c_thread1Thread1of1ForFork2_~i~0 4294967296) 1)) (.cse6 (mod (+ |c_thread4Thread1of1ForFork3_~i~3#1| 3) 4294967296)) (.cse0 (+ 1 (mod (+ c_thread1Thread1of1ForFork2_~i~0 3) 4294967296))) (.cse2 (mod (+ |c_thread4Thread1of1ForFork3_~i~3#1| 1) 4294967296)) (.cse4 (mod (+ |c_thread4Thread1of1ForFork3_~i~3#1| 4) 4294967296)) (.cse7 (+ (mod (+ c_thread1Thread1of1ForFork2_~i~0 4) 4294967296) 1))) (and (< (mod (+ |c_thread4Thread1of1ForFork3_~i~3#1| 2) 4294967296) .cse0) (< (mod (+ 5 |c_thread4Thread1of1ForFork3_~i~3#1|) 4294967296) .cse1) (< .cse2 (+ (mod (+ c_thread1Thread1of1ForFork2_~i~0 2) 4294967296) 1)) (< (mod (+ 7 |c_thread4Thread1of1ForFork3_~i~3#1|) 4294967296) (+ (mod (+ c_thread1Thread1of1ForFork2_~i~0 6) 4294967296) 1)) (< .cse3 (mod c_~N~0 4294967296)) (< (+ |c_thread2Thread1of1ForFork0_~i~1#1| (* 4294967296 (div c_~N~0 4294967296))) (+ c_~N~0 (* 4294967296 (div |c_thread2Thread1of1ForFork0_~i~1#1| 4294967296)))) (< .cse4 .cse1) (< (mod (+ |c_thread4Thread1of1ForFork3_~i~3#1| 11) 4294967296) (+ (mod (+ c_thread1Thread1of1ForFork2_~i~0 10) 4294967296) 1)) (< (mod (+ |c_thread4Thread1of1ForFork3_~i~3#1| 10) 4294967296) (+ (mod (+ c_thread1Thread1of1ForFork2_~i~0 9) 4294967296) 1)) (< .cse3 .cse5) (< .cse2 .cse5) (< .cse6 .cse0) (< .cse6 .cse7) (< .cse2 .cse0) (< .cse2 (+ (mod (+ c_thread1Thread1of1ForFork2_~i~0 1) 4294967296) 1)) (< .cse4 .cse7) (= c_thread3Thread1of1ForFork1_~i~2 |c_thread2Thread1of1ForFork0_#t~post2#1|) (< (mod (+ |c_thread4Thread1of1ForFork3_~i~3#1| 8) 4294967296) (+ (mod (+ 7 c_thread1Thread1of1ForFork2_~i~0) 4294967296) 1)) (= |c_thread2Thread1of1ForFork0_~i~1#1| c_thread3Thread1of1ForFork1_~i~2) (< (mod (+ |c_thread4Thread1of1ForFork3_~i~3#1| 9) 4294967296) (+ (mod (+ c_thread1Thread1of1ForFork2_~i~0 8) 4294967296) 1)))) is different from false [2024-05-05 21:59:37,033 WARN L293 SmtUtils]: Spent 25.33s on a formula simplification. DAG size of input: 80 DAG size of output: 70 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-05-05 22:01:10,792 WARN L293 SmtUtils]: Spent 22.12s on a formula simplification. DAG size of input: 72 DAG size of output: 64 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-05-05 22:01:37,184 WARN L293 SmtUtils]: Spent 8.66s on a formula simplification. DAG size of input: 66 DAG size of output: 57 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-05-05 22:01:39,522 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-05-05 22:02:15,415 WARN L293 SmtUtils]: Spent 12.34s on a formula simplification. DAG size of input: 69 DAG size of output: 57 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-05-05 22:02:17,055 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.47s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-05 22:02:20,197 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.27s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-05 22:02:30,777 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-05-05 22:02:33,446 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-05-05 22:02:34,737 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.29s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-05 22:02:38,049 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-05-05 22:02:39,626 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.36s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-05 22:03:24,937 WARN L293 SmtUtils]: Spent 15.46s on a formula simplification. DAG size of input: 74 DAG size of output: 64 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-05-05 22:03:26,867 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.46s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-05 22:03:30,565 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-05-05 22:03:32,983 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-05-05 22:03:36,766 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-05-05 22:03:43,329 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.81s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] Received shutdown request... [2024-05-05 22:04:10,409 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/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-05-05 22:04:10,411 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/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-05-05 22:04:10,411 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/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-05-05 22:04:11,435 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Forceful destruction successful, exit code 0 [2024-05-05 22:04:11,438 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-05-05 22:04:11,615 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forcibly destroying the process [2024-05-05 22:04:11,625 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 137 [2024-05-05 22:04:11,626 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,SelfDestructingSolverStorable20,SelfDestructingSolverStorable31,SelfDestructingSolverStorable18,SelfDestructingSolverStorable29,SelfDestructingSolverStorable19,SelfDestructingSolverStorable21,SelfDestructingSolverStorable32,SelfDestructingSolverStorable22,SelfDestructingSolverStorable33,SelfDestructingSolverStorable23,SelfDestructingSolverStorable24,SelfDestructingSolverStorable14,SelfDestructingSolverStorable25,SelfDestructingSolverStorable15,SelfDestructingSolverStorable26,SelfDestructingSolverStorable16,SelfDestructingSolverStorable27,SelfDestructingSolverStorable17,SelfDestructingSolverStorable28 [2024-05-05 22:04:11,626 WARN L619 AbstractCegarLoop]: Verification canceled: while PredicateUnifier was unifying predicates,while executing Executor. [2024-05-05 22:04:11,628 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2024-05-05 22:04:11,628 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 5 remaining) [2024-05-05 22:04:11,628 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 5 remaining) [2024-05-05 22:04:11,629 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 5 remaining) [2024-05-05 22:04:11,629 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 5 remaining) [2024-05-05 22:04:11,639 INFO L448 BasicCegarLoop]: Path program histogram: [16, 2, 1, 1] [2024-05-05 22:04:11,641 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-05-05 22:04:11,641 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2024-05-05 22:04:11,643 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.05 10:04:11 BasicIcfg [2024-05-05 22:04:11,643 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-05-05 22:04:11,643 INFO L158 Benchmark]: Toolchain (without parser) took 867700.36ms. Allocated memory was 175.1MB in the beginning and 1.4GB in the end (delta: 1.2GB). Free memory was 105.5MB in the beginning and 882.7MB in the end (delta: -777.2MB). Peak memory consumption was 472.2MB. Max. memory is 8.0GB. [2024-05-05 22:04:11,644 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 175.1MB. Free memory is still 105.4MB. There was no memory consumed. Max. memory is 8.0GB. [2024-05-05 22:04:11,644 INFO L158 Benchmark]: CACSL2BoogieTranslator took 182.73ms. Allocated memory is still 175.1MB. Free memory was 105.4MB in the beginning and 93.7MB in the end (delta: 11.7MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2024-05-05 22:04:11,644 INFO L158 Benchmark]: Boogie Procedure Inliner took 67.87ms. Allocated memory was 175.1MB in the beginning and 310.4MB in the end (delta: 135.3MB). Free memory was 93.7MB in the beginning and 281.9MB in the end (delta: -188.2MB). Peak memory consumption was 8.7MB. Max. memory is 8.0GB. [2024-05-05 22:04:11,644 INFO L158 Benchmark]: Boogie Preprocessor took 54.81ms. Allocated memory is still 310.4MB. Free memory was 281.9MB in the beginning and 280.3MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2024-05-05 22:04:11,644 INFO L158 Benchmark]: RCFGBuilder took 401.57ms. Allocated memory is still 310.4MB. Free memory was 280.3MB in the beginning and 260.9MB in the end (delta: 19.4MB). Peak memory consumption was 18.9MB. Max. memory is 8.0GB. [2024-05-05 22:04:11,645 INFO L158 Benchmark]: TraceAbstraction took 866987.94ms. Allocated memory was 310.4MB in the beginning and 1.4GB in the end (delta: 1.1GB). Free memory was 259.9MB in the beginning and 882.7MB in the end (delta: -622.8MB). Peak memory consumption was 491.8MB. Max. memory is 8.0GB. [2024-05-05 22:04:11,646 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.09ms. Allocated memory is still 175.1MB. Free memory is still 105.4MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 182.73ms. Allocated memory is still 175.1MB. Free memory was 105.4MB in the beginning and 93.7MB in the end (delta: 11.7MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 67.87ms. Allocated memory was 175.1MB in the beginning and 310.4MB in the end (delta: 135.3MB). Free memory was 93.7MB in the beginning and 281.9MB in the end (delta: -188.2MB). Peak memory consumption was 8.7MB. Max. memory is 8.0GB. * Boogie Preprocessor took 54.81ms. Allocated memory is still 310.4MB. Free memory was 281.9MB in the beginning and 280.3MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 401.57ms. Allocated memory is still 310.4MB. Free memory was 280.3MB in the beginning and 260.9MB in the end (delta: 19.4MB). Peak memory consumption was 18.9MB. Max. memory is 8.0GB. * TraceAbstraction took 866987.94ms. Allocated memory was 310.4MB in the beginning and 1.4GB in the end (delta: 1.1GB). Free memory was 259.9MB in the beginning and 882.7MB in the end (delta: -622.8MB). Peak memory consumption was 491.8MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 605415, independent: 550708, independent conditional: 550706, independent unconditional: 2, dependent: 54707, dependent conditional: 54707, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 552619, independent: 550708, independent conditional: 550706, independent unconditional: 2, dependent: 1911, dependent conditional: 1911, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ ConditionTransformingIndependenceRelation.Independence Queries: [ total: 552619, independent: 550708, independent conditional: 550706, independent unconditional: 2, dependent: 1911, dependent conditional: 1911, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 552619, independent: 550708, independent conditional: 550706, independent unconditional: 2, dependent: 1911, dependent conditional: 1911, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 555865, independent: 550708, independent conditional: 8743, independent unconditional: 541965, dependent: 5157, dependent conditional: 1475, dependent unconditional: 3682, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 555865, independent: 550708, independent conditional: 8556, independent unconditional: 542152, dependent: 5157, dependent conditional: 0, dependent unconditional: 5157, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 555865, independent: 550708, independent conditional: 8556, independent unconditional: 542152, dependent: 5157, dependent conditional: 0, dependent unconditional: 5157, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1814, independent: 1806, independent conditional: 123, independent unconditional: 1683, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1814, independent: 1798, independent conditional: 0, independent unconditional: 1798, dependent: 16, dependent conditional: 0, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 16, independent: 8, independent conditional: 4, independent unconditional: 4, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 16, independent: 8, independent conditional: 4, independent unconditional: 4, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 91, independent: 23, independent conditional: 2, independent unconditional: 21, dependent: 68, dependent conditional: 0, dependent unconditional: 68, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 555865, independent: 548902, independent conditional: 8433, independent unconditional: 540469, dependent: 5149, dependent conditional: 0, dependent unconditional: 5149, unknown: 1814, unknown conditional: 123, unknown unconditional: 1691] , Statistics on independence cache: Total cache size (in pairs): 1814, Positive cache size: 1806, Positive conditional cache size: 123, Positive unconditional cache size: 1683, Negative cache size: 8, Negative conditional cache size: 0, Negative unconditional cache size: 8, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 1662, Maximal queried relation: 1, ConditionTransformingIndependenceRelation.Independence Queries: [ total: 555865, independent: 550708, independent conditional: 8743, independent unconditional: 541965, dependent: 5157, dependent conditional: 1475, dependent unconditional: 3682, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 555865, independent: 550708, independent conditional: 8556, independent unconditional: 542152, dependent: 5157, dependent conditional: 0, dependent unconditional: 5157, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 555865, independent: 550708, independent conditional: 8556, independent unconditional: 542152, dependent: 5157, dependent conditional: 0, dependent unconditional: 5157, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1814, independent: 1806, independent conditional: 123, independent unconditional: 1683, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1814, independent: 1798, independent conditional: 0, independent unconditional: 1798, dependent: 16, dependent conditional: 0, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 16, independent: 8, independent conditional: 4, independent unconditional: 4, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 16, independent: 8, independent conditional: 4, independent unconditional: 4, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 91, independent: 23, independent conditional: 2, independent unconditional: 21, dependent: 68, dependent conditional: 0, dependent unconditional: 68, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 555865, independent: 548902, independent conditional: 8433, independent unconditional: 540469, dependent: 5149, dependent conditional: 0, dependent unconditional: 5149, unknown: 1814, unknown conditional: 123, unknown unconditional: 1691] , Statistics on independence cache: Total cache size (in pairs): 1814, Positive cache size: 1806, Positive conditional cache size: 123, Positive unconditional cache size: 1683, Negative cache size: 8, Negative conditional cache size: 0, Negative unconditional cache size: 8, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 1662 ], Independence queries for same thread: 52796 - TimeoutResultAtElement [Line: 101]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable Cancelled while PredicateUnifier was unifying predicates,while executing Executor. - TimeoutResultAtElement [Line: 92]: 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: 94]: 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: 91]: 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: 93]: 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 with 1 thread instances CFG has 9 procedures, 170 locations, 5 error locations. Started 1 CEGAR loops. OverallTime: 866.9s, OverallIterations: 3, TraceHistogramMax: 0, PathProgramHistogramMax: 16, EmptinessCheckTime: 842.9s, 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: 251, 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.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 9.7s InterpolantComputationTime, 1292 NumberOfCodeBlocks, 1292 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 1825 ConstructedInterpolants, 0 QuantifiedInterpolants, 10912 SizeOfPredicates, 64 NumberOfNonLiveVariables, 1096 ConjunctsInSsa, 132 ConjunctsInUnsatCore, 7 InterpolantComputations, 1 PerfectInterpolantSequences, 1850/5575 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, ConditionalCommutativityCheckTime: 12.5s, ConditionalCommutativityIAIntegrations: 0, ConditionalCommutativityDFSRestarts: 0, ConditionalCommutativityConditionCalculations: 17, ConditionalCommutativityTraceChecks: 17, ConditionalCommutativityImperfectProofs: 14 RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown