/root/.sdkman/candidates/java/current/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../benchexec/../../../trunk/examples/settings/gemcutter/NewStatesSleep.epf --traceabstraction.dfs.order.used.in.por LOOP_LOCKSTEP --traceabstraction.additional.conditional.commutativity.checking IA --traceabstraction.criterion.for.conditional.commutativity.checking LOOP -tc ../benchexec/../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/test-hard1.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-wip.dk.conditional-comm-17da818-m [2024-05-05 11:33:31,406 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-05-05 11:33:31,460 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../benchexec/../../../trunk/examples/settings/gemcutter/NewStatesSleep.epf [2024-05-05 11:33:31,464 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-05-05 11:33:31,464 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-05-05 11:33:31,484 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-05-05 11:33:31,484 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-05-05 11:33:31,485 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-05-05 11:33:31,485 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-05-05 11:33:31,489 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-05-05 11:33:31,490 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-05-05 11:33:31,490 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-05-05 11:33:31,490 INFO L153 SettingsManager]: * Use SBE=true [2024-05-05 11:33:31,492 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-05-05 11:33:31,492 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-05-05 11:33:31,492 INFO L153 SettingsManager]: * sizeof long=4 [2024-05-05 11:33:31,492 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-05-05 11:33:31,493 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-05-05 11:33:31,493 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-05-05 11:33:31,493 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-05-05 11:33:31,493 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-05-05 11:33:31,494 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-05-05 11:33:31,494 INFO L153 SettingsManager]: * sizeof long double=12 [2024-05-05 11:33:31,494 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-05-05 11:33:31,494 INFO L153 SettingsManager]: * Use constant arrays=true [2024-05-05 11:33:31,495 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-05-05 11:33:31,495 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-05-05 11:33:31,495 INFO L153 SettingsManager]: * To the following directory=./dump/ [2024-05-05 11:33:31,495 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-05-05 11:33:31,496 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-05-05 11:33:31,497 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-05-05 11:33:31,497 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-05-05 11:33:31,497 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-05-05 11:33:31,497 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-05-05 11:33:31,497 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=SLEEP_NEW_STATES [2024-05-05 11:33:31,498 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-05-05 11:33:31,498 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-05-05 11:33:31,498 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2024-05-05 11:33:31,498 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-05-05 11:33:31,498 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: DFS Order used in POR -> LOOP_LOCKSTEP Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Additional conditional commutativity checking -> IA Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Criterion for conditional commutativity checking -> LOOP [2024-05-05 11:33:31,779 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-05-05 11:33:31,806 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-05-05 11:33:31,808 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-05-05 11:33:31,809 INFO L270 PluginConnector]: Initializing CDTParser... [2024-05-05 11:33:31,810 INFO L274 PluginConnector]: CDTParser initialized [2024-05-05 11:33:31,811 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/svcomp/weaver/test-hard1.wvr.c [2024-05-05 11:33:33,080 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-05-05 11:33:33,264 INFO L384 CDTParser]: Found 1 translation units. [2024-05-05 11:33:33,264 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/test-hard1.wvr.c [2024-05-05 11:33:33,272 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/6af0448bd/5d1844c7682f41d79ff3a81f44803aee/FLAG4de4dc2d5 [2024-05-05 11:33:33,288 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/6af0448bd/5d1844c7682f41d79ff3a81f44803aee [2024-05-05 11:33:33,291 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-05-05 11:33:33,293 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-05-05 11:33:33,295 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-05-05 11:33:33,295 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-05-05 11:33:33,300 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-05-05 11:33:33,300 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.05 11:33:33" (1/1) ... [2024-05-05 11:33:33,301 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@66d84eb0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.05 11:33:33, skipping insertion in model container [2024-05-05 11:33:33,301 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.05 11:33:33" (1/1) ... [2024-05-05 11:33:33,330 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-05-05 11:33:33,495 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/test-hard1.wvr.c[3373,3386] [2024-05-05 11:33:33,499 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-05-05 11:33:33,507 INFO L202 MainTranslator]: Completed pre-run [2024-05-05 11:33:33,527 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/test-hard1.wvr.c[3373,3386] [2024-05-05 11:33:33,528 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-05-05 11:33:33,535 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2024-05-05 11:33:33,535 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2024-05-05 11:33:33,540 INFO L206 MainTranslator]: Completed translation [2024-05-05 11:33:33,541 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.05 11:33:33 WrapperNode [2024-05-05 11:33:33,541 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-05-05 11:33:33,542 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-05-05 11:33:33,542 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-05-05 11:33:33,542 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-05-05 11:33:33,548 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.05 11:33:33" (1/1) ... [2024-05-05 11:33:33,555 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.05 11:33:33" (1/1) ... [2024-05-05 11:33:33,572 INFO L138 Inliner]: procedures = 24, calls = 56, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 97 [2024-05-05 11:33:33,573 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-05-05 11:33:33,573 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-05-05 11:33:33,573 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-05-05 11:33:33,574 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-05-05 11:33:33,581 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.05 11:33:33" (1/1) ... [2024-05-05 11:33:33,581 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.05 11:33:33" (1/1) ... [2024-05-05 11:33:33,584 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.05 11:33:33" (1/1) ... [2024-05-05 11:33:33,584 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.05 11:33:33" (1/1) ... [2024-05-05 11:33:33,591 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.05 11:33:33" (1/1) ... [2024-05-05 11:33:33,595 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.05 11:33:33" (1/1) ... [2024-05-05 11:33:33,597 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.05 11:33:33" (1/1) ... [2024-05-05 11:33:33,598 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.05 11:33:33" (1/1) ... [2024-05-05 11:33:33,603 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-05-05 11:33:33,603 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-05-05 11:33:33,604 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-05-05 11:33:33,604 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-05-05 11:33:33,604 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.05 11:33:33" (1/1) ... [2024-05-05 11:33:33,609 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-05-05 11:33:33,619 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-05 11:33:33,631 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-05-05 11:33:33,636 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-05-05 11:33:33,667 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-05-05 11:33:33,668 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-05-05 11:33:33,668 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-05-05 11:33:33,668 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-05-05 11:33:33,668 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-05-05 11:33:33,668 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2024-05-05 11:33:33,668 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2024-05-05 11:33:33,668 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2024-05-05 11:33:33,668 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2024-05-05 11:33:33,669 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-05-05 11:33:33,669 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-05-05 11:33:33,671 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-05-05 11:33:33,671 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-05-05 11:33:33,676 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-05-05 11:33:33,676 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-05-05 11:33:33,676 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-05-05 11:33:33,677 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-05-05 11:33:33,677 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-05-05 11:33:33,678 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-05-05 11:33:33,762 INFO L241 CfgBuilder]: Building ICFG [2024-05-05 11:33:33,764 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2024-05-05 11:33:33,997 INFO L282 CfgBuilder]: Performing block encoding [2024-05-05 11:33:34,059 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-05-05 11:33:34,060 INFO L309 CfgBuilder]: Removed 4 assume(true) statements. [2024-05-05 11:33:34,061 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.05 11:33:34 BoogieIcfgContainer [2024-05-05 11:33:34,061 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-05-05 11:33:34,066 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-05-05 11:33:34,066 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-05-05 11:33:34,068 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-05-05 11:33:34,069 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.05 11:33:33" (1/3) ... [2024-05-05 11:33:34,069 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d0e7cf4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.05 11:33:34, skipping insertion in model container [2024-05-05 11:33:34,069 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.05 11:33:33" (2/3) ... [2024-05-05 11:33:34,070 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d0e7cf4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.05 11:33:34, skipping insertion in model container [2024-05-05 11:33:34,070 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.05 11:33:34" (3/3) ... [2024-05-05 11:33:34,071 INFO L112 eAbstractionObserver]: Analyzing ICFG test-hard1.wvr.c [2024-05-05 11:33:34,077 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2024-05-05 11:33:34,083 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-05-05 11:33:34,083 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-05-05 11:33:34,084 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-05-05 11:33:34,150 INFO L144 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2024-05-05 11:33:34,187 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-05 11:33:34,188 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-05-05 11:33:34,188 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-05 11:33:34,191 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-05-05 11:33:34,198 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2024-05-05 11:33:34,227 INFO L188 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-05-05 11:33:34,239 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-05 11:33:34,240 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-05-05 11:33:34,246 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;@5029d21d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms], mConComChecker=IA, mConComCheckerCriterion=LOOP, mConComCheckerLimitedChecksCriterion=false, mConComCheckerCriterionLimit=1, mConComCheckerRandomProb=100, mConComCheckerRandomSeed=123, mConComCheckerConditionCriterion=false [2024-05-05 11:33:34,246 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2024-05-05 11:33:35,399 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-05-05 11:33:35,402 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-05 11:33:35,403 INFO L85 PathProgramCache]: Analyzing trace with hash -1768307362, now seen corresponding path program 1 times [2024-05-05 11:33:35,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-05 11:33:35,413 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1086898076] [2024-05-05 11:33:35,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-05 11:33:35,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-05 11:33:35,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-05 11:33:35,719 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 129 trivial. 0 not checked. [2024-05-05 11:33:35,720 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-05 11:33:35,720 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1086898076] [2024-05-05 11:33:35,721 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1086898076] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-05 11:33:35,721 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-05 11:33:35,721 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-05-05 11:33:35,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1958667898] [2024-05-05 11:33:35,723 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-05 11:33:35,728 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-05-05 11:33:35,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-05 11:33:35,943 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-05-05 11:33:35,944 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-05-05 11:33:35,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-05 11:33:35,946 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-05 11:33:35,947 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 56.5) internal successors, (113), 2 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-05 11:33:35,947 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-05 11:33:36,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-05 11:33:36,135 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-05-05 11:33:36,135 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-05-05 11:33:36,136 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-05 11:33:36,136 INFO L85 PathProgramCache]: Analyzing trace with hash 851921736, now seen corresponding path program 1 times [2024-05-05 11:33:36,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-05 11:33:36,137 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [661025991] [2024-05-05 11:33:36,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-05 11:33:36,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-05 11:33:36,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-05 11:33:37,092 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 88 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2024-05-05 11:33:37,092 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-05 11:33:37,092 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [661025991] [2024-05-05 11:33:37,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [661025991] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-05 11:33:37,093 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-05 11:33:37,093 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-05-05 11:33:37,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1148788342] [2024-05-05 11:33:37,094 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-05 11:33:37,096 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-05-05 11:33:37,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-05 11:33:37,377 INFO L85 PathProgramCache]: Analyzing trace with hash 1640247067, now seen corresponding path program 1 times [2024-05-05 11:33:37,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-05 11:33:37,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-05 11:33:37,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-05 11:33:37,480 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-05 11:33:37,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-05 11:33:37,707 INFO L85 PathProgramCache]: Analyzing trace with hash -2102655400, now seen corresponding path program 1 times [2024-05-05 11:33:37,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-05 11:33:37,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-05 11:33:37,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-05 11:33:38,810 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-05 11:33:38,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-05 11:33:38,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-05 11:33:38,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-05 11:33:40,069 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-05 11:33:40,376 INFO L85 PathProgramCache]: Analyzing trace with hash -1496459147, now seen corresponding path program 2 times [2024-05-05 11:33:40,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-05 11:33:40,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-05 11:33:40,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-05 11:33:40,478 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-05 11:33:40,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-05 11:33:40,571 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-05-05 11:33:40,572 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=902, Unknown=0, NotChecked=0, Total=992 [2024-05-05 11:33:40,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-05 11:33:40,573 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-05 11:33:40,573 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 21.333333333333332) internal successors, (128), 6 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-05 11:33:40,573 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-05 11:33:40,573 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-05 11:33:41,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-05 11:33:41,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-05 11:33:41,031 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,SelfDestructingSolverStorable3,SelfDestructingSolverStorable2,SelfDestructingSolverStorable1,SelfDestructingSolverStorable5 [2024-05-05 11:33:41,031 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-05-05 11:33:41,032 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-05 11:33:41,032 INFO L85 PathProgramCache]: Analyzing trace with hash -2029386885, now seen corresponding path program 2 times [2024-05-05 11:33:41,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-05 11:33:41,032 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [847913442] [2024-05-05 11:33:41,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-05 11:33:41,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-05 11:33:41,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-05 11:33:41,693 INFO L134 CoverageAnalysis]: Checked inductivity of 244 backedges. 147 proven. 4 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2024-05-05 11:33:41,694 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-05 11:33:41,694 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [847913442] [2024-05-05 11:33:41,694 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [847913442] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-05 11:33:41,695 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [798513356] [2024-05-05 11:33:41,695 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-05-05 11:33:41,696 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-05 11:33:41,696 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-05 11:33:41,758 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-05-05 11:33:41,761 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-05-05 11:33:41,900 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-05-05 11:33:41,900 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-05-05 11:33:41,903 INFO L262 TraceCheckSpWp]: Trace formula consists of 362 conjuncts, 6 conjunts are in the unsatisfiable core [2024-05-05 11:33:41,910 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-05 11:33:42,000 INFO L134 CoverageAnalysis]: Checked inductivity of 244 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 202 trivial. 0 not checked. [2024-05-05 11:33:42,001 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-05-05 11:33:42,004 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [798513356] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-05 11:33:42,004 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-05-05 11:33:42,004 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 9 [2024-05-05 11:33:42,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [608627019] [2024-05-05 11:33:42,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-05 11:33:42,006 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-05-05 11:33:42,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-05 11:33:42,202 INFO L85 PathProgramCache]: Analyzing trace with hash 1167143915, now seen corresponding path program 3 times [2024-05-05 11:33:42,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-05 11:33:42,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-05 11:33:42,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-05 11:33:42,230 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-05 11:33:42,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-05 11:33:42,423 INFO L85 PathProgramCache]: Analyzing trace with hash 731734296, now seen corresponding path program 4 times [2024-05-05 11:33:42,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-05 11:33:42,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-05 11:33:42,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-05 11:33:42,473 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-05 11:33:42,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-05 11:33:42,714 INFO L85 PathProgramCache]: Analyzing trace with hash 1846554685, now seen corresponding path program 5 times [2024-05-05 11:33:42,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-05 11:33:42,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-05 11:33:42,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-05 11:33:42,766 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-05 11:33:42,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-05 11:33:42,970 INFO L85 PathProgramCache]: Analyzing trace with hash 1065051632, now seen corresponding path program 6 times [2024-05-05 11:33:42,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-05 11:33:42,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-05 11:33:43,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-05 11:33:43,011 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-05 11:33:43,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-05 11:33:43,176 INFO L85 PathProgramCache]: Analyzing trace with hash 2086263268, now seen corresponding path program 1 times [2024-05-05 11:33:43,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-05 11:33:43,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-05 11:33:43,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-05 11:33:45,909 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 10 proven. 47 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-05-05 11:33:45,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-05 11:33:45,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-05 11:33:45,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-05 11:33:48,211 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 14 proven. 43 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-05-05 11:33:48,426 INFO L85 PathProgramCache]: Analyzing trace with hash 1450637462, now seen corresponding path program 1 times [2024-05-05 11:33:48,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-05 11:33:48,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-05 11:33:48,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-05 11:33:48,914 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 11 proven. 2 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2024-05-05 11:33:48,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-05 11:33:48,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-05 11:33:48,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-05 11:33:49,250 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 11 proven. 2 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2024-05-05 11:33:49,341 INFO L85 PathProgramCache]: Analyzing trace with hash 2020088740, now seen corresponding path program 2 times [2024-05-05 11:33:49,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-05 11:33:49,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-05 11:33:49,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-05 11:33:49,713 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 11 proven. 2 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2024-05-05 11:33:49,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-05 11:33:49,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-05 11:33:49,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-05 11:33:50,077 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 11 proven. 2 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2024-05-05 11:33:50,079 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-05-05 11:33:50,081 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=470, Invalid=2952, Unknown=0, NotChecked=0, Total=3422 [2024-05-05 11:33:50,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-05 11:33:50,081 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-05 11:33:50,081 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 23.2) internal successors, (116), 5 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-05 11:33:50,081 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-05 11:33:50,081 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-05-05 11:33:50,081 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-05 11:33:50,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-05 11:33:50,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-05 11:33:50,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-05 11:33:50,541 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-05 11:33:50,734 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8,SelfDestructingSolverStorable7,SelfDestructingSolverStorable6,SelfDestructingSolverStorable10,SelfDestructingSolverStorable11,SelfDestructingSolverStorable12,SelfDestructingSolverStorable9,SelfDestructingSolverStorable13,SelfDestructingSolverStorable14,SelfDestructingSolverStorable15,SelfDestructingSolverStorable16 [2024-05-05 11:33:50,734 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 2 more)] === [2024-05-05 11:33:50,735 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-05 11:33:50,735 INFO L85 PathProgramCache]: Analyzing trace with hash -10387549, now seen corresponding path program 3 times [2024-05-05 11:33:50,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-05 11:33:50,735 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [630043861] [2024-05-05 11:33:50,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-05 11:33:50,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-05 11:33:50,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-05 11:33:51,214 INFO L134 CoverageAnalysis]: Checked inductivity of 291 backedges. 180 proven. 4 refuted. 0 times theorem prover too weak. 107 trivial. 0 not checked. [2024-05-05 11:33:51,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-05 11:33:51,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [630043861] [2024-05-05 11:33:51,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [630043861] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-05 11:33:51,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1862794346] [2024-05-05 11:33:51,215 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-05-05 11:33:51,215 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-05 11:33:51,215 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-05 11:33:51,217 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-05-05 11:33:51,238 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-05-05 11:33:51,387 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2024-05-05 11:33:51,388 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-05-05 11:33:51,390 INFO L262 TraceCheckSpWp]: Trace formula consists of 320 conjuncts, 20 conjunts are in the unsatisfiable core [2024-05-05 11:33:51,393 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-05 11:33:51,695 INFO L134 CoverageAnalysis]: Checked inductivity of 291 backedges. 177 proven. 21 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2024-05-05 11:33:51,695 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-05 11:33:51,944 INFO L134 CoverageAnalysis]: Checked inductivity of 291 backedges. 172 proven. 24 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked. [2024-05-05 11:33:51,944 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1862794346] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-05 11:33:51,944 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-05 11:33:51,944 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 9, 10] total 20 [2024-05-05 11:33:51,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1321649033] [2024-05-05 11:33:51,945 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-05 11:33:51,945 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-05-05 11:33:51,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-05 11:33:52,105 INFO L85 PathProgramCache]: Analyzing trace with hash 1167143915, now seen corresponding path program 7 times [2024-05-05 11:33:52,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-05 11:33:52,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-05 11:33:52,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-05 11:33:52,130 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-05 11:33:52,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-05 11:33:52,291 INFO L85 PathProgramCache]: Analyzing trace with hash 731734296, now seen corresponding path program 8 times [2024-05-05 11:33:52,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-05 11:33:52,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-05 11:33:52,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-05 11:33:52,329 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-05 11:33:52,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-05 11:33:52,538 INFO L85 PathProgramCache]: Analyzing trace with hash 1846554685, now seen corresponding path program 9 times [2024-05-05 11:33:52,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-05 11:33:52,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-05 11:33:52,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-05 11:33:52,588 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-05 11:33:52,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-05 11:33:52,849 INFO L85 PathProgramCache]: Analyzing trace with hash 1065051632, now seen corresponding path program 10 times [2024-05-05 11:33:52,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-05 11:33:52,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-05 11:33:52,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-05 11:33:52,881 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-05 11:33:52,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-05 11:33:53,071 INFO L85 PathProgramCache]: Analyzing trace with hash 2086263268, now seen corresponding path program 2 times [2024-05-05 11:33:53,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-05 11:33:53,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-05 11:33:53,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-05 11:33:55,820 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 12 proven. 45 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-05-05 11:33:55,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-05 11:33:55,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-05 11:33:55,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-05 11:33:58,382 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 14 proven. 42 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-05-05 11:33:58,395 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-05-05 11:33:58,397 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=583, Invalid=4673, Unknown=0, NotChecked=0, Total=5256 [2024-05-05 11:33:58,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-05 11:33:58,403 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-05 11:33:58,403 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 9.8) internal successors, (196), 20 states have internal predecessors, (196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-05 11:33:58,403 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-05 11:33:58,403 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-05-05 11:33:58,403 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-05-05 11:33:58,403 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-05 11:34:19,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-05 11:34:19,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-05 11:34:19,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-05 11:34:19,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 176 states. [2024-05-05 11:34:19,697 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-05-05 11:34:19,897 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,SelfDestructingSolverStorable19,SelfDestructingSolverStorable20,SelfDestructingSolverStorable21,4 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22,SelfDestructingSolverStorable23,SelfDestructingSolverStorable17 [2024-05-05 11:34:19,898 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 2 more)] === [2024-05-05 11:34:19,898 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-05 11:34:19,898 INFO L85 PathProgramCache]: Analyzing trace with hash 705926640, now seen corresponding path program 4 times [2024-05-05 11:34:19,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-05 11:34:19,900 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [945016000] [2024-05-05 11:34:19,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-05 11:34:19,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-05 11:34:20,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-05 11:34:21,207 INFO L134 CoverageAnalysis]: Checked inductivity of 3132 backedges. 1073 proven. 4 refuted. 0 times theorem prover too weak. 2055 trivial. 0 not checked. [2024-05-05 11:34:21,207 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-05 11:34:21,207 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [945016000] [2024-05-05 11:34:21,208 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [945016000] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-05 11:34:21,208 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1554218062] [2024-05-05 11:34:21,208 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-05-05 11:34:21,208 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-05 11:34:21,208 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-05 11:34:21,209 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-05 11:34:21,212 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-05 11:34:21,502 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-05-05 11:34:21,502 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-05-05 11:34:21,506 INFO L262 TraceCheckSpWp]: Trace formula consists of 622 conjuncts, 13 conjunts are in the unsatisfiable core [2024-05-05 11:34:21,512 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-05 11:34:21,646 INFO L134 CoverageAnalysis]: Checked inductivity of 3132 backedges. 1113 proven. 15 refuted. 0 times theorem prover too weak. 2004 trivial. 0 not checked. [2024-05-05 11:34:21,646 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-05 11:34:21,861 INFO L134 CoverageAnalysis]: Checked inductivity of 3132 backedges. 1096 proven. 49 refuted. 0 times theorem prover too weak. 1987 trivial. 0 not checked. [2024-05-05 11:34:21,861 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1554218062] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-05 11:34:21,861 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-05 11:34:21,861 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 11] total 17 [2024-05-05 11:34:21,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1440512873] [2024-05-05 11:34:21,862 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-05 11:34:21,863 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-05-05 11:34:21,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-05 11:34:22,011 INFO L85 PathProgramCache]: Analyzing trace with hash 1167143915, now seen corresponding path program 11 times [2024-05-05 11:34:22,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-05 11:34:22,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-05 11:34:22,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-05 11:34:22,036 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-05 11:34:22,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-05 11:34:22,197 INFO L85 PathProgramCache]: Analyzing trace with hash -1370795462, now seen corresponding path program 12 times [2024-05-05 11:34:22,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-05 11:34:22,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-05 11:34:22,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-05 11:34:22,248 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-05 11:34:22,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-05 11:34:22,407 INFO L85 PathProgramCache]: Analyzing trace with hash 1587125571, now seen corresponding path program 13 times [2024-05-05 11:34:22,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-05 11:34:22,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-05 11:34:22,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-05 11:34:22,529 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-05 11:34:22,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-05 11:34:22,722 INFO L85 PathProgramCache]: Analyzing trace with hash -72468648, now seen corresponding path program 14 times [2024-05-05 11:34:22,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-05 11:34:22,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-05 11:34:22,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-05 11:34:26,979 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 10 proven. 177 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-05-05 11:34:26,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-05 11:34:26,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-05 11:34:27,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-05 11:34:30,171 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 13 proven. 172 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-05-05 11:34:30,275 INFO L85 PathProgramCache]: Analyzing trace with hash -2125986411, now seen corresponding path program 15 times [2024-05-05 11:34:30,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-05 11:34:30,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-05 11:34:30,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-05 11:34:30,368 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-05 11:34:30,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-05 11:34:30,567 INFO L85 PathProgramCache]: Analyzing trace with hash -1520113470, now seen corresponding path program 16 times [2024-05-05 11:34:30,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-05 11:34:30,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-05 11:34:30,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-05 11:34:30,673 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-05 11:34:30,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-05 11:34:31,012 INFO L85 PathProgramCache]: Analyzing trace with hash 126078382, now seen corresponding path program 17 times [2024-05-05 11:34:31,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-05 11:34:31,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-05 11:34:31,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-05 11:34:31,109 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-05 11:34:31,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-05 11:34:31,368 INFO L85 PathProgramCache]: Analyzing trace with hash -1308129317, now seen corresponding path program 18 times [2024-05-05 11:34:31,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-05 11:34:31,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-05 11:34:31,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-05 11:34:31,508 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-05 11:34:31,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-05 11:34:31,760 INFO L85 PathProgramCache]: Analyzing trace with hash -776782464, now seen corresponding path program 19 times [2024-05-05 11:34:31,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-05 11:34:31,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-05 11:34:31,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-05 11:34:31,914 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-05 11:34:31,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-05 11:34:32,144 INFO L85 PathProgramCache]: Analyzing trace with hash -352120238, now seen corresponding path program 20 times [2024-05-05 11:34:32,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-05 11:34:32,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-05 11:34:32,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-05 11:34:32,241 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-05 11:34:32,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-05 11:34:32,627 INFO L85 PathProgramCache]: Analyzing trace with hash -807802753, now seen corresponding path program 21 times [2024-05-05 11:34:32,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-05 11:34:32,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-05 11:34:32,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-05 11:34:32,844 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-05 11:34:33,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-05 11:34:33,146 INFO L85 PathProgramCache]: Analyzing trace with hash 1674919727, now seen corresponding path program 22 times [2024-05-05 11:34:33,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-05 11:34:33,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-05 11:34:33,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-05 11:34:33,305 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-05 11:34:33,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-05 11:34:33,616 INFO L85 PathProgramCache]: Analyzing trace with hash 1935555825, now seen corresponding path program 23 times [2024-05-05 11:34:33,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-05 11:34:33,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-05 11:34:33,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-05 11:34:33,859 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-05 11:34:33,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-05 11:34:34,193 INFO L85 PathProgramCache]: Analyzing trace with hash -2086950156, now seen corresponding path program 24 times [2024-05-05 11:34:34,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-05 11:34:34,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-05 11:34:34,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-05 11:34:34,406 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-05 11:34:34,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-05 11:34:34,782 INFO L85 PathProgramCache]: Analyzing trace with hash 1614870793, now seen corresponding path program 25 times [2024-05-05 11:34:34,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-05 11:34:34,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-05 11:34:35,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-05 11:34:35,033 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-05 11:34:35,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-05 11:34:35,359 INFO L85 PathProgramCache]: Analyzing trace with hash 687494884, now seen corresponding path program 26 times [2024-05-05 11:34:35,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-05 11:34:35,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-05 11:34:35,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-05 11:34:35,650 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-05 11:34:35,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-05 11:34:36,022 INFO L85 PathProgramCache]: Analyzing trace with hash 826314444, now seen corresponding path program 27 times [2024-05-05 11:34:36,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-05 11:34:36,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-05 11:34:36,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-05 11:34:36,390 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-05 11:34:36,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-05 11:34:36,842 INFO L85 PathProgramCache]: Analyzing trace with hash 1849517049, now seen corresponding path program 28 times [2024-05-05 11:34:36,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-05 11:34:36,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-05 11:34:37,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-05 11:34:37,152 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-05 11:34:37,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-05 11:34:37,498 INFO L85 PathProgramCache]: Analyzing trace with hash 248702990, now seen corresponding path program 29 times [2024-05-05 11:34:37,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-05 11:34:37,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-05 11:34:37,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-05 11:34:37,805 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-05 11:34:38,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-05 11:34:38,240 INFO L85 PathProgramCache]: Analyzing trace with hash 292572855, now seen corresponding path program 30 times [2024-05-05 11:34:38,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-05 11:34:38,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-05 11:34:38,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-05 11:34:38,732 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-05 11:34:38,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-05 11:34:39,131 INFO L85 PathProgramCache]: Analyzing trace with hash 1549671262, now seen corresponding path program 31 times [2024-05-05 11:34:39,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-05 11:34:39,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-05 11:34:39,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-05 11:34:39,499 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-05 11:34:39,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-05 11:34:39,845 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-05-05 11:34:39,847 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=356, Invalid=4474, Unknown=0, NotChecked=0, Total=4830 [2024-05-05 11:34:39,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-05 11:34:39,847 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-05 11:34:39,847 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 11.0) internal successors, (187), 17 states have internal predecessors, (187), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-05 11:34:39,847 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-05 11:34:39,847 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-05-05 11:34:39,848 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-05-05 11:34:39,848 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 176 states. [2024-05-05 11:34:39,848 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-05 11:34:42,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-05 11:34:42,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-05 11:34:42,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-05 11:34:42,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 182 states. [2024-05-05 11:34:42,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-05-05 11:34:42,581 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-05 11:34:42,779 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40,SelfDestructingSolverStorable30,SelfDestructingSolverStorable41,SelfDestructingSolverStorable31,SelfDestructingSolverStorable42,5 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable29,SelfDestructingSolverStorable32,SelfDestructingSolverStorable43,SelfDestructingSolverStorable33,SelfDestructingSolverStorable44,SelfDestructingSolverStorable34,SelfDestructingSolverStorable45,SelfDestructingSolverStorable24,SelfDestructingSolverStorable35,SelfDestructingSolverStorable46,SelfDestructingSolverStorable25,SelfDestructingSolverStorable36,SelfDestructingSolverStorable26,SelfDestructingSolverStorable37,SelfDestructingSolverStorable27,SelfDestructingSolverStorable38,SelfDestructingSolverStorable28,SelfDestructingSolverStorable39 [2024-05-05 11:34:42,779 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-05-05 11:34:42,780 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-05 11:34:42,780 INFO L85 PathProgramCache]: Analyzing trace with hash 1398185419, now seen corresponding path program 5 times [2024-05-05 11:34:42,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-05 11:34:42,780 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [410893217] [2024-05-05 11:34:42,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-05 11:34:42,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-05 11:34:43,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-05 11:35:03,004 INFO L134 CoverageAnalysis]: Checked inductivity of 2731 backedges. 796 proven. 1878 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2024-05-05 11:35:03,005 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-05 11:35:03,005 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [410893217] [2024-05-05 11:35:03,005 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [410893217] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-05 11:35:03,005 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [549523656] [2024-05-05 11:35:03,005 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-05-05 11:35:03,005 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-05 11:35:03,005 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-05 11:35:03,006 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-05 11:35:03,009 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-05 11:35:03,489 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 27 check-sat command(s) [2024-05-05 11:35:03,490 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-05-05 11:35:03,496 INFO L262 TraceCheckSpWp]: Trace formula consists of 602 conjuncts, 183 conjunts are in the unsatisfiable core [2024-05-05 11:35:03,506 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-05 11:40:19,018 INFO L134 CoverageAnalysis]: Checked inductivity of 2731 backedges. 418 proven. 2244 refuted. 27 times theorem prover too weak. 42 trivial. 0 not checked. [2024-05-05 11:40:19,018 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-05 11:40:35,273 INFO L134 CoverageAnalysis]: Checked inductivity of 2731 backedges. 256 proven. 2469 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-05-05 11:40:35,273 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [549523656] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-05 11:40:35,273 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-05 11:40:35,273 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [88, 109, 142] total 335 [2024-05-05 11:40:35,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [725207222] [2024-05-05 11:40:35,274 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-05 11:40:35,275 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 335 states [2024-05-05 11:40:35,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-05 11:40:35,898 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 335 interpolants. [2024-05-05 11:40:35,910 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24407, Invalid=87426, Unknown=57, NotChecked=0, Total=111890 [2024-05-05 11:40:35,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-05 11:40:35,910 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-05 11:40:35,911 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 335 states, 335 states have (on average 2.5791044776119403) internal successors, (864), 335 states have internal predecessors, (864), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-05 11:40:35,911 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-05 11:40:35,911 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-05-05 11:40:35,911 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-05-05 11:40:35,911 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 182 states. [2024-05-05 11:40:35,912 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2024-05-05 11:40:35,912 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-05 11:40:51,233 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-05 11:40:53,353 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.01s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-05 11:41:00,027 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-05 11:41:02,763 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-05 11:41:04,232 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.46s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-05 11:41:10,861 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-05 11:41:12,416 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.13s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-05 11:41:14,756 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-05 11:41:22,001 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-05 11:41:36,709 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-05 11:41:39,448 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-05 11:41:41,456 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-05 11:41:43,505 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-05 11:41:45,797 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-05 11:41:56,995 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-05 11:42:01,775 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-05 11:42:04,443 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-05 11:42:06,802 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-05 11:42:09,994 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-05 11:42:12,113 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-05 11:42:14,128 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-05 11:42:17,128 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-05 11:42:26,717 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-05 11:42:35,594 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-05 11:42:41,655 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-05 11:42:43,825 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-05 11:42:45,527 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.44s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-05 11:42:47,531 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-05 11:42:49,606 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.07s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-05 11:42:55,177 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-05 11:43:00,006 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-05 11:43:02,021 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-05 11:43:05,165 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-05 11:43:15,924 WARN L293 SmtUtils]: Spent 6.14s on a formula simplification. DAG size of input: 106 DAG size of output: 41 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-05-05 11:43:19,137 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-05 11:43:21,271 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-05 11:43:28,668 WARN L293 SmtUtils]: Spent 5.92s on a formula simplification. DAG size of input: 193 DAG size of output: 36 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-05-05 11:43:44,871 WARN L293 SmtUtils]: Spent 12.79s on a formula simplification. DAG size of input: 134 DAG size of output: 75 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-05-05 11:43:46,959 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-05 11:44:08,744 WARN L293 SmtUtils]: Spent 21.17s on a formula simplification. DAG size of input: 179 DAG size of output: 45 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-05-05 11:44:10,995 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-05 11:44:13,010 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-05 11:44:25,660 WARN L293 SmtUtils]: Spent 12.54s on a formula simplification. DAG size of input: 145 DAG size of output: 64 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-05-05 11:44:45,454 WARN L293 SmtUtils]: Spent 16.82s on a formula simplification. DAG size of input: 137 DAG size of output: 68 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-05-05 11:44:47,575 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-05 11:44:49,894 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-05 11:44:51,906 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-05 11:44:54,443 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-05 11:45:01,099 WARN L293 SmtUtils]: Spent 5.82s on a formula simplification. DAG size of input: 174 DAG size of output: 47 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-05-05 11:45:03,128 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-05 11:45:04,354 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.17s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-05 11:45:06,358 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-05 11:45:11,080 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.70s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-05 11:45:13,088 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-05 11:45:15,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-05 11:45:17,105 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-05 11:45:21,171 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-05 11:45:23,177 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-05 11:45:27,560 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-05 11:45:29,632 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-05 11:45:31,641 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-05 11:45:32,917 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.25s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-05 11:45:35,156 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-05 11:45:37,708 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-05 11:45:40,009 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.36s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-05 11:45:41,216 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.04s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-05 11:45:49,092 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-05 11:45:50,691 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.59s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-05 11:45:52,705 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-05 11:45:54,726 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-05 11:45:56,761 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-05 11:45:58,765 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-05 11:46:04,758 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-05 11:46:07,427 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.07s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-05 11:46:10,363 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-05 11:46:12,716 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-05 11:46:14,857 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-05 11:46:30,901 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-05 11:46:35,894 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-05 11:46:42,877 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-05 11:46:44,362 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.48s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-05 11:46:47,821 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-05 11:46:50,328 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-05 11:47:00,726 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.42s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-05 11:47:03,236 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-05 11:47:05,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-05 11:47:07,059 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.65s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-05 11:47:09,062 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-05 11:47:14,075 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 [] Received shutdown request... [2024-05-05 11:47:23,523 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-05 11:47:23,524 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2024-05-05 11:47:23,524 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2024-05-05 11:47:24,545 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-05-05 11:47:24,546 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Forceful destruction successful, exit code 0 [2024-05-05 11:47:24,593 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-05 11:47:24,594 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2024-05-05 11:47:24,594 WARN L619 AbstractCegarLoop]: Verification canceled: while executing Executor. [2024-05-05 11:47:24,597 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2024-05-05 11:47:24,597 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 5 remaining) [2024-05-05 11:47:24,597 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 5 remaining) [2024-05-05 11:47:24,597 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 5 remaining) [2024-05-05 11:47:24,597 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 5 remaining) [2024-05-05 11:47:24,612 INFO L448 BasicCegarLoop]: Path program histogram: [31, 5, 2, 2, 1, 1] [2024-05-05 11:47:24,615 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-05-05 11:47:24,615 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2024-05-05 11:47:24,617 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.05 11:47:24 BasicIcfg [2024-05-05 11:47:24,617 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-05-05 11:47:24,617 INFO L158 Benchmark]: Toolchain (without parser) took 831324.33ms. Allocated memory was 287.3MB in the beginning and 1.9GB in the end (delta: 1.6GB). Free memory was 214.5MB in the beginning and 771.0MB in the end (delta: -556.5MB). Peak memory consumption was 1.1GB. Max. memory is 8.0GB. [2024-05-05 11:47:24,618 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 287.3MB. Free memory was 258.2MB in the beginning and 258.2MB in the end (delta: 27.8kB). There was no memory consumed. Max. memory is 8.0GB. [2024-05-05 11:47:24,618 INFO L158 Benchmark]: CACSL2BoogieTranslator took 246.17ms. Allocated memory is still 287.3MB. Free memory was 214.5MB in the beginning and 202.6MB in the end (delta: 11.9MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2024-05-05 11:47:24,618 INFO L158 Benchmark]: Boogie Procedure Inliner took 30.86ms. Allocated memory is still 287.3MB. Free memory was 202.6MB in the beginning and 200.6MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2024-05-05 11:47:24,618 INFO L158 Benchmark]: Boogie Preprocessor took 29.43ms. Allocated memory is still 287.3MB. Free memory was 200.6MB in the beginning and 199.3MB in the end (delta: 1.3MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2024-05-05 11:47:24,618 INFO L158 Benchmark]: RCFGBuilder took 457.99ms. Allocated memory is still 287.3MB. Free memory was 199.3MB in the beginning and 176.2MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 8.0GB. [2024-05-05 11:47:24,619 INFO L158 Benchmark]: TraceAbstraction took 830551.37ms. Allocated memory was 287.3MB in the beginning and 1.9GB in the end (delta: 1.6GB). Free memory was 175.2MB in the beginning and 771.0MB in the end (delta: -595.9MB). Peak memory consumption was 1.0GB. Max. memory is 8.0GB. [2024-05-05 11:47:24,620 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.12ms. Allocated memory is still 287.3MB. Free memory was 258.2MB in the beginning and 258.2MB in the end (delta: 27.8kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 246.17ms. Allocated memory is still 287.3MB. Free memory was 214.5MB in the beginning and 202.6MB in the end (delta: 11.9MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 30.86ms. Allocated memory is still 287.3MB. Free memory was 202.6MB in the beginning and 200.6MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 29.43ms. Allocated memory is still 287.3MB. Free memory was 200.6MB in the beginning and 199.3MB in the end (delta: 1.3MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 457.99ms. Allocated memory is still 287.3MB. Free memory was 199.3MB in the beginning and 176.2MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 8.0GB. * TraceAbstraction took 830551.37ms. Allocated memory was 287.3MB in the beginning and 1.9GB in the end (delta: 1.6GB). Free memory was 175.2MB in the beginning and 771.0MB in the end (delta: -595.9MB). Peak memory consumption was 1.0GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 260600, independent: 240355, independent conditional: 234878, independent unconditional: 5477, dependent: 20134, dependent conditional: 20101, dependent unconditional: 33, unknown: 111, unknown conditional: 111, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 244515, independent: 240355, independent conditional: 234878, independent unconditional: 5477, dependent: 4049, dependent conditional: 4016, dependent unconditional: 33, unknown: 111, unknown conditional: 111, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ ConditionTransformingIndependenceRelation.Independence Queries: [ total: 244515, independent: 240355, independent conditional: 234878, independent unconditional: 5477, dependent: 4049, dependent conditional: 4016, dependent unconditional: 33, unknown: 111, unknown conditional: 111, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 244515, independent: 240355, independent conditional: 234878, independent unconditional: 5477, dependent: 4049, dependent conditional: 4016, dependent unconditional: 33, unknown: 111, unknown conditional: 111, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 257661, independent: 240355, independent conditional: 7503, independent unconditional: 232852, dependent: 17195, dependent conditional: 8881, dependent unconditional: 8314, unknown: 111, unknown conditional: 111, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 257661, independent: 240355, independent conditional: 6534, independent unconditional: 233821, dependent: 17195, dependent conditional: 4684, dependent unconditional: 12511, unknown: 111, unknown conditional: 111, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 257661, independent: 240355, independent conditional: 6534, independent unconditional: 233821, dependent: 17195, dependent conditional: 4684, dependent unconditional: 12511, unknown: 111, unknown conditional: 111, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1281, independent: 1078, independent conditional: 77, independent unconditional: 1001, dependent: 194, dependent conditional: 182, dependent unconditional: 12, unknown: 9, unknown conditional: 9, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1281, independent: 1073, independent conditional: 0, independent unconditional: 1073, dependent: 208, dependent conditional: 0, dependent unconditional: 208, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 208, independent: 5, independent conditional: 5, independent unconditional: 0, dependent: 194, dependent conditional: 182, dependent unconditional: 12, unknown: 9, unknown conditional: 9, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 208, independent: 5, independent conditional: 5, independent unconditional: 0, dependent: 194, dependent conditional: 182, dependent unconditional: 12, unknown: 9, unknown conditional: 9, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 13738, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 4695, dependent conditional: 3967, dependent unconditional: 728, unknown: 9038, unknown conditional: 9038, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 257661, independent: 239277, independent conditional: 6457, independent unconditional: 232820, dependent: 17001, dependent conditional: 4502, dependent unconditional: 12499, unknown: 1383, unknown conditional: 370, unknown unconditional: 1013] , Statistics on independence cache: Total cache size (in pairs): 1272, Positive cache size: 1078, Positive conditional cache size: 77, Positive unconditional cache size: 1001, Negative cache size: 194, Negative conditional cache size: 182, Negative unconditional cache size: 12, Unknown cache size: 9, Unknown conditional cache size: 9, Unknown unconditional cache size: 0, Eliminated conditions: 5166, Maximal queried relation: 4, ConditionTransformingIndependenceRelation.Independence Queries: [ total: 257661, independent: 240355, independent conditional: 7503, independent unconditional: 232852, dependent: 17195, dependent conditional: 8881, dependent unconditional: 8314, unknown: 111, unknown conditional: 111, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 257661, independent: 240355, independent conditional: 6534, independent unconditional: 233821, dependent: 17195, dependent conditional: 4684, dependent unconditional: 12511, unknown: 111, unknown conditional: 111, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 257661, independent: 240355, independent conditional: 6534, independent unconditional: 233821, dependent: 17195, dependent conditional: 4684, dependent unconditional: 12511, unknown: 111, unknown conditional: 111, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1281, independent: 1078, independent conditional: 77, independent unconditional: 1001, dependent: 194, dependent conditional: 182, dependent unconditional: 12, unknown: 9, unknown conditional: 9, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1281, independent: 1073, independent conditional: 0, independent unconditional: 1073, dependent: 208, dependent conditional: 0, dependent unconditional: 208, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 208, independent: 5, independent conditional: 5, independent unconditional: 0, dependent: 194, dependent conditional: 182, dependent unconditional: 12, unknown: 9, unknown conditional: 9, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 208, independent: 5, independent conditional: 5, independent unconditional: 0, dependent: 194, dependent conditional: 182, dependent unconditional: 12, unknown: 9, unknown conditional: 9, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 13738, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 4695, dependent conditional: 3967, dependent unconditional: 728, unknown: 9038, unknown conditional: 9038, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 257661, independent: 239277, independent conditional: 6457, independent unconditional: 232820, dependent: 17001, dependent conditional: 4502, dependent unconditional: 12499, unknown: 1383, unknown conditional: 370, unknown unconditional: 1013] , Statistics on independence cache: Total cache size (in pairs): 1272, Positive cache size: 1078, Positive conditional cache size: 77, Positive unconditional cache size: 1001, Negative cache size: 194, Negative conditional cache size: 182, Negative unconditional cache size: 12, Unknown cache size: 9, Unknown conditional cache size: 9, Unknown unconditional cache size: 0, Eliminated conditions: 5166 ], Independence queries for same thread: 16085 - TimeoutResultAtElement [Line: 139]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable Cancelled while executing Executor. - TimeoutResultAtElement [Line: 129]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while executing Executor. - TimeoutResultAtElement [Line: 130]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while executing Executor. - TimeoutResultAtElement [Line: 132]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while executing Executor. - TimeoutResultAtElement [Line: 131]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while executing Executor. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 159 locations, 5 error locations. Started 1 CEGAR loops. OverallTime: 830.4s, OverallIterations: 6, TraceHistogramMax: 0, PathProgramHistogramMax: 31, EmptinessCheckTime: 434.9s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 284, 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.2s SsaConstructionTime, 1.9s SatisfiabilityAnalysisTime, 355.3s InterpolantComputationTime, 2462 NumberOfCodeBlocks, 2424 NumberOfCodeBlocksAsserted, 44 NumberOfCheckSat, 3352 ConstructedInterpolants, 0 QuantifiedInterpolants, 29075 SizeOfPredicates, 65 NumberOfNonLiveVariables, 1906 ConjunctsInSsa, 222 ConjunctsInUnsatCore, 13 InterpolantComputations, 3 PerfectInterpolantSequences, 12469/19208 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: 35.7s, ConditionalCommutativityIAIntegrations: 0, ConditionalCommutativityDFSRestarts: 0, ConditionalCommutativityConditionCalculations: 36, ConditionalCommutativityTraceChecks: 36, ConditionalCommutativityImperfectProofs: 6 RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown