/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-equiv.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-wip.dk.conditional-comm-17da818-m [2024-05-08 04:20:49,567 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-05-08 04:20:49,627 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../benchexec/../../../trunk/examples/settings/gemcutter/NewStatesSleep.epf [2024-05-08 04:20:49,631 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-05-08 04:20:49,632 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-05-08 04:20:49,662 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-05-08 04:20:49,662 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-05-08 04:20:49,662 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-05-08 04:20:49,663 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-05-08 04:20:49,666 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-05-08 04:20:49,666 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-05-08 04:20:49,667 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-05-08 04:20:49,667 INFO L153 SettingsManager]: * Use SBE=true [2024-05-08 04:20:49,668 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-05-08 04:20:49,668 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-05-08 04:20:49,669 INFO L153 SettingsManager]: * sizeof long=4 [2024-05-08 04:20:49,669 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-05-08 04:20:49,669 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-05-08 04:20:49,669 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-05-08 04:20:49,669 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-05-08 04:20:49,669 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-05-08 04:20:49,670 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-05-08 04:20:49,671 INFO L153 SettingsManager]: * sizeof long double=12 [2024-05-08 04:20:49,671 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-05-08 04:20:49,671 INFO L153 SettingsManager]: * Use constant arrays=true [2024-05-08 04:20:49,671 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-05-08 04:20:49,671 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-05-08 04:20:49,671 INFO L153 SettingsManager]: * To the following directory=./dump/ [2024-05-08 04:20:49,672 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-05-08 04:20:49,672 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-05-08 04:20:49,673 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-05-08 04:20:49,673 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-05-08 04:20:49,673 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-05-08 04:20:49,673 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-05-08 04:20:49,673 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=SLEEP_NEW_STATES [2024-05-08 04:20:49,673 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-05-08 04:20:49,674 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-05-08 04:20:49,674 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2024-05-08 04:20:49,674 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-05-08 04:20:49,674 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-05-08 04:20:49,916 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-05-08 04:20:49,930 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-05-08 04:20:49,934 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-05-08 04:20:49,935 INFO L270 PluginConnector]: Initializing CDTParser... [2024-05-08 04:20:49,935 INFO L274 PluginConnector]: CDTParser initialized [2024-05-08 04:20:49,936 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/svcomp/weaver/popl20-mult-equiv.wvr.c [2024-05-08 04:20:51,030 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-05-08 04:20:51,194 INFO L384 CDTParser]: Found 1 translation units. [2024-05-08 04:20:51,195 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-mult-equiv.wvr.c [2024-05-08 04:20:51,206 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/72be3fec2/9014572967a443f6a893a9c0c08183b8/FLAGe43874262 [2024-05-08 04:20:51,216 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/72be3fec2/9014572967a443f6a893a9c0c08183b8 [2024-05-08 04:20:51,218 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-05-08 04:20:51,219 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-05-08 04:20:51,220 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-05-08 04:20:51,220 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-05-08 04:20:51,223 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-05-08 04:20:51,224 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.05 04:20:51" (1/1) ... [2024-05-08 04:20:51,224 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3514784a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.05 04:20:51, skipping insertion in model container [2024-05-08 04:20:51,224 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.05 04:20:51" (1/1) ... [2024-05-08 04:20:51,239 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-05-08 04:20:51,376 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-equiv.wvr.c[2591,2604] [2024-05-08 04:20:51,379 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-05-08 04:20:51,385 INFO L202 MainTranslator]: Completed pre-run [2024-05-08 04:20:51,415 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-equiv.wvr.c[2591,2604] [2024-05-08 04:20:51,416 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-05-08 04:20:51,421 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2024-05-08 04:20:51,421 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2024-05-08 04:20:51,426 INFO L206 MainTranslator]: Completed translation [2024-05-08 04:20:51,426 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.05 04:20:51 WrapperNode [2024-05-08 04:20:51,427 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-05-08 04:20:51,427 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-05-08 04:20:51,427 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-05-08 04:20:51,427 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-05-08 04:20:51,438 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.05 04:20:51" (1/1) ... [2024-05-08 04:20:51,449 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.05 04:20:51" (1/1) ... [2024-05-08 04:20:51,463 INFO L138 Inliner]: procedures = 22, calls = 39, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 69 [2024-05-08 04:20:51,463 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-05-08 04:20:51,463 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-05-08 04:20:51,464 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-05-08 04:20:51,464 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-05-08 04:20:51,470 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.05 04:20:51" (1/1) ... [2024-05-08 04:20:51,470 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.05 04:20:51" (1/1) ... [2024-05-08 04:20:51,473 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.05 04:20:51" (1/1) ... [2024-05-08 04:20:51,473 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.05 04:20:51" (1/1) ... [2024-05-08 04:20:51,502 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.05 04:20:51" (1/1) ... [2024-05-08 04:20:51,509 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.05 04:20:51" (1/1) ... [2024-05-08 04:20:51,510 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.05 04:20:51" (1/1) ... [2024-05-08 04:20:51,511 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.05 04:20:51" (1/1) ... [2024-05-08 04:20:51,515 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-05-08 04:20:51,515 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-05-08 04:20:51,515 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-05-08 04:20:51,516 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-05-08 04:20:51,516 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.05 04:20:51" (1/1) ... [2024-05-08 04:20:51,520 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-05-08 04:20:51,529 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-08 04:20:51,545 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-05-08 04:20:51,551 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-05-08 04:20:51,582 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-05-08 04:20:51,583 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-05-08 04:20:51,583 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-05-08 04:20:51,583 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-05-08 04:20:51,583 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-05-08 04:20:51,583 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2024-05-08 04:20:51,584 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2024-05-08 04:20:51,584 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-05-08 04:20:51,584 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-05-08 04:20:51,584 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-05-08 04:20:51,584 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-05-08 04:20:51,585 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-05-08 04:20:51,586 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-05-08 04:20:51,586 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-05-08 04:20:51,586 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-05-08 04:20:51,586 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-05-08 04:20:51,587 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-05-08 04:20:51,652 INFO L241 CfgBuilder]: Building ICFG [2024-05-08 04:20:51,654 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2024-05-08 04:20:51,834 INFO L282 CfgBuilder]: Performing block encoding [2024-05-08 04:20:51,909 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-05-08 04:20:51,909 INFO L309 CfgBuilder]: Removed 3 assume(true) statements. [2024-05-08 04:20:51,911 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.05 04:20:51 BoogieIcfgContainer [2024-05-08 04:20:51,911 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-05-08 04:20:51,913 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-05-08 04:20:51,913 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-05-08 04:20:51,915 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-05-08 04:20:51,915 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.05 04:20:51" (1/3) ... [2024-05-08 04:20:51,916 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52408607 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.05 04:20:51, skipping insertion in model container [2024-05-08 04:20:51,916 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.05 04:20:51" (2/3) ... [2024-05-08 04:20:51,921 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52408607 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.05 04:20:51, skipping insertion in model container [2024-05-08 04:20:51,921 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.05 04:20:51" (3/3) ... [2024-05-08 04:20:51,923 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-mult-equiv.wvr.c [2024-05-08 04:20:51,930 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2024-05-08 04:20:51,937 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-05-08 04:20:51,938 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-05-08 04:20:51,938 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-05-08 04:20:51,994 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2024-05-08 04:20:52,027 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-08 04:20:52,027 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-05-08 04:20:52,027 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-08 04:20:52,029 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-05-08 04:20:52,031 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2024-05-08 04:20:52,067 INFO L188 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-05-08 04:20:52,076 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-08 04:20:52,078 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-05-08 04:20:52,083 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;@5f1a875c, 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, mConComCheckerConditionCriterion=false [2024-05-08 04:20:52,083 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2024-05-08 04:20:52,593 INFO L85 PathProgramCache]: Analyzing trace with hash -319144301, now seen corresponding path program 1 times [2024-05-08 04:20:52,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-08 04:20:52,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-08 04:20:52,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-08 04:20:52,880 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-08 04:20:52,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-08 04:20:54,227 INFO L85 PathProgramCache]: Analyzing trace with hash 1790820321, now seen corresponding path program 2 times [2024-05-08 04:20:54,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-08 04:20:54,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-08 04:20:54,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-08 04:20:54,275 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-08 04:20:54,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-08 04:20:54,475 INFO L85 PathProgramCache]: Analyzing trace with hash 444321100, now seen corresponding path program 3 times [2024-05-08 04:20:54,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-08 04:20:54,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-08 04:20:54,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-08 04:20:54,527 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-08 04:20:54,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-08 04:20:54,804 INFO L85 PathProgramCache]: Analyzing trace with hash 845616928, now seen corresponding path program 4 times [2024-05-08 04:20:54,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-08 04:20:54,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-08 04:20:54,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-08 04:20:54,856 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-08 04:20:54,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-08 04:20:55,072 INFO L85 PathProgramCache]: Analyzing trace with hash 1540910357, now seen corresponding path program 1 times [2024-05-08 04:20:55,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-08 04:20:55,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-08 04:20:55,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-08 04:20:56,127 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-08 04:20:56,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-08 04:20:56,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-08 04:20:56,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-08 04:20:56,793 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-08 04:20:57,001 INFO L85 PathProgramCache]: Analyzing trace with hash 603896095, now seen corresponding path program 2 times [2024-05-08 04:20:57,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-08 04:20:57,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-08 04:20:57,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-08 04:20:57,194 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-05-08 04:20:57,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-08 04:20:57,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-08 04:20:57,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-08 04:20:57,329 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-05-08 04:20:57,340 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 1 more)] === [2024-05-08 04:20:57,341 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-08 04:20:57,341 INFO L85 PathProgramCache]: Analyzing trace with hash -1121987728, now seen corresponding path program 1 times [2024-05-08 04:20:57,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-08 04:20:57,345 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [130246468] [2024-05-08 04:20:57,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-08 04:20:57,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-08 04:20:57,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-08 04:20:57,382 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-05-08 04:20:57,383 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-08 04:20:57,383 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [130246468] [2024-05-08 04:20:57,384 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [130246468] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-08 04:20:57,384 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-08 04:20:57,384 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-05-08 04:20:57,386 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1858339207] [2024-05-08 04:20:57,386 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-08 04:20:57,393 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-05-08 04:20:57,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-08 04:20:57,439 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-05-08 04:20:57,440 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-05-08 04:20:57,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-08 04:20:57,443 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-08 04:20:57,443 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 37.5) internal successors, (75), 2 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-08 04:20:57,443 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-08 04:20:57,633 INFO L85 PathProgramCache]: Analyzing trace with hash -319144301, now seen corresponding path program 5 times [2024-05-08 04:20:57,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-08 04:20:57,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-08 04:20:57,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-08 04:20:57,667 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-08 04:20:57,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-08 04:20:57,899 INFO L85 PathProgramCache]: Analyzing trace with hash 1790820321, now seen corresponding path program 6 times [2024-05-08 04:20:57,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-08 04:20:57,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-08 04:20:57,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-08 04:20:57,913 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-08 04:20:57,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-08 04:20:58,029 INFO L85 PathProgramCache]: Analyzing trace with hash 444321100, now seen corresponding path program 7 times [2024-05-08 04:20:58,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-08 04:20:58,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-08 04:20:58,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-08 04:20:58,043 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-08 04:20:58,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-08 04:20:58,216 INFO L85 PathProgramCache]: Analyzing trace with hash 845616928, now seen corresponding path program 8 times [2024-05-08 04:20:58,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-08 04:20:58,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-08 04:20:58,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-08 04:20:58,228 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-08 04:20:58,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-08 04:20:58,373 INFO L85 PathProgramCache]: Analyzing trace with hash 1540910357, now seen corresponding path program 3 times [2024-05-08 04:20:58,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-08 04:20:58,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-08 04:20:58,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-08 04:20:59,132 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-08 04:20:59,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-08 04:20:59,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-08 04:20:59,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-08 04:20:59,699 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-08 04:20:59,889 INFO L85 PathProgramCache]: Analyzing trace with hash 603896095, now seen corresponding path program 4 times [2024-05-08 04:20:59,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-08 04:20:59,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-08 04:20:59,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-08 04:21:00,007 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-05-08 04:21:00,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-08 04:21:00,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-08 04:21:00,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-08 04:21:00,136 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-05-08 04:21:00,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-08 04:21:00,139 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,SelfDestructingSolverStorable10,SelfDestructingSolverStorable11,SelfDestructingSolverStorable12,SelfDestructingSolverStorable9,SelfDestructingSolverStorable13,SelfDestructingSolverStorable14,SelfDestructingSolverStorable15,SelfDestructingSolverStorable16 [2024-05-08 04:21:00,140 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 1 more)] === [2024-05-08 04:21:00,140 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-08 04:21:00,140 INFO L85 PathProgramCache]: Analyzing trace with hash -1005987980, now seen corresponding path program 1 times [2024-05-08 04:21:00,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-08 04:21:00,140 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1759505158] [2024-05-08 04:21:00,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-08 04:21:00,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-08 04:21:00,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-08 04:21:00,387 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-08 04:21:00,388 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-08 04:21:00,388 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1759505158] [2024-05-08 04:21:00,388 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1759505158] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-08 04:21:00,388 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1694079044] [2024-05-08 04:21:00,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-08 04:21:00,388 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-08 04:21:00,389 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-08 04:21:00,391 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-05-08 04:21:00,429 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-05-08 04:21:00,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-08 04:21:00,482 INFO L262 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 13 conjunts are in the unsatisfiable core [2024-05-08 04:21:00,484 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-08 04:21:00,800 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-05-08 04:21:00,800 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-05-08 04:21:00,800 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1694079044] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-08 04:21:00,800 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-05-08 04:21:00,801 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [7] total 12 [2024-05-08 04:21:00,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [120711011] [2024-05-08 04:21:00,801 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-08 04:21:00,802 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-05-08 04:21:00,802 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-08 04:21:00,813 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-05-08 04:21:00,813 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-05-08 04:21:00,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-08 04:21:00,814 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-08 04:21:00,814 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.625) internal successors, (77), 8 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-08 04:21:00,814 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-08 04:21:00,814 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-08 04:21:01,096 INFO L85 PathProgramCache]: Analyzing trace with hash 530136904, now seen corresponding path program 1 times [2024-05-08 04:21:01,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-08 04:21:01,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-08 04:21:01,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-08 04:21:01,134 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-08 04:21:01,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-08 04:21:01,317 INFO L85 PathProgramCache]: Analyzing trace with hash 848385164, now seen corresponding path program 2 times [2024-05-08 04:21:01,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-08 04:21:01,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-08 04:21:01,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-08 04:21:01,341 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-08 04:21:01,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-08 04:21:01,498 INFO L85 PathProgramCache]: Analyzing trace with hash -1527607113, now seen corresponding path program 3 times [2024-05-08 04:21:01,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-08 04:21:01,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-08 04:21:01,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-08 04:21:01,521 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-08 04:21:01,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-08 04:21:01,705 INFO L85 PathProgramCache]: Analyzing trace with hash 1336195669, now seen corresponding path program 4 times [2024-05-08 04:21:01,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-08 04:21:01,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-08 04:21:01,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-08 04:21:01,722 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-08 04:21:01,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-08 04:21:01,848 INFO L85 PathProgramCache]: Analyzing trace with hash 1656362122, now seen corresponding path program 1 times [2024-05-08 04:21:01,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-08 04:21:01,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-08 04:21:01,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-08 04:21:02,117 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 2 proven. 16 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-05-08 04:21:02,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-08 04:21:02,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-08 04:21:02,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-08 04:21:03,066 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-08 04:21:03,263 INFO L85 PathProgramCache]: Analyzing trace with hash 1161809674, now seen corresponding path program 2 times [2024-05-08 04:21:03,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-08 04:21:03,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-08 04:21:03,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-08 04:21:03,793 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-08 04:21:03,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-08 04:21:03,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-08 04:21:03,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-08 04:21:04,320 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-08 04:21:04,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-08 04:21:04,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-08 04:21:04,345 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-05-08 04:21:04,530 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,3 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable19,SelfDestructingSolverStorable20,SelfDestructingSolverStorable21,SelfDestructingSolverStorable22,SelfDestructingSolverStorable23,SelfDestructingSolverStorable24,SelfDestructingSolverStorable25,SelfDestructingSolverStorable17 [2024-05-08 04:21:04,530 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 1 more)] === [2024-05-08 04:21:04,531 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-08 04:21:04,531 INFO L85 PathProgramCache]: Analyzing trace with hash 1498311593, now seen corresponding path program 1 times [2024-05-08 04:21:04,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-08 04:21:04,531 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [527711682] [2024-05-08 04:21:04,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-08 04:21:04,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-08 04:21:04,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-08 04:21:05,155 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-08 04:21:05,155 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-08 04:21:05,155 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [527711682] [2024-05-08 04:21:05,155 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [527711682] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-08 04:21:05,155 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2060671353] [2024-05-08 04:21:05,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-08 04:21:05,155 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-08 04:21:05,156 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-08 04:21:05,170 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-05-08 04:21:05,195 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-05-08 04:21:05,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-08 04:21:05,246 INFO L262 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 18 conjunts are in the unsatisfiable core [2024-05-08 04:21:05,248 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-08 04:21:06,287 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 10 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-05-08 04:21:06,287 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-08 04:21:07,728 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-08 04:21:07,728 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2060671353] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-08 04:21:07,728 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-08 04:21:07,728 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12, 12] total 33 [2024-05-08 04:21:07,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [956333296] [2024-05-08 04:21:07,729 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-08 04:21:07,729 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2024-05-08 04:21:07,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-08 04:21:07,741 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2024-05-08 04:21:07,742 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=162, Invalid=894, Unknown=0, NotChecked=0, Total=1056 [2024-05-08 04:21:07,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-08 04:21:07,742 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-08 04:21:07,742 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 4.484848484848484) internal successors, (148), 33 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-08 04:21:07,742 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-08 04:21:07,742 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-05-08 04:21:07,742 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-08 04:21:12,439 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-08 04:21:22,606 INFO L85 PathProgramCache]: Analyzing trace with hash -1107375314, now seen corresponding path program 3 times [2024-05-08 04:21:22,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-08 04:21:22,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-08 04:21:22,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-08 04:21:23,885 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 2 proven. 142 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2024-05-08 04:21:23,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-08 04:21:23,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-08 04:21:23,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-08 04:21:28,364 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 33 proven. 134 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-05-08 04:21:28,476 INFO L85 PathProgramCache]: Analyzing trace with hash -1096394527, now seen corresponding path program 4 times [2024-05-08 04:21:28,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-08 04:21:28,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-08 04:21:28,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-08 04:21:29,932 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 2 proven. 142 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2024-05-08 04:21:29,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-08 04:21:29,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-08 04:21:29,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-08 04:21:36,653 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 12 proven. 157 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-05-08 04:21:36,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-08 04:21:36,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-08 04:21:36,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2024-05-08 04:21:36,808 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-05-08 04:21:37,002 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,SelfDestructingSolverStorable30,4 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26,SelfDestructingSolverStorable27,SelfDestructingSolverStorable28 [2024-05-08 04:21:37,003 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-05-08 04:21:37,003 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-08 04:21:37,003 INFO L85 PathProgramCache]: Analyzing trace with hash -541022233, now seen corresponding path program 2 times [2024-05-08 04:21:37,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-08 04:21:37,004 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1673863375] [2024-05-08 04:21:37,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-08 04:21:37,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-08 04:21:37,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-08 04:21:43,065 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 126 proven. 97 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-05-08 04:21:43,065 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-08 04:21:43,066 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1673863375] [2024-05-08 04:21:43,066 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1673863375] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-08 04:21:43,066 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1890872799] [2024-05-08 04:21:43,066 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-05-08 04:21:43,066 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-08 04:21:43,067 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-08 04:21:43,068 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-05-08 04:21:43,074 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-05-08 04:21:43,178 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-05-08 04:21:43,178 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-05-08 04:21:43,179 INFO L262 TraceCheckSpWp]: Trace formula consists of 275 conjuncts, 13 conjunts are in the unsatisfiable core [2024-05-08 04:21:43,181 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-08 04:21:43,570 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 81 proven. 49 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2024-05-08 04:21:43,571 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-08 04:21:43,765 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 86 proven. 1 refuted. 0 times theorem prover too weak. 166 trivial. 0 not checked. [2024-05-08 04:21:43,765 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1890872799] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-08 04:21:43,766 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-08 04:21:43,766 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 9, 6] total 39 [2024-05-08 04:21:43,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [300568492] [2024-05-08 04:21:43,766 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-08 04:21:43,766 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2024-05-08 04:21:43,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-08 04:21:43,801 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2024-05-08 04:21:43,801 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=1345, Unknown=0, NotChecked=0, Total=1482 [2024-05-08 04:21:43,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-08 04:21:43,802 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-08 04:21:43,802 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 39 states have (on average 5.0) internal successors, (195), 39 states have internal predecessors, (195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-08 04:21:43,802 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-08 04:21:43,802 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-05-08 04:21:43,802 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 84 states. [2024-05-08 04:21:43,802 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-08 04:21:57,494 INFO L85 PathProgramCache]: Analyzing trace with hash 1232056083, now seen corresponding path program 5 times [2024-05-08 04:21:57,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-08 04:21:57,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-08 04:21:57,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-08 04:21:57,593 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-08 04:21:57,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-08 04:22:00,498 INFO L85 PathProgramCache]: Analyzing trace with hash -607479022, now seen corresponding path program 6 times [2024-05-08 04:22:00,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-08 04:22:00,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-08 04:22:00,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-08 04:22:00,556 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-08 04:22:00,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-08 04:22:00,912 INFO L85 PathProgramCache]: Analyzing trace with hash 1104649684, now seen corresponding path program 7 times [2024-05-08 04:22:00,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-08 04:22:00,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-08 04:22:01,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-08 04:22:01,025 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-08 04:22:01,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-08 04:22:02,404 INFO L85 PathProgramCache]: Analyzing trace with hash 1584897451, now seen corresponding path program 8 times [2024-05-08 04:22:02,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-08 04:22:02,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-08 04:22:02,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-08 04:22:02,475 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-08 04:22:03,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-08 04:22:04,131 INFO L85 PathProgramCache]: Analyzing trace with hash 245706948, now seen corresponding path program 9 times [2024-05-08 04:22:04,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-08 04:22:04,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-08 04:22:04,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-08 04:22:04,192 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-08 04:22:04,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-08 04:22:04,911 INFO L85 PathProgramCache]: Analyzing trace with hash -1606414308, now seen corresponding path program 10 times [2024-05-08 04:22:04,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-08 04:22:04,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-08 04:22:04,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-08 04:22:04,970 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-08 04:22:05,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-08 04:22:06,557 INFO L85 PathProgramCache]: Analyzing trace with hash -1622831005, now seen corresponding path program 11 times [2024-05-08 04:22:06,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-08 04:22:06,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-08 04:22:06,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-08 04:22:06,598 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-08 04:22:06,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-08 04:22:06,787 INFO L85 PathProgramCache]: Analyzing trace with hash -1606321982, now seen corresponding path program 12 times [2024-05-08 04:22:06,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-08 04:22:06,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-08 04:22:06,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-08 04:22:06,824 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-08 04:22:06,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-08 04:22:09,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-08 04:22:09,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-08 04:22:09,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2024-05-08 04:22:09,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 127 states. [2024-05-08 04:22:09,646 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-05-08 04:22:09,841 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,SelfDestructingSolverStorable32,SelfDestructingSolverStorable33,SelfDestructingSolverStorable34,SelfDestructingSolverStorable35,5 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable36,SelfDestructingSolverStorable37,SelfDestructingSolverStorable38,SelfDestructingSolverStorable39 [2024-05-08 04:22:09,841 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-05-08 04:22:09,842 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-08 04:22:09,842 INFO L85 PathProgramCache]: Analyzing trace with hash 308048458, now seen corresponding path program 3 times [2024-05-08 04:22:09,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-08 04:22:09,842 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1675653165] [2024-05-08 04:22:09,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-08 04:22:09,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-08 04:22:09,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-08 04:22:12,703 INFO L134 CoverageAnalysis]: Checked inductivity of 315 backedges. 188 proven. 83 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2024-05-08 04:22:12,703 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-08 04:22:12,703 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1675653165] [2024-05-08 04:22:12,703 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1675653165] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-08 04:22:12,703 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2091180226] [2024-05-08 04:22:12,703 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-05-08 04:22:12,703 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-08 04:22:12,703 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-08 04:22:12,705 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-05-08 04:22:12,707 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-05-08 04:22:13,024 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2024-05-08 04:22:13,024 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-05-08 04:22:13,026 INFO L262 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 66 conjunts are in the unsatisfiable core [2024-05-08 04:22:13,030 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-08 04:26:19,216 WARN L293 SmtUtils]: Spent 5.37s on a formula simplification that was a NOOP. DAG size: 72 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-05-08 04:26:19,275 INFO L134 CoverageAnalysis]: Checked inductivity of 315 backedges. 156 proven. 115 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2024-05-08 04:26:19,276 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-08 04:26:31,846 INFO L134 CoverageAnalysis]: Checked inductivity of 315 backedges. 10 proven. 305 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-08 04:26:31,846 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2091180226] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-08 04:26:31,846 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-08 04:26:31,846 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 33, 50] total 117 [2024-05-08 04:26:31,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1644886422] [2024-05-08 04:26:31,847 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-08 04:26:31,847 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 117 states [2024-05-08 04:26:31,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-08 04:26:31,879 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 117 interpolants. [2024-05-08 04:26:31,881 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=2037, Invalid=11512, Unknown=23, NotChecked=0, Total=13572 [2024-05-08 04:26:31,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-08 04:26:31,882 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-08 04:26:31,882 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 117 states, 117 states have (on average 2.393162393162393) internal successors, (280), 117 states have internal predecessors, (280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-08 04:26:31,882 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-08 04:26:31,882 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-05-08 04:26:31,882 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 89 states. [2024-05-08 04:26:31,882 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 127 states. [2024-05-08 04:26:31,882 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-08 04:27:42,617 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.61s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-08 04:27:43,753 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.01s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-08 04:27:46,563 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-08 04:28:22,095 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-08 04:28:46,824 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.97s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-08 04:28:51,854 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.88s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-08 04:28:54,272 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-08 04:29:01,559 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-08 04:29:05,302 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.02s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-08 04:29:09,368 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-08 04:29:12,186 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.43s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-08 04:29:14,762 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-08 04:29:17,382 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-08 04:29:41,322 WARN L293 SmtUtils]: Spent 6.78s on a formula simplification. DAG size of input: 82 DAG size of output: 58 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-05-08 04:29:47,809 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-08 04:29:57,149 WARN L293 SmtUtils]: Spent 6.32s on a formula simplification. DAG size of input: 84 DAG size of output: 68 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-05-08 04:30:01,764 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.46s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-08 04:30:07,518 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-08 04:30:10,070 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-08 04:30:12,477 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.56s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-08 04:30:26,844 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.49s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-08 04:30:28,794 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.87s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-08 04:30:33,098 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-08 04:30:37,979 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-08 04:30:40,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-05-08 04:30:42,352 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.96s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-08 04:30:44,486 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-08 04:30:46,493 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-08 04:30:47,941 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.33s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-08 04:32:44,401 WARN L293 SmtUtils]: Spent 5.51s on a formula simplification. DAG size of input: 256 DAG size of output: 127 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-05-08 04:33:05,730 WARN L293 SmtUtils]: Spent 9.60s on a formula simplification. DAG size of input: 262 DAG size of output: 130 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) Received shutdown request... [2024-05-08 04:35:11,482 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2024-05-08 04:35:11,484 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2024-05-08 04:35:11,484 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2024-05-08 04:35:11,601 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-05-08 04:35:11,791 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable40 [2024-05-08 04:35:11,791 WARN L619 AbstractCegarLoop]: Verification canceled: while PredicateUnifier was unifying predicates,while SimplifyDDA2 was simplifying a ∧-19-3-2-1 term,while SimplifyDDA2 was simplifying 2 xjuncts wrt. a ATOM-1 context. [2024-05-08 04:35:11,794 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2024-05-08 04:35:11,794 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 4 remaining) [2024-05-08 04:35:11,794 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining) [2024-05-08 04:35:11,794 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining) [2024-05-08 04:35:11,799 INFO L448 BasicCegarLoop]: Path program histogram: [12, 8, 4, 4, 3, 1, 1] [2024-05-08 04:35:11,802 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-05-08 04:35:11,802 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2024-05-08 04:35:11,804 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.05 04:35:11 BasicIcfg [2024-05-08 04:35:11,804 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-05-08 04:35:11,804 INFO L158 Benchmark]: Toolchain (without parser) took 860585.29ms. Allocated memory was 190.8MB in the beginning and 1.2GB in the end (delta: 966.8MB). Free memory was 124.1MB in the beginning and 1.0GB in the end (delta: -904.2MB). Peak memory consumption was 63.7MB. Max. memory is 8.0GB. [2024-05-08 04:35:11,804 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 190.8MB. Free memory is still 160.3MB. There was no memory consumed. Max. memory is 8.0GB. [2024-05-08 04:35:11,805 INFO L158 Benchmark]: CACSL2BoogieTranslator took 207.07ms. Allocated memory is still 190.8MB. Free memory was 123.9MB in the beginning and 112.5MB in the end (delta: 11.4MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2024-05-08 04:35:11,805 INFO L158 Benchmark]: Boogie Procedure Inliner took 35.81ms. Allocated memory is still 190.8MB. Free memory was 112.3MB in the beginning and 110.8MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2024-05-08 04:35:11,805 INFO L158 Benchmark]: Boogie Preprocessor took 51.36ms. Allocated memory was 190.8MB in the beginning and 296.7MB in the end (delta: 105.9MB). Free memory was 110.8MB in the beginning and 269.2MB in the end (delta: -158.5MB). Peak memory consumption was 5.9MB. Max. memory is 8.0GB. [2024-05-08 04:35:11,805 INFO L158 Benchmark]: RCFGBuilder took 395.48ms. Allocated memory is still 296.7MB. Free memory was 269.2MB in the beginning and 251.4MB in the end (delta: 17.8MB). Peak memory consumption was 17.8MB. Max. memory is 8.0GB. [2024-05-08 04:35:11,805 INFO L158 Benchmark]: TraceAbstraction took 859891.13ms. Allocated memory was 296.7MB in the beginning and 1.2GB in the end (delta: 860.9MB). Free memory was 250.4MB in the beginning and 1.0GB in the end (delta: -777.9MB). Peak memory consumption was 83.0MB. Max. memory is 8.0GB. [2024-05-08 04:35:11,806 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 190.8MB. Free memory is still 160.3MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 207.07ms. Allocated memory is still 190.8MB. Free memory was 123.9MB in the beginning and 112.5MB in the end (delta: 11.4MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 35.81ms. Allocated memory is still 190.8MB. Free memory was 112.3MB in the beginning and 110.8MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 51.36ms. Allocated memory was 190.8MB in the beginning and 296.7MB in the end (delta: 105.9MB). Free memory was 110.8MB in the beginning and 269.2MB in the end (delta: -158.5MB). Peak memory consumption was 5.9MB. Max. memory is 8.0GB. * RCFGBuilder took 395.48ms. Allocated memory is still 296.7MB. Free memory was 269.2MB in the beginning and 251.4MB in the end (delta: 17.8MB). Peak memory consumption was 17.8MB. Max. memory is 8.0GB. * TraceAbstraction took 859891.13ms. Allocated memory was 296.7MB in the beginning and 1.2GB in the end (delta: 860.9MB). Free memory was 250.4MB in the beginning and 1.0GB in the end (delta: -777.9MB). Peak memory consumption was 83.0MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 12667, independent: 11623, independent conditional: 9370, independent unconditional: 2253, dependent: 1010, dependent conditional: 992, dependent unconditional: 18, unknown: 34, unknown conditional: 25, unknown unconditional: 9] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 11735, independent: 11623, independent conditional: 9370, independent unconditional: 2253, dependent: 78, dependent conditional: 60, dependent unconditional: 18, unknown: 34, unknown conditional: 25, unknown unconditional: 9] , UnionIndependenceRelation.Statistics on underlying relations: [ ConditionTransformingIndependenceRelation.Independence Queries: [ total: 11735, independent: 11623, independent conditional: 9370, independent unconditional: 2253, dependent: 78, dependent conditional: 60, dependent unconditional: 18, unknown: 34, unknown conditional: 25, unknown unconditional: 9] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 11735, independent: 11623, independent conditional: 9370, independent unconditional: 2253, dependent: 78, dependent conditional: 60, dependent unconditional: 18, unknown: 34, unknown conditional: 25, unknown unconditional: 9] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 11920, independent: 11623, independent conditional: 4006, independent unconditional: 7617, dependent: 224, dependent conditional: 100, dependent unconditional: 124, unknown: 73, unknown conditional: 33, unknown unconditional: 40] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 11920, independent: 11623, independent conditional: 3703, independent unconditional: 7920, dependent: 224, dependent conditional: 67, dependent unconditional: 157, unknown: 73, unknown conditional: 24, unknown unconditional: 49] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 11920, independent: 11623, independent conditional: 3703, independent unconditional: 7920, dependent: 224, dependent conditional: 67, dependent unconditional: 157, unknown: 73, unknown conditional: 24, unknown unconditional: 49] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 407, independent: 371, independent conditional: 0, independent unconditional: 371, dependent: 31, dependent conditional: 26, dependent unconditional: 5, unknown: 5, unknown conditional: 4, unknown unconditional: 1] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 407, independent: 371, independent conditional: 0, independent unconditional: 371, dependent: 36, dependent conditional: 0, dependent unconditional: 36, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 36, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 31, dependent conditional: 26, dependent unconditional: 5, unknown: 5, unknown conditional: 4, unknown unconditional: 1] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 36, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 31, dependent conditional: 26, dependent unconditional: 5, unknown: 5, unknown conditional: 4, unknown unconditional: 1] , SemanticIndependenceRelation.Query Time [ms]: [ total: 6251, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1204, dependent conditional: 1136, dependent unconditional: 68, unknown: 5047, unknown conditional: 4034, unknown unconditional: 1013] , Protected Queries: 0 ], Cache Queries: [ total: 11920, independent: 11252, independent conditional: 3703, independent unconditional: 7549, dependent: 193, dependent conditional: 41, dependent unconditional: 152, unknown: 475, unknown conditional: 50, unknown unconditional: 425] , Statistics on independence cache: Total cache size (in pairs): 402, Positive cache size: 371, Positive conditional cache size: 0, Positive unconditional cache size: 371, Negative cache size: 31, Negative conditional cache size: 26, Negative unconditional cache size: 5, Unknown cache size: 5, Unknown conditional cache size: 4, Unknown unconditional cache size: 1, Eliminated conditions: 345, Maximal queried relation: 3, ConditionTransformingIndependenceRelation.Independence Queries: [ total: 11920, independent: 11623, independent conditional: 4006, independent unconditional: 7617, dependent: 224, dependent conditional: 100, dependent unconditional: 124, unknown: 73, unknown conditional: 33, unknown unconditional: 40] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 11920, independent: 11623, independent conditional: 3703, independent unconditional: 7920, dependent: 224, dependent conditional: 67, dependent unconditional: 157, unknown: 73, unknown conditional: 24, unknown unconditional: 49] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 11920, independent: 11623, independent conditional: 3703, independent unconditional: 7920, dependent: 224, dependent conditional: 67, dependent unconditional: 157, unknown: 73, unknown conditional: 24, unknown unconditional: 49] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 407, independent: 371, independent conditional: 0, independent unconditional: 371, dependent: 31, dependent conditional: 26, dependent unconditional: 5, unknown: 5, unknown conditional: 4, unknown unconditional: 1] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 407, independent: 371, independent conditional: 0, independent unconditional: 371, dependent: 36, dependent conditional: 0, dependent unconditional: 36, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 36, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 31, dependent conditional: 26, dependent unconditional: 5, unknown: 5, unknown conditional: 4, unknown unconditional: 1] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 36, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 31, dependent conditional: 26, dependent unconditional: 5, unknown: 5, unknown conditional: 4, unknown unconditional: 1] , SemanticIndependenceRelation.Query Time [ms]: [ total: 6251, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1204, dependent conditional: 1136, dependent unconditional: 68, unknown: 5047, unknown conditional: 4034, unknown unconditional: 1013] , Protected Queries: 0 ], Cache Queries: [ total: 11920, independent: 11252, independent conditional: 3703, independent unconditional: 7549, dependent: 193, dependent conditional: 41, dependent unconditional: 152, unknown: 475, unknown conditional: 50, unknown unconditional: 425] , Statistics on independence cache: Total cache size (in pairs): 402, Positive cache size: 371, Positive conditional cache size: 0, Positive unconditional cache size: 371, Negative cache size: 31, Negative conditional cache size: 26, Negative unconditional cache size: 5, Unknown cache size: 5, Unknown conditional cache size: 4, Unknown unconditional cache size: 1, Eliminated conditions: 345 ], Independence queries for same thread: 932 - TimeoutResultAtElement [Line: 105]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable Cancelled while PredicateUnifier was unifying predicates,while SimplifyDDA2 was simplifying a ∧-19-3-2-1 term,while SimplifyDDA2 was simplifying 2 xjuncts wrt. a ATOM-1 context. - TimeoutResultAtElement [Line: 98]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while PredicateUnifier was unifying predicates,while SimplifyDDA2 was simplifying a ∧-19-3-2-1 term,while SimplifyDDA2 was simplifying 2 xjuncts wrt. a ATOM-1 context. - TimeoutResultAtElement [Line: 99]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while PredicateUnifier was unifying predicates,while SimplifyDDA2 was simplifying a ∧-19-3-2-1 term,while SimplifyDDA2 was simplifying 2 xjuncts wrt. a ATOM-1 context. - TimeoutResultAtElement [Line: 97]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while PredicateUnifier was unifying predicates,while SimplifyDDA2 was simplifying a ∧-19-3-2-1 term,while SimplifyDDA2 was simplifying 2 xjuncts wrt. a ATOM-1 context. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 111 locations, 4 error locations. Started 1 CEGAR loops. OverallTime: 859.7s, OverallIterations: 5, TraceHistogramMax: 0, PathProgramHistogramMax: 12, EmptinessCheckTime: 586.1s, 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: 358, 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.5s SatisfiabilityAnalysisTime, 271.8s InterpolantComputationTime, 938 NumberOfCodeBlocks, 938 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 1279 ConstructedInterpolants, 0 QuantifiedInterpolants, 15231 SizeOfPredicates, 33 NumberOfNonLiveVariables, 966 ConjunctsInSsa, 110 ConjunctsInUnsatCore, 12 InterpolantComputations, 2 PerfectInterpolantSequences, 1088/1776 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConditionalCommutativityCheckTime: 30.3s, ConditionalCommutativityIAIntegrations: 0, ConditionalCommutativityDFSRestarts: 0, ConditionalCommutativityConditionCalculations: 28, ConditionalCommutativityTraceChecks: 28, ConditionalCommutativityImperfectProofs: 8 RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown