/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 NONE -tc ../benchexec/../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread/fib_unsafe-6.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-wip.dk.conditional-comm-17da818-m [2024-05-04 18:04:24,936 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-05-04 18:04:25,003 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../benchexec/../../../trunk/examples/settings/gemcutter/NewStatesSleep.epf [2024-05-04 18:04:25,008 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-05-04 18:04:25,008 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-05-04 18:04:25,033 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-05-04 18:04:25,034 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-05-04 18:04:25,034 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-05-04 18:04:25,035 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-05-04 18:04:25,038 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-05-04 18:04:25,038 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-05-04 18:04:25,038 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-05-04 18:04:25,038 INFO L153 SettingsManager]: * Use SBE=true [2024-05-04 18:04:25,040 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-05-04 18:04:25,040 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-05-04 18:04:25,040 INFO L153 SettingsManager]: * sizeof long=4 [2024-05-04 18:04:25,040 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-05-04 18:04:25,041 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-05-04 18:04:25,041 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-05-04 18:04:25,041 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-05-04 18:04:25,041 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-05-04 18:04:25,041 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-05-04 18:04:25,042 INFO L153 SettingsManager]: * sizeof long double=12 [2024-05-04 18:04:25,042 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-05-04 18:04:25,042 INFO L153 SettingsManager]: * Use constant arrays=true [2024-05-04 18:04:25,042 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-05-04 18:04:25,042 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-05-04 18:04:25,042 INFO L153 SettingsManager]: * To the following directory=./dump/ [2024-05-04 18:04:25,043 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-05-04 18:04:25,043 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-05-04 18:04:25,044 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-05-04 18:04:25,044 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-05-04 18:04:25,044 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-05-04 18:04:25,044 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-05-04 18:04:25,044 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=SLEEP_NEW_STATES [2024-05-04 18:04:25,044 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-05-04 18:04:25,045 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-05-04 18:04:25,045 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2024-05-04 18:04:25,045 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-05-04 18:04:25,045 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 -> NONE [2024-05-04 18:04:25,247 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-05-04 18:04:25,277 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-05-04 18:04:25,280 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-05-04 18:04:25,281 INFO L270 PluginConnector]: Initializing CDTParser... [2024-05-04 18:04:25,281 INFO L274 PluginConnector]: CDTParser initialized [2024-05-04 18:04:25,282 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/svcomp/pthread/fib_unsafe-6.i [2024-05-04 18:04:26,404 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-05-04 18:04:26,603 INFO L384 CDTParser]: Found 1 translation units. [2024-05-04 18:04:26,604 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread/fib_unsafe-6.i [2024-05-04 18:04:26,615 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/4bcc68789/89869dbf886a43a4b87e0094cc80ff39/FLAGc55abc182 [2024-05-04 18:04:26,626 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/4bcc68789/89869dbf886a43a4b87e0094cc80ff39 [2024-05-04 18:04:26,628 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-05-04 18:04:26,630 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-05-04 18:04:26,631 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-05-04 18:04:26,631 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-05-04 18:04:26,635 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-05-04 18:04:26,636 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.05 06:04:26" (1/1) ... [2024-05-04 18:04:26,637 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@47b111fc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 06:04:26, skipping insertion in model container [2024-05-04 18:04:26,637 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.05 06:04:26" (1/1) ... [2024-05-04 18:04:26,671 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-05-04 18:04:26,909 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-6.i[30243,30256] [2024-05-04 18:04:26,931 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-05-04 18:04:26,941 INFO L202 MainTranslator]: Completed pre-run [2024-05-04 18:04:26,969 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-6.i[30243,30256] [2024-05-04 18:04:26,974 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-05-04 18:04:26,991 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2024-05-04 18:04:26,991 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2024-05-04 18:04:26,997 INFO L206 MainTranslator]: Completed translation [2024-05-04 18:04:26,997 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 06:04:26 WrapperNode [2024-05-04 18:04:26,998 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-05-04 18:04:26,998 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-05-04 18:04:26,998 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-05-04 18:04:26,999 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-05-04 18:04:27,004 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 06:04:26" (1/1) ... [2024-05-04 18:04:27,012 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 06:04:26" (1/1) ... [2024-05-04 18:04:27,045 INFO L138 Inliner]: procedures = 165, calls = 28, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 74 [2024-05-04 18:04:27,045 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-05-04 18:04:27,046 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-05-04 18:04:27,046 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-05-04 18:04:27,046 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-05-04 18:04:27,057 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 06:04:26" (1/1) ... [2024-05-04 18:04:27,057 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 06:04:26" (1/1) ... [2024-05-04 18:04:27,060 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 06:04:26" (1/1) ... [2024-05-04 18:04:27,060 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 06:04:26" (1/1) ... [2024-05-04 18:04:27,063 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 06:04:26" (1/1) ... [2024-05-04 18:04:27,066 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 06:04:26" (1/1) ... [2024-05-04 18:04:27,067 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 06:04:26" (1/1) ... [2024-05-04 18:04:27,068 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 06:04:26" (1/1) ... [2024-05-04 18:04:27,071 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-05-04 18:04:27,072 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-05-04 18:04:27,072 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-05-04 18:04:27,072 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-05-04 18:04:27,073 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 06:04:26" (1/1) ... [2024-05-04 18:04:27,078 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-05-04 18:04:27,103 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-04 18:04:27,117 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-04 18:04:27,154 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-04 18:04:27,174 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2024-05-04 18:04:27,174 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2024-05-04 18:04:27,174 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2024-05-04 18:04:27,174 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2024-05-04 18:04:27,175 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-05-04 18:04:27,175 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-05-04 18:04:27,175 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-05-04 18:04:27,175 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-05-04 18:04:27,175 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-05-04 18:04:27,175 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-05-04 18:04:27,175 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-05-04 18:04:27,175 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-05-04 18:04:27,175 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-05-04 18:04:27,176 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-05-04 18:04:27,276 INFO L241 CfgBuilder]: Building ICFG [2024-05-04 18:04:27,277 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2024-05-04 18:04:27,419 INFO L282 CfgBuilder]: Performing block encoding [2024-05-04 18:04:27,427 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-05-04 18:04:27,427 INFO L309 CfgBuilder]: Removed 3 assume(true) statements. [2024-05-04 18:04:27,429 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.05 06:04:27 BoogieIcfgContainer [2024-05-04 18:04:27,429 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-05-04 18:04:27,430 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-05-04 18:04:27,430 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-05-04 18:04:27,437 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-05-04 18:04:27,437 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.05 06:04:26" (1/3) ... [2024-05-04 18:04:27,438 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d3fb0ea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.05 06:04:27, skipping insertion in model container [2024-05-04 18:04:27,438 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 06:04:26" (2/3) ... [2024-05-04 18:04:27,438 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d3fb0ea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.05 06:04:27, skipping insertion in model container [2024-05-04 18:04:27,438 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.05 06:04:27" (3/3) ... [2024-05-04 18:04:27,439 INFO L112 eAbstractionObserver]: Analyzing ICFG fib_unsafe-6.i [2024-05-04 18:04:27,446 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2024-05-04 18:04:27,453 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-05-04 18:04:27,453 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-05-04 18:04:27,453 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-05-04 18:04:27,529 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-05-04 18:04:27,566 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-04 18:04:27,567 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-05-04 18:04:27,567 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-04 18:04:27,568 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-04 18:04:27,569 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-04 18:04:27,594 INFO L188 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-05-04 18:04:27,601 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-05-04 18:04:27,607 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;@23cd1471, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms], mConComChecker=NONE, mConComCheckerCriterion=DEFAULT, mConComCheckerLimitedChecksCriterion=false, mConComCheckerCriterionLimit=1, mConComCheckerRandomProb=100, mConComCheckerRandomSeed=123, mConComCheckerConditionCriterion=false [2024-05-04 18:04:27,608 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2024-05-04 18:04:27,842 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-04 18:04:27,845 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-04 18:04:27,846 INFO L85 PathProgramCache]: Analyzing trace with hash -1184059601, now seen corresponding path program 1 times [2024-05-04 18:04:27,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-04 18:04:27,853 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [771949061] [2024-05-04 18:04:27,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-04 18:04:27,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-04 18:04:28,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-04 18:04:28,455 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-04 18:04:28,456 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-04 18:04:28,456 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [771949061] [2024-05-04 18:04:28,457 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [771949061] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-04 18:04:28,457 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-04 18:04:28,457 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-05-04 18:04:28,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1172539883] [2024-05-04 18:04:28,459 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-04 18:04:28,469 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-05-04 18:04:28,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-04 18:04:28,491 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-05-04 18:04:28,492 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-05-04 18:04:28,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-04 18:04:28,494 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-04 18:04:28,495 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-04 18:04:28,495 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-04 18:04:28,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-05-04 18:04:28,566 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-05-04 18:04:28,566 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-04 18:04:28,569 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-04 18:04:28,569 INFO L85 PathProgramCache]: Analyzing trace with hash 546730109, now seen corresponding path program 1 times [2024-05-04 18:04:28,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-04 18:04:28,570 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1041774647] [2024-05-04 18:04:28,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-04 18:04:28,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-04 18:04:28,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-04 18:04:28,765 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-04 18:04:28,766 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-04 18:04:28,766 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1041774647] [2024-05-04 18:04:28,766 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1041774647] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-04 18:04:28,766 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [572482064] [2024-05-04 18:04:28,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-04 18:04:28,767 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-04 18:04:28,767 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-04 18:04:28,816 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-04 18:04:28,818 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-04 18:04:28,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-04 18:04:28,931 INFO L262 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 4 conjunts are in the unsatisfiable core [2024-05-04 18:04:28,940 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-04 18:04:29,037 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-04 18:04:29,037 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-04 18:04:29,117 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-04 18:04:29,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [572482064] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-04 18:04:29,118 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-04 18:04:29,118 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2024-05-04 18:04:29,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2119826195] [2024-05-04 18:04:29,119 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-04 18:04:29,120 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-05-04 18:04:29,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-04 18:04:29,123 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-05-04 18:04:29,123 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2024-05-04 18:04:29,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-04 18:04:29,124 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-04 18:04:29,124 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-04 18:04:29,124 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-05-04 18:04:29,125 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-04 18:04:29,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-05-04 18:04:29,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-04 18:04:29,240 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-04 18:04:29,440 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,SelfDestructingSolverStorable1 [2024-05-04 18:04:29,440 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-04 18:04:29,442 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-04 18:04:29,442 INFO L85 PathProgramCache]: Analyzing trace with hash -872570179, now seen corresponding path program 2 times [2024-05-04 18:04:29,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-04 18:04:29,443 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2131770168] [2024-05-04 18:04:29,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-04 18:04:29,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-04 18:04:29,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-04 18:04:29,742 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-04 18:04:29,742 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-04 18:04:29,743 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2131770168] [2024-05-04 18:04:29,743 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2131770168] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-04 18:04:29,745 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [706030849] [2024-05-04 18:04:29,746 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-05-04 18:04:29,746 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-04 18:04:29,746 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-04 18:04:29,762 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-04 18:04:29,788 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-04 18:04:29,860 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-05-04 18:04:29,861 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-05-04 18:04:29,862 INFO L262 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 8 conjunts are in the unsatisfiable core [2024-05-04 18:04:29,868 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-04 18:04:29,966 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-04 18:04:29,966 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-04 18:04:30,078 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-04 18:04:30,079 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [706030849] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-04 18:04:30,079 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-04 18:04:30,079 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 18 [2024-05-04 18:04:30,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [157679000] [2024-05-04 18:04:30,079 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-04 18:04:30,080 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-05-04 18:04:30,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-04 18:04:30,081 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-05-04 18:04:30,081 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2024-05-04 18:04:30,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-04 18:04:30,081 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-04 18:04:30,082 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-04 18:04:30,082 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-05-04 18:04:30,082 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-05-04 18:04:30,082 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-04 18:04:30,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-05-04 18:04:30,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-04 18:04:30,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-05-04 18:04:30,241 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-04 18:04:30,432 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-04 18:04:30,433 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-04 18:04:30,433 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-04 18:04:30,433 INFO L85 PathProgramCache]: Analyzing trace with hash 328881981, now seen corresponding path program 3 times [2024-05-04 18:04:30,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-04 18:04:30,433 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1958414780] [2024-05-04 18:04:30,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-04 18:04:30,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-04 18:04:30,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-04 18:04:30,834 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-04 18:04:30,835 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-04 18:04:30,835 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1958414780] [2024-05-04 18:04:30,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1958414780] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-04 18:04:30,835 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1070857947] [2024-05-04 18:04:30,836 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-05-04 18:04:30,836 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-04 18:04:30,836 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-04 18:04:30,837 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-04 18:04:30,845 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-04 18:04:30,940 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2024-05-04 18:04:30,940 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-05-04 18:04:30,942 INFO L262 TraceCheckSpWp]: Trace formula consists of 358 conjuncts, 16 conjunts are in the unsatisfiable core [2024-05-04 18:04:30,945 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-04 18:04:31,239 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-04 18:04:31,239 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-05-04 18:04:31,239 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1070857947] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-04 18:04:31,239 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-05-04 18:04:31,240 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [17] total 32 [2024-05-04 18:04:31,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [94798040] [2024-05-04 18:04:31,240 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-04 18:04:31,240 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-05-04 18:04:31,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-04 18:04:31,241 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-05-04 18:04:31,242 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=159, Invalid=833, Unknown=0, NotChecked=0, Total=992 [2024-05-04 18:04:31,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-04 18:04:31,242 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-04 18:04:31,242 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-04 18:04:31,242 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-05-04 18:04:31,242 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-05-04 18:04:31,242 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2024-05-04 18:04:31,242 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-04 18:04:31,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-05-04 18:04:31,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-04 18:04:31,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-05-04 18:04:31,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-05-04 18:04:31,451 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-04 18:04:31,650 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-04 18:04:31,651 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-04 18:04:31,651 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-04 18:04:31,651 INFO L85 PathProgramCache]: Analyzing trace with hash 1219746159, now seen corresponding path program 1 times [2024-05-04 18:04:31,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-04 18:04:31,651 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1911254870] [2024-05-04 18:04:31,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-04 18:04:31,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-04 18:04:31,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-04 18:04:32,040 INFO L134 CoverageAnalysis]: Checked inductivity of 375 backedges. 0 proven. 375 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-04 18:04:32,040 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-04 18:04:32,040 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1911254870] [2024-05-04 18:04:32,040 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1911254870] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-04 18:04:32,043 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1621513769] [2024-05-04 18:04:32,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-04 18:04:32,044 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-04 18:04:32,044 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-04 18:04:32,045 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-04 18:04:32,084 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-04 18:04:32,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-04 18:04:32,152 INFO L262 TraceCheckSpWp]: Trace formula consists of 348 conjuncts, 14 conjunts are in the unsatisfiable core [2024-05-04 18:04:32,160 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-04 18:04:32,425 INFO L134 CoverageAnalysis]: Checked inductivity of 375 backedges. 370 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-05-04 18:04:32,425 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-05-04 18:04:32,425 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1621513769] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-04 18:04:32,426 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-05-04 18:04:32,426 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [17] total 30 [2024-05-04 18:04:32,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2115407616] [2024-05-04 18:04:32,437 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-04 18:04:32,437 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-05-04 18:04:32,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-04 18:04:32,438 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-05-04 18:04:32,438 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=142, Invalid=728, Unknown=0, NotChecked=0, Total=870 [2024-05-04 18:04:32,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-04 18:04:32,438 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-04 18:04:32,438 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 11.466666666666667) internal successors, (172), 15 states have internal predecessors, (172), 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-04 18:04:32,438 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-05-04 18:04:32,438 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-05-04 18:04:32,439 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2024-05-04 18:04:32,439 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2024-05-04 18:04:32,439 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-04 18:04:32,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-05-04 18:04:32,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-04 18:04:32,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-05-04 18:04:32,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-05-04 18:04:32,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-05-04 18:04:32,683 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-04 18:04:32,881 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,6 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-04 18:04:32,881 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-04 18:04:32,881 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-04 18:04:32,882 INFO L85 PathProgramCache]: Analyzing trace with hash 1601501288, now seen corresponding path program 1 times [2024-05-04 18:04:32,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-04 18:04:32,882 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1193840150] [2024-05-04 18:04:32,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-04 18:04:32,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-04 18:04:32,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-04 18:04:33,156 INFO L134 CoverageAnalysis]: Checked inductivity of 316 backedges. 0 proven. 316 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-04 18:04:33,156 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-04 18:04:33,156 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1193840150] [2024-05-04 18:04:33,156 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1193840150] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-04 18:04:33,156 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [418641581] [2024-05-04 18:04:33,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-04 18:04:33,157 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-04 18:04:33,157 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-04 18:04:33,158 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-04 18:04:33,160 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-04 18:04:33,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-04 18:04:33,254 INFO L262 TraceCheckSpWp]: Trace formula consists of 338 conjuncts, 16 conjunts are in the unsatisfiable core [2024-05-04 18:04:33,256 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-04 18:04:33,359 INFO L134 CoverageAnalysis]: Checked inductivity of 316 backedges. 0 proven. 316 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-04 18:04:33,359 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-04 18:04:33,685 INFO L134 CoverageAnalysis]: Checked inductivity of 316 backedges. 0 proven. 316 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-04 18:04:33,685 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [418641581] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-04 18:04:33,685 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-04 18:04:33,685 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 31 [2024-05-04 18:04:33,685 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1756074813] [2024-05-04 18:04:33,685 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-04 18:04:33,686 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2024-05-04 18:04:33,686 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-04 18:04:33,687 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2024-05-04 18:04:33,687 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=255, Invalid=675, Unknown=0, NotChecked=0, Total=930 [2024-05-04 18:04:33,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-04 18:04:33,687 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-04 18:04:33,687 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 9.548387096774194) internal successors, (296), 31 states have internal predecessors, (296), 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-04 18:04:33,688 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-05-04 18:04:33,688 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-05-04 18:04:33,688 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2024-05-04 18:04:33,688 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2024-05-04 18:04:33,688 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2024-05-04 18:04:33,688 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-04 18:04:34,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-05-04 18:04:34,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-04 18:04:34,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-05-04 18:04:34,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-05-04 18:04:34,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-05-04 18:04:34,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2024-05-04 18:04:34,069 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-04 18:04:34,263 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,7 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-04 18:04:34,264 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-04 18:04:34,264 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-04 18:04:34,264 INFO L85 PathProgramCache]: Analyzing trace with hash 1442077135, now seen corresponding path program 2 times [2024-05-04 18:04:34,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-04 18:04:34,265 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [210527994] [2024-05-04 18:04:34,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-04 18:04:34,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-04 18:04:34,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-04 18:04:34,310 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-04 18:04:34,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-04 18:04:34,448 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-05-04 18:04:34,448 INFO L363 BasicCegarLoop]: Counterexample is feasible [2024-05-04 18:04:34,449 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2024-05-04 18:04:34,450 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 3 remaining) [2024-05-04 18:04:34,451 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2024-05-04 18:04:34,451 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-05-04 18:04:34,458 INFO L448 BasicCegarLoop]: Path program histogram: [3, 2, 1, 1] [2024-05-04 18:04:34,463 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-05-04 18:04:34,463 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2024-05-04 18:04:34,536 WARN L1576 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre4 could not be translated [2024-05-04 18:04:34,541 WARN L1576 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre6 could not be translated [2024-05-04 18:04:34,558 WARN L1576 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ret8 could not be translated [2024-05-04 18:04:34,577 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.05 06:04:34 BasicIcfg [2024-05-04 18:04:34,577 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-05-04 18:04:34,577 INFO L158 Benchmark]: Toolchain (without parser) took 7947.61ms. Allocated memory was 163.6MB in the beginning and 306.2MB in the end (delta: 142.6MB). Free memory was 94.7MB in the beginning and 141.2MB in the end (delta: -46.5MB). Peak memory consumption was 97.8MB. Max. memory is 8.0GB. [2024-05-04 18:04:34,577 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 163.6MB. Free memory is still 102.4MB. There was no memory consumed. Max. memory is 8.0GB. [2024-05-04 18:04:34,577 INFO L158 Benchmark]: CACSL2BoogieTranslator took 367.16ms. Allocated memory is still 163.6MB. Free memory was 94.4MB in the beginning and 124.8MB in the end (delta: -30.3MB). Peak memory consumption was 15.6MB. Max. memory is 8.0GB. [2024-05-04 18:04:34,578 INFO L158 Benchmark]: Boogie Procedure Inliner took 47.11ms. Allocated memory is still 163.6MB. Free memory was 124.3MB in the beginning and 122.7MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2024-05-04 18:04:34,578 INFO L158 Benchmark]: Boogie Preprocessor took 25.40ms. Allocated memory is still 163.6MB. Free memory was 122.7MB in the beginning and 121.1MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2024-05-04 18:04:34,578 INFO L158 Benchmark]: RCFGBuilder took 356.76ms. Allocated memory is still 163.6MB. Free memory was 121.1MB in the beginning and 106.4MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. [2024-05-04 18:04:34,578 INFO L158 Benchmark]: TraceAbstraction took 7146.48ms. Allocated memory was 163.6MB in the beginning and 306.2MB in the end (delta: 142.6MB). Free memory was 105.4MB in the beginning and 141.2MB in the end (delta: -35.8MB). Peak memory consumption was 106.3MB. Max. memory is 8.0GB. [2024-05-04 18:04:34,579 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.09ms. Allocated memory is still 163.6MB. Free memory is still 102.4MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 367.16ms. Allocated memory is still 163.6MB. Free memory was 94.4MB in the beginning and 124.8MB in the end (delta: -30.3MB). Peak memory consumption was 15.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 47.11ms. Allocated memory is still 163.6MB. Free memory was 124.3MB in the beginning and 122.7MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 25.40ms. Allocated memory is still 163.6MB. Free memory was 122.7MB in the beginning and 121.1MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 356.76ms. Allocated memory is still 163.6MB. Free memory was 121.1MB in the beginning and 106.4MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. * TraceAbstraction took 7146.48ms. Allocated memory was 163.6MB in the beginning and 306.2MB in the end (delta: 142.6MB). Free memory was 105.4MB in the beginning and 141.2MB in the end (delta: -35.8MB). Peak memory consumption was 106.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: 13196, independent: 11133, independent conditional: 11133, independent unconditional: 0, dependent: 2063, dependent conditional: 2063, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 11155, independent: 11133, independent conditional: 11133, independent unconditional: 0, dependent: 22, dependent conditional: 22, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ ConditionTransformingIndependenceRelation.Independence Queries: [ total: 11155, independent: 11133, independent conditional: 11133, independent unconditional: 0, dependent: 22, dependent conditional: 22, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 11155, independent: 11133, independent conditional: 11133, independent unconditional: 0, dependent: 22, dependent conditional: 22, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 11187, independent: 11133, independent conditional: 0, independent unconditional: 11133, dependent: 54, dependent conditional: 10, dependent unconditional: 44, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 11187, independent: 11133, independent conditional: 0, independent unconditional: 11133, dependent: 54, dependent conditional: 0, dependent unconditional: 54, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 11187, independent: 11133, independent conditional: 0, independent unconditional: 11133, dependent: 54, dependent conditional: 0, dependent unconditional: 54, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 474, independent: 472, independent conditional: 0, independent unconditional: 472, 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: 474, independent: 472, independent conditional: 0, independent unconditional: 472, 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: 32, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 32, dependent conditional: 0, dependent unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 11187, independent: 10661, independent conditional: 0, independent unconditional: 10661, dependent: 52, dependent conditional: 0, dependent unconditional: 52, unknown: 474, unknown conditional: 0, unknown unconditional: 474] , Statistics on independence cache: Total cache size (in pairs): 474, Positive cache size: 472, Positive conditional cache size: 0, Positive unconditional cache size: 472, 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: 10, Maximal queried relation: 1, ConditionTransformingIndependenceRelation.Independence Queries: [ total: 11187, independent: 11133, independent conditional: 0, independent unconditional: 11133, dependent: 54, dependent conditional: 10, dependent unconditional: 44, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 11187, independent: 11133, independent conditional: 0, independent unconditional: 11133, dependent: 54, dependent conditional: 0, dependent unconditional: 54, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 11187, independent: 11133, independent conditional: 0, independent unconditional: 11133, dependent: 54, dependent conditional: 0, dependent unconditional: 54, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 474, independent: 472, independent conditional: 0, independent unconditional: 472, 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: 474, independent: 472, independent conditional: 0, independent unconditional: 472, 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: 32, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 32, dependent conditional: 0, dependent unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 11187, independent: 10661, independent conditional: 0, independent unconditional: 10661, dependent: 52, dependent conditional: 0, dependent unconditional: 52, unknown: 474, unknown conditional: 0, unknown unconditional: 474] , Statistics on independence cache: Total cache size (in pairs): 474, Positive cache size: 472, Positive conditional cache size: 0, Positive unconditional cache size: 472, 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: 10 ], Independence queries for same thread: 2041 - 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)=611, argc=611, argv={612:613}, 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)=611, argc=611, argv={612:613}, 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)=611, argc=611, argv={612:613}, 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)=611, arg={0:0}, argc=611, argv={612:613}, 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)=611, arg={0:0}, arg={0:0}, arg={0:0}, argc=611, argv={612:613}, 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 < 6 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 < 6 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 < 14 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 < 6 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 < 6 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 < 14 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 < 6 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 < 6 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 < 14 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 < 6 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 < 6 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 < 14 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 < 6 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 < 6 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 < 14 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 < 6 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 < 6 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 < 14 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 FALSE 1 !(p < 6) 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] [L692] 1 return ((void *)0); VAL [\result={0:0}, 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] [L695] COND FALSE 2 !(q < 6) VAL [\result={0:0}, 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] [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=13, i=233, j=377, next=13, p=6, prev=8, q=6, x=6] [L705] COND TRUE 0 x < 14 VAL [\result={0:0}, \result={0:0}, 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] [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=13, i=233, j=377, next=21, p=6, prev=8, q=6, x=6] [L707] 0 prev = cur VAL [\result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=13, i=233, j=377, next=21, p=6, prev=13, q=6, x=6] [L708] 0 cur = next VAL [\result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=21, i=233, j=377, next=21, p=6, prev=13, q=6, x=6] [L705] 0 x++ VAL [\result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=21, i=233, j=377, next=21, p=6, prev=13, q=6, x=7] [L705] COND TRUE 0 x < 14 VAL [\result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=21, i=233, j=377, next=21, p=6, prev=13, q=6, 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=233, j=377, next=34, p=6, prev=13, q=6, 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=233, j=377, next=34, p=6, prev=21, q=6, 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=233, j=377, next=34, p=6, prev=21, q=6, 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=233, j=377, next=34, p=6, prev=21, q=6, x=8] [L705] COND TRUE 0 x < 14 VAL [\result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=34, i=233, j=377, next=34, p=6, prev=21, q=6, 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=233, j=377, next=55, p=6, prev=21, q=6, 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=233, j=377, next=55, p=6, prev=34, q=6, 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=233, j=377, next=55, p=6, prev=34, q=6, 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=233, j=377, next=55, p=6, prev=34, q=6, x=9] [L705] COND TRUE 0 x < 14 VAL [\result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=55, i=233, j=377, next=55, p=6, prev=34, q=6, 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=233, j=377, next=89, p=6, prev=34, q=6, 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=233, j=377, next=89, p=6, prev=55, q=6, 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=233, j=377, next=89, p=6, prev=55, q=6, 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=233, j=377, next=89, p=6, prev=55, q=6, x=10] [L705] COND TRUE 0 x < 14 VAL [\result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=89, i=233, j=377, next=89, p=6, prev=55, q=6, 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=233, j=377, next=144, p=6, prev=55, q=6, 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=233, j=377, next=144, p=6, prev=89, q=6, 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=233, j=377, next=144, p=6, prev=89, q=6, 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=233, j=377, next=144, p=6, prev=89, q=6, x=11] [L705] COND TRUE 0 x < 14 VAL [\result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=144, i=233, j=377, next=144, p=6, prev=89, q=6, 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=233, j=377, next=233, p=6, prev=89, q=6, 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=233, j=377, next=233, p=6, prev=144, q=6, 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=233, j=377, next=233, p=6, prev=144, q=6, 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=233, j=377, next=233, p=6, prev=144, q=6, x=12] [L705] COND TRUE 0 x < 14 VAL [\result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=233, i=233, j=377, next=233, p=6, prev=144, q=6, 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=233, j=377, next=377, p=6, prev=144, q=6, 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=233, j=377, next=377, p=6, prev=233, q=6, 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=233, j=377, next=377, p=6, prev=233, q=6, 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=233, j=377, next=377, p=6, prev=233, q=6, x=13] [L705] COND TRUE 0 x < 14 VAL [\result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=377, i=233, j=377, next=377, p=6, prev=233, q=6, 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=233, j=377, next=610, p=6, prev=233, q=6, 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=233, j=377, next=610, p=6, prev=377, q=6, 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=233, j=377, next=610, p=6, prev=377, q=6, 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=233, j=377, next=610, p=6, prev=377, q=6, x=14] [L705] COND FALSE 0 !(x < 14) VAL [\result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=610, i=233, j=377, next=610, p=6, prev=377, q=6, x=14] [L710] 0 return prev; VAL [\result=377, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=610, i=233, j=377, next=610, p=6, prev=377, q=6, x=14] [L722] RET, EXPR 0 fib() [L722] 0 int correct = fib(); VAL [\old(argc)=611, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, argc=611, argv={612:613}, correct=377, cur=610, i=233, id1={5:0}, id2={3:0}, j=377, next=610, p=6, prev=377, q=6, x=14] [L724] 0 _Bool assert_cond = i < correct && j < correct; VAL [\old(argc)=611, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, argc=611, argv={612:613}, assert_cond=0, correct=377, cur=610, i=233, id1={5:0}, id2={3:0}, j=377, next=610, p=6, prev=377, q=6, x=14] [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=610, expression=0, i=233, j=377, next=610, p=6, prev=377, q=6, x=14] [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=610, expression=0, i=233, j=377, next=610, p=6, prev=377, q=6, x=14] - 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: 6.9s, OverallIterations: 7, TraceHistogramMax: 0, PathProgramHistogramMax: 3, EmptinessCheckTime: 1.4s, 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: 117, 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.4s SatisfiabilityAnalysisTime, 3.2s InterpolantComputationTime, 1730 NumberOfCodeBlocks, 1730 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 1863 ConstructedInterpolants, 0 QuantifiedInterpolants, 4119 SizeOfPredicates, 48 NumberOfNonLiveVariables, 1480 ConjunctsInSsa, 58 ConjunctsInUnsatCore, 14 InterpolantComputations, 3 PerfectInterpolantSequences, 809/2851 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: 0.0s, ConditionalCommutativityIAIntegrations: 0, ConditionalCommutativityDFSRestarts: 0, ConditionalCommutativityConditionCalculations: 0, ConditionalCommutativityTraceChecks: 0, ConditionalCommutativityImperfectProofs: 0 RESULT: Ultimate proved your program to be incorrect! [2024-05-04 18:04:34,608 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Ended with exit code 0 [2024-05-04 18:04:34,798 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...