/root/.sdkman/candidates/java/current/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../benchexec/../../../trunk/examples/settings/gemcutter/NewStatesSleep.epf --traceabstraction.dfs.order.used.in.por LOOP_LOCKSTEP --traceabstraction.additional.conditional.commutativity.checking DFS --traceabstraction.criterion.for.conditional.commutativity.checking RANDOM --traceabstraction.probability.for.random.criterion 20 --traceabstraction.seed.for.random.criterion 546 -tc ../benchexec/../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-ext/04_incdec_cas.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-wip.dk.conditional-comm-3774817-m [2024-04-05 07:07:51,206 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-04-05 07:07:51,249 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../benchexec/../../../trunk/examples/settings/gemcutter/NewStatesSleep.epf [2024-04-05 07:07:51,252 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-04-05 07:07:51,253 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-04-05 07:07:51,267 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-04-05 07:07:51,267 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-04-05 07:07:51,268 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-04-05 07:07:51,268 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-04-05 07:07:51,271 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-04-05 07:07:51,271 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-04-05 07:07:51,271 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-04-05 07:07:51,272 INFO L153 SettingsManager]: * Use SBE=true [2024-04-05 07:07:51,272 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-04-05 07:07:51,273 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-04-05 07:07:51,273 INFO L153 SettingsManager]: * sizeof long=4 [2024-04-05 07:07:51,273 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-04-05 07:07:51,273 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-04-05 07:07:51,273 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-04-05 07:07:51,273 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-04-05 07:07:51,274 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-04-05 07:07:51,274 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-04-05 07:07:51,274 INFO L153 SettingsManager]: * sizeof long double=12 [2024-04-05 07:07:51,274 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-04-05 07:07:51,275 INFO L153 SettingsManager]: * Use constant arrays=true [2024-04-05 07:07:51,275 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-04-05 07:07:51,275 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-04-05 07:07:51,275 INFO L153 SettingsManager]: * To the following directory=./dump/ [2024-04-05 07:07:51,289 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-04-05 07:07:51,290 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-04-05 07:07:51,291 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-04-05 07:07:51,291 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-04-05 07:07:51,291 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-04-05 07:07:51,291 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-04-05 07:07:51,291 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=SLEEP_NEW_STATES [2024-04-05 07:07:51,291 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-04-05 07:07:51,291 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-04-05 07:07:51,291 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2024-04-05 07:07:51,291 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-04-05 07:07:51,292 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: DFS Order used in POR -> LOOP_LOCKSTEP Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Additional conditional commutativity checking -> DFS Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Criterion for conditional commutativity checking -> RANDOM Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: probability for random criterion as percentage -> 20 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: seed for random criterion -> 546 [2024-04-05 07:07:51,505 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-04-05 07:07:51,529 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-04-05 07:07:51,531 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-04-05 07:07:51,532 INFO L270 PluginConnector]: Initializing CDTParser... [2024-04-05 07:07:51,532 INFO L274 PluginConnector]: CDTParser initialized [2024-04-05 07:07:51,533 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/svcomp/pthread-ext/04_incdec_cas.i [2024-04-05 07:07:52,592 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-04-05 07:07:52,788 INFO L384 CDTParser]: Found 1 translation units. [2024-04-05 07:07:52,788 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-ext/04_incdec_cas.i [2024-04-05 07:07:52,801 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/2500d58c1/8b13bad4891c41a5b55f9554cb53c3e1/FLAGc5754d7b2 [2024-04-05 07:07:52,811 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/2500d58c1/8b13bad4891c41a5b55f9554cb53c3e1 [2024-04-05 07:07:52,812 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-04-05 07:07:52,813 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-04-05 07:07:52,815 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-04-05 07:07:52,816 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-04-05 07:07:52,819 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-04-05 07:07:52,820 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.04 07:07:52" (1/1) ... [2024-04-05 07:07:52,821 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3aa72ae8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 07:07:52, skipping insertion in model container [2024-04-05 07:07:52,821 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.04 07:07:52" (1/1) ... [2024-04-05 07:07:52,867 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-04-05 07:07:53,091 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-ext/04_incdec_cas.i[30285,30298] [2024-04-05 07:07:53,098 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-ext/04_incdec_cas.i[30729,30742] [2024-04-05 07:07:53,102 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-04-05 07:07:53,112 INFO L202 MainTranslator]: Completed pre-run [2024-04-05 07:07:53,143 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-ext/04_incdec_cas.i[30285,30298] [2024-04-05 07:07:53,146 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-ext/04_incdec_cas.i[30729,30742] [2024-04-05 07:07:53,155 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-04-05 07:07:53,180 INFO L206 MainTranslator]: Completed translation [2024-04-05 07:07:53,180 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 07:07:53 WrapperNode [2024-04-05 07:07:53,181 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-04-05 07:07:53,181 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-04-05 07:07:53,181 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-04-05 07:07:53,182 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-04-05 07:07:53,186 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 07:07:53" (1/1) ... [2024-04-05 07:07:53,205 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 07:07:53" (1/1) ... [2024-04-05 07:07:53,224 INFO L138 Inliner]: procedures = 172, calls = 43, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 158 [2024-04-05 07:07:53,224 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-04-05 07:07:53,224 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-04-05 07:07:53,225 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-04-05 07:07:53,225 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-04-05 07:07:53,230 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 07:07:53" (1/1) ... [2024-04-05 07:07:53,230 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 07:07:53" (1/1) ... [2024-04-05 07:07:53,232 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 07:07:53" (1/1) ... [2024-04-05 07:07:53,232 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 07:07:53" (1/1) ... [2024-04-05 07:07:53,236 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 07:07:53" (1/1) ... [2024-04-05 07:07:53,239 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 07:07:53" (1/1) ... [2024-04-05 07:07:53,240 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 07:07:53" (1/1) ... [2024-04-05 07:07:53,241 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 07:07:53" (1/1) ... [2024-04-05 07:07:53,248 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-04-05 07:07:53,248 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-04-05 07:07:53,249 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-04-05 07:07:53,249 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-04-05 07:07:53,249 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 07:07:53" (1/1) ... [2024-04-05 07:07:53,271 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-04-05 07:07:53,289 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-04-05 07:07:53,301 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-04-05 07:07:53,302 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-04-05 07:07:53,335 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-04-05 07:07:53,335 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2024-04-05 07:07:53,335 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2024-04-05 07:07:53,335 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-04-05 07:07:53,336 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-04-05 07:07:53,336 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-04-05 07:07:53,336 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-04-05 07:07:53,336 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-04-05 07:07:53,336 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-04-05 07:07:53,336 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-04-05 07:07:53,337 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-04-05 07:07:53,430 INFO L241 CfgBuilder]: Building ICFG [2024-04-05 07:07:53,431 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2024-04-05 07:07:53,620 INFO L282 CfgBuilder]: Performing block encoding [2024-04-05 07:07:53,724 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-04-05 07:07:53,724 INFO L309 CfgBuilder]: Removed 3 assume(true) statements. [2024-04-05 07:07:53,726 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.04 07:07:53 BoogieIcfgContainer [2024-04-05 07:07:53,726 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-04-05 07:07:53,727 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-04-05 07:07:53,727 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-04-05 07:07:53,729 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-04-05 07:07:53,730 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.04 07:07:52" (1/3) ... [2024-04-05 07:07:53,730 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e2b2413 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.04 07:07:53, skipping insertion in model container [2024-04-05 07:07:53,730 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 07:07:53" (2/3) ... [2024-04-05 07:07:53,730 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e2b2413 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.04 07:07:53, skipping insertion in model container [2024-04-05 07:07:53,730 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.04 07:07:53" (3/3) ... [2024-04-05 07:07:53,731 INFO L112 eAbstractionObserver]: Analyzing ICFG 04_incdec_cas.i [2024-04-05 07:07:53,737 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2024-04-05 07:07:53,744 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-04-05 07:07:53,744 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-04-05 07:07:53,744 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-04-05 07:07:53,802 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-04-05 07:07:53,838 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-04-05 07:07:53,839 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-04-05 07:07:53,839 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-04-05 07:07:53,840 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-04-05 07:07:53,843 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2024-04-05 07:07:53,885 INFO L184 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-04-05 07:07:53,896 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-05 07:07:53,897 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-04-05 07:07:53,902 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;@2cea61c1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms], mConComChecker=DFS, mConComCheckerCriterion=RANDOM, mConComCheckerLimitedChecksCriterion=false, mConComCheckerCriterionLimit=1, mConComCheckerRandomProb=20, mConComCheckerRandomSeed=546 [2024-04-05 07:07:53,903 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2024-04-05 07:07:53,954 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-04-05 07:07:53,956 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-05 07:07:53,956 INFO L85 PathProgramCache]: Analyzing trace with hash 2069504969, now seen corresponding path program 1 times [2024-04-05 07:07:53,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-05 07:07:53,963 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [558569771] [2024-04-05 07:07:53,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 07:07:53,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 07:07:54,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 07:07:54,203 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-04-05 07:07:54,204 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-05 07:07:54,204 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [558569771] [2024-04-05 07:07:54,204 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [558569771] provided 1 perfect and 0 imperfect interpolant sequences [2024-04-05 07:07:54,204 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-04-05 07:07:54,205 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-04-05 07:07:54,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [381789153] [2024-04-05 07:07:54,206 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-04-05 07:07:54,212 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-04-05 07:07:54,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-05 07:07:54,233 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-04-05 07:07:54,234 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-04-05 07:07:54,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 07:07:54,235 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-05 07:07:54,236 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 19.0) internal successors, (38), 2 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-04-05 07:07:54,236 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-05 07:07:54,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 07:07:54,272 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-04-05 07:07:54,273 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-04-05 07:07:54,273 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-05 07:07:54,273 INFO L85 PathProgramCache]: Analyzing trace with hash 1930054108, now seen corresponding path program 1 times [2024-04-05 07:07:54,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-05 07:07:54,273 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1778054199] [2024-04-05 07:07:54,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 07:07:54,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 07:07:54,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 07:07:54,634 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-04-05 07:07:54,635 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-05 07:07:54,635 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1778054199] [2024-04-05 07:07:54,636 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1778054199] provided 1 perfect and 0 imperfect interpolant sequences [2024-04-05 07:07:54,636 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-04-05 07:07:54,636 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-04-05 07:07:54,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [491427137] [2024-04-05 07:07:54,636 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-04-05 07:07:54,637 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-04-05 07:07:54,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-05 07:07:54,638 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-04-05 07:07:54,638 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-04-05 07:07:54,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 07:07:54,639 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-05 07:07:54,640 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.625) internal successors, (53), 8 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-04-05 07:07:54,640 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-05 07:07:54,640 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-05 07:07:54,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 07:07:54,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-04-05 07:07:54,812 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-04-05 07:07:54,812 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-04-05 07:07:54,813 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-05 07:07:54,813 INFO L85 PathProgramCache]: Analyzing trace with hash 379580625, now seen corresponding path program 1 times [2024-04-05 07:07:54,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-05 07:07:54,813 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [726578687] [2024-04-05 07:07:54,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 07:07:54,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 07:07:54,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 07:07:55,548 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-04-05 07:07:55,549 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-05 07:07:55,549 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [726578687] [2024-04-05 07:07:55,549 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [726578687] provided 1 perfect and 0 imperfect interpolant sequences [2024-04-05 07:07:55,549 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-04-05 07:07:55,549 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-04-05 07:07:55,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1812997674] [2024-04-05 07:07:55,549 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-04-05 07:07:55,550 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-04-05 07:07:55,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-05 07:07:55,551 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-04-05 07:07:55,551 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2024-04-05 07:07:55,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 07:07:55,552 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-05 07:07:55,552 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 3.8333333333333335) internal successors, (46), 13 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-04-05 07:07:55,552 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-05 07:07:55,552 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2024-04-05 07:07:55,552 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-05 07:07:55,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 07:07:55,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-04-05 07:07:55,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-04-05 07:07:55,735 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-04-05 07:07:55,735 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-04-05 07:07:55,735 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-05 07:07:55,736 INFO L85 PathProgramCache]: Analyzing trace with hash -1174053011, now seen corresponding path program 1 times [2024-04-05 07:07:55,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-05 07:07:55,739 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [780262522] [2024-04-05 07:07:55,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 07:07:55,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 07:07:55,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-05 07:07:55,802 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-05 07:07:55,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-05 07:07:55,844 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-04-05 07:07:55,844 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-04-05 07:07:55,845 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 5 remaining) [2024-04-05 07:07:55,847 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining) [2024-04-05 07:07:55,847 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONERROR_FUNCTION (2 of 5 remaining) [2024-04-05 07:07:55,848 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 5 remaining) [2024-04-05 07:07:55,848 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining) [2024-04-05 07:07:55,848 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-04-05 07:07:55,854 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-04-05 07:07:55,856 WARN L233 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2024-04-05 07:07:55,856 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2024-04-05 07:07:55,915 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-04-05 07:07:55,921 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-04-05 07:07:55,922 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-04-05 07:07:55,922 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-04-05 07:07:55,924 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-04-05 07:07:55,928 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (3)] Waiting until timeout for monitored process [2024-04-05 07:07:55,930 INFO L184 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-04-05 07:07:55,930 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-05 07:07:55,930 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-04-05 07:07:55,931 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;@2cea61c1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms], mConComChecker=DFS, mConComCheckerCriterion=RANDOM, mConComCheckerLimitedChecksCriterion=false, mConComCheckerCriterionLimit=1, mConComCheckerRandomProb=20, mConComCheckerRandomSeed=546 [2024-04-05 07:07:55,931 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2024-04-05 07:07:55,943 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-04-05 07:07:55,943 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-05 07:07:55,947 INFO L85 PathProgramCache]: Analyzing trace with hash -77191831, now seen corresponding path program 1 times [2024-04-05 07:07:55,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-05 07:07:55,947 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [146982481] [2024-04-05 07:07:55,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 07:07:55,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 07:07:55,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 07:07:55,966 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-04-05 07:07:55,968 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-05 07:07:55,969 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [146982481] [2024-04-05 07:07:55,969 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [146982481] provided 1 perfect and 0 imperfect interpolant sequences [2024-04-05 07:07:55,969 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-04-05 07:07:55,969 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-04-05 07:07:55,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1445341518] [2024-04-05 07:07:55,969 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-04-05 07:07:55,970 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-04-05 07:07:55,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-05 07:07:55,970 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-04-05 07:07:55,971 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-04-05 07:07:55,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 07:07:55,971 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-05 07:07:55,971 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 19.0) internal successors, (38), 2 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-04-05 07:07:55,971 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-05 07:07:56,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 07:07:56,008 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-04-05 07:07:56,008 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-04-05 07:07:56,008 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-05 07:07:56,008 INFO L85 PathProgramCache]: Analyzing trace with hash -277568332, now seen corresponding path program 1 times [2024-04-05 07:07:56,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-05 07:07:56,008 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1380574683] [2024-04-05 07:07:56,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 07:07:56,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 07:07:56,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 07:07:56,166 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-04-05 07:07:56,166 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-05 07:07:56,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1380574683] [2024-04-05 07:07:56,166 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1380574683] provided 1 perfect and 0 imperfect interpolant sequences [2024-04-05 07:07:56,167 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-04-05 07:07:56,167 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-04-05 07:07:56,167 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [578108076] [2024-04-05 07:07:56,167 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-04-05 07:07:56,168 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-04-05 07:07:56,168 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-05 07:07:56,169 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-04-05 07:07:56,169 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-04-05 07:07:56,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 07:07:56,169 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-05 07:07:56,169 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 9 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-04-05 07:07:56,170 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-05 07:07:56,170 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-05 07:07:56,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 07:07:56,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-04-05 07:07:56,267 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-04-05 07:07:56,267 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-04-05 07:07:56,268 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-05 07:07:56,268 INFO L85 PathProgramCache]: Analyzing trace with hash 1129166833, now seen corresponding path program 1 times [2024-04-05 07:07:56,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-05 07:07:56,268 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1694702260] [2024-04-05 07:07:56,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 07:07:56,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 07:07:56,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 07:07:56,796 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-04-05 07:07:56,796 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-05 07:07:56,797 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1694702260] [2024-04-05 07:07:56,797 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1694702260] provided 1 perfect and 0 imperfect interpolant sequences [2024-04-05 07:07:56,798 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-04-05 07:07:56,798 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-04-05 07:07:56,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [733342234] [2024-04-05 07:07:56,798 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-04-05 07:07:56,798 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-04-05 07:07:56,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-05 07:07:56,799 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-04-05 07:07:56,799 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2024-04-05 07:07:56,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 07:07:56,800 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-05 07:07:56,800 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 3.8333333333333335) internal successors, (46), 13 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-04-05 07:07:56,800 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-05 07:07:56,800 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2024-04-05 07:07:56,800 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-05 07:07:57,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 07:07:57,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-04-05 07:07:57,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-04-05 07:07:57,025 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-04-05 07:07:57,025 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-04-05 07:07:57,025 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-05 07:07:57,025 INFO L85 PathProgramCache]: Analyzing trace with hash 1137574501, now seen corresponding path program 1 times [2024-04-05 07:07:57,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-05 07:07:57,025 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [547291900] [2024-04-05 07:07:57,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 07:07:57,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 07:07:57,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 07:07:57,601 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 10 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-04-05 07:07:57,601 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-05 07:07:57,601 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [547291900] [2024-04-05 07:07:57,601 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [547291900] provided 0 perfect and 1 imperfect interpolant sequences [2024-04-05 07:07:57,601 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1922325092] [2024-04-05 07:07:57,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 07:07:57,602 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-04-05 07:07:57,602 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-04-05 07:07:57,604 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-04-05 07:07:57,632 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-04-05 07:07:57,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 07:07:57,719 INFO L262 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 30 conjunts are in the unsatisfiable core [2024-04-05 07:07:57,723 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-04-05 07:07:57,814 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-04-05 07:07:57,815 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2024-04-05 07:07:57,880 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-04-05 07:07:58,001 INFO L349 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2024-04-05 07:07:58,001 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2024-04-05 07:07:58,216 INFO L349 Elim1Store]: treesize reduction 56, result has 30.9 percent of original size [2024-04-05 07:07:58,217 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 54 treesize of output 94 [2024-04-05 07:07:58,225 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2024-04-05 07:07:58,242 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2024-04-05 07:07:58,250 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2024-04-05 07:07:58,314 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 19 [2024-04-05 07:07:58,317 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2024-04-05 07:07:58,419 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-04-05 07:07:58,484 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 10 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-04-05 07:07:58,484 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-04-05 07:07:58,554 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_132 (Array Int Int))) (< (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_132) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) 4294967295)) is different from false [2024-04-05 07:07:59,351 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 178 treesize of output 174 [2024-04-05 07:07:59,360 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 102 treesize of output 94 [2024-04-05 07:07:59,388 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 94 treesize of output 90 [2024-04-05 07:07:59,507 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 10 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2024-04-05 07:07:59,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1922325092] provided 0 perfect and 2 imperfect interpolant sequences [2024-04-05 07:07:59,507 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-04-05 07:07:59,508 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 14, 14] total 36 [2024-04-05 07:07:59,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [362599049] [2024-04-05 07:07:59,508 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-04-05 07:07:59,508 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2024-04-05 07:07:59,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-05 07:07:59,509 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2024-04-05 07:07:59,509 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=161, Invalid=1012, Unknown=21, NotChecked=66, Total=1260 [2024-04-05 07:07:59,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 07:07:59,510 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-05 07:07:59,510 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 6.055555555555555) internal successors, (218), 36 states have internal predecessors, (218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-04-05 07:07:59,510 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-05 07:07:59,510 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2024-04-05 07:07:59,510 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2024-04-05 07:07:59,510 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-05 07:08:00,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 07:08:00,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-04-05 07:08:00,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-04-05 07:08:00,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-04-05 07:08:00,469 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-04-05 07:08:00,662 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-04-05 07:08:00,663 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-04-05 07:08:00,664 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-05 07:08:00,664 INFO L85 PathProgramCache]: Analyzing trace with hash 1699917811, now seen corresponding path program 1 times [2024-04-05 07:08:00,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-05 07:08:00,664 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1923209764] [2024-04-05 07:08:00,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 07:08:00,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 07:08:00,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 07:08:01,873 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-04-05 07:08:01,873 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-05 07:08:01,873 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1923209764] [2024-04-05 07:08:01,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1923209764] provided 0 perfect and 1 imperfect interpolant sequences [2024-04-05 07:08:01,873 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [57389817] [2024-04-05 07:08:01,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 07:08:01,873 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-04-05 07:08:01,873 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-04-05 07:08:01,874 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-04-05 07:08:01,896 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-04-05 07:08:01,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 07:08:01,998 INFO L262 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 66 conjunts are in the unsatisfiable core [2024-04-05 07:08:02,006 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-04-05 07:08:02,186 INFO L349 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2024-04-05 07:08:02,187 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 22 treesize of output 33 [2024-04-05 07:08:02,303 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-04-05 07:08:02,614 INFO L349 Elim1Store]: treesize reduction 60, result has 31.8 percent of original size [2024-04-05 07:08:02,615 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 29 treesize of output 40 [2024-04-05 07:08:03,101 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-04-05 07:08:03,190 INFO L349 Elim1Store]: treesize reduction 116, result has 29.7 percent of original size [2024-04-05 07:08:03,190 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 4 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 6 new quantified variables, introduced 4 case distinctions, treesize of input 118 treesize of output 268 [2024-04-05 07:08:03,206 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 15 [2024-04-05 07:08:03,221 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18 [2024-04-05 07:08:03,257 INFO L173 IndexEqualityManager]: detected equality via solver [2024-04-05 07:08:03,263 INFO L173 IndexEqualityManager]: detected equality via solver [2024-04-05 07:08:03,296 INFO L349 Elim1Store]: treesize reduction 81, result has 17.3 percent of original size [2024-04-05 07:08:03,297 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 8 case distinctions, treesize of input 83 treesize of output 93 [2024-04-05 07:08:03,339 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 36 [2024-04-05 07:08:03,361 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 36 [2024-04-05 07:08:06,716 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 25 [2024-04-05 07:08:06,835 WARN L876 $PredicateComparison]: unable to prove that (and (= (select |c_#valid| 3) 1) (<= |c_~#inc_flag~0.base| 4) (not (= 3 |c_ULTIMATE.start_main_~#t~0#1.base|)) (= 5 |c_~#dec_flag~0.base|) (= (select |c_#valid| 5) 1) (let ((.cse6 (select |c_#memory_int| 3)) (.cse0 (= |c_~#inc_flag~0.base| 3))) (or (and (not .cse0) (let ((.cse3 (select |c_#memory_int| |c_~#inc_flag~0.base|))) (let ((.cse1 (store .cse3 |c_~#value~0.offset| 1))) (or (and (exists ((v_DerPreprocessor_10 (Array Int Int)) (|thr1Thread1of2ForFork0_inc_~#inc__casret~0#1.base| Int) (v_DerPreprocessor_16 (Array Int Int)) (|thr1Thread1of2ForFork0_inc_~#inc__casret~0#1.offset| Int) (v_DerPreprocessor_17 (Array Int Int)) (v_DerPreprocessor_11 (Array Int Int))) (let ((.cse5 (select |c_#memory_int| |thr1Thread1of2ForFork0_inc_~#inc__casret~0#1.base|))) (let ((.cse2 (store (store (store |c_#memory_int| |c_~#inc_flag~0.base| v_DerPreprocessor_16) 3 v_DerPreprocessor_17) |thr1Thread1of2ForFork0_inc_~#inc__casret~0#1.base| .cse5)) (.cse4 (store (store (store |c_#memory_int| |c_~#inc_flag~0.base| v_DerPreprocessor_10) 3 v_DerPreprocessor_11) |thr1Thread1of2ForFork0_inc_~#inc__casret~0#1.base| (store .cse3 |thr1Thread1of2ForFork0_inc_~#inc__casret~0#1.offset| 1)))) (and (= .cse1 (select .cse2 3)) (= .cse3 (select .cse4 |c_~#inc_flag~0.base|)) (= (select .cse2 |c_~#inc_flag~0.base|) .cse3) (not (= |c_~#inc_flag~0.base| |thr1Thread1of2ForFork0_inc_~#inc__casret~0#1.base|)) (= (select .cse5 |thr1Thread1of2ForFork0_inc_~#inc__casret~0#1.offset|) 1) (not (= 3 |thr1Thread1of2ForFork0_inc_~#inc__casret~0#1.base|)) (= .cse6 (select .cse4 3)) (not (= |c_ULTIMATE.start_main_~#t~0#1.base| |thr1Thread1of2ForFork0_inc_~#inc__casret~0#1.base|)) (not (= 5 |thr1Thread1of2ForFork0_inc_~#inc__casret~0#1.base|)))))) (= (select .cse6 |c_~#value~0.offset|) 1)) (and (or (and (exists ((v_DerPreprocessor_14 (Array Int Int))) (= .cse1 (select (store (store |c_#memory_int| 3 v_DerPreprocessor_14) |c_~#inc_flag~0.base| .cse3) 3))) (exists ((v_DerPreprocessor_6 (Array Int Int))) (let ((.cse7 (select (store (store |c_#memory_int| 3 v_DerPreprocessor_6) |c_~#inc_flag~0.base| .cse3) 3))) (and (= (select .cse7 |c_~#value~0.offset|) 1) (= .cse6 .cse7)))) (exists ((|thr1Thread1of2ForFork0_inc_~#inc__casret~0#1.offset| Int)) (= (select .cse3 |thr1Thread1of2ForFork0_inc_~#inc__casret~0#1.offset|) 1))) (exists ((v_prenex_13 (Array Int Int)) (v_prenex_12 (Array Int Int)) (|thr1Thread1of2ForFork0_inc_~#inc__casret~0#1.offset| Int) (v_DerPreprocessor_14 (Array Int Int))) (let ((.cse8 (select (store (store |c_#memory_int| 3 v_prenex_13) |c_~#inc_flag~0.base| v_prenex_12) 3))) (and (= (select .cse8 |c_~#value~0.offset|) 1) (= (select .cse3 |thr1Thread1of2ForFork0_inc_~#inc__casret~0#1.offset|) 1) (= (select v_prenex_12 |thr1Thread1of2ForFork0_inc_~#inc__casret~0#1.offset|) 1) (= .cse6 .cse8) (let ((.cse9 (select (store (store |c_#memory_int| 3 v_DerPreprocessor_14) |c_~#inc_flag~0.base| v_prenex_12) 3))) (= (store (store .cse3 |thr1Thread1of2ForFork0_inc_~#inc__casret~0#1.offset| (select .cse9 |thr1Thread1of2ForFork0_inc_~#inc__casret~0#1.offset|)) |c_~#value~0.offset| 1) .cse9)))))) (not (= |c_~#inc_flag~0.base| |c_ULTIMATE.start_main_~#t~0#1.base|))))))) (and (or (exists ((|thr1Thread1of2ForFork0_inc_~#inc__casret~0#1.base| Int)) (and (not (= 3 |thr1Thread1of2ForFork0_inc_~#inc__casret~0#1.base|)) (exists ((|thr1Thread1of2ForFork0_inc_~#inc__casret~0#1.offset| Int)) (let ((.cse10 (select |c_#memory_int| |thr1Thread1of2ForFork0_inc_~#inc__casret~0#1.base|))) (and (= (select .cse10 |thr1Thread1of2ForFork0_inc_~#inc__casret~0#1.offset|) 1) (exists ((v_DerPreprocessor_8 (Array Int Int)) (v_prenex_4 (Array Int Int))) (let ((.cse11 (select (store (store |c_#memory_int| 3 v_prenex_4) |thr1Thread1of2ForFork0_inc_~#inc__casret~0#1.base| .cse10) 3))) (and (= (select (store (store |c_#memory_int| 3 v_DerPreprocessor_8) |thr1Thread1of2ForFork0_inc_~#inc__casret~0#1.base| (store .cse11 |thr1Thread1of2ForFork0_inc_~#inc__casret~0#1.offset| 1)) 3) .cse11) (= .cse6 .cse11) (= (store .cse11 |c_~#value~0.offset| 1) .cse6))))))) (not (= |c_ULTIMATE.start_main_~#t~0#1.base| |thr1Thread1of2ForFork0_inc_~#inc__casret~0#1.base|)) (not (= 5 |thr1Thread1of2ForFork0_inc_~#inc__casret~0#1.base|)))) (exists ((|thr1Thread1of2ForFork0_inc_~#inc__casret~0#1.base| Int)) (and (exists ((|thr1Thread1of2ForFork0_inc_~#inc__casret~0#1.offset| Int)) (let ((.cse13 (select |c_#memory_int| |thr1Thread1of2ForFork0_inc_~#inc__casret~0#1.base|))) (and (exists ((v_DerPreprocessor_9 (Array Int Int)) (v_DerPreprocessor_8 (Array Int Int))) (and (exists ((v_DerPreprocessor_3 (Array Int Int))) (let ((.cse12 (select (store (store |c_#memory_int| 3 v_DerPreprocessor_3) |thr1Thread1of2ForFork0_inc_~#inc__casret~0#1.base| .cse13) 3))) (and (= (select .cse12 |c_~#value~0.offset|) 1) (= (select (store (store |c_#memory_int| 3 v_DerPreprocessor_8) |thr1Thread1of2ForFork0_inc_~#inc__casret~0#1.base| v_DerPreprocessor_9) 3) .cse12)))) (= .cse6 (store (store v_DerPreprocessor_9 |thr1Thread1of2ForFork0_inc_~#inc__casret~0#1.offset| (select .cse6 |thr1Thread1of2ForFork0_inc_~#inc__casret~0#1.offset|)) |c_~#value~0.offset| 1)) (= (select v_DerPreprocessor_9 |thr1Thread1of2ForFork0_inc_~#inc__casret~0#1.offset|) 1))) (= (select .cse13 |thr1Thread1of2ForFork0_inc_~#inc__casret~0#1.offset|) 1)))) (not (= 3 |thr1Thread1of2ForFork0_inc_~#inc__casret~0#1.base|)) (not (= |c_ULTIMATE.start_main_~#t~0#1.base| |thr1Thread1of2ForFork0_inc_~#inc__casret~0#1.base|)) (not (= 5 |thr1Thread1of2ForFork0_inc_~#inc__casret~0#1.base|))))) .cse0))) (= |c_~#value~0.base| 3) (not (= 5 |c_ULTIMATE.start_main_~#t~0#1.base|)) (= (select |c_#valid| |c_ULTIMATE.start_main_~#t~0#1.base|) 1) (= |c_~#dec_flag~0.offset| 0)) is different from true [2024-04-05 07:08:08,760 INFO L349 Elim1Store]: treesize reduction 88, result has 46.7 percent of original size [2024-04-05 07:08:08,761 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 14 case distinctions, treesize of input 677 treesize of output 652 [2024-04-05 07:08:08,781 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 198 treesize of output 196 [2024-04-05 07:08:08,800 INFO L349 Elim1Store]: treesize reduction 15, result has 37.5 percent of original size [2024-04-05 07:08:08,800 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 196 treesize of output 199 [2024-04-05 07:08:08,867 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-04-05 07:08:08,970 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-04-05 07:08:08,971 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 11 [2024-04-05 07:08:09,016 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-04-05 07:08:09,017 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 11 [2024-04-05 07:08:47,136 WARN L293 SmtUtils]: Spent 7.41s on a formula simplification that was a NOOP. DAG size: 849 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-04-05 07:14:10,705 INFO L190 IndexEqualityManager]: detected not equals via solver Received shutdown request... [2024-04-05 07:22:13,154 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2024-04-05 07:22:13,154 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2024-04-05 07:22:13,154 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (3)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2024-04-05 07:22:13,154 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2024-04-05 07:22:13,464 WARN L235 SmtUtils]: Removed 36530 from assertion stack [2024-04-05 07:22:13,465 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2024-04-05 07:22:13,471 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-04-05 07:22:13,666 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-04-05 07:22:13,669 WARN L619 AbstractCegarLoop]: Verification canceled: while PartialOrderCegarLoop was analyzing trace of length 83 with TraceHistMax 2,while TraceCheckSpWp was constructing forward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 149051 for 482140ms.. [2024-04-05 07:22:13,669 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2024-04-05 07:22:13,669 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thr1Err1ASSERT_VIOLATIONERROR_FUNCTION (4 of 7 remaining) [2024-04-05 07:22:13,669 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2024-04-05 07:22:13,669 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thr1Err1ASSERT_VIOLATIONERROR_FUNCTION (2 of 7 remaining) [2024-04-05 07:22:13,669 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 7 remaining) [2024-04-05 07:22:13,669 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thr1Err1ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2024-04-05 07:22:13,670 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2024-04-05 07:22:13,674 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 2 thread instances [2024-04-05 07:22:13,674 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2024-04-05 07:22:13,675 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.04 07:22:13 BasicIcfg [2024-04-05 07:22:13,675 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-04-05 07:22:13,676 INFO L158 Benchmark]: Toolchain (without parser) took 860862.54ms. Allocated memory was 298.8MB in the beginning and 3.0GB in the end (delta: 2.7GB). Free memory was 226.4MB in the beginning and 2.6GB in the end (delta: -2.4GB). Peak memory consumption was 865.4MB. Max. memory is 8.0GB. [2024-04-05 07:22:13,676 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 298.8MB. Free memory is still 265.1MB. There was no memory consumed. Max. memory is 8.0GB. [2024-04-05 07:22:13,676 INFO L158 Benchmark]: CACSL2BoogieTranslator took 365.32ms. Allocated memory is still 298.8MB. Free memory was 226.2MB in the beginning and 205.9MB in the end (delta: 20.3MB). Peak memory consumption was 19.9MB. Max. memory is 8.0GB. [2024-04-05 07:22:13,676 INFO L158 Benchmark]: Boogie Procedure Inliner took 42.71ms. Allocated memory is still 298.8MB. Free memory was 205.9MB in the beginning and 203.6MB in the end (delta: 2.3MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2024-04-05 07:22:13,676 INFO L158 Benchmark]: Boogie Preprocessor took 23.52ms. Allocated memory is still 298.8MB. Free memory was 203.6MB in the beginning and 201.9MB in the end (delta: 1.7MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2024-04-05 07:22:13,676 INFO L158 Benchmark]: RCFGBuilder took 477.31ms. Allocated memory is still 298.8MB. Free memory was 201.7MB in the beginning and 229.5MB in the end (delta: -27.8MB). Peak memory consumption was 7.2MB. Max. memory is 8.0GB. [2024-04-05 07:22:13,677 INFO L158 Benchmark]: TraceAbstraction took 859948.18ms. Allocated memory was 298.8MB in the beginning and 3.0GB in the end (delta: 2.7GB). Free memory was 228.5MB in the beginning and 2.6GB in the end (delta: -2.4GB). Peak memory consumption was 866.5MB. Max. memory is 8.0GB. [2024-04-05 07:22:13,677 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.10ms. Allocated memory is still 298.8MB. Free memory is still 265.1MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 365.32ms. Allocated memory is still 298.8MB. Free memory was 226.2MB in the beginning and 205.9MB in the end (delta: 20.3MB). Peak memory consumption was 19.9MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 42.71ms. Allocated memory is still 298.8MB. Free memory was 205.9MB in the beginning and 203.6MB in the end (delta: 2.3MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 23.52ms. Allocated memory is still 298.8MB. Free memory was 203.6MB in the beginning and 201.9MB in the end (delta: 1.7MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 477.31ms. Allocated memory is still 298.8MB. Free memory was 201.7MB in the beginning and 229.5MB in the end (delta: -27.8MB). Peak memory consumption was 7.2MB. Max. memory is 8.0GB. * TraceAbstraction took 859948.18ms. Allocated memory was 298.8MB in the beginning and 3.0GB in the end (delta: 2.7GB). Free memory was 228.5MB in the beginning and 2.6GB in the end (delta: -2.4GB). Peak memory consumption was 866.5MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 438, independent: 354, independent conditional: 296, independent unconditional: 58, dependent: 84, dependent conditional: 68, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 354, independent: 354, independent conditional: 296, independent unconditional: 58, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ ConditionTransformingIndependenceRelation.Independence Queries: [ total: 354, independent: 354, independent conditional: 296, independent unconditional: 58, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 354, independent: 354, independent conditional: 296, independent unconditional: 58, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 354, independent: 354, independent conditional: 56, independent unconditional: 298, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 354, independent: 354, independent conditional: 21, independent unconditional: 333, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 354, independent: 354, independent conditional: 21, independent unconditional: 333, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 86, independent: 86, independent conditional: 2, independent unconditional: 84, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 86, independent: 86, independent conditional: 0, independent unconditional: 86, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 354, independent: 268, independent conditional: 19, independent unconditional: 249, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 86, unknown conditional: 2, unknown unconditional: 84] , Statistics on independence cache: Total cache size (in pairs): 86, Positive cache size: 86, Positive conditional cache size: 2, Positive unconditional cache size: 84, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 35, Maximal queried relation: 0, ConditionTransformingIndependenceRelation.Independence Queries: [ total: 354, independent: 354, independent conditional: 56, independent unconditional: 298, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 354, independent: 354, independent conditional: 21, independent unconditional: 333, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 354, independent: 354, independent conditional: 21, independent unconditional: 333, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 86, independent: 86, independent conditional: 2, independent unconditional: 84, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 86, independent: 86, independent conditional: 0, independent unconditional: 86, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 354, independent: 268, independent conditional: 19, independent unconditional: 249, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 86, unknown conditional: 2, unknown unconditional: 84] , Statistics on independence cache: Total cache size (in pairs): 86, Positive cache size: 86, Positive conditional cache size: 2, Positive unconditional cache size: 84, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 35 ], Independence queries for same thread: 84 - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 848, independent: 707, independent conditional: 595, independent unconditional: 112, dependent: 141, dependent conditional: 121, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 707, independent: 707, independent conditional: 595, independent unconditional: 112, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ ConditionTransformingIndependenceRelation.Independence Queries: [ total: 707, independent: 707, independent conditional: 595, independent unconditional: 112, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 707, independent: 707, independent conditional: 595, independent unconditional: 112, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 707, independent: 707, independent conditional: 115, independent unconditional: 592, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 707, independent: 707, independent conditional: 43, independent unconditional: 664, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 707, independent: 707, independent conditional: 43, independent unconditional: 664, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 113, independent: 113, independent conditional: 2, independent unconditional: 111, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 113, independent: 113, independent conditional: 0, independent unconditional: 113, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 707, independent: 594, independent conditional: 41, independent unconditional: 553, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 113, unknown conditional: 2, unknown unconditional: 111] , Statistics on independence cache: Total cache size (in pairs): 113, Positive cache size: 113, Positive conditional cache size: 2, Positive unconditional cache size: 111, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 72, Maximal queried relation: 0, ConditionTransformingIndependenceRelation.Independence Queries: [ total: 707, independent: 707, independent conditional: 115, independent unconditional: 592, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 707, independent: 707, independent conditional: 43, independent unconditional: 664, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 707, independent: 707, independent conditional: 43, independent unconditional: 664, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 113, independent: 113, independent conditional: 2, independent unconditional: 111, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 113, independent: 113, independent conditional: 0, independent unconditional: 113, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 707, independent: 594, independent conditional: 41, independent unconditional: 553, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 113, unknown conditional: 2, unknown unconditional: 111] , Statistics on independence cache: Total cache size (in pairs): 113, Positive cache size: 113, Positive conditional cache size: 2, Positive unconditional cache size: 111, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 72 ], Independence queries for same thread: 141 - TimeoutResultAtElement [Line: 706]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable Cancelled while PartialOrderCegarLoop was analyzing trace of length 83 with TraceHistMax 2,while TraceCheckSpWp was constructing forward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 149051 for 482140ms.. - TimeoutResultAtElement [Line: 724]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable Cancelled while PartialOrderCegarLoop was analyzing trace of length 83 with TraceHistMax 2,while TraceCheckSpWp was constructing forward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 149051 for 482140ms.. - TimeoutResultAtElement [Line: 749]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while PartialOrderCegarLoop was analyzing trace of length 83 with TraceHistMax 2,while TraceCheckSpWp was constructing forward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 149051 for 482140ms.. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 3 procedures, 154 locations, 5 error locations. Started 1 CEGAR loops. OverallTime: 2.0s, OverallIterations: 4, TraceHistogramMax: 0, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.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: 26, 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.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 196 NumberOfCodeBlocks, 196 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 134 ConstructedInterpolants, 0 QuantifiedInterpolants, 1057 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 PerfectInterpolantSequences, 5/5 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 - StatisticsResult: Ultimate Automizer benchmark data with 2 thread instances CFG has 4 procedures, 215 locations, 7 error locations. Started 1 CEGAR loops. OverallTime: 857.7s, OverallIterations: 5, TraceHistogramMax: 0, PathProgramHistogramMax: 1, EmptinessCheckTime: 1.3s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 47, 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.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 3.0s InterpolantComputationTime, 345 NumberOfCodeBlocks, 345 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 428 ConstructedInterpolants, 51 QuantifiedInterpolants, 5469 SizeOfPredicates, 14 NumberOfNonLiveVariables, 228 ConjunctsInSsa, 30 ConjunctsInUnsatCore, 6 InterpolantComputations, 3 PerfectInterpolantSequences, 47/68 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown