/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 BOTH --traceabstraction.criterion.for.conditional.commutativity.checking SLEEP_SET --traceabstraction.use.limited.checks.recommended.for.dfs true --traceabstraction.limit.for.limited.checks 10 -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-3774817-m [2024-04-06 09:56:24,416 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-04-06 09:56:24,480 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../benchexec/../../../trunk/examples/settings/gemcutter/NewStatesSleep.epf [2024-04-06 09:56:24,483 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-04-06 09:56:24,483 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-04-06 09:56:24,509 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-04-06 09:56:24,509 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-04-06 09:56:24,509 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-04-06 09:56:24,510 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-04-06 09:56:24,513 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-04-06 09:56:24,513 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-04-06 09:56:24,513 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-04-06 09:56:24,514 INFO L153 SettingsManager]: * Use SBE=true [2024-04-06 09:56:24,514 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-04-06 09:56:24,515 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-04-06 09:56:24,515 INFO L153 SettingsManager]: * sizeof long=4 [2024-04-06 09:56:24,515 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-04-06 09:56:24,515 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-04-06 09:56:24,516 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-04-06 09:56:24,516 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-04-06 09:56:24,516 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-04-06 09:56:24,516 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-04-06 09:56:24,516 INFO L153 SettingsManager]: * sizeof long double=12 [2024-04-06 09:56:24,516 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-04-06 09:56:24,517 INFO L153 SettingsManager]: * Use constant arrays=true [2024-04-06 09:56:24,517 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-04-06 09:56:24,517 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-04-06 09:56:24,517 INFO L153 SettingsManager]: * To the following directory=./dump/ [2024-04-06 09:56:24,517 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-04-06 09:56:24,517 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-04-06 09:56:24,518 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-04-06 09:56:24,518 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-04-06 09:56:24,519 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-04-06 09:56:24,519 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-04-06 09:56:24,519 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=SLEEP_NEW_STATES [2024-04-06 09:56:24,519 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-04-06 09:56:24,519 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-04-06 09:56:24,519 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2024-04-06 09:56:24,519 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-04-06 09:56:24,519 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 -> BOTH Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Criterion for conditional commutativity checking -> SLEEP_SET Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: use limited checks (recommended for DFS) -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Limit for limited checks -> 10 [2024-04-06 09:56:24,736 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-04-06 09:56:24,756 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-04-06 09:56:24,758 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-04-06 09:56:24,759 INFO L270 PluginConnector]: Initializing CDTParser... [2024-04-06 09:56:24,759 INFO L274 PluginConnector]: CDTParser initialized [2024-04-06 09:56:24,760 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-04-06 09:56:25,852 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-04-06 09:56:25,979 INFO L384 CDTParser]: Found 1 translation units. [2024-04-06 09:56:25,979 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-mult-4.wvr.c [2024-04-06 09:56:25,991 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/f2ab56131/d685ee1f8c09408fb19556ed92c35f05/FLAGefbc0a738 [2024-04-06 09:56:26,009 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/f2ab56131/d685ee1f8c09408fb19556ed92c35f05 [2024-04-06 09:56:26,012 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-04-06 09:56:26,012 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-04-06 09:56:26,025 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-04-06 09:56:26,026 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-04-06 09:56:26,030 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-04-06 09:56:26,030 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.04 09:56:26" (1/1) ... [2024-04-06 09:56:26,032 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6aab19bd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.04 09:56:26, skipping insertion in model container [2024-04-06 09:56:26,038 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.04 09:56:26" (1/1) ... [2024-04-06 09:56:26,085 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-04-06 09:56:26,281 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-04-06 09:56:26,284 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-04-06 09:56:26,294 INFO L202 MainTranslator]: Completed pre-run [2024-04-06 09:56:26,325 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-04-06 09:56:26,326 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-04-06 09:56:26,331 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2024-04-06 09:56:26,331 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2024-04-06 09:56:26,338 INFO L206 MainTranslator]: Completed translation [2024-04-06 09:56:26,339 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.04 09:56:26 WrapperNode [2024-04-06 09:56:26,339 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-04-06 09:56:26,340 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-04-06 09:56:26,340 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-04-06 09:56:26,340 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-04-06 09:56:26,345 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.04 09:56:26" (1/1) ... [2024-04-06 09:56:26,357 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.04 09:56:26" (1/1) ... [2024-04-06 09:56:26,399 INFO L138 Inliner]: procedures = 23, calls = 42, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 120 [2024-04-06 09:56:26,400 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-04-06 09:56:26,400 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-04-06 09:56:26,401 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-04-06 09:56:26,401 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-04-06 09:56:26,407 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.04 09:56:26" (1/1) ... [2024-04-06 09:56:26,407 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.04 09:56:26" (1/1) ... [2024-04-06 09:56:26,417 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.04 09:56:26" (1/1) ... [2024-04-06 09:56:26,417 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.04 09:56:26" (1/1) ... [2024-04-06 09:56:26,426 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.04 09:56:26" (1/1) ... [2024-04-06 09:56:26,428 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.04 09:56:26" (1/1) ... [2024-04-06 09:56:26,429 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.04 09:56:26" (1/1) ... [2024-04-06 09:56:26,430 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.04 09:56:26" (1/1) ... [2024-04-06 09:56:26,431 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-04-06 09:56:26,432 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-04-06 09:56:26,432 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-04-06 09:56:26,432 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-04-06 09:56:26,433 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.04 09:56:26" (1/1) ... [2024-04-06 09:56:26,442 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-04-06 09:56:26,453 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-04-06 09:56:26,475 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-04-06 09:56:26,519 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-04-06 09:56:26,555 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-04-06 09:56:26,555 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-04-06 09:56:26,555 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-04-06 09:56:26,555 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-04-06 09:56:26,555 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-04-06 09:56:26,556 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2024-04-06 09:56:26,556 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2024-04-06 09:56:26,556 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2024-04-06 09:56:26,556 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2024-04-06 09:56:26,556 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-04-06 09:56:26,556 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-04-06 09:56:26,556 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-04-06 09:56:26,556 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-04-06 09:56:26,556 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-04-06 09:56:26,556 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-04-06 09:56:26,556 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-04-06 09:56:26,557 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-04-06 09:56:26,557 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-04-06 09:56:26,558 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-04-06 09:56:26,639 INFO L241 CfgBuilder]: Building ICFG [2024-04-06 09:56:26,641 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2024-04-06 09:56:26,823 INFO L282 CfgBuilder]: Performing block encoding [2024-04-06 09:56:26,864 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-04-06 09:56:26,865 INFO L309 CfgBuilder]: Removed 4 assume(true) statements. [2024-04-06 09:56:26,866 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.04 09:56:26 BoogieIcfgContainer [2024-04-06 09:56:26,866 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-04-06 09:56:26,868 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-04-06 09:56:26,868 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-04-06 09:56:26,870 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-04-06 09:56:26,870 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.04 09:56:26" (1/3) ... [2024-04-06 09:56:26,871 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@43628f90 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.04 09:56:26, skipping insertion in model container [2024-04-06 09:56:26,871 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.04 09:56:26" (2/3) ... [2024-04-06 09:56:26,871 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@43628f90 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.04 09:56:26, skipping insertion in model container [2024-04-06 09:56:26,871 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.04 09:56:26" (3/3) ... [2024-04-06 09:56:26,872 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-mult-4.wvr.c [2024-04-06 09:56:26,878 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2024-04-06 09:56:26,884 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-04-06 09:56:26,884 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-04-06 09:56:26,885 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-04-06 09:56:26,938 INFO L144 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2024-04-06 09:56:26,971 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-04-06 09:56:26,971 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-04-06 09:56:26,972 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-04-06 09:56:26,974 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-04-06 09:56:26,990 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-04-06 09:56:27,036 INFO L184 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-04-06 09:56:27,049 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-06 09:56:27,050 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-04-06 09:56:27,056 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;@eb307bc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms], mConComChecker=BOTH, mConComCheckerCriterion=SLEEP_SET, mConComCheckerLimitedChecksCriterion=true, mConComCheckerCriterionLimit=10, mConComCheckerRandomProb=100, mConComCheckerRandomSeed=123 [2024-04-06 09:56:27,056 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2024-04-06 09:56:29,297 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-04-06 09:56:29,300 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-06 09:56:29,300 INFO L85 PathProgramCache]: Analyzing trace with hash 825825901, now seen corresponding path program 1 times [2024-04-06 09:56:29,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-06 09:56:29,309 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1397892966] [2024-04-06 09:56:29,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 09:56:29,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 09:56:29,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 09:56:29,710 INFO L134 CoverageAnalysis]: Checked inductivity of 349 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 349 trivial. 0 not checked. [2024-04-06 09:56:29,710 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-06 09:56:29,710 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1397892966] [2024-04-06 09:56:29,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1397892966] provided 1 perfect and 0 imperfect interpolant sequences [2024-04-06 09:56:29,711 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-04-06 09:56:29,711 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-04-06 09:56:29,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1789195633] [2024-04-06 09:56:29,712 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-04-06 09:56:29,730 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-04-06 09:56:29,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-06 09:56:29,912 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-04-06 09:56:29,913 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-04-06 09:56:29,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-06 09:56:29,915 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-06 09:56:29,916 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-04-06 09:56:29,916 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-06 09:56:31,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-06 09:56:31,398 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-04-06 09:56:31,398 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-04-06 09:56:31,398 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-06 09:56:31,399 INFO L85 PathProgramCache]: Analyzing trace with hash 1856459753, now seen corresponding path program 1 times [2024-04-06 09:56:31,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-06 09:56:31,399 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1616249757] [2024-04-06 09:56:31,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 09:56:31,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 09:56:31,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 09:56:32,675 INFO L134 CoverageAnalysis]: Checked inductivity of 349 backedges. 142 proven. 173 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-04-06 09:56:32,675 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-06 09:56:32,675 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1616249757] [2024-04-06 09:56:32,676 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1616249757] provided 0 perfect and 1 imperfect interpolant sequences [2024-04-06 09:56:32,676 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1953438604] [2024-04-06 09:56:32,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 09:56:32,676 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-04-06 09:56:32,677 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-04-06 09:56:32,722 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-04-06 09:56:32,744 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-04-06 09:56:32,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 09:56:32,840 INFO L262 TraceCheckSpWp]: Trace formula consists of 449 conjuncts, 38 conjunts are in the unsatisfiable core [2024-04-06 09:56:32,851 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-04-06 09:56:33,565 INFO L134 CoverageAnalysis]: Checked inductivity of 349 backedges. 142 proven. 189 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-04-06 09:56:33,565 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-04-06 09:56:34,533 INFO L134 CoverageAnalysis]: Checked inductivity of 349 backedges. 142 proven. 189 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-04-06 09:56:34,533 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1953438604] provided 0 perfect and 2 imperfect interpolant sequences [2024-04-06 09:56:34,533 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-04-06 09:56:34,533 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 21, 21] total 51 [2024-04-06 09:56:34,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [586237031] [2024-04-06 09:56:34,534 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-04-06 09:56:34,535 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2024-04-06 09:56:34,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-06 09:56:34,675 INFO L85 PathProgramCache]: Analyzing trace with hash -1155650188, now seen corresponding path program 1 times [2024-04-06 09:56:34,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 09:56:34,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 09:56:34,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 09:56:35,007 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-04-06 09:56:35,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 09:56:35,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 09:56:35,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 09:56:35,269 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-04-06 09:56:35,404 INFO L85 PathProgramCache]: Analyzing trace with hash 1851303999, now seen corresponding path program 2 times [2024-04-06 09:56:35,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 09:56:35,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 09:56:35,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-06 09:56:35,424 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-06 09:56:35,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-06 09:56:35,524 INFO L85 PathProgramCache]: Analyzing trace with hash -540021526, now seen corresponding path program 1 times [2024-04-06 09:56:35,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 09:56:35,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 09:56:35,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 09:56:35,964 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-04-06 09:56:35,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 09:56:35,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 09:56:35,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 09:56:36,251 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-04-06 09:56:36,327 INFO L85 PathProgramCache]: Analyzing trace with hash 657273161, now seen corresponding path program 2 times [2024-04-06 09:56:36,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 09:56:36,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 09:56:36,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 09:56:36,676 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-04-06 09:56:36,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 09:56:36,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 09:56:36,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 09:56:37,084 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-04-06 09:56:37,164 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2024-04-06 09:56:37,166 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=189, Invalid=3117, Unknown=0, NotChecked=0, Total=3306 [2024-04-06 09:56:37,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-06 09:56:37,168 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-06 09:56:37,169 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-04-06 09:56:37,169 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-06 09:56:37,169 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-06 09:57:02,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-06 09:57:02,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 106 states. [2024-04-06 09:57:02,671 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-04-06 09:57:02,870 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3,SelfDestructingSolverStorable2,SelfDestructingSolverStorable1,SelfDestructingSolverStorable8,SelfDestructingSolverStorable7,SelfDestructingSolverStorable6,SelfDestructingSolverStorable5 [2024-04-06 09:57:02,871 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-04-06 09:57:02,872 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-06 09:57:02,873 INFO L85 PathProgramCache]: Analyzing trace with hash 1547051283, now seen corresponding path program 2 times [2024-04-06 09:57:02,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-06 09:57:02,875 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [191462504] [2024-04-06 09:57:02,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 09:57:02,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 09:57:03,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 09:57:04,281 INFO L134 CoverageAnalysis]: Checked inductivity of 1393 backedges. 304 proven. 570 refuted. 0 times theorem prover too weak. 519 trivial. 0 not checked. [2024-04-06 09:57:04,282 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-06 09:57:04,282 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [191462504] [2024-04-06 09:57:04,282 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [191462504] provided 0 perfect and 1 imperfect interpolant sequences [2024-04-06 09:57:04,282 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2039224601] [2024-04-06 09:57:04,282 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-04-06 09:57:04,282 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-04-06 09:57:04,282 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-04-06 09:57:04,284 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-04-06 09:57:04,299 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-04-06 09:57:04,448 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-04-06 09:57:04,448 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-04-06 09:57:04,451 INFO L262 TraceCheckSpWp]: Trace formula consists of 647 conjuncts, 86 conjunts are in the unsatisfiable core [2024-04-06 09:57:04,456 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-04-06 09:57:06,198 INFO L134 CoverageAnalysis]: Checked inductivity of 1393 backedges. 304 proven. 1063 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2024-04-06 09:57:06,198 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-04-06 09:57:09,864 INFO L134 CoverageAnalysis]: Checked inductivity of 1393 backedges. 304 proven. 1063 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2024-04-06 09:57:09,865 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2039224601] provided 0 perfect and 2 imperfect interpolant sequences [2024-04-06 09:57:09,865 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-04-06 09:57:09,865 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 45, 45] total 100 [2024-04-06 09:57:09,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [182817532] [2024-04-06 09:57:09,865 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-04-06 09:57:09,866 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 100 states [2024-04-06 09:57:09,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-06 09:57:10,200 INFO L85 PathProgramCache]: Analyzing trace with hash -387435888, now seen corresponding path program 3 times [2024-04-06 09:57:10,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 09:57:10,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 09:57:10,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-06 09:57:10,279 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-06 09:57:10,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-06 09:57:10,433 INFO L85 PathProgramCache]: Analyzing trace with hash -701263557, now seen corresponding path program 4 times [2024-04-06 09:57:10,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 09:57:10,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 09:57:10,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 09:57:11,074 INFO L134 CoverageAnalysis]: Checked inductivity of 376 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 266 trivial. 0 not checked. [2024-04-06 09:57:11,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 09:57:11,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 09:57:11,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 09:57:11,427 INFO L134 CoverageAnalysis]: Checked inductivity of 376 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 266 trivial. 0 not checked. [2024-04-06 09:57:11,516 INFO L85 PathProgramCache]: Analyzing trace with hash -1499319137, now seen corresponding path program 5 times [2024-04-06 09:57:11,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 09:57:11,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 09:57:11,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 09:57:11,879 INFO L134 CoverageAnalysis]: Checked inductivity of 554 backedges. 171 proven. 110 refuted. 0 times theorem prover too weak. 273 trivial. 0 not checked. [2024-04-06 09:57:11,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 09:57:11,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 09:57:11,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 09:57:12,347 INFO L134 CoverageAnalysis]: Checked inductivity of 554 backedges. 171 proven. 110 refuted. 0 times theorem prover too weak. 273 trivial. 0 not checked. [2024-04-06 09:57:12,427 INFO L85 PathProgramCache]: Analyzing trace with hash -1237742454, now seen corresponding path program 6 times [2024-04-06 09:57:12,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 09:57:12,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 09:57:12,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 09:57:12,861 INFO L134 CoverageAnalysis]: Checked inductivity of 567 backedges. 172 proven. 110 refuted. 0 times theorem prover too weak. 285 trivial. 0 not checked. [2024-04-06 09:57:12,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 09:57:12,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 09:57:12,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 09:57:13,243 INFO L134 CoverageAnalysis]: Checked inductivity of 567 backedges. 172 proven. 110 refuted. 0 times theorem prover too weak. 285 trivial. 0 not checked. [2024-04-06 09:57:13,408 INFO L85 PathProgramCache]: Analyzing trace with hash -110702424, now seen corresponding path program 7 times [2024-04-06 09:57:13,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 09:57:13,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 09:57:13,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 09:57:13,802 INFO L134 CoverageAnalysis]: Checked inductivity of 568 backedges. 172 proven. 110 refuted. 0 times theorem prover too weak. 286 trivial. 0 not checked. [2024-04-06 09:57:13,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 09:57:13,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 09:57:13,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 09:57:14,163 INFO L134 CoverageAnalysis]: Checked inductivity of 568 backedges. 172 proven. 110 refuted. 0 times theorem prover too weak. 286 trivial. 0 not checked. [2024-04-06 09:57:14,240 INFO L85 PathProgramCache]: Analyzing trace with hash 304672756, now seen corresponding path program 8 times [2024-04-06 09:57:14,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 09:57:14,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 09:57:14,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 09:57:14,717 INFO L134 CoverageAnalysis]: Checked inductivity of 568 backedges. 172 proven. 110 refuted. 0 times theorem prover too weak. 286 trivial. 0 not checked. [2024-04-06 09:57:14,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 09:57:14,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 09:57:14,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 09:57:15,100 INFO L134 CoverageAnalysis]: Checked inductivity of 568 backedges. 172 proven. 110 refuted. 0 times theorem prover too weak. 286 trivial. 0 not checked. [2024-04-06 09:57:15,170 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 100 interpolants. [2024-04-06 09:57:15,172 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=638, Invalid=10074, Unknown=0, NotChecked=0, Total=10712 [2024-04-06 09:57:15,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-06 09:57:15,172 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-06 09:57:15,172 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 100 states, 100 states have (on average 6.35) internal successors, (635), 100 states have internal predecessors, (635), 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-04-06 09:57:15,172 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-06 09:57:15,172 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 106 states. [2024-04-06 09:57:15,173 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-06 09:57:26,585 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse10 (+ 7 |c_thread2Thread1of1ForFork0_~i~1#1|)) (.cse13 (+ |c_thread2Thread1of1ForFork0_~i~1#1| 8)) (.cse20 (+ |c_thread2Thread1of1ForFork0_~i~1#1| 9)) (.cse0 (+ |c_thread2Thread1of1ForFork0_~i~1#1| 1)) (.cse22 (+ |c_thread2Thread1of1ForFork0_~i~1#1| 6)) (.cse17 (+ |c_thread2Thread1of1ForFork0_~i~1#1| 2)) (.cse16 (+ |c_thread2Thread1of1ForFork0_~i~1#1| 4))) (let ((.cse4 (+ |c_thread2Thread1of1ForFork0_~i~1#1| 3)) (.cse5 (* (div .cse16 4294967296) 4294967296)) (.cse14 (mod (+ c_thread1Thread1of1ForFork2_~i~0 8) 4294967296)) (.cse1 (* (div .cse17 4294967296) 4294967296)) (.cse18 (mod (+ c_thread1Thread1of1ForFork2_~i~0 4) 4294967296)) (.cse2 (mod (+ c_thread1Thread1of1ForFork2_~i~0 3) 4294967296)) (.cse7 (+ |c_thread2Thread1of1ForFork0_~i~1#1| 5)) (.cse9 (* (div .cse22 4294967296) 4294967296)) (.cse6 (mod (+ 5 c_thread1Thread1of1ForFork2_~i~0) 4294967296)) (.cse3 (* (div .cse0 4294967296) 4294967296)) (.cse15 (* (div .cse20 4294967296) 4294967296)) (.cse19 (mod (+ c_thread1Thread1of1ForFork2_~i~0 9) 4294967296)) (.cse11 (* (div .cse13 4294967296) 4294967296)) (.cse8 (mod (+ c_thread1Thread1of1ForFork2_~i~0 6) 4294967296)) (.cse12 (mod (+ 7 c_thread1Thread1of1ForFork2_~i~0) 4294967296)) (.cse23 (* (div .cse10 4294967296) 4294967296)) (.cse21 (* (div (+ |c_thread2Thread1of1ForFork0_~i~1#1| 10) 4294967296) 4294967296))) (and (< .cse0 (+ .cse1 .cse2)) (< |c_thread2Thread1of1ForFork0_~i~1#1| (+ .cse3 (mod c_thread1Thread1of1ForFork2_~i~0 4294967296))) (< .cse4 (+ (mod (+ |c_thread1Thread1of1ForFork2_#t~post1| 5) 4294967296) .cse5)) (< .cse4 (+ .cse6 .cse5)) (< |c_thread2Thread1of1ForFork0_~i~1#1| (+ .cse3 (mod (+ c_thread1Thread1of1ForFork2_~i~0 2) 4294967296))) (< .cse7 (+ .cse8 .cse9)) (< |c_thread2Thread1of1ForFork0_~i~1#1| (+ .cse3 (mod (+ |c_thread1Thread1of1ForFork2_#t~post1| 2) 4294967296))) (< .cse7 (+ .cse9 (mod (+ |c_thread1Thread1of1ForFork2_#t~post1| 6) 4294967296))) (< |c_thread2Thread1of1ForFork0_~i~1#1| (+ .cse3 (mod (+ |c_thread1Thread1of1ForFork2_#t~post1| 3) 4294967296))) (< .cse10 (+ .cse11 .cse12)) (< .cse0 (+ (mod (+ |c_thread1Thread1of1ForFork2_#t~post1| 4) 4294967296) .cse1)) (< .cse13 (+ .cse14 .cse15)) (< (+ |c_thread2Thread1of1ForFork0_~i~1#1| (* 4294967296 (div c_~N~0 4294967296))) (+ c_~N~0 (* 4294967296 (div |c_thread2Thread1of1ForFork0_~i~1#1| 4294967296)))) (< .cse16 (+ (* (div .cse7 4294967296) 4294967296) .cse6)) (< .cse17 (+ (* (div .cse4 4294967296) 4294967296) .cse18)) (< .cse4 (+ .cse5 .cse18)) (< .cse10 (+ .cse11 .cse14)) (< .cse0 (+ .cse1 .cse18)) (< |c_thread2Thread1of1ForFork0_~i~1#1| (+ .cse3 .cse2)) (< |c_thread2Thread1of1ForFork0_~i~1#1| (+ .cse3 (mod (+ |c_thread1Thread1of1ForFork2_#t~post1| 1) 4294967296))) (< .cse7 (+ .cse9 .cse6)) (< .cse13 (+ .cse19 .cse15)) (< |c_thread2Thread1of1ForFork0_~i~1#1| (+ .cse3 (mod (+ c_thread1Thread1of1ForFork2_~i~0 1) 4294967296))) (< .cse13 (+ (mod (+ |c_thread1Thread1of1ForFork2_#t~post1| 9) 4294967296) .cse15)) (= |c_thread2Thread1of1ForFork0_~i~1#1| c_thread3Thread1of1ForFork1_~i~2) (< .cse20 (+ .cse19 .cse21)) (< .cse22 (+ .cse23 (mod (+ 7 |c_thread1Thread1of1ForFork2_#t~post1|) 4294967296))) (< .cse10 (+ .cse11 (mod (+ |c_thread1Thread1of1ForFork2_#t~post1| 8) 4294967296))) (< .cse22 (+ .cse8 .cse23)) (< .cse22 (+ .cse12 .cse23)) (< .cse20 (+ (mod (+ |c_thread1Thread1of1ForFork2_#t~post1| 10) 4294967296) .cse21))))) is different from false [2024-04-06 09:57:28,662 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse10 (+ |c_thread2Thread1of1ForFork0_~i~1#1| 1))) (let ((.cse3 (+ |c_thread2Thread1of1ForFork0_~i~1#1| 4)) (.cse4 (+ |c_thread2Thread1of1ForFork0_~i~1#1| 5)) (.cse2 (mod (+ 5 c_thread1Thread1of1ForFork2_~i~0) 4294967296)) (.cse1 (+ |c_thread2Thread1of1ForFork0_~i~1#1| 3)) (.cse6 (+ |c_thread2Thread1of1ForFork0_~i~1#1| 2)) (.cse7 (mod (+ c_thread1Thread1of1ForFork2_~i~0 4) 4294967296)) (.cse0 (* (div .cse10 4294967296) 4294967296)) (.cse9 (+ |c_thread2Thread1of1ForFork0_~i~1#1| 8)) (.cse5 (+ |c_thread2Thread1of1ForFork0_~i~1#1| 6)) (.cse8 (+ 7 |c_thread2Thread1of1ForFork0_~i~1#1|))) (and (< |c_thread2Thread1of1ForFork0_~i~1#1| (+ .cse0 (mod c_thread1Thread1of1ForFork2_~i~0 4294967296))) (< .cse1 (+ .cse2 (* (div .cse3 4294967296) 4294967296))) (< |c_thread2Thread1of1ForFork0_~i~1#1| (+ .cse0 (mod (+ c_thread1Thread1of1ForFork2_~i~0 2) 4294967296))) (< .cse4 (+ (mod (+ c_thread1Thread1of1ForFork2_~i~0 6) 4294967296) (* (div .cse5 4294967296) 4294967296))) (< .cse3 (+ (* (div .cse4 4294967296) 4294967296) .cse2)) (< .cse6 (+ (* (div .cse1 4294967296) 4294967296) .cse7)) (< .cse8 (+ (* (div .cse9 4294967296) 4294967296) (mod (+ c_thread1Thread1of1ForFork2_~i~0 8) 4294967296))) (< .cse10 (+ (* (div .cse6 4294967296) 4294967296) .cse7)) (< |c_thread2Thread1of1ForFork0_~i~1#1| (+ .cse0 (mod (+ c_thread1Thread1of1ForFork2_~i~0 3) 4294967296))) (< .cse9 (+ (mod (+ c_thread1Thread1of1ForFork2_~i~0 9) 4294967296) (* (div (+ |c_thread2Thread1of1ForFork0_~i~1#1| 9) 4294967296) 4294967296))) (= |c_thread2Thread1of1ForFork0_~i~1#1| c_thread3Thread1of1ForFork1_~i~2) (< .cse5 (+ (mod (+ 7 c_thread1Thread1of1ForFork2_~i~0) 4294967296) (* (div .cse8 4294967296) 4294967296)))))) is different from false [2024-04-06 09:58:01,565 WARN L293 SmtUtils]: Spent 11.17s on a formula simplification. DAG size of input: 89 DAG size of output: 87 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-04-06 09:58:45,084 WARN L293 SmtUtils]: Spent 14.27s on a formula simplification. DAG size of input: 80 DAG size of output: 75 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-04-06 09:59:20,420 WARN L293 SmtUtils]: Spent 10.36s on a formula simplification. DAG size of input: 78 DAG size of output: 78 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-04-06 09:59:22,803 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-04-06 09:59:44,924 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-04-06 09:59:47,970 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.92s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-04-06 09:59:49,387 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.38s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-04-06 09:59:51,708 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-04-06 10:00:40,134 WARN L293 SmtUtils]: Spent 20.97s on a formula simplification. DAG size of input: 101 DAG size of output: 92 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-04-06 10:00:42,816 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-04-06 10:00:45,401 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-04-06 10:01:19,297 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-04-06 10:01:21,326 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-04-06 10:01:23,715 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-04-06 10:02:12,471 WARN L293 SmtUtils]: Spent 25.33s on a formula simplification. DAG size of input: 135 DAG size of output: 94 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-04-06 10:03:30,224 WARN L293 SmtUtils]: Spent 24.69s on a formula simplification. DAG size of input: 152 DAG size of output: 94 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-04-06 10:03:31,714 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-04-06 10:03:36,014 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-04-06 10:03:38,021 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-04-06 10:03:41,483 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-04-06 10:03:43,589 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-04-06 10:03:45,596 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-04-06 10:04:10,278 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-04-06 10:04:12,282 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-04-06 10:04:14,288 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-04-06 10:04:16,299 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-04-06 10:04:37,965 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.06s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-04-06 10:04:39,970 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-04-06 10:04:42,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-04-06 10:04:44,094 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-04-06 10:04:45,332 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.24s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-04-06 10:05:15,673 WARN L293 SmtUtils]: Spent 9.79s on a formula simplification. DAG size of input: 118 DAG size of output: 73 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-04-06 10:05:17,707 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-04-06 10:05:19,768 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-04-06 10:05:21,834 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-04-06 10:05:23,814 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.98s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-04-06 10:05:26,228 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-04-06 10:05:27,304 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.08s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-04-06 10:05:29,365 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-04-06 10:05:31,642 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-04-06 10:05:33,646 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-04-06 10:05:35,663 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-04-06 10:05:37,670 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-04-06 10:05:39,675 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-04-06 10:05:41,682 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-04-06 10:05:43,691 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-04-06 10:05:45,696 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-04-06 10:05:47,858 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-04-06 10:05:49,885 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-04-06 10:05:51,942 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.06s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-04-06 10:05:53,952 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-04-06 10:05:55,956 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-04-06 10:05:57,960 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-04-06 10:05:59,968 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-04-06 10:06:01,003 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-04-06 10:06:03,007 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-04-06 10:06:05,043 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-04-06 10:06:07,078 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-04-06 10:06:09,082 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-04-06 10:06:35,198 WARN L293 SmtUtils]: Spent 9.02s on a formula simplification. DAG size of input: 79 DAG size of output: 72 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-04-06 10:06:37,201 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-04-06 10:06:39,208 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-04-06 10:06:41,260 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-04-06 10:06:43,311 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-04-06 10:06:45,319 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-04-06 10:06:47,327 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-04-06 10:06:49,334 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-04-06 10:06:51,338 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-04-06 10:06:53,342 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-04-06 10:06:55,240 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.90s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-04-06 10:06:57,243 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-04-06 10:06:59,248 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-04-06 10:07:01,253 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-04-06 10:07:31,119 WARN L293 SmtUtils]: Spent 9.24s on a formula simplification. DAG size of input: 75 DAG size of output: 69 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-04-06 10:07:33,122 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-04-06 10:07:35,127 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-04-06 10:07:37,131 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-04-06 10:07:39,136 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-04-06 10:07:41,143 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-04-06 10:07:43,147 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-04-06 10:07:45,153 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-04-06 10:07:47,157 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-04-06 10:07:49,163 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-04-06 10:07:51,167 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-04-06 10:07:53,171 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-04-06 10:07:55,176 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-04-06 10:07:57,185 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-04-06 10:07:59,190 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-04-06 10:08:01,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-04-06 10:08:03,200 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-04-06 10:08:05,206 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-04-06 10:08:07,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-04-06 10:08:09,219 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-04-06 10:08:11,225 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-04-06 10:08:13,230 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-04-06 10:08:15,233 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-04-06 10:08:16,984 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.74s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-04-06 10:08:18,990 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-04-06 10:08:21,130 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-04-06 10:08:23,149 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-04-06 10:08:24,699 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.55s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-04-06 10:08:46,223 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-04-06 10:08:48,231 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-04-06 10:08:50,316 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-04-06 10:08:52,392 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-04-06 10:09:18,130 WARN L293 SmtUtils]: Spent 5.79s on a formula simplification. DAG size of input: 84 DAG size of output: 81 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-04-06 10:09:20,679 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-04-06 10:09:22,722 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-04-06 10:09:24,798 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-04-06 10:09:27,758 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-04-06 10:09:29,783 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-04-06 10:09:31,799 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-04-06 10:09:52,738 WARN L293 SmtUtils]: Spent 7.17s on a formula simplification. DAG size of input: 75 DAG size of output: 72 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-04-06 10:09:55,350 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-04-06 10:09:57,404 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-04-06 10:09:59,408 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-04-06 10:10:01,487 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-04-06 10:10:03,494 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-04-06 10:10:05,497 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-04-06 10:10:07,502 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-04-06 10:10:09,754 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-04-06 10:10:12,733 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-04-06 10:10:14,832 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-04-06 10:10:16,841 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-04-06 10:10:18,845 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-04-06 10:10:20,849 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-04-06 10:10:23,286 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-04-06 10:10:25,343 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-04-06 10:10:27,543 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-04-06 10:10:49,288 WARN L293 SmtUtils]: Spent 7.18s on a formula simplification. DAG size of input: 83 DAG size of output: 77 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) Received shutdown request... [2024-04-06 10:10:50,025 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-04-06 10:10:50,038 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-04-06 10:10:50,040 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-04-06 10:10:51,052 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-04-06 10:10:51,052 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Ended with exit code 0 [2024-04-06 10:10:51,226 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-04-06 10:10:51,238 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,SelfDestructingSolverStorable19,SelfDestructingSolverStorable20,SelfDestructingSolverStorable10,SelfDestructingSolverStorable11,SelfDestructingSolverStorable12,SelfDestructingSolverStorable9,SelfDestructingSolverStorable13,SelfDestructingSolverStorable14,SelfDestructingSolverStorable15,SelfDestructingSolverStorable16,SelfDestructingSolverStorable17 [2024-04-06 10:10:51,238 WARN L619 AbstractCegarLoop]: Verification canceled: while executing Executor. [2024-04-06 10:10:51,240 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2024-04-06 10:10:51,240 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 5 remaining) [2024-04-06 10:10:51,241 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 5 remaining) [2024-04-06 10:10:51,241 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 5 remaining) [2024-04-06 10:10:51,241 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 5 remaining) [2024-04-06 10:10:51,244 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-04-06 10:10:51,246 INFO L445 BasicCegarLoop]: Path program histogram: [8, 2, 2, 1] [2024-04-06 10:10:51,261 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-04-06 10:10:51,261 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2024-04-06 10:10:51,263 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.04 10:10:51 BasicIcfg [2024-04-06 10:10:51,263 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-04-06 10:10:51,264 INFO L158 Benchmark]: Toolchain (without parser) took 865251.45ms. Allocated memory was 162.5MB in the beginning and 1.7GB in the end (delta: 1.6GB). Free memory was 92.4MB in the beginning and 1.5GB in the end (delta: -1.4GB). Peak memory consumption was 152.8MB. Max. memory is 8.0GB. [2024-04-06 10:10:51,264 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 162.5MB. Free memory was 93.2MB in the beginning and 93.0MB in the end (delta: 181.9kB). There was no memory consumed. Max. memory is 8.0GB. [2024-04-06 10:10:51,264 INFO L158 Benchmark]: CACSL2BoogieTranslator took 314.43ms. Allocated memory is still 162.5MB. Free memory was 92.3MB in the beginning and 80.7MB in the end (delta: 11.6MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2024-04-06 10:10:51,265 INFO L158 Benchmark]: Boogie Procedure Inliner took 59.81ms. Allocated memory was 162.5MB in the beginning and 255.9MB in the end (delta: 93.3MB). Free memory was 80.7MB in the beginning and 226.5MB in the end (delta: -145.8MB). Peak memory consumption was 8.8MB. Max. memory is 8.0GB. [2024-04-06 10:10:51,265 INFO L158 Benchmark]: Boogie Preprocessor took 30.87ms. Allocated memory is still 255.9MB. Free memory was 226.5MB in the beginning and 224.9MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2024-04-06 10:10:51,265 INFO L158 Benchmark]: RCFGBuilder took 434.23ms. Allocated memory is still 255.9MB. Free memory was 224.9MB in the beginning and 205.5MB in the end (delta: 19.4MB). Peak memory consumption was 19.9MB. Max. memory is 8.0GB. [2024-04-06 10:10:51,265 INFO L158 Benchmark]: TraceAbstraction took 864395.78ms. Allocated memory was 255.9MB in the beginning and 1.7GB in the end (delta: 1.5GB). Free memory was 204.5MB in the beginning and 1.5GB in the end (delta: -1.3GB). Peak memory consumption was 170.2MB. Max. memory is 8.0GB. [2024-04-06 10:10:51,276 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 162.5MB. Free memory was 93.2MB in the beginning and 93.0MB in the end (delta: 181.9kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 314.43ms. Allocated memory is still 162.5MB. Free memory was 92.3MB in the beginning and 80.7MB in the end (delta: 11.6MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 59.81ms. Allocated memory was 162.5MB in the beginning and 255.9MB in the end (delta: 93.3MB). Free memory was 80.7MB in the beginning and 226.5MB in the end (delta: -145.8MB). Peak memory consumption was 8.8MB. Max. memory is 8.0GB. * Boogie Preprocessor took 30.87ms. Allocated memory is still 255.9MB. Free memory was 226.5MB in the beginning and 224.9MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 434.23ms. Allocated memory is still 255.9MB. Free memory was 224.9MB in the beginning and 205.5MB in the end (delta: 19.4MB). Peak memory consumption was 19.9MB. Max. memory is 8.0GB. * TraceAbstraction took 864395.78ms. Allocated memory was 255.9MB in the beginning and 1.7GB in the end (delta: 1.5GB). Free memory was 204.5MB in the beginning and 1.5GB in the end (delta: -1.3GB). Peak memory consumption was 170.2MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 1340568, independent: 1176351, independent conditional: 1113536, independent unconditional: 62815, dependent: 164217, dependent conditional: 119625, dependent unconditional: 44592, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1180151, independent: 1176351, independent conditional: 1113536, independent unconditional: 62815, dependent: 3800, dependent conditional: 3784, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1180151, independent: 1176351, independent conditional: 1113536, independent unconditional: 62815, dependent: 3800, dependent conditional: 3784, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1180151, independent: 1176351, independent conditional: 1113536, independent unconditional: 62815, dependent: 3800, dependent conditional: 3784, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1186621, independent: 1176351, independent conditional: 28893, independent unconditional: 1147458, dependent: 10270, dependent conditional: 2874, dependent unconditional: 7396, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1186621, independent: 1176351, independent conditional: 26034, independent unconditional: 1150317, dependent: 10270, dependent conditional: 0, dependent unconditional: 10270, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1186621, independent: 1176351, independent conditional: 26034, independent unconditional: 1150317, dependent: 10270, dependent conditional: 0, dependent unconditional: 10270, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1802, independent: 1794, independent conditional: 4, independent unconditional: 1790, 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: 1802, independent: 1786, independent conditional: 0, independent unconditional: 1786, 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: 95, independent: 21, independent conditional: 2, independent unconditional: 19, dependent: 74, dependent conditional: 0, dependent unconditional: 74, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 1186621, independent: 1174557, independent conditional: 26030, independent unconditional: 1148527, dependent: 10262, dependent conditional: 0, dependent unconditional: 10262, unknown: 1802, unknown conditional: 4, unknown unconditional: 1798] , Statistics on independence cache: Total cache size (in pairs): 1802, Positive cache size: 1794, Positive conditional cache size: 4, Positive unconditional cache size: 1790, 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: 5733, Maximal queried relation: 1, ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1186621, independent: 1176351, independent conditional: 28893, independent unconditional: 1147458, dependent: 10270, dependent conditional: 2874, dependent unconditional: 7396, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1186621, independent: 1176351, independent conditional: 26034, independent unconditional: 1150317, dependent: 10270, dependent conditional: 0, dependent unconditional: 10270, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1186621, independent: 1176351, independent conditional: 26034, independent unconditional: 1150317, dependent: 10270, dependent conditional: 0, dependent unconditional: 10270, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1802, independent: 1794, independent conditional: 4, independent unconditional: 1790, 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: 1802, independent: 1786, independent conditional: 0, independent unconditional: 1786, 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: 95, independent: 21, independent conditional: 2, independent unconditional: 19, dependent: 74, dependent conditional: 0, dependent unconditional: 74, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 1186621, independent: 1174557, independent conditional: 26030, independent unconditional: 1148527, dependent: 10262, dependent conditional: 0, dependent unconditional: 10262, unknown: 1802, unknown conditional: 4, unknown unconditional: 1798] , Statistics on independence cache: Total cache size (in pairs): 1802, Positive cache size: 1794, Positive conditional cache size: 4, Positive unconditional cache size: 1790, 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: 5733 ], Independence queries for same thread: 160417 - TimeoutResultAtElement [Line: 101]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable Cancelled while executing Executor. - TimeoutResultAtElement [Line: 92]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while executing Executor. - TimeoutResultAtElement [Line: 94]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while executing Executor. - TimeoutResultAtElement [Line: 91]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while executing Executor. - TimeoutResultAtElement [Line: 93]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled 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: 864.2s, OverallIterations: 3, TraceHistogramMax: 0, PathProgramHistogramMax: 8, EmptinessCheckTime: 845.3s, 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: 213, 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.6s InterpolantComputationTime, 1292 NumberOfCodeBlocks, 1292 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 1825 ConstructedInterpolants, 0 QuantifiedInterpolants, 11556 SizeOfPredicates, 60 NumberOfNonLiveVariables, 1096 ConjunctsInSsa, 124 ConjunctsInUnsatCore, 7 InterpolantComputations, 1 PerfectInterpolantSequences, 2328/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 RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown