/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 DFS --traceabstraction.criterion.for.conditional.commutativity.checking DEFAULT --traceabstraction.use.limited.checks.recommended.for.dfs true --traceabstraction.limit.for.limited.checks 2 -tc ../benchexec/../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread/fib_unsafe-7.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-wip.dk.conditional-comm-17da818-m [2024-05-06 04:53:17,699 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-05-06 04:53:17,765 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../benchexec/../../../trunk/examples/settings/gemcutter/NewStatesSleep.epf [2024-05-06 04:53:17,771 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-05-06 04:53:17,771 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-05-06 04:53:17,796 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-05-06 04:53:17,796 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-05-06 04:53:17,797 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-05-06 04:53:17,797 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-05-06 04:53:17,800 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-05-06 04:53:17,801 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-05-06 04:53:17,801 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-05-06 04:53:17,801 INFO L153 SettingsManager]: * Use SBE=true [2024-05-06 04:53:17,802 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-05-06 04:53:17,802 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-05-06 04:53:17,802 INFO L153 SettingsManager]: * sizeof long=4 [2024-05-06 04:53:17,802 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-05-06 04:53:17,802 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-05-06 04:53:17,802 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-05-06 04:53:17,802 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-05-06 04:53:17,803 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-05-06 04:53:17,803 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-05-06 04:53:17,803 INFO L153 SettingsManager]: * sizeof long double=12 [2024-05-06 04:53:17,803 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-05-06 04:53:17,803 INFO L153 SettingsManager]: * Use constant arrays=true [2024-05-06 04:53:17,804 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-05-06 04:53:17,804 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-05-06 04:53:17,804 INFO L153 SettingsManager]: * To the following directory=./dump/ [2024-05-06 04:53:17,804 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-05-06 04:53:17,804 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-05-06 04:53:17,805 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-05-06 04:53:17,805 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-05-06 04:53:17,805 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-05-06 04:53:17,806 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-05-06 04:53:17,806 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=SLEEP_NEW_STATES [2024-05-06 04:53:17,806 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-05-06 04:53:17,806 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-05-06 04:53:17,806 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2024-05-06 04:53:17,806 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-05-06 04:53:17,806 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 -> DFS Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Criterion for conditional commutativity checking -> DEFAULT Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: use limited checks (recommended for DFS) -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Limit for limited checks -> 2 [2024-05-06 04:53:18,072 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-05-06 04:53:18,111 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-05-06 04:53:18,113 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-05-06 04:53:18,114 INFO L270 PluginConnector]: Initializing CDTParser... [2024-05-06 04:53:18,114 INFO L274 PluginConnector]: CDTParser initialized [2024-05-06 04:53:18,115 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/svcomp/pthread/fib_unsafe-7.i [2024-05-06 04:53:19,164 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-05-06 04:53:19,397 INFO L384 CDTParser]: Found 1 translation units. [2024-05-06 04:53:19,397 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread/fib_unsafe-7.i [2024-05-06 04:53:19,414 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/ff17ea1f3/1babee6463444875843637464197500d/FLAGeb63e3c86 [2024-05-06 04:53:19,426 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/ff17ea1f3/1babee6463444875843637464197500d [2024-05-06 04:53:19,428 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-05-06 04:53:19,429 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-05-06 04:53:19,430 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-05-06 04:53:19,430 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-05-06 04:53:19,434 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-05-06 04:53:19,434 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.05 04:53:19" (1/1) ... [2024-05-06 04:53:19,435 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@36f4de5e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 04:53:19, skipping insertion in model container [2024-05-06 04:53:19,435 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.05 04:53:19" (1/1) ... [2024-05-06 04:53:19,476 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-05-06 04:53:19,651 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/fib_unsafe-7.i[30243,30256] [2024-05-06 04:53:19,670 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-05-06 04:53:19,680 INFO L202 MainTranslator]: Completed pre-run [2024-05-06 04:53:19,724 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/fib_unsafe-7.i[30243,30256] [2024-05-06 04:53:19,737 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-05-06 04:53:19,761 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2024-05-06 04:53:19,761 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2024-05-06 04:53:19,766 INFO L206 MainTranslator]: Completed translation [2024-05-06 04:53:19,767 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 04:53:19 WrapperNode [2024-05-06 04:53:19,767 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-05-06 04:53:19,768 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-05-06 04:53:19,768 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-05-06 04:53:19,768 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-05-06 04:53:19,774 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 04:53:19" (1/1) ... [2024-05-06 04:53:19,798 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 04:53:19" (1/1) ... [2024-05-06 04:53:19,823 INFO L138 Inliner]: procedures = 165, calls = 28, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 74 [2024-05-06 04:53:19,823 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-05-06 04:53:19,824 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-05-06 04:53:19,824 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-05-06 04:53:19,824 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-05-06 04:53:19,830 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 04:53:19" (1/1) ... [2024-05-06 04:53:19,831 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 04:53:19" (1/1) ... [2024-05-06 04:53:19,835 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 04:53:19" (1/1) ... [2024-05-06 04:53:19,836 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 04:53:19" (1/1) ... [2024-05-06 04:53:19,849 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 04:53:19" (1/1) ... [2024-05-06 04:53:19,852 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 04:53:19" (1/1) ... [2024-05-06 04:53:19,853 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 04:53:19" (1/1) ... [2024-05-06 04:53:19,853 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 04:53:19" (1/1) ... [2024-05-06 04:53:19,855 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-05-06 04:53:19,855 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-05-06 04:53:19,855 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-05-06 04:53:19,856 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-05-06 04:53:19,856 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 04:53:19" (1/1) ... [2024-05-06 04:53:19,863 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-05-06 04:53:19,871 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-06 04:53:19,885 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-06 04:53:19,891 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-06 04:53:19,923 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2024-05-06 04:53:19,923 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2024-05-06 04:53:19,923 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2024-05-06 04:53:19,923 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2024-05-06 04:53:19,923 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-05-06 04:53:19,924 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-05-06 04:53:19,924 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-05-06 04:53:19,924 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-05-06 04:53:19,924 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-05-06 04:53:19,924 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-05-06 04:53:19,925 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-05-06 04:53:19,925 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-05-06 04:53:19,925 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-05-06 04:53:19,926 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-05-06 04:53:20,056 INFO L241 CfgBuilder]: Building ICFG [2024-05-06 04:53:20,057 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2024-05-06 04:53:20,165 INFO L282 CfgBuilder]: Performing block encoding [2024-05-06 04:53:20,171 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-05-06 04:53:20,172 INFO L309 CfgBuilder]: Removed 3 assume(true) statements. [2024-05-06 04:53:20,173 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.05 04:53:20 BoogieIcfgContainer [2024-05-06 04:53:20,173 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-05-06 04:53:20,175 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-05-06 04:53:20,175 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-05-06 04:53:20,177 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-05-06 04:53:20,177 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.05 04:53:19" (1/3) ... [2024-05-06 04:53:20,178 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a1acf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.05 04:53:20, skipping insertion in model container [2024-05-06 04:53:20,178 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 04:53:19" (2/3) ... [2024-05-06 04:53:20,178 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a1acf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.05 04:53:20, skipping insertion in model container [2024-05-06 04:53:20,178 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.05 04:53:20" (3/3) ... [2024-05-06 04:53:20,179 INFO L112 eAbstractionObserver]: Analyzing ICFG fib_unsafe-7.i [2024-05-06 04:53:20,185 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2024-05-06 04:53:20,193 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-05-06 04:53:20,194 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-05-06 04:53:20,194 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-05-06 04:53:20,265 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-05-06 04:53:20,310 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-06 04:53:20,310 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-05-06 04:53:20,310 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-06 04:53:20,313 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-06 04:53:20,314 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-06 04:53:20,349 INFO L188 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-05-06 04:53:20,360 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-06 04:53:20,361 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-05-06 04:53:20,368 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;@78afbe32, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms], mConComChecker=DFS, mConComCheckerCriterion=DEFAULT, mConComCheckerLimitedChecksCriterion=true, mConComCheckerCriterionLimit=2, mConComCheckerRandomProb=100, mConComCheckerRandomSeed=123, mConComCheckerConditionCriterion=false [2024-05-06 04:53:20,368 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2024-05-06 04:53:20,588 INFO L85 PathProgramCache]: Analyzing trace with hash 920930900, now seen corresponding path program 1 times [2024-05-06 04:53:20,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 04:53:20,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 04:53:20,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 04:53:20,785 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 04:53:20,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 04:53:20,914 INFO L85 PathProgramCache]: Analyzing trace with hash -1818823887, now seen corresponding path program 2 times [2024-05-06 04:53:20,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 04:53:20,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 04:53:20,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 04:53:20,970 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 04:53:20,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 04:53:21,069 INFO L85 PathProgramCache]: Analyzing trace with hash 310184287, now seen corresponding path program 1 times [2024-05-06 04:53:21,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 04:53:21,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 04:53:21,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 04:53:21,114 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 04:53:21,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 04:53:21,179 INFO L85 PathProgramCache]: Analyzing trace with hash 2019539270, now seen corresponding path program 2 times [2024-05-06 04:53:21,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 04:53:21,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 04:53:21,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 04:53:21,197 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 04:53:21,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 04:53:21,261 INFO L85 PathProgramCache]: Analyzing trace with hash -1361992354, now seen corresponding path program 1 times [2024-05-06 04:53:21,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 04:53:21,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 04:53:21,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 04:53:21,287 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 04:53:21,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 04:53:21,361 INFO L85 PathProgramCache]: Analyzing trace with hash -1458873881, now seen corresponding path program 2 times [2024-05-06 04:53:21,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 04:53:21,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 04:53:21,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 04:53:21,385 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 04:53:21,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 04:53:21,435 INFO L85 PathProgramCache]: Analyzing trace with hash 1246410695, now seen corresponding path program 1 times [2024-05-06 04:53:21,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 04:53:21,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 04:53:21,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 04:53:21,447 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 04:53:21,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 04:53:21,506 INFO L85 PathProgramCache]: Analyzing trace with hash 1476962782, now seen corresponding path program 2 times [2024-05-06 04:53:21,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 04:53:21,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 04:53:21,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 04:53:21,527 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 04:53:21,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 04:53:21,587 INFO L85 PathProgramCache]: Analyzing trace with hash 1832526146, now seen corresponding path program 1 times [2024-05-06 04:53:21,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 04:53:21,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 04:53:21,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 04:53:21,602 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 04:53:21,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 04:53:21,645 INFO L85 PathProgramCache]: Analyzing trace with hash 2125856643, now seen corresponding path program 2 times [2024-05-06 04:53:21,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 04:53:21,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 04:53:21,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 04:53:21,656 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 04:53:21,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 04:53:21,712 INFO L85 PathProgramCache]: Analyzing trace with hash -397354433, now seen corresponding path program 1 times [2024-05-06 04:53:21,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 04:53:21,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 04:53:21,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 04:53:21,730 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 04:53:21,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 04:53:21,771 INFO L85 PathProgramCache]: Analyzing trace with hash 1038408806, now seen corresponding path program 2 times [2024-05-06 04:53:21,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 04:53:21,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 04:53:21,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 04:53:21,782 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 04:53:21,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 04:53:21,801 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-05-06 04:53:21,803 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-06 04:53:21,804 INFO L85 PathProgramCache]: Analyzing trace with hash -1184059601, now seen corresponding path program 1 times [2024-05-06 04:53:21,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-06 04:53:21,808 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1757904666] [2024-05-06 04:53:21,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 04:53:21,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 04:53:21,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 04:53:21,914 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-06 04:53:21,914 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-06 04:53:21,914 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1757904666] [2024-05-06 04:53:21,915 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1757904666] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-06 04:53:21,915 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-06 04:53:21,915 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-05-06 04:53:21,917 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1433266807] [2024-05-06 04:53:21,918 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-06 04:53:21,923 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-05-06 04:53:21,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-06 04:53:21,970 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-05-06 04:53:21,970 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-05-06 04:53:21,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-06 04:53:21,972 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-06 04:53:21,973 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 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-06 04:53:21,973 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-06 04:53:22,045 INFO L85 PathProgramCache]: Analyzing trace with hash 227468881, now seen corresponding path program 1 times [2024-05-06 04:53:22,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 04:53:22,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 04:53:22,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 04:53:22,058 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 04:53:22,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 04:53:22,101 INFO L85 PathProgramCache]: Analyzing trace with hash -317715180, now seen corresponding path program 2 times [2024-05-06 04:53:22,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 04:53:22,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 04:53:22,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 04:53:22,113 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 04:53:22,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 04:53:22,158 INFO L85 PathProgramCache]: Analyzing trace with hash -394829268, now seen corresponding path program 3 times [2024-05-06 04:53:22,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 04:53:22,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 04:53:22,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 04:53:22,172 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 04:53:22,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 04:53:22,212 INFO L85 PathProgramCache]: Analyzing trace with hash 1513772121, now seen corresponding path program 4 times [2024-05-06 04:53:22,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 04:53:22,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 04:53:22,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 04:53:22,234 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 04:53:22,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 04:53:22,271 INFO L85 PathProgramCache]: Analyzing trace with hash 2108893497, now seen corresponding path program 5 times [2024-05-06 04:53:22,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 04:53:22,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 04:53:22,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 04:53:22,282 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 04:53:22,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 04:53:22,321 INFO L85 PathProgramCache]: Analyzing trace with hash 1018665260, now seen corresponding path program 6 times [2024-05-06 04:53:22,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 04:53:22,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 04:53:22,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 04:53:22,331 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 04:53:22,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 04:53:22,365 INFO L85 PathProgramCache]: Analyzing trace with hash 1998895504, now seen corresponding path program 7 times [2024-05-06 04:53:22,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 04:53:22,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 04:53:22,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 04:53:22,377 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 04:53:22,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 04:53:22,416 INFO L85 PathProgramCache]: Analyzing trace with hash -1075515787, now seen corresponding path program 8 times [2024-05-06 04:53:22,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 04:53:22,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 04:53:22,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 04:53:22,427 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 04:53:22,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 04:53:22,462 INFO L85 PathProgramCache]: Analyzing trace with hash 162201649, now seen corresponding path program 9 times [2024-05-06 04:53:22,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 04:53:22,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 04:53:22,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 04:53:22,487 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 04:53:22,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 04:53:22,544 INFO L85 PathProgramCache]: Analyzing trace with hash 1350780724, now seen corresponding path program 10 times [2024-05-06 04:53:22,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 04:53:22,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 04:53:22,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 04:53:22,557 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 04:53:22,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 04:53:22,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-05-06 04:53:22,571 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,SelfDestructingSolverStorable19,SelfDestructingSolverStorable20,SelfDestructingSolverStorable21,SelfDestructingSolverStorable22,SelfDestructingSolverStorable12,SelfDestructingSolverStorable13,SelfDestructingSolverStorable14,SelfDestructingSolverStorable15,SelfDestructingSolverStorable16,SelfDestructingSolverStorable17 [2024-05-06 04:53:22,572 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-05-06 04:53:22,573 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-06 04:53:22,573 INFO L85 PathProgramCache]: Analyzing trace with hash 546730109, now seen corresponding path program 1 times [2024-05-06 04:53:22,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-06 04:53:22,574 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1312889306] [2024-05-06 04:53:22,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 04:53:22,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 04:53:22,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 04:53:22,686 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-06 04:53:22,686 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-06 04:53:22,687 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1312889306] [2024-05-06 04:53:22,687 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1312889306] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-06 04:53:22,687 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [268680409] [2024-05-06 04:53:22,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 04:53:22,687 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-06 04:53:22,688 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-06 04:53:22,734 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-06 04:53:22,752 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-06 04:53:22,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 04:53:22,835 INFO L262 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 4 conjunts are in the unsatisfiable core [2024-05-06 04:53:22,837 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-06 04:53:22,894 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-06 04:53:22,894 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-06 04:53:22,946 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-06 04:53:22,946 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [268680409] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-06 04:53:22,946 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-06 04:53:22,947 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2024-05-06 04:53:22,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [957056466] [2024-05-06 04:53:22,950 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-06 04:53:22,952 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-05-06 04:53:22,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-06 04:53:22,953 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-05-06 04:53:22,953 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2024-05-06 04:53:22,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-06 04:53:22,954 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-06 04:53:22,954 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 12.7) internal successors, (127), 10 states have internal predecessors, (127), 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-06 04:53:22,954 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-05-06 04:53:22,954 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-06 04:53:23,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-05-06 04:53:23,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-06 04:53:23,092 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-05-06 04:53:23,280 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,SelfDestructingSolverStorable23 [2024-05-06 04:53:23,281 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-05-06 04:53:23,281 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-06 04:53:23,281 INFO L85 PathProgramCache]: Analyzing trace with hash -872570179, now seen corresponding path program 2 times [2024-05-06 04:53:23,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-06 04:53:23,282 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [395495963] [2024-05-06 04:53:23,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 04:53:23,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 04:53:23,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 04:53:23,448 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 84 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-06 04:53:23,449 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-06 04:53:23,449 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [395495963] [2024-05-06 04:53:23,449 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [395495963] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-06 04:53:23,449 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [220506236] [2024-05-06 04:53:23,449 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-05-06 04:53:23,449 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-06 04:53:23,449 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-06 04:53:23,450 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-06 04:53:23,475 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-06 04:53:23,537 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-05-06 04:53:23,537 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-05-06 04:53:23,538 INFO L262 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 8 conjunts are in the unsatisfiable core [2024-05-06 04:53:23,542 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-06 04:53:23,611 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 84 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-06 04:53:23,611 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-06 04:53:23,714 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 84 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-06 04:53:23,714 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [220506236] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-06 04:53:23,714 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-06 04:53:23,714 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 18 [2024-05-06 04:53:23,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [176589891] [2024-05-06 04:53:23,715 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-06 04:53:23,716 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-05-06 04:53:23,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-06 04:53:23,718 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-05-06 04:53:23,718 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2024-05-06 04:53:23,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-06 04:53:23,719 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-06 04:53:23,719 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 10.833333333333334) internal successors, (195), 18 states have internal predecessors, (195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-06 04:53:23,719 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-05-06 04:53:23,719 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-05-06 04:53:23,719 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-06 04:53:23,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-05-06 04:53:23,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-06 04:53:23,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-05-06 04:53:23,878 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-06 04:53:24,078 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2024-05-06 04:53:24,079 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-05-06 04:53:24,079 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-06 04:53:24,079 INFO L85 PathProgramCache]: Analyzing trace with hash 328881981, now seen corresponding path program 3 times [2024-05-06 04:53:24,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-06 04:53:24,080 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1952745380] [2024-05-06 04:53:24,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 04:53:24,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 04:53:24,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 04:53:24,406 INFO L134 CoverageAnalysis]: Checked inductivity of 434 backedges. 0 proven. 434 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-06 04:53:24,406 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-06 04:53:24,406 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1952745380] [2024-05-06 04:53:24,406 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1952745380] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-06 04:53:24,406 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2057029745] [2024-05-06 04:53:24,406 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-05-06 04:53:24,407 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-06 04:53:24,407 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-06 04:53:24,408 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-06 04:53:24,426 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-06 04:53:24,532 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2024-05-06 04:53:24,532 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-05-06 04:53:24,534 INFO L262 TraceCheckSpWp]: Trace formula consists of 358 conjuncts, 16 conjunts are in the unsatisfiable core [2024-05-06 04:53:24,537 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-06 04:53:24,810 INFO L134 CoverageAnalysis]: Checked inductivity of 434 backedges. 434 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-06 04:53:24,810 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-05-06 04:53:24,810 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2057029745] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-06 04:53:24,810 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-05-06 04:53:24,811 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [17] total 32 [2024-05-06 04:53:24,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1809124416] [2024-05-06 04:53:24,811 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-06 04:53:24,811 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-05-06 04:53:24,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-06 04:53:24,812 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-05-06 04:53:24,812 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=159, Invalid=833, Unknown=0, NotChecked=0, Total=992 [2024-05-06 04:53:24,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-06 04:53:24,813 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-06 04:53:24,813 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 10.764705882352942) internal successors, (183), 17 states have internal predecessors, (183), 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-06 04:53:24,813 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-05-06 04:53:24,813 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-05-06 04:53:24,813 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2024-05-06 04:53:24,813 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-06 04:53:25,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-05-06 04:53:25,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-06 04:53:25,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-05-06 04:53:25,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-05-06 04:53:25,075 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-05-06 04:53:25,263 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25,5 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-06 04:53:25,264 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-05-06 04:53:25,264 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-06 04:53:25,264 INFO L85 PathProgramCache]: Analyzing trace with hash 996868386, now seen corresponding path program 1 times [2024-05-06 04:53:25,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-06 04:53:25,264 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1440337693] [2024-05-06 04:53:25,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 04:53:25,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 04:53:25,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 04:53:25,682 INFO L134 CoverageAnalysis]: Checked inductivity of 545 backedges. 0 proven. 545 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-06 04:53:25,682 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-06 04:53:25,682 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1440337693] [2024-05-06 04:53:25,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1440337693] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-06 04:53:25,682 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1830095008] [2024-05-06 04:53:25,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 04:53:25,683 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-06 04:53:25,683 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-06 04:53:25,684 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-06 04:53:25,710 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-06 04:53:25,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 04:53:25,786 INFO L262 TraceCheckSpWp]: Trace formula consists of 387 conjuncts, 16 conjunts are in the unsatisfiable core [2024-05-06 04:53:25,789 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-06 04:53:26,070 INFO L134 CoverageAnalysis]: Checked inductivity of 545 backedges. 533 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-05-06 04:53:26,071 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-05-06 04:53:26,071 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1830095008] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-06 04:53:26,071 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-05-06 04:53:26,071 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [21] total 36 [2024-05-06 04:53:26,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [793992474] [2024-05-06 04:53:26,071 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-06 04:53:26,071 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-05-06 04:53:26,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-06 04:53:26,072 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-05-06 04:53:26,072 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=199, Invalid=1061, Unknown=0, NotChecked=0, Total=1260 [2024-05-06 04:53:26,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-06 04:53:26,073 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-06 04:53:26,073 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 11.117647058823529) internal successors, (189), 17 states have internal predecessors, (189), 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-06 04:53:26,073 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-05-06 04:53:26,073 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-05-06 04:53:26,073 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2024-05-06 04:53:26,073 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 24 states. [2024-05-06 04:53:26,073 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-06 04:53:26,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-05-06 04:53:26,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-06 04:53:26,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-05-06 04:53:26,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-05-06 04:53:26,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-05-06 04:53:26,373 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-05-06 04:53:26,571 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2024-05-06 04:53:26,571 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-05-06 04:53:26,571 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-06 04:53:26,571 INFO L85 PathProgramCache]: Analyzing trace with hash 60620829, now seen corresponding path program 1 times [2024-05-06 04:53:26,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-06 04:53:26,572 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [394648533] [2024-05-06 04:53:26,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 04:53:26,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 04:53:26,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 04:53:26,818 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-06 04:53:26,818 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-06 04:53:26,819 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [394648533] [2024-05-06 04:53:26,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [394648533] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-06 04:53:26,819 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1795752892] [2024-05-06 04:53:26,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 04:53:26,819 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-06 04:53:26,819 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-06 04:53:26,820 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-05-06 04:53:26,848 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-05-06 04:53:26,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 04:53:26,925 INFO L262 TraceCheckSpWp]: Trace formula consists of 354 conjuncts, 16 conjunts are in the unsatisfiable core [2024-05-06 04:53:26,927 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-06 04:53:27,028 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-06 04:53:27,028 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-06 04:53:27,269 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-06 04:53:27,269 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1795752892] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-06 04:53:27,269 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-06 04:53:27,269 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 34 [2024-05-06 04:53:27,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1467138030] [2024-05-06 04:53:27,271 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-06 04:53:27,272 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2024-05-06 04:53:27,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-06 04:53:27,273 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2024-05-06 04:53:27,273 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=306, Invalid=816, Unknown=0, NotChecked=0, Total=1122 [2024-05-06 04:53:27,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-06 04:53:27,274 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-06 04:53:27,274 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 9.5) internal successors, (323), 34 states have internal predecessors, (323), 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-06 04:53:27,274 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-05-06 04:53:27,274 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-05-06 04:53:27,274 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2024-05-06 04:53:27,274 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 24 states. [2024-05-06 04:53:27,274 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 24 states. [2024-05-06 04:53:27,274 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-06 04:53:27,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-05-06 04:53:27,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-06 04:53:27,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-05-06 04:53:27,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-05-06 04:53:27,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-05-06 04:53:27,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2024-05-06 04:53:27,726 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-05-06 04:53:27,916 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2024-05-06 04:53:27,916 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-05-06 04:53:27,917 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-06 04:53:27,917 INFO L85 PathProgramCache]: Analyzing trace with hash 1327961501, now seen corresponding path program 2 times [2024-05-06 04:53:27,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-06 04:53:27,917 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [363877490] [2024-05-06 04:53:27,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 04:53:27,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 04:53:27,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 04:53:28,587 INFO L134 CoverageAnalysis]: Checked inductivity of 974 backedges. 0 proven. 974 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-06 04:53:28,587 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-06 04:53:28,587 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [363877490] [2024-05-06 04:53:28,588 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [363877490] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-06 04:53:28,588 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1258853726] [2024-05-06 04:53:28,588 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-05-06 04:53:28,588 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-06 04:53:28,588 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-06 04:53:28,590 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-05-06 04:53:28,612 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-05-06 04:53:28,701 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-05-06 04:53:28,702 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-05-06 04:53:28,704 INFO L262 TraceCheckSpWp]: Trace formula consists of 450 conjuncts, 32 conjunts are in the unsatisfiable core [2024-05-06 04:53:28,706 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-06 04:53:28,869 INFO L134 CoverageAnalysis]: Checked inductivity of 974 backedges. 0 proven. 974 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-06 04:53:28,869 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-06 04:53:29,402 INFO L134 CoverageAnalysis]: Checked inductivity of 974 backedges. 0 proven. 974 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-06 04:53:29,403 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1258853726] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-06 04:53:29,403 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-06 04:53:29,403 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33, 33] total 35 [2024-05-06 04:53:29,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [321807350] [2024-05-06 04:53:29,403 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-06 04:53:29,404 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2024-05-06 04:53:29,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-06 04:53:29,405 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2024-05-06 04:53:29,405 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=323, Invalid=867, Unknown=0, NotChecked=0, Total=1190 [2024-05-06 04:53:29,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-06 04:53:29,405 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-06 04:53:29,406 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 7.2) internal successors, (252), 35 states have internal predecessors, (252), 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-06 04:53:29,406 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-05-06 04:53:29,406 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-05-06 04:53:29,406 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2024-05-06 04:53:29,406 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 24 states. [2024-05-06 04:53:29,406 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 24 states. [2024-05-06 04:53:29,406 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 45 states. [2024-05-06 04:53:29,406 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-06 04:53:29,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-05-06 04:53:29,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-06 04:53:29,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-05-06 04:53:29,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-05-06 04:53:29,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-05-06 04:53:29,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2024-05-06 04:53:29,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2024-05-06 04:53:29,931 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-05-06 04:53:30,131 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2024-05-06 04:53:30,132 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-05-06 04:53:30,132 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-06 04:53:30,132 INFO L85 PathProgramCache]: Analyzing trace with hash 1654436186, now seen corresponding path program 3 times [2024-05-06 04:53:30,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-06 04:53:30,132 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [72610863] [2024-05-06 04:53:30,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 04:53:30,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 04:53:30,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 04:53:30,162 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 04:53:30,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 04:53:30,210 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-05-06 04:53:30,210 INFO L363 BasicCegarLoop]: Counterexample is feasible [2024-05-06 04:53:30,211 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2024-05-06 04:53:30,212 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 3 remaining) [2024-05-06 04:53:30,213 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2024-05-06 04:53:30,213 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-05-06 04:53:30,216 INFO L448 BasicCegarLoop]: Path program histogram: [10, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1] [2024-05-06 04:53:30,220 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-05-06 04:53:30,220 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2024-05-06 04:53:30,293 WARN L1576 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre4 could not be translated [2024-05-06 04:53:30,294 WARN L1576 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre6 could not be translated [2024-05-06 04:53:30,315 WARN L1576 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ret8 could not be translated [2024-05-06 04:53:30,337 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.05 04:53:30 BasicIcfg [2024-05-06 04:53:30,338 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-05-06 04:53:30,339 INFO L158 Benchmark]: Toolchain (without parser) took 10908.66ms. Allocated memory was 306.2MB in the beginning and 480.2MB in the end (delta: 174.1MB). Free memory was 233.3MB in the beginning and 253.1MB in the end (delta: -19.8MB). Peak memory consumption was 155.1MB. Max. memory is 8.0GB. [2024-05-06 04:53:30,339 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 306.2MB. Free memory is still 274.9MB. There was no memory consumed. Max. memory is 8.0GB. [2024-05-06 04:53:30,340 INFO L158 Benchmark]: CACSL2BoogieTranslator took 337.08ms. Allocated memory is still 306.2MB. Free memory was 233.1MB in the beginning and 213.4MB in the end (delta: 19.7MB). Peak memory consumption was 19.9MB. Max. memory is 8.0GB. [2024-05-06 04:53:30,341 INFO L158 Benchmark]: Boogie Procedure Inliner took 55.20ms. Allocated memory is still 306.2MB. Free memory was 213.2MB in the beginning and 211.3MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2024-05-06 04:53:30,341 INFO L158 Benchmark]: Boogie Preprocessor took 31.13ms. Allocated memory is still 306.2MB. Free memory was 211.3MB in the beginning and 209.8MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2024-05-06 04:53:30,341 INFO L158 Benchmark]: RCFGBuilder took 317.59ms. Allocated memory is still 306.2MB. Free memory was 209.8MB in the beginning and 195.1MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. [2024-05-06 04:53:30,341 INFO L158 Benchmark]: TraceAbstraction took 10162.83ms. Allocated memory was 306.2MB in the beginning and 480.2MB in the end (delta: 174.1MB). Free memory was 194.1MB in the beginning and 253.6MB in the end (delta: -59.5MB). Peak memory consumption was 115.3MB. Max. memory is 8.0GB. [2024-05-06 04:53:30,342 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.11ms. Allocated memory is still 306.2MB. Free memory is still 274.9MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 337.08ms. Allocated memory is still 306.2MB. Free memory was 233.1MB in the beginning and 213.4MB in the end (delta: 19.7MB). Peak memory consumption was 19.9MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 55.20ms. Allocated memory is still 306.2MB. Free memory was 213.2MB in the beginning and 211.3MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 31.13ms. Allocated memory is still 306.2MB. Free memory was 211.3MB in the beginning and 209.8MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 317.59ms. Allocated memory is still 306.2MB. Free memory was 209.8MB in the beginning and 195.1MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. * TraceAbstraction took 10162.83ms. Allocated memory was 306.2MB in the beginning and 480.2MB in the end (delta: 174.1MB). Free memory was 194.1MB in the beginning and 253.6MB in the end (delta: -59.5MB). Peak memory consumption was 115.3MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre4 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre6 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ret8 could not be translated - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 25622, independent: 23251, independent conditional: 17620, independent unconditional: 5631, dependent: 2371, dependent conditional: 2349, dependent unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 23295, independent: 23251, independent conditional: 17620, independent unconditional: 5631, dependent: 44, dependent conditional: 22, dependent unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ ConditionTransformingIndependenceRelation.Independence Queries: [ total: 23295, independent: 23251, independent conditional: 17620, independent unconditional: 5631, dependent: 44, dependent conditional: 22, dependent unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 23295, independent: 23251, independent conditional: 17620, independent unconditional: 5631, dependent: 44, dependent conditional: 22, dependent unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 23349, independent: 23251, independent conditional: 4778, independent unconditional: 18473, dependent: 98, dependent conditional: 10, dependent unconditional: 88, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 23349, independent: 23251, independent conditional: 3633, independent unconditional: 19618, dependent: 98, dependent conditional: 0, dependent unconditional: 98, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 23349, independent: 23251, independent conditional: 3633, independent unconditional: 19618, dependent: 98, dependent conditional: 0, dependent unconditional: 98, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 624, independent: 622, independent conditional: 0, independent unconditional: 622, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 624, independent: 622, independent conditional: 0, independent unconditional: 622, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 28, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 28, dependent conditional: 0, dependent unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 23349, independent: 22629, independent conditional: 3633, independent unconditional: 18996, dependent: 96, dependent conditional: 0, dependent unconditional: 96, unknown: 624, unknown conditional: 0, unknown unconditional: 624] , Statistics on independence cache: Total cache size (in pairs): 624, Positive cache size: 622, Positive conditional cache size: 0, Positive unconditional cache size: 622, Negative cache size: 2, Negative conditional cache size: 0, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 1155, Maximal queried relation: 1, ConditionTransformingIndependenceRelation.Independence Queries: [ total: 23349, independent: 23251, independent conditional: 4778, independent unconditional: 18473, dependent: 98, dependent conditional: 10, dependent unconditional: 88, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 23349, independent: 23251, independent conditional: 3633, independent unconditional: 19618, dependent: 98, dependent conditional: 0, dependent unconditional: 98, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 23349, independent: 23251, independent conditional: 3633, independent unconditional: 19618, dependent: 98, dependent conditional: 0, dependent unconditional: 98, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 624, independent: 622, independent conditional: 0, independent unconditional: 622, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 624, independent: 622, independent conditional: 0, independent unconditional: 622, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 28, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 28, dependent conditional: 0, dependent unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 23349, independent: 22629, independent conditional: 3633, independent unconditional: 18996, dependent: 96, dependent conditional: 0, dependent unconditional: 96, unknown: 624, unknown conditional: 0, unknown unconditional: 624] , Statistics on independence cache: Total cache size (in pairs): 624, Positive cache size: 622, Positive conditional cache size: 0, Positive unconditional cache size: 622, Negative cache size: 2, Negative conditional cache size: 0, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 1155 ], Independence queries for same thread: 2327 - CounterExampleResult [Line: 681]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L682] 0 int i, j; VAL [i=0, j=0] [L685] 0 int p, q; VAL [i=0, j=0, p=0, q=0] [L702] 0 int cur = 1, prev = 0, next = 0; VAL [cur=1, i=0, j=0, next=0, p=0, prev=0, q=0] [L703] 0 int x; VAL [cur=1, i=0, j=0, next=0, p=0, prev=0, q=0, x=0] [L713] 0 pthread_t id1, id2; VAL [\old(argc)=1598, argc=1598, argv={1599:1600}, cur=1, i=0, id1={5:0}, id2={3:0}, j=0, next=0, p=0, prev=0, q=0, x=0] [L715] 0 i = 1 VAL [\old(argc)=1598, argc=1598, argv={1599:1600}, cur=1, i=1, id1={5:0}, id2={3:0}, j=0, next=0, p=0, prev=0, q=0, x=0] [L718] 0 j = 1 VAL [\old(argc)=1598, argc=1598, argv={1599:1600}, cur=1, i=1, id1={5:0}, id2={3:0}, j=1, next=0, p=0, prev=0, q=0, x=0] [L720] FCALL, FORK 0 pthread_create(&id1, ((void *)0), t1, ((void *)0)) VAL [\old(argc)=1598, arg={0:0}, argc=1598, argv={1599:1600}, cur=1, i=1, id1={5:0}, id2={3:0}, j=1, next=0, p=0, prev=0, q=0, x=0] [L687] 1 p = 0 VAL [arg={0:0}, arg={0:0}, cur=1, i=1, j=1, next=0, p=0, prev=0, q=0, x=0] [L721] FCALL, FORK 0 pthread_create(&id2, ((void *)0), t2, ((void *)0)) VAL [\old(argc)=1598, arg={0:0}, arg={0:0}, arg={0:0}, argc=1598, argv={1599:1600}, cur=1, i=1, id1={5:0}, id2={3:0}, j=1, next=0, p=0, prev=0, q=0, x=0] [L695] 2 q = 0 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=1, i=1, j=1, next=0, p=0, prev=0, q=0, x=0] [L722] CALL, EXPR 0 fib() [L705] 0 x = 0 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=1, i=1, j=1, next=0, p=0, prev=0, q=0, x=0] [L687] COND TRUE 1 p < 7 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=1, i=1, j=1, next=0, p=0, prev=0, q=0, x=0] [L689] 1 i = i + j VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=1, i=2, j=1, next=0, p=0, prev=0, q=0, x=0] [L687] 1 p++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=1, i=2, j=1, next=0, p=1, prev=0, q=0, x=0] [L695] COND TRUE 2 q < 7 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=1, i=2, j=1, next=0, p=1, prev=0, q=0, x=0] [L697] 2 j = j + i VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=1, i=2, j=3, next=0, p=1, prev=0, q=0, x=0] [L695] 2 q++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=1, i=2, j=3, next=0, p=1, prev=0, q=1, x=0] [L705] COND TRUE 0 x < 16 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=1, i=2, j=3, next=0, p=1, prev=0, q=1, x=0] [L706] 0 next = prev + cur VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=1, i=2, j=3, next=1, p=1, prev=0, q=1, x=0] [L707] 0 prev = cur VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=1, i=2, j=3, next=1, p=1, prev=1, q=1, x=0] [L708] 0 cur = next VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=1, i=2, j=3, next=1, p=1, prev=1, q=1, x=0] [L705] 0 x++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=1, i=2, j=3, next=1, p=1, prev=1, q=1, x=1] [L687] COND TRUE 1 p < 7 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=1, i=2, j=3, next=1, p=1, prev=1, q=1, x=1] [L689] 1 i = i + j VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=1, i=5, j=3, next=1, p=1, prev=1, q=1, x=1] [L687] 1 p++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=1, i=5, j=3, next=1, p=2, prev=1, q=1, x=1] [L695] COND TRUE 2 q < 7 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=1, i=5, j=3, next=1, p=2, prev=1, q=1, x=1] [L697] 2 j = j + i VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=1, i=5, j=8, next=1, p=2, prev=1, q=1, x=1] [L695] 2 q++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=1, i=5, j=8, next=1, p=2, prev=1, q=2, x=1] [L705] COND TRUE 0 x < 16 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=1, i=5, j=8, next=1, p=2, prev=1, q=2, x=1] [L706] 0 next = prev + cur VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=1, i=5, j=8, next=2, p=2, prev=1, q=2, x=1] [L707] 0 prev = cur VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=1, i=5, j=8, next=2, p=2, prev=1, q=2, x=1] [L708] 0 cur = next VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=2, i=5, j=8, next=2, p=2, prev=1, q=2, x=1] [L705] 0 x++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=2, i=5, j=8, next=2, p=2, prev=1, q=2, x=2] [L687] COND TRUE 1 p < 7 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=2, i=5, j=8, next=2, p=2, prev=1, q=2, x=2] [L689] 1 i = i + j VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=2, i=13, j=8, next=2, p=2, prev=1, q=2, x=2] [L687] 1 p++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=2, i=13, j=8, next=2, p=3, prev=1, q=2, x=2] [L695] COND TRUE 2 q < 7 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=2, i=13, j=8, next=2, p=3, prev=1, q=2, x=2] [L697] 2 j = j + i VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=2, i=13, j=21, next=2, p=3, prev=1, q=2, x=2] [L695] 2 q++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=2, i=13, j=21, next=2, p=3, prev=1, q=3, x=2] [L705] COND TRUE 0 x < 16 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=2, i=13, j=21, next=2, p=3, prev=1, q=3, x=2] [L706] 0 next = prev + cur VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=2, i=13, j=21, next=3, p=3, prev=1, q=3, x=2] [L707] 0 prev = cur VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=2, i=13, j=21, next=3, p=3, prev=2, q=3, x=2] [L708] 0 cur = next VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=3, i=13, j=21, next=3, p=3, prev=2, q=3, x=2] [L705] 0 x++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=3, i=13, j=21, next=3, p=3, prev=2, q=3, x=3] [L687] COND TRUE 1 p < 7 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=3, i=13, j=21, next=3, p=3, prev=2, q=3, x=3] [L689] 1 i = i + j VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=3, i=34, j=21, next=3, p=3, prev=2, q=3, x=3] [L687] 1 p++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=3, i=34, j=21, next=3, p=4, prev=2, q=3, x=3] [L695] COND TRUE 2 q < 7 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=3, i=34, j=21, next=3, p=4, prev=2, q=3, x=3] [L697] 2 j = j + i VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=3, i=34, j=55, next=3, p=4, prev=2, q=3, x=3] [L695] 2 q++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=3, i=34, j=55, next=3, p=4, prev=2, q=4, x=3] [L705] COND TRUE 0 x < 16 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=3, i=34, j=55, next=3, p=4, prev=2, q=4, x=3] [L706] 0 next = prev + cur VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=3, i=34, j=55, next=5, p=4, prev=2, q=4, x=3] [L707] 0 prev = cur VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=3, i=34, j=55, next=5, p=4, prev=3, q=4, x=3] [L708] 0 cur = next VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=5, i=34, j=55, next=5, p=4, prev=3, q=4, x=3] [L705] 0 x++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=5, i=34, j=55, next=5, p=4, prev=3, q=4, x=4] [L687] COND TRUE 1 p < 7 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=5, i=34, j=55, next=5, p=4, prev=3, q=4, x=4] [L689] 1 i = i + j VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=5, i=89, j=55, next=5, p=4, prev=3, q=4, x=4] [L687] 1 p++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=5, i=89, j=55, next=5, p=5, prev=3, q=4, x=4] [L695] COND TRUE 2 q < 7 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=5, i=89, j=55, next=5, p=5, prev=3, q=4, x=4] [L697] 2 j = j + i VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=5, i=89, j=144, next=5, p=5, prev=3, q=4, x=4] [L695] 2 q++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=5, i=89, j=144, next=5, p=5, prev=3, q=5, x=4] [L705] COND TRUE 0 x < 16 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=5, i=89, j=144, next=5, p=5, prev=3, q=5, x=4] [L706] 0 next = prev + cur VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=5, i=89, j=144, next=8, p=5, prev=3, q=5, x=4] [L707] 0 prev = cur VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=5, i=89, j=144, next=8, p=5, prev=5, q=5, x=4] [L708] 0 cur = next VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=8, i=89, j=144, next=8, p=5, prev=5, q=5, x=4] [L705] 0 x++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=8, i=89, j=144, next=8, p=5, prev=5, q=5, x=5] [L687] COND TRUE 1 p < 7 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=8, i=89, j=144, next=8, p=5, prev=5, q=5, x=5] [L689] 1 i = i + j VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=8, i=233, j=144, next=8, p=5, prev=5, q=5, x=5] [L687] 1 p++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=8, i=233, j=144, next=8, p=6, prev=5, q=5, x=5] [L695] COND TRUE 2 q < 7 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=8, i=233, j=144, next=8, p=6, prev=5, q=5, x=5] [L697] 2 j = j + i VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=8, i=233, j=377, next=8, p=6, prev=5, q=5, x=5] [L695] 2 q++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=8, i=233, j=377, next=8, p=6, prev=5, q=6, x=5] [L705] COND TRUE 0 x < 16 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=8, i=233, j=377, next=8, p=6, prev=5, q=6, x=5] [L706] 0 next = prev + cur VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=8, i=233, j=377, next=13, p=6, prev=5, q=6, x=5] [L707] 0 prev = cur VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=8, i=233, j=377, next=13, p=6, prev=8, q=6, x=5] [L708] 0 cur = next VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=13, i=233, j=377, next=13, p=6, prev=8, q=6, x=5] [L705] 0 x++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=13, i=233, j=377, next=13, p=6, prev=8, q=6, x=6] [L687] COND TRUE 1 p < 7 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=13, i=233, j=377, next=13, p=6, prev=8, q=6, x=6] [L689] 1 i = i + j VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=13, i=610, j=377, next=13, p=6, prev=8, q=6, x=6] [L687] 1 p++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=13, i=610, j=377, next=13, p=7, prev=8, q=6, x=6] [L695] COND TRUE 2 q < 7 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=13, i=610, j=377, next=13, p=7, prev=8, q=6, x=6] [L697] 2 j = j + i VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=13, i=610, j=987, next=13, p=7, prev=8, q=6, x=6] [L695] 2 q++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=13, i=610, j=987, next=13, p=7, prev=8, q=7, x=6] [L705] COND TRUE 0 x < 16 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=13, i=610, j=987, next=13, p=7, prev=8, q=7, x=6] [L706] 0 next = prev + cur VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=13, i=610, j=987, next=21, p=7, prev=8, q=7, x=6] [L707] 0 prev = cur VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=13, i=610, j=987, next=21, p=7, prev=13, q=7, x=6] [L708] 0 cur = next VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=21, i=610, j=987, next=21, p=7, prev=13, q=7, x=6] [L705] 0 x++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=21, i=610, j=987, next=21, p=7, prev=13, q=7, x=7] [L687] COND FALSE 1 !(p < 7) VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=21, i=610, j=987, next=21, p=7, prev=13, q=7, x=7] [L692] 1 return ((void *)0); VAL [\result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=21, i=610, j=987, next=21, p=7, prev=13, q=7, x=7] [L695] COND FALSE 2 !(q < 7) VAL [\result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=21, i=610, j=987, next=21, p=7, prev=13, q=7, x=7] [L700] 2 return ((void *)0); VAL [\result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=21, i=610, j=987, next=21, p=7, prev=13, q=7, x=7] [L705] COND TRUE 0 x < 16 VAL [\result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=21, i=610, j=987, next=21, p=7, prev=13, q=7, x=7] [L706] 0 next = prev + cur VAL [\result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=21, i=610, j=987, next=34, p=7, prev=13, q=7, x=7] [L707] 0 prev = cur VAL [\result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=21, i=610, j=987, next=34, p=7, prev=21, q=7, x=7] [L708] 0 cur = next VAL [\result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=34, i=610, j=987, next=34, p=7, prev=21, q=7, x=7] [L705] 0 x++ VAL [\result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=34, i=610, j=987, next=34, p=7, prev=21, q=7, x=8] [L705] COND TRUE 0 x < 16 VAL [\result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=34, i=610, j=987, next=34, p=7, prev=21, q=7, x=8] [L706] 0 next = prev + cur VAL [\result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=34, i=610, j=987, next=55, p=7, prev=21, q=7, x=8] [L707] 0 prev = cur VAL [\result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=34, i=610, j=987, next=55, p=7, prev=34, q=7, x=8] [L708] 0 cur = next VAL [\result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=55, i=610, j=987, next=55, p=7, prev=34, q=7, x=8] [L705] 0 x++ VAL [\result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=55, i=610, j=987, next=55, p=7, prev=34, q=7, x=9] [L705] COND TRUE 0 x < 16 VAL [\result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=55, i=610, j=987, next=55, p=7, prev=34, q=7, x=9] [L706] 0 next = prev + cur VAL [\result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=55, i=610, j=987, next=89, p=7, prev=34, q=7, x=9] [L707] 0 prev = cur VAL [\result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=55, i=610, j=987, next=89, p=7, prev=55, q=7, x=9] [L708] 0 cur = next VAL [\result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=89, i=610, j=987, next=89, p=7, prev=55, q=7, x=9] [L705] 0 x++ VAL [\result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=89, i=610, j=987, next=89, p=7, prev=55, q=7, x=10] [L705] COND TRUE 0 x < 16 VAL [\result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=89, i=610, j=987, next=89, p=7, prev=55, q=7, x=10] [L706] 0 next = prev + cur VAL [\result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=89, i=610, j=987, next=144, p=7, prev=55, q=7, x=10] [L707] 0 prev = cur VAL [\result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=89, i=610, j=987, next=144, p=7, prev=89, q=7, x=10] [L708] 0 cur = next VAL [\result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=144, i=610, j=987, next=144, p=7, prev=89, q=7, x=10] [L705] 0 x++ VAL [\result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=144, i=610, j=987, next=144, p=7, prev=89, q=7, x=11] [L705] COND TRUE 0 x < 16 VAL [\result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=144, i=610, j=987, next=144, p=7, prev=89, q=7, x=11] [L706] 0 next = prev + cur VAL [\result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=144, i=610, j=987, next=233, p=7, prev=89, q=7, x=11] [L707] 0 prev = cur VAL [\result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=144, i=610, j=987, next=233, p=7, prev=144, q=7, x=11] [L708] 0 cur = next VAL [\result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=233, i=610, j=987, next=233, p=7, prev=144, q=7, x=11] [L705] 0 x++ VAL [\result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=233, i=610, j=987, next=233, p=7, prev=144, q=7, x=12] [L705] COND TRUE 0 x < 16 VAL [\result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=233, i=610, j=987, next=233, p=7, prev=144, q=7, x=12] [L706] 0 next = prev + cur VAL [\result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=233, i=610, j=987, next=377, p=7, prev=144, q=7, x=12] [L707] 0 prev = cur VAL [\result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=233, i=610, j=987, next=377, p=7, prev=233, q=7, x=12] [L708] 0 cur = next VAL [\result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=377, i=610, j=987, next=377, p=7, prev=233, q=7, x=12] [L705] 0 x++ VAL [\result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=377, i=610, j=987, next=377, p=7, prev=233, q=7, x=13] [L705] COND TRUE 0 x < 16 VAL [\result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=377, i=610, j=987, next=377, p=7, prev=233, q=7, x=13] [L706] 0 next = prev + cur VAL [\result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=377, i=610, j=987, next=610, p=7, prev=233, q=7, x=13] [L707] 0 prev = cur VAL [\result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=377, i=610, j=987, next=610, p=7, prev=377, q=7, x=13] [L708] 0 cur = next VAL [\result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=610, i=610, j=987, next=610, p=7, prev=377, q=7, x=13] [L705] 0 x++ VAL [\result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=610, i=610, j=987, next=610, p=7, prev=377, q=7, x=14] [L705] COND TRUE 0 x < 16 VAL [\result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=610, i=610, j=987, next=610, p=7, prev=377, q=7, x=14] [L706] 0 next = prev + cur VAL [\result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=610, i=610, j=987, next=987, p=7, prev=377, q=7, x=14] [L707] 0 prev = cur VAL [\result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=610, i=610, j=987, next=987, p=7, prev=610, q=7, x=14] [L708] 0 cur = next VAL [\result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=987, i=610, j=987, next=987, p=7, prev=610, q=7, x=14] [L705] 0 x++ VAL [\result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=987, i=610, j=987, next=987, p=7, prev=610, q=7, x=15] [L705] COND TRUE 0 x < 16 VAL [\result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=987, i=610, j=987, next=987, p=7, prev=610, q=7, x=15] [L706] 0 next = prev + cur VAL [\result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=987, i=610, j=987, next=1597, p=7, prev=610, q=7, x=15] [L707] 0 prev = cur VAL [\result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=987, i=610, j=987, next=1597, p=7, prev=987, q=7, x=15] [L708] 0 cur = next VAL [\result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=1597, i=610, j=987, next=1597, p=7, prev=987, q=7, x=15] [L705] 0 x++ VAL [\result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=1597, i=610, j=987, next=1597, p=7, prev=987, q=7, x=16] [L705] COND FALSE 0 !(x < 16) VAL [\result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=1597, i=610, j=987, next=1597, p=7, prev=987, q=7, x=16] [L710] 0 return prev; VAL [\result=987, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=1597, i=610, j=987, next=1597, p=7, prev=987, q=7, x=16] [L722] RET, EXPR 0 fib() [L722] 0 int correct = fib(); VAL [\old(argc)=1598, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, argc=1598, argv={1599:1600}, correct=987, cur=1597, i=610, id1={5:0}, id2={3:0}, j=987, next=1597, p=7, prev=987, q=7, x=16] [L724] 0 _Bool assert_cond = i < correct && j < correct; VAL [\old(argc)=1598, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, argc=1598, argv={1599:1600}, assert_cond=0, correct=987, cur=1597, i=610, id1={5:0}, id2={3:0}, j=987, next=1597, p=7, prev=987, q=7, x=16] [L726] CALL 0 __VERIFIER_assert(assert_cond) [L681] COND TRUE 0 !expression VAL [\old(expression)=0, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=1597, expression=0, i=610, j=987, next=1597, p=7, prev=987, q=7, x=16] [L681] 0 reach_error() VAL [\old(expression)=0, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=1597, expression=0, i=610, j=987, next=1597, p=7, prev=987, q=7, x=16] - UnprovableResult [Line: 721]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 720]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 112 locations, 3 error locations. Started 1 CEGAR loops. OverallTime: 9.9s, OverallIterations: 8, TraceHistogramMax: 0, PathProgramHistogramMax: 10, EmptinessCheckTime: 3.8s, 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: 174, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 3.8s InterpolantComputationTime, 2290 NumberOfCodeBlocks, 2290 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 2641 ConstructedInterpolants, 0 QuantifiedInterpolants, 6129 SizeOfPredicates, 80 NumberOfNonLiveVariables, 1985 ConjunctsInSsa, 92 ConjunctsInUnsatCore, 17 InterpolantComputations, 3 PerfectInterpolantSequences, 979/6299 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: 1.8s, ConditionalCommutativityIAIntegrations: 0, ConditionalCommutativityDFSRestarts: 0, ConditionalCommutativityConditionCalculations: 22, ConditionalCommutativityTraceChecks: 22, ConditionalCommutativityImperfectProofs: 0 RESULT: Ultimate proved your program to be incorrect! [2024-05-06 04:53:30,375 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-06 04:53:30,559 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...