./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-regression/stateful_check.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-regression/stateful_check.c -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 86e7865b5c88aae342720e4dde014f366638a0b48b0e0f6e55acb2c675bcac3e --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 01:33:52,255 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 01:33:52,357 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-11 01:33:52,364 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 01:33:52,364 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 01:33:52,400 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 01:33:52,401 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 01:33:52,401 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 01:33:52,402 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 01:33:52,403 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 01:33:52,405 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 01:33:52,405 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 01:33:52,406 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 01:33:52,406 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 01:33:52,408 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 01:33:52,409 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 01:33:52,409 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 01:33:52,409 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 01:33:52,410 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 01:33:52,410 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 01:33:52,410 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 01:33:52,413 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 01:33:52,414 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 01:33:52,414 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 01:33:52,414 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 01:33:52,415 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 01:33:52,415 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 01:33:52,415 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 01:33:52,415 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 01:33:52,416 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 01:33:52,416 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 01:33:52,416 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 01:33:52,416 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 01:33:52,417 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 01:33:52,417 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 01:33:52,417 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 01:33:52,417 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 01:33:52,418 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 01:33:52,418 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 01:33:52,418 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 01:33:52,418 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 01:33:52,420 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 01:33:52,420 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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-clean/releaseScripts/default/UAutomizer-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.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 86e7865b5c88aae342720e4dde014f366638a0b48b0e0f6e55acb2c675bcac3e [2024-10-11 01:33:52,695 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 01:33:52,746 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 01:33:52,749 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 01:33:52,750 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 01:33:52,751 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 01:33:52,752 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-regression/stateful_check.c [2024-10-11 01:33:54,260 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 01:33:54,473 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 01:33:54,474 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-regression/stateful_check.c [2024-10-11 01:33:54,484 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/6f2931c49/c74fcfd77ebb4ffc8364243161a770af/FLAGf795f8003 [2024-10-11 01:33:54,495 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/6f2931c49/c74fcfd77ebb4ffc8364243161a770af [2024-10-11 01:33:54,497 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 01:33:54,498 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 01:33:54,501 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 01:33:54,502 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 01:33:54,506 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 01:33:54,506 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 01:33:54" (1/1) ... [2024-10-11 01:33:54,507 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@274bf236 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:33:54, skipping insertion in model container [2024-10-11 01:33:54,507 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 01:33:54" (1/1) ... [2024-10-11 01:33:54,525 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 01:33:54,684 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-regression/stateful_check.c[298,311] [2024-10-11 01:33:54,714 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 01:33:54,724 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 01:33:54,737 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-regression/stateful_check.c[298,311] [2024-10-11 01:33:54,744 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 01:33:54,758 INFO L204 MainTranslator]: Completed translation [2024-10-11 01:33:54,759 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:33:54 WrapperNode [2024-10-11 01:33:54,759 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 01:33:54,760 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 01:33:54,761 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 01:33:54,761 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 01:33:54,767 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:33:54" (1/1) ... [2024-10-11 01:33:54,777 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:33:54" (1/1) ... [2024-10-11 01:33:54,798 INFO L138 Inliner]: procedures = 21, calls = 20, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 104 [2024-10-11 01:33:54,799 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 01:33:54,800 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 01:33:54,800 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 01:33:54,800 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 01:33:54,808 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:33:54" (1/1) ... [2024-10-11 01:33:54,808 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:33:54" (1/1) ... [2024-10-11 01:33:54,810 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:33:54" (1/1) ... [2024-10-11 01:33:54,822 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-11 01:33:54,822 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:33:54" (1/1) ... [2024-10-11 01:33:54,822 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:33:54" (1/1) ... [2024-10-11 01:33:54,827 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:33:54" (1/1) ... [2024-10-11 01:33:54,831 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:33:54" (1/1) ... [2024-10-11 01:33:54,832 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:33:54" (1/1) ... [2024-10-11 01:33:54,833 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:33:54" (1/1) ... [2024-10-11 01:33:54,835 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 01:33:54,838 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 01:33:54,839 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 01:33:54,839 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 01:33:54,839 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:33:54" (1/1) ... [2024-10-11 01:33:54,845 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 01:33:54,854 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 01:33:54,870 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 01:33:54,877 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 01:33:54,916 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 01:33:54,916 INFO L130 BoogieDeclarations]: Found specification of procedure __blast_assert [2024-10-11 01:33:54,916 INFO L138 BoogieDeclarations]: Found implementation of procedure __blast_assert [2024-10-11 01:33:54,917 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 01:33:54,917 INFO L130 BoogieDeclarations]: Found specification of procedure mutex_lock [2024-10-11 01:33:54,917 INFO L138 BoogieDeclarations]: Found implementation of procedure mutex_lock [2024-10-11 01:33:54,917 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 01:33:54,917 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 01:33:54,972 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 01:33:54,974 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 01:33:55,181 INFO L? ?]: Removed 15 outVars from TransFormulas that were not future-live. [2024-10-11 01:33:55,182 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 01:33:55,227 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 01:33:55,227 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 01:33:55,228 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 01:33:55 BoogieIcfgContainer [2024-10-11 01:33:55,228 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 01:33:55,231 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 01:33:55,231 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 01:33:55,234 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 01:33:55,235 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 01:33:54" (1/3) ... [2024-10-11 01:33:55,236 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@329a4755 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 01:33:55, skipping insertion in model container [2024-10-11 01:33:55,236 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:33:54" (2/3) ... [2024-10-11 01:33:55,237 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@329a4755 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 01:33:55, skipping insertion in model container [2024-10-11 01:33:55,237 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 01:33:55" (3/3) ... [2024-10-11 01:33:55,239 INFO L112 eAbstractionObserver]: Analyzing ICFG stateful_check.c [2024-10-11 01:33:55,255 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 01:33:55,255 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 01:33:55,304 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 01:33:55,310 INFO L333 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, mAutomataTypeConcurrency=PETRI_NET, 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;@68b45205, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 01:33:55,311 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 01:33:55,314 INFO L276 IsEmpty]: Start isEmpty. Operand has 36 states, 26 states have (on average 1.6538461538461537) internal successors, (43), 31 states have internal predecessors, (43), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-11 01:33:55,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-10-11 01:33:55,319 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 01:33:55,320 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-10-11 01:33:55,320 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 01:33:55,325 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 01:33:55,326 INFO L85 PathProgramCache]: Analyzing trace with hash 908924996, now seen corresponding path program 1 times [2024-10-11 01:33:55,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 01:33:55,336 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1640528999] [2024-10-11 01:33:55,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 01:33:55,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 01:33:55,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:33:55,463 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 01:33:55,464 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 01:33:55,464 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1640528999] [2024-10-11 01:33:55,466 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1640528999] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 01:33:55,466 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 01:33:55,466 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 01:33:55,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1886328915] [2024-10-11 01:33:55,469 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 01:33:55,473 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 01:33:55,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 01:33:55,512 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 01:33:55,512 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 01:33:55,515 INFO L87 Difference]: Start difference. First operand has 36 states, 26 states have (on average 1.6538461538461537) internal successors, (43), 31 states have internal predecessors, (43), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 01:33:55,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 01:33:55,574 INFO L93 Difference]: Finished difference Result 70 states and 112 transitions. [2024-10-11 01:33:55,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 01:33:55,577 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2024-10-11 01:33:55,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 01:33:55,585 INFO L225 Difference]: With dead ends: 70 [2024-10-11 01:33:55,586 INFO L226 Difference]: Without dead ends: 33 [2024-10-11 01:33:55,589 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 01:33:55,593 INFO L432 NwaCegarLoop]: 43 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 01:33:55,594 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 43 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 01:33:55,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2024-10-11 01:33:55,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2024-10-11 01:33:55,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 25 states have (on average 1.56) internal successors, (39), 28 states have internal predecessors, (39), 6 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 01:33:55,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 48 transitions. [2024-10-11 01:33:55,621 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 48 transitions. Word has length 6 [2024-10-11 01:33:55,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 01:33:55,622 INFO L471 AbstractCegarLoop]: Abstraction has 33 states and 48 transitions. [2024-10-11 01:33:55,622 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 01:33:55,622 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 48 transitions. [2024-10-11 01:33:55,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-10-11 01:33:55,623 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 01:33:55,623 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-10-11 01:33:55,623 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 01:33:55,623 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 01:33:55,624 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 01:33:55,624 INFO L85 PathProgramCache]: Analyzing trace with hash -311212518, now seen corresponding path program 1 times [2024-10-11 01:33:55,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 01:33:55,624 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1007080155] [2024-10-11 01:33:55,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 01:33:55,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 01:33:55,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:33:55,675 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 01:33:55,676 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 01:33:55,676 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1007080155] [2024-10-11 01:33:55,676 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1007080155] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 01:33:55,676 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 01:33:55,676 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 01:33:55,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [807118244] [2024-10-11 01:33:55,677 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 01:33:55,677 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 01:33:55,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 01:33:55,680 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 01:33:55,680 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 01:33:55,680 INFO L87 Difference]: Start difference. First operand 33 states and 48 transitions. Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 2 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 01:33:55,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 01:33:55,724 INFO L93 Difference]: Finished difference Result 58 states and 87 transitions. [2024-10-11 01:33:55,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 01:33:55,725 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 2 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2024-10-11 01:33:55,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 01:33:55,728 INFO L225 Difference]: With dead ends: 58 [2024-10-11 01:33:55,728 INFO L226 Difference]: Without dead ends: 52 [2024-10-11 01:33:55,728 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 01:33:55,729 INFO L432 NwaCegarLoop]: 41 mSDtfsCounter, 29 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 01:33:55,730 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 78 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 01:33:55,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2024-10-11 01:33:55,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2024-10-11 01:33:55,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 42 states have (on average 1.5952380952380953) internal successors, (67), 45 states have internal predecessors, (67), 8 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (5), 3 states have call predecessors, (5), 5 states have call successors, (5) [2024-10-11 01:33:55,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 80 transitions. [2024-10-11 01:33:55,741 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 80 transitions. Word has length 7 [2024-10-11 01:33:55,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 01:33:55,742 INFO L471 AbstractCegarLoop]: Abstraction has 52 states and 80 transitions. [2024-10-11 01:33:55,742 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 2 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 01:33:55,743 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 80 transitions. [2024-10-11 01:33:55,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-10-11 01:33:55,743 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 01:33:55,744 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 01:33:55,744 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 01:33:55,744 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 01:33:55,745 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 01:33:55,745 INFO L85 PathProgramCache]: Analyzing trace with hash -306987785, now seen corresponding path program 1 times [2024-10-11 01:33:55,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 01:33:55,745 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1677979162] [2024-10-11 01:33:55,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 01:33:55,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 01:33:55,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:33:55,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 01:33:55,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:33:55,826 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 01:33:55,826 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 01:33:55,827 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1677979162] [2024-10-11 01:33:55,827 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1677979162] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 01:33:55,827 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 01:33:55,827 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 01:33:55,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [454954157] [2024-10-11 01:33:55,827 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 01:33:55,828 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 01:33:55,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 01:33:55,829 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 01:33:55,829 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 01:33:55,829 INFO L87 Difference]: Start difference. First operand 52 states and 80 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 01:33:55,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 01:33:55,938 INFO L93 Difference]: Finished difference Result 130 states and 205 transitions. [2024-10-11 01:33:55,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 01:33:55,943 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2024-10-11 01:33:55,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 01:33:55,944 INFO L225 Difference]: With dead ends: 130 [2024-10-11 01:33:55,944 INFO L226 Difference]: Without dead ends: 79 [2024-10-11 01:33:55,945 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 01:33:55,946 INFO L432 NwaCegarLoop]: 34 mSDtfsCounter, 19 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 01:33:55,949 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 89 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 01:33:55,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2024-10-11 01:33:55,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 76. [2024-10-11 01:33:55,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 66 states have (on average 1.5454545454545454) internal successors, (102), 69 states have internal predecessors, (102), 8 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (5), 3 states have call predecessors, (5), 5 states have call successors, (5) [2024-10-11 01:33:55,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 115 transitions. [2024-10-11 01:33:55,966 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 115 transitions. Word has length 17 [2024-10-11 01:33:55,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 01:33:55,967 INFO L471 AbstractCegarLoop]: Abstraction has 76 states and 115 transitions. [2024-10-11 01:33:55,967 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 01:33:55,973 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 115 transitions. [2024-10-11 01:33:55,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-10-11 01:33:55,974 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 01:33:55,974 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 01:33:55,974 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 01:33:55,975 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 01:33:55,975 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 01:33:55,975 INFO L85 PathProgramCache]: Analyzing trace with hash 1007545302, now seen corresponding path program 1 times [2024-10-11 01:33:55,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 01:33:55,976 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1949857052] [2024-10-11 01:33:55,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 01:33:55,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 01:33:56,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:33:56,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-11 01:33:56,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:33:56,121 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 01:33:56,121 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 01:33:56,121 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1949857052] [2024-10-11 01:33:56,121 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1949857052] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 01:33:56,122 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [85186034] [2024-10-11 01:33:56,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 01:33:56,122 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 01:33:56,127 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 01:33:56,128 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 01:33:56,130 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-11 01:33:56,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:33:56,204 INFO L255 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 01:33:56,209 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 01:33:56,292 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 01:33:56,293 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 01:33:56,358 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 01:33:56,359 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [85186034] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 01:33:56,359 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 01:33:56,359 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 3, 4] total 7 [2024-10-11 01:33:56,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1788189090] [2024-10-11 01:33:56,359 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 01:33:56,360 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 01:33:56,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 01:33:56,361 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 01:33:56,361 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-11 01:33:56,361 INFO L87 Difference]: Start difference. First operand 76 states and 115 transitions. Second operand has 7 states, 7 states have (on average 6.142857142857143) internal successors, (43), 6 states have internal predecessors, (43), 1 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 01:33:56,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 01:33:56,500 INFO L93 Difference]: Finished difference Result 235 states and 370 transitions. [2024-10-11 01:33:56,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 01:33:56,501 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.142857142857143) internal successors, (43), 6 states have internal predecessors, (43), 1 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 24 [2024-10-11 01:33:56,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 01:33:56,502 INFO L225 Difference]: With dead ends: 235 [2024-10-11 01:33:56,503 INFO L226 Difference]: Without dead ends: 160 [2024-10-11 01:33:56,503 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 45 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-11 01:33:56,505 INFO L432 NwaCegarLoop]: 33 mSDtfsCounter, 71 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 179 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 01:33:56,506 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 179 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 01:33:56,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2024-10-11 01:33:56,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 148. [2024-10-11 01:33:56,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 138 states have (on average 1.5869565217391304) internal successors, (219), 141 states have internal predecessors, (219), 8 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (5), 3 states have call predecessors, (5), 5 states have call successors, (5) [2024-10-11 01:33:56,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 232 transitions. [2024-10-11 01:33:56,527 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 232 transitions. Word has length 24 [2024-10-11 01:33:56,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 01:33:56,528 INFO L471 AbstractCegarLoop]: Abstraction has 148 states and 232 transitions. [2024-10-11 01:33:56,528 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.142857142857143) internal successors, (43), 6 states have internal predecessors, (43), 1 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 01:33:56,528 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 232 transitions. [2024-10-11 01:33:56,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-10-11 01:33:56,529 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 01:33:56,529 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 01:33:56,543 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-11 01:33:56,733 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 01:33:56,734 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 01:33:56,734 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 01:33:56,734 INFO L85 PathProgramCache]: Analyzing trace with hash 1518945594, now seen corresponding path program 1 times [2024-10-11 01:33:56,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 01:33:56,735 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1947652863] [2024-10-11 01:33:56,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 01:33:56,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 01:33:56,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 01:33:56,759 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-11 01:33:56,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 01:33:56,814 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-11 01:33:56,815 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-11 01:33:56,817 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location __blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-11 01:33:56,818 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 01:33:56,821 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2024-10-11 01:33:56,857 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 01:33:56,860 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 01:33:56 BoogieIcfgContainer [2024-10-11 01:33:56,864 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 01:33:56,865 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 01:33:56,865 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 01:33:56,865 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 01:33:56,865 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 01:33:55" (3/4) ... [2024-10-11 01:33:56,866 INFO L133 WitnessPrinter]: Generating witness for reachability counterexample [2024-10-11 01:33:56,907 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-11 01:33:56,907 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 01:33:56,907 INFO L158 Benchmark]: Toolchain (without parser) took 2409.54ms. Allocated memory is still 165.7MB. Free memory was 112.3MB in the beginning and 74.0MB in the end (delta: 38.3MB). Peak memory consumption was 40.4MB. Max. memory is 16.1GB. [2024-10-11 01:33:56,908 INFO L158 Benchmark]: CDTParser took 0.25ms. Allocated memory is still 165.7MB. Free memory is still 127.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 01:33:56,908 INFO L158 Benchmark]: CACSL2BoogieTranslator took 258.09ms. Allocated memory is still 165.7MB. Free memory was 112.3MB in the beginning and 99.0MB in the end (delta: 13.4MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-10-11 01:33:56,908 INFO L158 Benchmark]: Boogie Procedure Inliner took 38.64ms. Allocated memory is still 165.7MB. Free memory was 99.0MB in the beginning and 97.4MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 01:33:56,908 INFO L158 Benchmark]: Boogie Preprocessor took 35.24ms. Allocated memory is still 165.7MB. Free memory was 97.4MB in the beginning and 95.5MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 01:33:56,909 INFO L158 Benchmark]: RCFGBuilder took 389.52ms. Allocated memory is still 165.7MB. Free memory was 95.5MB in the beginning and 80.9MB in the end (delta: 14.6MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-10-11 01:33:56,909 INFO L158 Benchmark]: TraceAbstraction took 1633.34ms. Allocated memory is still 165.7MB. Free memory was 80.2MB in the beginning and 76.2MB in the end (delta: 4.0MB). Peak memory consumption was 4.7MB. Max. memory is 16.1GB. [2024-10-11 01:33:56,909 INFO L158 Benchmark]: Witness Printer took 42.42ms. Allocated memory is still 165.7MB. Free memory was 76.2MB in the beginning and 74.0MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 01:33:56,910 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.25ms. Allocated memory is still 165.7MB. Free memory is still 127.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 258.09ms. Allocated memory is still 165.7MB. Free memory was 112.3MB in the beginning and 99.0MB in the end (delta: 13.4MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 38.64ms. Allocated memory is still 165.7MB. Free memory was 99.0MB in the beginning and 97.4MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 35.24ms. Allocated memory is still 165.7MB. Free memory was 97.4MB in the beginning and 95.5MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 389.52ms. Allocated memory is still 165.7MB. Free memory was 95.5MB in the beginning and 80.9MB in the end (delta: 14.6MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 1633.34ms. Allocated memory is still 165.7MB. Free memory was 80.2MB in the beginning and 76.2MB in the end (delta: 4.0MB). Peak memory consumption was 4.7MB. Max. memory is 16.1GB. * Witness Printer took 42.42ms. Allocated memory is still 165.7MB. Free memory was 76.2MB in the beginning and 74.0MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 6]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L11] int ldv_mutex = 1; [L13] int open_called = 0; [L76] int ldv_s_misc_fops_file_operations = 0; [L77] CALL my_init() [L71] open_called = 0 [L72] return 0; [L77] RET my_init() [L78] COND TRUE __VERIFIER_nondet_int() [L82] case 0: [L84] CALL misc_open() [L59] COND TRUE __VERIFIER_nondet_int() [L61] return 1; VAL [\result=1, ldv_mutex=1, open_called=0] [L84] RET misc_open() [L85] ldv_s_misc_fops_file_operations++ VAL [ldv_mutex=1, ldv_s_misc_fops_file_operations=1, open_called=0] [L78] COND TRUE __VERIFIER_nondet_int() [L82] case 0: [L90] case 1: [L92] CALL misc_read() [L54] return 0; [L92] RET misc_read() [L93] ldv_s_misc_fops_file_operations++ VAL [ldv_mutex=1, ldv_s_misc_fops_file_operations=2, open_called=0] [L78] COND TRUE __VERIFIER_nondet_int() [L82] case 0: [L90] case 1: [L98] case 2: [L100] CALL misc_llseek() [L50] return 0; [L100] RET misc_llseek() [L101] ldv_s_misc_fops_file_operations++ VAL [ldv_mutex=1, ldv_s_misc_fops_file_operations=3, open_called=0] [L78] COND TRUE __VERIFIER_nondet_int() [L82] case 0: [L90] case 1: [L98] case 2: [L106] case 3: [L108] CALL misc_release() [L36] COND FALSE !(\read(open_called)) VAL [ldv_mutex=1, open_called=0] [L43] CALL mutex_lock() VAL [\old(ldv_mutex)=1, ldv_mutex=1, open_called=0] [L18] (ldv_mutex == 1) ? 0 : __blast_assert() VAL [\old(ldv_mutex)=1, ldv_mutex=1, open_called=0] [L19] ldv_mutex = 2 [L43] RET mutex_lock() VAL [ldv_mutex=2, open_called=0] [L44] CALL mutex_lock() VAL [\old(ldv_mutex)=2, ldv_mutex=2, open_called=0] [L18] (ldv_mutex == 1) ? 0 : __blast_assert() VAL [\old(ldv_mutex)=2, ldv_mutex=2, open_called=0] [L18] CALL __blast_assert() VAL [\old(ldv_mutex)=2, ldv_mutex=2, open_called=0] [L6] reach_error() VAL [\old(ldv_mutex)=2, ldv_mutex=2, open_called=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 36 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.5s, OverallIterations: 5, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 119 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 119 mSDsluCounter, 389 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 238 mSDsCounter, 35 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 140 IncrementalHoareTripleChecker+Invalid, 175 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 35 mSolverCounterUnsat, 151 mSDtfsCounter, 140 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 59 GetRequests, 50 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=148occurred in iteration=4, InterpolantAutomatonStates: 16, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 4 MinimizatonAttempts, 15 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 115 NumberOfCodeBlocks, 115 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 96 ConstructedInterpolants, 0 QuantifiedInterpolants, 206 SizeOfPredicates, 0 NumberOfNonLiveVariables, 83 ConjunctsInSsa, 3 ConjunctsInUnsatCore, 6 InterpolantComputations, 3 PerfectInterpolantSequences, 4/13 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-10-11 01:33:56,939 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE