/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 --traceabstraction.prune.known.deadend.states.from.previous.iterations false -s ../../../trunk/examples/settings/gemcutter/NewStatesSleep.epf --traceabstraction.cegar.restart.behaviour ONE_CEGAR_PER_ERROR_LOCATION -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread/triangular-longer-2.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-wip.dk.dynamic-abstractions-a4a1cd3-m [2024-05-30 17:38:52,083 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-05-30 17:38:52,139 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/settings/gemcutter/NewStatesSleep.epf [2024-05-30 17:38:52,142 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-05-30 17:38:52,142 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-05-30 17:38:52,165 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-05-30 17:38:52,166 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-05-30 17:38:52,166 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-05-30 17:38:52,167 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-05-30 17:38:52,170 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-05-30 17:38:52,170 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-05-30 17:38:52,170 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-05-30 17:38:52,170 INFO L153 SettingsManager]: * Use SBE=true [2024-05-30 17:38:52,172 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-05-30 17:38:52,172 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-05-30 17:38:52,172 INFO L153 SettingsManager]: * sizeof long=4 [2024-05-30 17:38:52,172 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-05-30 17:38:52,172 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-05-30 17:38:52,172 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-05-30 17:38:52,172 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-05-30 17:38:52,173 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-05-30 17:38:52,173 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-05-30 17:38:52,173 INFO L153 SettingsManager]: * sizeof long double=12 [2024-05-30 17:38:52,173 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-05-30 17:38:52,173 INFO L153 SettingsManager]: * Use constant arrays=true [2024-05-30 17:38:52,173 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-05-30 17:38:52,174 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-05-30 17:38:52,174 INFO L153 SettingsManager]: * To the following directory=./dump/ [2024-05-30 17:38:52,174 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-05-30 17:38:52,174 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-05-30 17:38:52,175 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-05-30 17:38:52,175 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-05-30 17:38:52,175 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-05-30 17:38:52,175 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-05-30 17:38:52,175 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=SLEEP_NEW_STATES [2024-05-30 17:38:52,176 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-05-30 17:38:52,176 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-05-30 17:38:52,176 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2024-05-30 17:38:52,176 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-05-30 17:38:52,176 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: Prune known deadend states from previous iterations -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: CEGAR restart behaviour -> ONE_CEGAR_PER_ERROR_LOCATION [2024-05-30 17:38:52,372 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-05-30 17:38:52,389 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-05-30 17:38:52,391 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-05-30 17:38:52,392 INFO L270 PluginConnector]: Initializing CDTParser... [2024-05-30 17:38:52,392 INFO L274 PluginConnector]: CDTParser initialized [2024-05-30 17:38:52,393 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/svcomp/pthread/triangular-longer-2.i [2024-05-30 17:38:53,491 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-05-30 17:38:53,717 INFO L384 CDTParser]: Found 1 translation units. [2024-05-30 17:38:53,718 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread/triangular-longer-2.i [2024-05-30 17:38:53,728 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/75cfdacf1/f2cde65636f147d2b77272bf1b503c73/FLAG3f6a7e4b6 [2024-05-30 17:38:53,744 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/75cfdacf1/f2cde65636f147d2b77272bf1b503c73 [2024-05-30 17:38:53,746 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-05-30 17:38:53,749 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-05-30 17:38:53,751 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-05-30 17:38:53,751 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-05-30 17:38:53,754 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-05-30 17:38:53,755 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.05 05:38:53" (1/1) ... [2024-05-30 17:38:53,756 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@75bcec96 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.05 05:38:53, skipping insertion in model container [2024-05-30 17:38:53,756 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.05 05:38:53" (1/1) ... [2024-05-30 17:38:53,799 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-05-30 17:38:54,103 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/triangular-longer-2.i[30963,30976] [2024-05-30 17:38:54,107 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-05-30 17:38:54,113 INFO L202 MainTranslator]: Completed pre-run [2024-05-30 17:38:54,153 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/triangular-longer-2.i[30963,30976] [2024-05-30 17:38:54,154 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-05-30 17:38:54,191 INFO L206 MainTranslator]: Completed translation [2024-05-30 17:38:54,192 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.05 05:38:54 WrapperNode [2024-05-30 17:38:54,192 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-05-30 17:38:54,192 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-05-30 17:38:54,193 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-05-30 17:38:54,193 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-05-30 17:38:54,198 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.05 05:38:54" (1/1) ... [2024-05-30 17:38:54,205 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.05 05:38:54" (1/1) ... [2024-05-30 17:38:54,222 INFO L138 Inliner]: procedures = 169, calls = 24, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 45 [2024-05-30 17:38:54,222 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-05-30 17:38:54,223 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-05-30 17:38:54,223 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-05-30 17:38:54,223 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-05-30 17:38:54,229 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.05 05:38:54" (1/1) ... [2024-05-30 17:38:54,230 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.05 05:38:54" (1/1) ... [2024-05-30 17:38:54,232 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.05 05:38:54" (1/1) ... [2024-05-30 17:38:54,232 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.05 05:38:54" (1/1) ... [2024-05-30 17:38:54,235 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.05 05:38:54" (1/1) ... [2024-05-30 17:38:54,237 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.05 05:38:54" (1/1) ... [2024-05-30 17:38:54,238 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.05 05:38:54" (1/1) ... [2024-05-30 17:38:54,239 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.05 05:38:54" (1/1) ... [2024-05-30 17:38:54,240 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-05-30 17:38:54,241 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-05-30 17:38:54,241 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-05-30 17:38:54,241 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-05-30 17:38:54,242 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.05 05:38:54" (1/1) ... [2024-05-30 17:38:54,252 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-05-30 17:38:54,262 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-30 17:38:54,279 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-05-30 17:38:54,294 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-05-30 17:38:54,341 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2024-05-30 17:38:54,341 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2024-05-30 17:38:54,341 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2024-05-30 17:38:54,341 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2024-05-30 17:38:54,341 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-05-30 17:38:54,341 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-05-30 17:38:54,341 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-05-30 17:38:54,342 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-05-30 17:38:54,342 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-05-30 17:38:54,342 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-05-30 17:38:54,342 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-05-30 17:38:54,342 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-05-30 17:38:54,342 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-05-30 17:38:54,343 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-05-30 17:38:54,462 INFO L241 CfgBuilder]: Building ICFG [2024-05-30 17:38:54,463 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2024-05-30 17:38:54,611 INFO L282 CfgBuilder]: Performing block encoding [2024-05-30 17:38:54,620 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-05-30 17:38:54,620 INFO L309 CfgBuilder]: Removed 2 assume(true) statements. [2024-05-30 17:38:54,620 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.05 05:38:54 BoogieIcfgContainer [2024-05-30 17:38:54,621 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-05-30 17:38:54,623 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-05-30 17:38:54,623 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-05-30 17:38:54,625 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-05-30 17:38:54,625 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.05 05:38:53" (1/3) ... [2024-05-30 17:38:54,626 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@30314fd1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.05 05:38:54, skipping insertion in model container [2024-05-30 17:38:54,626 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.05 05:38:54" (2/3) ... [2024-05-30 17:38:54,626 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@30314fd1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.05 05:38:54, skipping insertion in model container [2024-05-30 17:38:54,626 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.05 05:38:54" (3/3) ... [2024-05-30 17:38:54,627 INFO L112 eAbstractionObserver]: Analyzing ICFG triangular-longer-2.i [2024-05-30 17:38:54,635 WARN L146 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2024-05-30 17:38:54,642 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-05-30 17:38:54,642 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-05-30 17:38:54,643 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-05-30 17:38:54,702 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-05-30 17:38:54,740 INFO L103 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-30 17:38:54,740 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-05-30 17:38:54,740 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-30 17:38:54,743 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-05-30 17:38:54,756 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2024-05-30 17:38:54,808 INFO L166 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-05-30 17:38:54,813 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION ======== [2024-05-30 17:38:54,818 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;@4175506, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-30 17:38:54,818 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-05-30 17:38:54,851 INFO L78 Accepts]: Start accepts. Automaton has currently 50 states, but on-demand construction may add more states Word has length 30 [2024-05-30 17:38:54,852 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-30 17:38:54,852 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-30 17:38:54,857 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-30 17:38:54,857 INFO L85 PathProgramCache]: Analyzing trace with hash -1937643587, now seen corresponding path program 1 times [2024-05-30 17:38:54,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-30 17:38:54,865 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1807991194] [2024-05-30 17:38:54,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 17:38:54,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-30 17:38:54,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-30 17:38:55,414 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-30 17:38:55,414 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-30 17:38:55,415 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1807991194] [2024-05-30 17:38:55,415 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1807991194] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-30 17:38:55,415 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-30 17:38:55,416 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-05-30 17:38:55,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1320765950] [2024-05-30 17:38:55,417 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-30 17:38:55,420 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-05-30 17:38:55,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-30 17:38:55,439 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-05-30 17:38:55,440 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-05-30 17:38:55,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 17:38:55,441 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-30 17:38:55,442 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.0) internal successors, (30), 6 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-30 17:38:55,442 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 17:38:55,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-30 17:38:55,615 INFO L78 Accepts]: Start accepts. Automaton has currently 332 states, but on-demand construction may add more states Word has length 40 [2024-05-30 17:38:55,615 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-30 17:38:55,615 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-05-30 17:38:55,615 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-30 17:38:55,616 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-30 17:38:55,617 INFO L85 PathProgramCache]: Analyzing trace with hash -1877115405, now seen corresponding path program 1 times [2024-05-30 17:38:55,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-30 17:38:55,617 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [487302299] [2024-05-30 17:38:55,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 17:38:55,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-30 17:38:55,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-30 17:38:55,795 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-30 17:38:55,795 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-30 17:38:55,795 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [487302299] [2024-05-30 17:38:55,796 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [487302299] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-30 17:38:55,796 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-30 17:38:55,796 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-05-30 17:38:55,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1337446538] [2024-05-30 17:38:55,796 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-30 17:38:55,798 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-05-30 17:38:55,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-30 17:38:55,799 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-05-30 17:38:55,800 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-05-30 17:38:55,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 17:38:55,800 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-30 17:38:55,801 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.0) internal successors, (40), 8 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-30 17:38:55,801 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-05-30 17:38:55,801 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 17:38:56,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-30 17:38:56,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-05-30 17:38:56,008 INFO L78 Accepts]: Start accepts. Automaton has currently 621 states, but on-demand construction may add more states Word has length 52 [2024-05-30 17:38:56,009 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-30 17:38:56,009 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-05-30 17:38:56,009 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-30 17:38:56,009 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-30 17:38:56,009 INFO L85 PathProgramCache]: Analyzing trace with hash 963887234, now seen corresponding path program 1 times [2024-05-30 17:38:56,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-30 17:38:56,010 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [543781992] [2024-05-30 17:38:56,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 17:38:56,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-30 17:38:56,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-30 17:38:56,175 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-30 17:38:56,176 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-30 17:38:56,176 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [543781992] [2024-05-30 17:38:56,176 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [543781992] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-30 17:38:56,176 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1963671289] [2024-05-30 17:38:56,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 17:38:56,176 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-30 17:38:56,177 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-30 17:38:56,256 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-05-30 17:38:56,298 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-05-30 17:38:56,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-30 17:38:56,337 INFO L262 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 11 conjunts are in the unsatisfiable core [2024-05-30 17:38:56,341 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-30 17:38:56,484 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-30 17:38:56,485 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-30 17:38:56,707 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-30 17:38:56,707 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1963671289] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-30 17:38:56,707 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-30 17:38:56,707 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 18 [2024-05-30 17:38:56,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [144915672] [2024-05-30 17:38:56,708 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-30 17:38:56,708 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-05-30 17:38:56,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-30 17:38:56,710 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-05-30 17:38:56,711 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=240, Unknown=0, NotChecked=0, Total=306 [2024-05-30 17:38:56,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 17:38:56,711 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-30 17:38:56,711 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 6.5) internal successors, (117), 18 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-30 17:38:56,712 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-05-30 17:38:56,712 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2024-05-30 17:38:56,712 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 17:38:57,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-30 17:38:57,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-05-30 17:38:57,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-05-30 17:38:57,088 INFO L78 Accepts]: Start accepts. Automaton has currently 1401 states, but on-demand construction may add more states Word has length 82 [2024-05-30 17:38:57,089 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-30 17:38:57,096 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-05-30 17:38:57,294 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2024-05-30 17:38:57,294 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-30 17:38:57,295 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-30 17:38:57,295 INFO L85 PathProgramCache]: Analyzing trace with hash -308799052, now seen corresponding path program 2 times [2024-05-30 17:38:57,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-30 17:38:57,297 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1593654493] [2024-05-30 17:38:57,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 17:38:57,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-30 17:38:57,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-30 17:38:57,620 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 0 proven. 93 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-30 17:38:57,621 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-30 17:38:57,621 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1593654493] [2024-05-30 17:38:57,621 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1593654493] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-30 17:38:57,621 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2065688061] [2024-05-30 17:38:57,621 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-05-30 17:38:57,621 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-30 17:38:57,621 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-30 17:38:57,622 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-05-30 17:38:57,633 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-05-30 17:38:57,694 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-05-30 17:38:57,695 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-05-30 17:38:57,696 INFO L262 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 17 conjunts are in the unsatisfiable core [2024-05-30 17:38:57,701 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-30 17:38:57,893 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 0 proven. 93 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-30 17:38:57,893 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-30 17:38:58,261 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 0 proven. 93 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-30 17:38:58,262 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2065688061] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-30 17:38:58,262 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-30 17:38:58,262 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 30 [2024-05-30 17:38:58,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [736830961] [2024-05-30 17:38:58,262 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-30 17:38:58,264 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2024-05-30 17:38:58,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-30 17:38:58,266 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2024-05-30 17:38:58,267 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=186, Invalid=684, Unknown=0, NotChecked=0, Total=870 [2024-05-30 17:38:58,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 17:38:58,267 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-30 17:38:58,267 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 5.9) internal successors, (177), 30 states have internal predecessors, (177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-30 17:38:58,267 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-05-30 17:38:58,267 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2024-05-30 17:38:58,267 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 25 states. [2024-05-30 17:38:58,267 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 17:38:59,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-30 17:38:59,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-05-30 17:38:59,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-05-30 17:38:59,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2024-05-30 17:38:59,085 INFO L78 Accepts]: Start accepts. Automaton has currently 2296 states, but on-demand construction may add more states Word has length 132 [2024-05-30 17:38:59,086 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-30 17:38:59,091 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-05-30 17:38:59,291 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-30 17:38:59,292 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-30 17:38:59,292 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-30 17:38:59,292 INFO L85 PathProgramCache]: Analyzing trace with hash -1179456078, now seen corresponding path program 3 times [2024-05-30 17:38:59,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-30 17:38:59,292 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1231873442] [2024-05-30 17:38:59,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 17:38:59,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-30 17:38:59,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-30 17:38:59,681 INFO L134 CoverageAnalysis]: Checked inductivity of 433 backedges. 396 proven. 37 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-30 17:38:59,682 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-30 17:38:59,682 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1231873442] [2024-05-30 17:38:59,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1231873442] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-30 17:38:59,682 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [376013149] [2024-05-30 17:38:59,682 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-05-30 17:38:59,682 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-30 17:38:59,682 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-30 17:38:59,683 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-05-30 17:38:59,686 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-05-30 17:38:59,768 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2024-05-30 17:38:59,768 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-05-30 17:38:59,770 INFO L262 TraceCheckSpWp]: Trace formula consists of 267 conjuncts, 22 conjunts are in the unsatisfiable core [2024-05-30 17:38:59,778 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-30 17:38:59,885 INFO L134 CoverageAnalysis]: Checked inductivity of 433 backedges. 433 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-30 17:38:59,886 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-05-30 17:38:59,886 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [376013149] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-30 17:38:59,886 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-05-30 17:38:59,886 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [23] total 25 [2024-05-30 17:38:59,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [374054051] [2024-05-30 17:38:59,886 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-30 17:38:59,886 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-05-30 17:38:59,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-30 17:38:59,888 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-05-30 17:38:59,888 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=451, Unknown=0, NotChecked=0, Total=600 [2024-05-30 17:38:59,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 17:38:59,888 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-30 17:38:59,891 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 5.739130434782608) internal successors, (132), 23 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-30 17:38:59,891 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-05-30 17:38:59,891 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2024-05-30 17:38:59,891 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 25 states. [2024-05-30 17:38:59,891 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 45 states. [2024-05-30 17:38:59,891 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 17:39:00,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-30 17:39:00,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-05-30 17:39:00,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-05-30 17:39:00,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2024-05-30 17:39:00,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2024-05-30 17:39:00,553 INFO L78 Accepts]: Start accepts. Automaton has currently 12097 states, but on-demand construction may add more states Word has length 135 [2024-05-30 17:39:00,555 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-30 17:39:00,563 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-05-30 17:39:00,760 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-30 17:39:00,761 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-30 17:39:00,761 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-30 17:39:00,761 INFO L85 PathProgramCache]: Analyzing trace with hash -619679658, now seen corresponding path program 1 times [2024-05-30 17:39:00,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-30 17:39:00,763 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1644684244] [2024-05-30 17:39:00,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 17:39:00,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-30 17:39:00,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-30 17:39:00,799 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-30 17:39:00,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-30 17:39:00,853 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-05-30 17:39:00,853 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-05-30 17:39:00,854 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-05-30 17:39:00,855 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-05-30 17:39:00,862 INFO L445 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1] [2024-05-30 17:39:00,863 INFO L308 ceAbstractionStarter]: Result for error location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION was UNSAFE (1/3) [2024-05-30 17:39:00,866 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-05-30 17:39:00,866 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2024-05-30 17:39:00,941 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: Expected StepInfo for loop construct to contain Condition, but it did not [2024-05-30 17:39:00,949 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.05 05:39:00 BasicIcfg [2024-05-30 17:39:00,949 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-05-30 17:39:00,949 INFO L158 Benchmark]: Toolchain (without parser) took 7200.75ms. Allocated memory was 172.0MB in the beginning and 385.9MB in the end (delta: 213.9MB). Free memory was 97.3MB in the beginning and 189.8MB in the end (delta: -92.5MB). Peak memory consumption was 122.2MB. Max. memory is 8.0GB. [2024-05-30 17:39:00,949 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 172.0MB. Free memory is still 101.1MB. There was no memory consumed. Max. memory is 8.0GB. [2024-05-30 17:39:00,949 INFO L158 Benchmark]: CACSL2BoogieTranslator took 441.20ms. Allocated memory was 172.0MB in the beginning and 320.9MB in the end (delta: 148.9MB). Free memory was 97.1MB in the beginning and 279.0MB in the end (delta: -181.9MB). Peak memory consumption was 15.6MB. Max. memory is 8.0GB. [2024-05-30 17:39:00,950 INFO L158 Benchmark]: Boogie Procedure Inliner took 29.91ms. Allocated memory is still 320.9MB. Free memory was 279.0MB in the beginning and 277.5MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2024-05-30 17:39:00,950 INFO L158 Benchmark]: Boogie Preprocessor took 17.65ms. Allocated memory is still 320.9MB. Free memory was 277.5MB in the beginning and 275.9MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2024-05-30 17:39:00,950 INFO L158 Benchmark]: RCFGBuilder took 380.02ms. Allocated memory is still 320.9MB. Free memory was 275.9MB in the beginning and 262.8MB in the end (delta: 13.1MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. [2024-05-30 17:39:00,950 INFO L158 Benchmark]: TraceAbstraction took 6326.22ms. Allocated memory was 320.9MB in the beginning and 385.9MB in the end (delta: 65.0MB). Free memory was 261.7MB in the beginning and 189.8MB in the end (delta: 71.9MB). Peak memory consumption was 137.0MB. Max. memory is 8.0GB. [2024-05-30 17:39:00,951 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.09ms. Allocated memory is still 172.0MB. Free memory is still 101.1MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 441.20ms. Allocated memory was 172.0MB in the beginning and 320.9MB in the end (delta: 148.9MB). Free memory was 97.1MB in the beginning and 279.0MB in the end (delta: -181.9MB). Peak memory consumption was 15.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 29.91ms. Allocated memory is still 320.9MB. Free memory was 279.0MB in the beginning and 277.5MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 17.65ms. Allocated memory is still 320.9MB. Free memory was 277.5MB in the beginning and 275.9MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 380.02ms. Allocated memory is still 320.9MB. Free memory was 275.9MB in the beginning and 262.8MB in the end (delta: 13.1MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. * TraceAbstraction took 6326.22ms. Allocated memory was 320.9MB in the beginning and 385.9MB in the end (delta: 65.0MB). Free memory was 261.7MB in the beginning and 189.8MB in the end (delta: 71.9MB). Peak memory consumption was 137.0MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expected StepInfo for loop construct to contain Condition, but it did not - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 52976, independent: 50688, independent conditional: 50688, independent unconditional: 0, dependent: 2288, dependent conditional: 2288, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 50969, independent: 50688, independent conditional: 50688, independent unconditional: 0, dependent: 281, dependent conditional: 281, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 50969, independent: 50688, independent conditional: 50688, independent unconditional: 0, dependent: 281, dependent conditional: 281, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 53287, independent: 50688, independent conditional: 527, independent unconditional: 50161, dependent: 2599, dependent conditional: 1791, dependent unconditional: 808, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 53287, independent: 50688, independent conditional: 527, independent unconditional: 50161, dependent: 2599, dependent conditional: 595, dependent unconditional: 2004, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 53287, independent: 50688, independent conditional: 527, independent unconditional: 50161, dependent: 2599, dependent conditional: 595, dependent unconditional: 2004, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 317, independent: 241, independent conditional: 23, independent unconditional: 218, dependent: 76, dependent conditional: 74, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 317, independent: 218, independent conditional: 0, independent unconditional: 218, dependent: 99, dependent conditional: 0, dependent unconditional: 99, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 99, independent: 23, independent conditional: 23, independent unconditional: 0, dependent: 76, dependent conditional: 74, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 99, independent: 23, independent conditional: 23, independent unconditional: 0, dependent: 76, dependent conditional: 74, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 172, independent: 41, independent conditional: 41, independent unconditional: 0, dependent: 130, dependent conditional: 106, dependent unconditional: 25, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 53287, independent: 50447, independent conditional: 504, independent unconditional: 49943, dependent: 2523, dependent conditional: 521, dependent unconditional: 2002, unknown: 317, unknown conditional: 97, unknown unconditional: 220] , Statistics on independence cache: Total cache size (in pairs): 317, Positive cache size: 241, Positive conditional cache size: 23, Positive unconditional cache size: 218, Negative cache size: 76, Negative conditional cache size: 74, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 1196, Maximal queried relation: 5, Independence queries for same thread: 2007 - StatisticsResult: Visitor Statistics States: 31, Transitions: 30, Traversal time: 0.0s - StatisticsResult: Visitor Statistics States: 316, Transitions: 338, Traversal time: 0.2s - StatisticsResult: Visitor Statistics States: 592, Transitions: 632, Traversal time: 0.2s - StatisticsResult: Visitor Statistics States: 1351, Transitions: 1443, Traversal time: 0.4s - StatisticsResult: Visitor Statistics States: 2211, Transitions: 2358, Traversal time: 0.8s - StatisticsResult: Visitor Statistics States: 12015, Transitions: 12866, Traversal time: 0.7s - CounterExampleResult [Line: 722]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L694] 0 int i = 3, j = 6; VAL [i=3, j=6] [L712] 0 pthread_t id1, id2; VAL [\old(argc)=50, argc=50, argv={51:49}, i=3, id1={5:0}, id2={3:0}, j=6] [L713] FCALL, FORK 0 pthread_create(&id1, ((void *)0), t1, ((void *)0)) VAL [\old(argc)=50, arg={0:0}, argc=50, argv={51:49}, i=3, id1={5:0}, id2={3:0}, j=6] [L714] FCALL, FORK 0 pthread_create(&id2, ((void *)0), t2, ((void *)0)) VAL [\old(argc)=50, arg={0:0}, arg={0:0}, argc=50, argv={51:49}, i=3, id1={5:0}, id2={3:0}, j=6] [L716] 0 int condI = i >= (2*10 +6); VAL [\old(argc)=50, arg={0:0}, arg={0:0}, argc=50, argv={51:49}, condI=0, i=3, id1={5:0}, id2={3:0}, j=6] [L696] 1 int k = 0; VAL [arg={0:0}, arg={0:0}, arg={0:0}, i=3, j=6, k=0] [L696] COND TRUE 1 k < 10 VAL [arg={0:0}, arg={0:0}, arg={0:0}, i=3, j=6, k=0] [L698] 1 i = j + 1 VAL [arg={0:0}, arg={0:0}, arg={0:0}, i=7, j=6, k=0] [L696] 1 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, i=7, j=6, k=1] [L696] COND TRUE 1 k < 10 VAL [arg={0:0}, arg={0:0}, arg={0:0}, i=7, j=6, k=1] [L704] 2 int k = 0; VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=7, j=6, k=0, k=1] [L704] COND TRUE 2 k < 10 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=7, j=6, k=0, k=1] [L706] 2 j = i + 1 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=7, j=8, k=0, k=1] [L698] 1 i = j + 1 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=9, j=8, k=0, k=1] [L696] 1 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=9, j=8, k=0, k=2] [L696] COND TRUE 1 k < 10 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=9, j=8, k=0, k=2] [L704] 2 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=9, j=8, k=1, k=2] [L704] COND TRUE 2 k < 10 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=9, j=8, k=1, k=2] [L706] 2 j = i + 1 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=9, j=10, k=1, k=2] [L698] 1 i = j + 1 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=11, j=10, k=1, k=2] [L696] 1 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=11, j=10, k=1, k=3] [L696] COND TRUE 1 k < 10 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=11, j=10, k=1, k=3] [L704] 2 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=11, j=10, k=2, k=3] [L704] COND TRUE 2 k < 10 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=11, j=10, k=2, k=3] [L706] 2 j = i + 1 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=11, j=12, k=2, k=3] [L698] 1 i = j + 1 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=13, j=12, k=2, k=3] [L696] 1 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=13, j=12, k=2, k=4] [L696] COND TRUE 1 k < 10 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=13, j=12, k=2, k=4] [L704] 2 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=13, j=12, k=3, k=4] [L704] COND TRUE 2 k < 10 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=13, j=12, k=3, k=4] [L706] 2 j = i + 1 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=13, j=14, k=3, k=4] [L698] 1 i = j + 1 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=15, j=14, k=3, k=4] [L696] 1 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=15, j=14, k=3, k=5] [L696] COND TRUE 1 k < 10 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=15, j=14, k=3, k=5] [L704] 2 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=15, j=14, k=4, k=5] [L704] COND TRUE 2 k < 10 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=15, j=14, k=4, k=5] [L706] 2 j = i + 1 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=15, j=16, k=4, k=5] [L698] 1 i = j + 1 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=17, j=16, k=4, k=5] [L696] 1 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=17, j=16, k=4, k=6] [L696] COND TRUE 1 k < 10 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=17, j=16, k=4, k=6] [L704] 2 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=17, j=16, k=5, k=6] [L704] COND TRUE 2 k < 10 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=17, j=16, k=5, k=6] [L706] 2 j = i + 1 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=17, j=18, k=5, k=6] [L698] 1 i = j + 1 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=19, j=18, k=5, k=6] [L696] 1 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=19, j=18, k=5, k=7] [L696] COND TRUE 1 k < 10 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=19, j=18, k=5, k=7] [L704] 2 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=19, j=18, k=6, k=7] [L704] COND TRUE 2 k < 10 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=19, j=18, k=6, k=7] [L706] 2 j = i + 1 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=19, j=20, k=6, k=7] [L698] 1 i = j + 1 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=21, j=20, k=6, k=7] [L696] 1 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=21, j=20, k=6, k=8] [L696] COND TRUE 1 k < 10 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=21, j=20, k=6, k=8] [L704] 2 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=21, j=20, k=7, k=8] [L704] COND TRUE 2 k < 10 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=21, j=20, k=7, k=8] [L706] 2 j = i + 1 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=21, j=22, k=7, k=8] [L698] 1 i = j + 1 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=23, j=22, k=7, k=8] [L696] 1 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=23, j=22, k=7, k=9] [L696] COND TRUE 1 k < 10 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=23, j=22, k=7, k=9] [L704] 2 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=23, j=22, k=8, k=9] [L704] COND TRUE 2 k < 10 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=23, j=22, k=8, k=9] [L706] 2 j = i + 1 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=23, j=24, k=8, k=9] [L698] 1 i = j + 1 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=25, j=24, k=8, k=9] [L696] 1 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=25, j=24, k=10, k=8] [L696] COND FALSE 1 !(k < 10) VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=25, j=24, k=10, k=8] [L704] 2 k++ VAL [\result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=25, j=24, k=9] [L704] COND TRUE 2 k < 10 VAL [\result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=25, j=24, k=9] [L706] 2 j = i + 1 VAL [\result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=25, j=26, k=9] [L719] 0 int condJ = j >= (2*10 +6); VAL [\old(argc)=50, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, argc=50, argv={51:49}, condI=0, condJ=1, i=25, id1={5:0}, id2={3:0}, j=26, k=9] [L721] COND TRUE 0 condI || condJ VAL [\old(argc)=50, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, argc=50, argv={51:49}, condI=0, condJ=1, i=25, id1={5:0}, id2={3:0}, j=26, k=9] [L722] 0 reach_error() VAL [\old(argc)=50, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, argc=50, argv={51:49}, condI=0, condJ=1, i=25, id1={5:0}, id2={3:0}, j=26, k=9] - StatisticsResult: Ultimate Automizer benchmark data for error location: ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION with 1 thread instances CFG has 5 procedures, 88 locations, 3 error locations. Started 1 CEGAR loops. OverallTime: 6.1s, OverallIterations: 6, TraceHistogramMax: 0, PathProgramHistogramMax: 3, EmptinessCheckTime: 2.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: 125, 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, 2.5s InterpolantComputationTime, 737 NumberOfCodeBlocks, 737 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 726 ConstructedInterpolants, 0 QuantifiedInterpolants, 3522 SizeOfPredicates, 38 NumberOfNonLiveVariables, 593 ConjunctsInSsa, 50 ConjunctsInUnsatCore, 10 InterpolantComputations, 3 PerfectInterpolantSequences, 829/1172 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 proved your program to be incorrect! [2024-05-30 17:39:00,973 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Ended with exit code 0 [2024-05-30 17:39:01,173 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...