./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/locks/test_locks_15-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/locks/test_locks_15-1.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 11a9c91fdf6b42598924d9a4ae5a3db9994a05118a3b564c2bd29b9bad4177b0 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 08:08:10,797 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 08:08:10,868 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-09 08:08:10,874 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 08:08:10,875 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 08:08:10,905 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 08:08:10,907 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 08:08:10,907 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 08:08:10,908 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 08:08:10,909 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 08:08:10,910 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 08:08:10,912 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 08:08:10,913 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 08:08:10,913 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 08:08:10,914 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 08:08:10,914 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 08:08:10,914 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 08:08:10,915 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 08:08:10,915 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 08:08:10,915 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 08:08:10,915 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-09 08:08:10,920 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-09 08:08:10,920 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-09 08:08:10,920 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 08:08:10,920 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-09 08:08:10,921 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 08:08:10,921 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-09 08:08:10,921 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 08:08:10,921 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 08:08:10,922 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 08:08:10,922 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 08:08:10,922 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 08:08:10,922 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 08:08:10,923 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 08:08:10,923 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 08:08:10,923 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 08:08:10,923 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 08:08:10,924 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 08:08:10,924 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 08:08:10,924 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 08:08:10,924 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 08:08:10,925 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 08:08:10,926 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/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/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 valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) 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 -> 11a9c91fdf6b42598924d9a4ae5a3db9994a05118a3b564c2bd29b9bad4177b0 [2024-11-09 08:08:11,179 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 08:08:11,197 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 08:08:11,201 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 08:08:11,202 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 08:08:11,202 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 08:08:11,204 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/locks/test_locks_15-1.c [2024-11-09 08:08:12,600 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 08:08:12,813 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 08:08:12,814 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/locks/test_locks_15-1.c [2024-11-09 08:08:12,825 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d004927dc/cd63b5482b674648b311c54e07a6f6cc/FLAG71232e6ac [2024-11-09 08:08:12,838 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d004927dc/cd63b5482b674648b311c54e07a6f6cc [2024-11-09 08:08:12,840 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 08:08:12,841 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 08:08:12,846 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 08:08:12,846 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 08:08:12,853 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 08:08:12,853 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 08:08:12" (1/1) ... [2024-11-09 08:08:12,854 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@15a1a012 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:08:12, skipping insertion in model container [2024-11-09 08:08:12,854 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 08:08:12" (1/1) ... [2024-11-09 08:08:12,887 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 08:08:13,116 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 08:08:13,126 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 08:08:13,151 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 08:08:13,172 INFO L204 MainTranslator]: Completed translation [2024-11-09 08:08:13,173 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:08:13 WrapperNode [2024-11-09 08:08:13,173 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 08:08:13,174 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 08:08:13,174 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 08:08:13,175 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 08:08:13,185 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:08:13" (1/1) ... [2024-11-09 08:08:13,198 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:08:13" (1/1) ... [2024-11-09 08:08:13,221 INFO L138 Inliner]: procedures = 12, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 211 [2024-11-09 08:08:13,221 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 08:08:13,222 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 08:08:13,222 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 08:08:13,223 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 08:08:13,234 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:08:13" (1/1) ... [2024-11-09 08:08:13,234 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:08:13" (1/1) ... [2024-11-09 08:08:13,236 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:08:13" (1/1) ... [2024-11-09 08:08:13,260 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-11-09 08:08:13,260 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:08:13" (1/1) ... [2024-11-09 08:08:13,260 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:08:13" (1/1) ... [2024-11-09 08:08:13,268 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:08:13" (1/1) ... [2024-11-09 08:08:13,272 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:08:13" (1/1) ... [2024-11-09 08:08:13,273 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:08:13" (1/1) ... [2024-11-09 08:08:13,274 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:08:13" (1/1) ... [2024-11-09 08:08:13,276 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 08:08:13,277 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 08:08:13,278 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 08:08:13,278 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 08:08:13,278 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:08:13" (1/1) ... [2024-11-09 08:08:13,286 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 08:08:13,297 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 08:08:13,314 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-09 08:08:13,318 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-09 08:08:13,366 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 08:08:13,366 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 08:08:13,367 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 08:08:13,367 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-09 08:08:13,446 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 08:08:13,450 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 08:08:13,809 INFO L? ?]: Removed 38 outVars from TransFormulas that were not future-live. [2024-11-09 08:08:13,809 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 08:08:13,848 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 08:08:13,848 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-09 08:08:13,849 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 08:08:13 BoogieIcfgContainer [2024-11-09 08:08:13,849 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 08:08:13,851 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 08:08:13,851 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 08:08:13,855 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 08:08:13,855 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 08:08:12" (1/3) ... [2024-11-09 08:08:13,856 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@703728ba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 08:08:13, skipping insertion in model container [2024-11-09 08:08:13,856 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:08:13" (2/3) ... [2024-11-09 08:08:13,856 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@703728ba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 08:08:13, skipping insertion in model container [2024-11-09 08:08:13,856 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 08:08:13" (3/3) ... [2024-11-09 08:08:13,857 INFO L112 eAbstractionObserver]: Analyzing ICFG test_locks_15-1.c [2024-11-09 08:08:13,873 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 08:08:13,874 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-09 08:08:13,912 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 08:08:13,918 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=None, 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;@47dad098, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 08:08:13,918 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-09 08:08:13,922 INFO L276 IsEmpty]: Start isEmpty. Operand has 58 states, 55 states have (on average 1.9090909090909092) internal successors, (105), 57 states have internal predecessors, (105), 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-11-09 08:08:13,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-09 08:08:13,926 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 08:08:13,927 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-09 08:08:13,927 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-09 08:08:13,931 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 08:08:13,932 INFO L85 PathProgramCache]: Analyzing trace with hash 28959894, now seen corresponding path program 1 times [2024-11-09 08:08:13,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 08:08:13,939 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1873131551] [2024-11-09 08:08:13,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:08:13,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 08:08:14,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:08:14,096 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 08:08:14,097 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 08:08:14,097 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1873131551] [2024-11-09 08:08:14,102 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1873131551] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 08:08:14,102 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 08:08:14,102 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 08:08:14,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [851919095] [2024-11-09 08:08:14,105 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 08:08:14,109 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-09 08:08:14,110 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 08:08:14,140 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-09 08:08:14,141 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 08:08:14,143 INFO L87 Difference]: Start difference. First operand has 58 states, 55 states have (on average 1.9090909090909092) internal successors, (105), 57 states have internal predecessors, (105), 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) Second operand has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 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-11-09 08:08:14,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 08:08:14,157 INFO L93 Difference]: Finished difference Result 57 states and 101 transitions. [2024-11-09 08:08:14,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-09 08:08:14,159 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), 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) Word has length 5 [2024-11-09 08:08:14,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 08:08:14,165 INFO L225 Difference]: With dead ends: 57 [2024-11-09 08:08:14,165 INFO L226 Difference]: Without dead ends: 55 [2024-11-09 08:08:14,166 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-11-09 08:08:14,169 INFO L432 NwaCegarLoop]: 101 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 08:08:14,170 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 08:08:14,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2024-11-09 08:08:14,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2024-11-09 08:08:14,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 53 states have (on average 1.8679245283018868) internal successors, (99), 54 states have internal predecessors, (99), 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-11-09 08:08:14,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 99 transitions. [2024-11-09 08:08:14,197 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 99 transitions. Word has length 5 [2024-11-09 08:08:14,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 08:08:14,198 INFO L471 AbstractCegarLoop]: Abstraction has 55 states and 99 transitions. [2024-11-09 08:08:14,198 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), 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-11-09 08:08:14,198 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 99 transitions. [2024-11-09 08:08:14,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-09 08:08:14,198 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 08:08:14,198 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-09 08:08:14,199 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 08:08:14,199 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-09 08:08:14,199 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 08:08:14,200 INFO L85 PathProgramCache]: Analyzing trace with hash 889700686, now seen corresponding path program 1 times [2024-11-09 08:08:14,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 08:08:14,200 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [902013377] [2024-11-09 08:08:14,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:08:14,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 08:08:14,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:08:14,277 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 08:08:14,278 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 08:08:14,278 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [902013377] [2024-11-09 08:08:14,278 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [902013377] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 08:08:14,278 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 08:08:14,278 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 08:08:14,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [120263628] [2024-11-09 08:08:14,279 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 08:08:14,279 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 08:08:14,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 08:08:14,283 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 08:08:14,284 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 08:08:14,284 INFO L87 Difference]: Start difference. First operand 55 states and 99 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 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-11-09 08:08:14,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 08:08:14,295 INFO L93 Difference]: Finished difference Result 54 states and 98 transitions. [2024-11-09 08:08:14,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 08:08:14,296 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 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) Word has length 6 [2024-11-09 08:08:14,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 08:08:14,297 INFO L225 Difference]: With dead ends: 54 [2024-11-09 08:08:14,297 INFO L226 Difference]: Without dead ends: 52 [2024-11-09 08:08:14,297 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-11-09 08:08:14,299 INFO L432 NwaCegarLoop]: 98 mSDtfsCounter, 93 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 1 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 08:08:14,299 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 98 Invalid, 1 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 08:08:14,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2024-11-09 08:08:14,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2024-11-09 08:08:14,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 51 states have (on average 1.8823529411764706) internal successors, (96), 51 states have internal predecessors, (96), 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-11-09 08:08:14,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 96 transitions. [2024-11-09 08:08:14,305 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 96 transitions. Word has length 6 [2024-11-09 08:08:14,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 08:08:14,306 INFO L471 AbstractCegarLoop]: Abstraction has 52 states and 96 transitions. [2024-11-09 08:08:14,306 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 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-11-09 08:08:14,306 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 96 transitions. [2024-11-09 08:08:14,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-09 08:08:14,307 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 08:08:14,307 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 08:08:14,307 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 08:08:14,308 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-09 08:08:14,308 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 08:08:14,308 INFO L85 PathProgramCache]: Analyzing trace with hash 1809554789, now seen corresponding path program 1 times [2024-11-09 08:08:14,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 08:08:14,309 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2036046821] [2024-11-09 08:08:14,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:08:14,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 08:08:14,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:08:14,389 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 08:08:14,390 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 08:08:14,391 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2036046821] [2024-11-09 08:08:14,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2036046821] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 08:08:14,392 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 08:08:14,392 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 08:08:14,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1402881880] [2024-11-09 08:08:14,393 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 08:08:14,393 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 08:08:14,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 08:08:14,394 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 08:08:14,395 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 08:08:14,395 INFO L87 Difference]: Start difference. First operand 52 states and 96 transitions. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 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-11-09 08:08:14,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 08:08:14,428 INFO L93 Difference]: Finished difference Result 101 states and 186 transitions. [2024-11-09 08:08:14,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 08:08:14,429 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 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) Word has length 23 [2024-11-09 08:08:14,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 08:08:14,430 INFO L225 Difference]: With dead ends: 101 [2024-11-09 08:08:14,430 INFO L226 Difference]: Without dead ends: 101 [2024-11-09 08:08:14,431 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-11-09 08:08:14,432 INFO L432 NwaCegarLoop]: 153 mSDtfsCounter, 77 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 242 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 08:08:14,433 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 242 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 08:08:14,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2024-11-09 08:08:14,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 98. [2024-11-09 08:08:14,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 97 states have (on average 1.8969072164948453) internal successors, (184), 97 states have internal predecessors, (184), 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-11-09 08:08:14,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 184 transitions. [2024-11-09 08:08:14,449 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 184 transitions. Word has length 23 [2024-11-09 08:08:14,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 08:08:14,450 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 184 transitions. [2024-11-09 08:08:14,450 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 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-11-09 08:08:14,452 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 184 transitions. [2024-11-09 08:08:14,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-09 08:08:14,452 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 08:08:14,453 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 08:08:14,453 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-09 08:08:14,454 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-09 08:08:14,454 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 08:08:14,454 INFO L85 PathProgramCache]: Analyzing trace with hash 1809331837, now seen corresponding path program 1 times [2024-11-09 08:08:14,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 08:08:14,455 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [256231949] [2024-11-09 08:08:14,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:08:14,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 08:08:14,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:08:14,517 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 08:08:14,517 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 08:08:14,518 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [256231949] [2024-11-09 08:08:14,518 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [256231949] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 08:08:14,518 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 08:08:14,518 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 08:08:14,519 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2138135587] [2024-11-09 08:08:14,519 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 08:08:14,520 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 08:08:14,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 08:08:14,521 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 08:08:14,521 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 08:08:14,522 INFO L87 Difference]: Start difference. First operand 98 states and 184 transitions. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 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-11-09 08:08:14,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 08:08:14,544 INFO L93 Difference]: Finished difference Result 99 states and 185 transitions. [2024-11-09 08:08:14,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 08:08:14,548 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 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) Word has length 23 [2024-11-09 08:08:14,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 08:08:14,549 INFO L225 Difference]: With dead ends: 99 [2024-11-09 08:08:14,549 INFO L226 Difference]: Without dead ends: 99 [2024-11-09 08:08:14,549 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-11-09 08:08:14,550 INFO L432 NwaCegarLoop]: 95 mSDtfsCounter, 14 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 186 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 08:08:14,551 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 186 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 08:08:14,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2024-11-09 08:08:14,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2024-11-09 08:08:14,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 98 states have (on average 1.8877551020408163) internal successors, (185), 98 states have internal predecessors, (185), 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-11-09 08:08:14,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 185 transitions. [2024-11-09 08:08:14,570 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 185 transitions. Word has length 23 [2024-11-09 08:08:14,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 08:08:14,570 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 185 transitions. [2024-11-09 08:08:14,570 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 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-11-09 08:08:14,571 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 185 transitions. [2024-11-09 08:08:14,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-09 08:08:14,571 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 08:08:14,571 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 08:08:14,572 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-09 08:08:14,572 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-09 08:08:14,572 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 08:08:14,573 INFO L85 PathProgramCache]: Analyzing trace with hash 120611047, now seen corresponding path program 1 times [2024-11-09 08:08:14,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 08:08:14,573 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [193731259] [2024-11-09 08:08:14,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:08:14,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 08:08:14,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:08:14,627 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 08:08:14,628 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 08:08:14,628 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [193731259] [2024-11-09 08:08:14,628 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [193731259] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 08:08:14,628 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 08:08:14,628 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 08:08:14,629 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1819591736] [2024-11-09 08:08:14,629 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 08:08:14,629 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 08:08:14,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 08:08:14,630 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 08:08:14,630 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 08:08:14,630 INFO L87 Difference]: Start difference. First operand 99 states and 185 transitions. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 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-11-09 08:08:14,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 08:08:14,654 INFO L93 Difference]: Finished difference Result 139 states and 253 transitions. [2024-11-09 08:08:14,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 08:08:14,655 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 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) Word has length 23 [2024-11-09 08:08:14,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 08:08:14,656 INFO L225 Difference]: With dead ends: 139 [2024-11-09 08:08:14,656 INFO L226 Difference]: Without dead ends: 139 [2024-11-09 08:08:14,657 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-11-09 08:08:14,658 INFO L432 NwaCegarLoop]: 99 mSDtfsCounter, 77 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 08:08:14,658 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 136 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 08:08:14,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2024-11-09 08:08:14,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 136. [2024-11-09 08:08:14,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 135 states have (on average 1.8592592592592592) internal successors, (251), 135 states have internal predecessors, (251), 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-11-09 08:08:14,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 251 transitions. [2024-11-09 08:08:14,670 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 251 transitions. Word has length 23 [2024-11-09 08:08:14,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 08:08:14,670 INFO L471 AbstractCegarLoop]: Abstraction has 136 states and 251 transitions. [2024-11-09 08:08:14,670 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 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-11-09 08:08:14,671 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 251 transitions. [2024-11-09 08:08:14,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-09 08:08:14,671 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 08:08:14,672 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 08:08:14,672 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-09 08:08:14,672 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-09 08:08:14,673 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 08:08:14,673 INFO L85 PathProgramCache]: Analyzing trace with hash 120388095, now seen corresponding path program 1 times [2024-11-09 08:08:14,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 08:08:14,673 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1700263451] [2024-11-09 08:08:14,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:08:14,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 08:08:14,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:08:14,724 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 08:08:14,724 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 08:08:14,724 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1700263451] [2024-11-09 08:08:14,725 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1700263451] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 08:08:14,725 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 08:08:14,725 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 08:08:14,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1660977931] [2024-11-09 08:08:14,725 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 08:08:14,726 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 08:08:14,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 08:08:14,726 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 08:08:14,727 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 08:08:14,727 INFO L87 Difference]: Start difference. First operand 136 states and 251 transitions. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 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-11-09 08:08:14,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 08:08:14,746 INFO L93 Difference]: Finished difference Result 137 states and 246 transitions. [2024-11-09 08:08:14,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 08:08:14,747 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 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) Word has length 23 [2024-11-09 08:08:14,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 08:08:14,748 INFO L225 Difference]: With dead ends: 137 [2024-11-09 08:08:14,748 INFO L226 Difference]: Without dead ends: 137 [2024-11-09 08:08:14,748 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-11-09 08:08:14,749 INFO L432 NwaCegarLoop]: 124 mSDtfsCounter, 75 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 214 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 08:08:14,750 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 214 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 08:08:14,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2024-11-09 08:08:14,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 134. [2024-11-09 08:08:14,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 133 states have (on average 1.8345864661654134) internal successors, (244), 133 states have internal predecessors, (244), 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-11-09 08:08:14,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 244 transitions. [2024-11-09 08:08:14,765 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 244 transitions. Word has length 23 [2024-11-09 08:08:14,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 08:08:14,765 INFO L471 AbstractCegarLoop]: Abstraction has 134 states and 244 transitions. [2024-11-09 08:08:14,765 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 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-11-09 08:08:14,766 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 244 transitions. [2024-11-09 08:08:14,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-09 08:08:14,766 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 08:08:14,766 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 08:08:14,767 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-09 08:08:14,767 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-09 08:08:14,767 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 08:08:14,767 INFO L85 PathProgramCache]: Analyzing trace with hash -1873533659, now seen corresponding path program 1 times [2024-11-09 08:08:14,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 08:08:14,768 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [598025063] [2024-11-09 08:08:14,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:08:14,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 08:08:14,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 08:08:14,792 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 08:08:14,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 08:08:14,837 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 08:08:14,837 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-09 08:08:14,838 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (1 of 2 remaining) [2024-11-09 08:08:14,840 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (0 of 2 remaining) [2024-11-09 08:08:14,841 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-09 08:08:14,844 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2024-11-09 08:08:14,906 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-09 08:08:14,909 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.11 08:08:14 BoogieIcfgContainer [2024-11-09 08:08:14,909 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-09 08:08:14,909 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-09 08:08:14,910 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-09 08:08:14,911 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-09 08:08:14,911 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 08:08:13" (3/4) ... [2024-11-09 08:08:14,914 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-09 08:08:14,915 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-09 08:08:14,915 INFO L158 Benchmark]: Toolchain (without parser) took 2074.06ms. Allocated memory is still 169.9MB. Free memory was 102.6MB in the beginning and 59.6MB in the end (delta: 43.0MB). Peak memory consumption was 44.0MB. Max. memory is 16.1GB. [2024-11-09 08:08:14,916 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 113.2MB. Free memory is still 74.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 08:08:14,916 INFO L158 Benchmark]: CACSL2BoogieTranslator took 327.77ms. Allocated memory is still 169.9MB. Free memory was 102.3MB in the beginning and 88.7MB in the end (delta: 13.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-09 08:08:14,916 INFO L158 Benchmark]: Boogie Procedure Inliner took 47.31ms. Allocated memory is still 169.9MB. Free memory was 88.7MB in the beginning and 86.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 08:08:14,917 INFO L158 Benchmark]: Boogie Preprocessor took 54.44ms. Allocated memory is still 169.9MB. Free memory was 86.6MB in the beginning and 84.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 08:08:14,919 INFO L158 Benchmark]: RCFGBuilder took 571.61ms. Allocated memory is still 169.9MB. Free memory was 84.2MB in the beginning and 137.2MB in the end (delta: -52.9MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2024-11-09 08:08:14,919 INFO L158 Benchmark]: TraceAbstraction took 1058.05ms. Allocated memory is still 169.9MB. Free memory was 136.3MB in the beginning and 59.6MB in the end (delta: 76.7MB). Peak memory consumption was 77.6MB. Max. memory is 16.1GB. [2024-11-09 08:08:14,920 INFO L158 Benchmark]: Witness Printer took 5.42ms. Allocated memory is still 169.9MB. Free memory is still 59.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 08:08:14,922 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.17ms. Allocated memory is still 113.2MB. Free memory is still 74.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 327.77ms. Allocated memory is still 169.9MB. Free memory was 102.3MB in the beginning and 88.7MB in the end (delta: 13.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 47.31ms. Allocated memory is still 169.9MB. Free memory was 88.7MB in the beginning and 86.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 54.44ms. Allocated memory is still 169.9MB. Free memory was 86.6MB in the beginning and 84.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 571.61ms. Allocated memory is still 169.9MB. Free memory was 84.2MB in the beginning and 137.2MB in the end (delta: -52.9MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * TraceAbstraction took 1058.05ms. Allocated memory is still 169.9MB. Free memory was 136.3MB in the beginning and 59.6MB in the end (delta: 76.7MB). Peak memory consumption was 77.6MB. Max. memory is 16.1GB. * Witness Printer took 5.42ms. Allocated memory is still 169.9MB. Free memory is still 59.6MB. There was no memory consumed. 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 - UnprovableResult [Line: 3]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 3. Possible FailurePath: [L8] int p1 = __VERIFIER_nondet_int(); [L9] int lk1; [L11] int p2 = __VERIFIER_nondet_int(); [L12] int lk2; [L14] int p3 = __VERIFIER_nondet_int(); [L15] int lk3; [L17] int p4 = __VERIFIER_nondet_int(); [L18] int lk4; [L20] int p5 = __VERIFIER_nondet_int(); [L21] int lk5; [L23] int p6 = __VERIFIER_nondet_int(); [L24] int lk6; [L26] int p7 = __VERIFIER_nondet_int(); [L27] int lk7; [L29] int p8 = __VERIFIER_nondet_int(); [L30] int lk8; [L32] int p9 = __VERIFIER_nondet_int(); [L33] int lk9; [L35] int p10 = __VERIFIER_nondet_int(); [L36] int lk10; [L38] int p11 = __VERIFIER_nondet_int(); [L39] int lk11; [L41] int p12 = __VERIFIER_nondet_int(); [L42] int lk12; [L44] int p13 = __VERIFIER_nondet_int(); [L45] int lk13; [L47] int p14 = __VERIFIER_nondet_int(); [L48] int lk14; [L50] int p15 = __VERIFIER_nondet_int(); [L51] int lk15; [L54] int cond; VAL [p10=1, p11=0, p12=1, p13=1, p14=1, p15=1, p1=0, p2=0, p3=0, p4=1, p5=1, p6=1, p7=1, p8=1, p9=1] [L56] COND TRUE 1 [L57] cond = __VERIFIER_nondet_int() [L58] COND FALSE !(cond == 0) [L61] lk1 = 0 [L63] lk2 = 0 [L65] lk3 = 0 [L67] lk4 = 0 [L69] lk5 = 0 [L71] lk6 = 0 [L73] lk7 = 0 [L75] lk8 = 0 [L77] lk9 = 0 [L79] lk10 = 0 [L81] lk11 = 0 [L83] lk12 = 0 [L85] lk13 = 0 [L87] lk14 = 0 [L89] lk15 = 0 VAL [lk10=0, lk11=0, lk12=0, lk13=0, lk14=0, lk15=0, lk1=0, lk2=0, lk3=0, lk4=0, lk5=0, lk6=0, lk7=0, lk8=0, lk9=0, p10=1, p11=0, p12=1, p13=1, p14=1, p15=1, p1=0, p2=0, p3=0, p4=1, p5=1, p6=1, p7=1, p8=1, p9=1] [L93] COND FALSE !(p1 != 0) VAL [lk10=0, lk11=0, lk12=0, lk13=0, lk14=0, lk15=0, lk1=0, lk2=0, lk3=0, lk4=0, lk5=0, lk6=0, lk7=0, lk8=0, lk9=0, p10=1, p11=0, p12=1, p13=1, p14=1, p15=1, p1=0, p2=0, p3=0, p4=1, p5=1, p6=1, p7=1, p8=1, p9=1] [L97] COND FALSE !(p2 != 0) VAL [lk10=0, lk11=0, lk12=0, lk13=0, lk14=0, lk15=0, lk1=0, lk2=0, lk3=0, lk4=0, lk5=0, lk6=0, lk7=0, lk8=0, lk9=0, p10=1, p11=0, p12=1, p13=1, p14=1, p15=1, p1=0, p2=0, p3=0, p4=1, p5=1, p6=1, p7=1, p8=1, p9=1] [L101] COND FALSE !(p3 != 0) VAL [lk10=0, lk11=0, lk12=0, lk13=0, lk14=0, lk15=0, lk1=0, lk2=0, lk3=0, lk4=0, lk5=0, lk6=0, lk7=0, lk8=0, lk9=0, p10=1, p11=0, p12=1, p13=1, p14=1, p15=1, p1=0, p2=0, p3=0, p4=1, p5=1, p6=1, p7=1, p8=1, p9=1] [L105] COND TRUE p4 != 0 [L106] lk4 = 1 VAL [lk10=0, lk11=0, lk12=0, lk13=0, lk14=0, lk15=0, lk1=0, lk2=0, lk3=0, lk4=1, lk5=0, lk6=0, lk7=0, lk8=0, lk9=0, p10=1, p11=0, p12=1, p13=1, p14=1, p15=1, p1=0, p2=0, p3=0, p4=1, p5=1, p6=1, p7=1, p8=1, p9=1] [L109] COND TRUE p5 != 0 [L110] lk5 = 1 VAL [lk10=0, lk11=0, lk12=0, lk13=0, lk14=0, lk15=0, lk1=0, lk2=0, lk3=0, lk4=1, lk5=1, lk6=0, lk7=0, lk8=0, lk9=0, p10=1, p11=0, p12=1, p13=1, p14=1, p15=1, p1=0, p2=0, p3=0, p4=1, p5=1, p6=1, p7=1, p8=1, p9=1] [L113] COND TRUE p6 != 0 [L114] lk6 = 1 VAL [lk10=0, lk11=0, lk12=0, lk13=0, lk14=0, lk15=0, lk1=0, lk2=0, lk3=0, lk4=1, lk5=1, lk6=1, lk7=0, lk8=0, lk9=0, p10=1, p11=0, p12=1, p13=1, p14=1, p15=1, p1=0, p2=0, p3=0, p4=1, p5=1, p6=1, p7=1, p8=1, p9=1] [L117] COND TRUE p7 != 0 [L118] lk7 = 1 VAL [lk10=0, lk11=0, lk12=0, lk13=0, lk14=0, lk15=0, lk1=0, lk2=0, lk3=0, lk4=1, lk5=1, lk6=1, lk7=1, lk8=0, lk9=0, p10=1, p11=0, p12=1, p13=1, p14=1, p15=1, p1=0, p2=0, p3=0, p4=1, p5=1, p6=1, p7=1, p8=1, p9=1] [L121] COND TRUE p8 != 0 [L122] lk8 = 1 VAL [lk10=0, lk11=0, lk12=0, lk13=0, lk14=0, lk15=0, lk1=0, lk2=0, lk3=0, lk4=1, lk5=1, lk6=1, lk7=1, lk8=1, lk9=0, p10=1, p11=0, p12=1, p13=1, p14=1, p15=1, p1=0, p2=0, p3=0, p4=1, p5=1, p6=1, p7=1, p8=1, p9=1] [L125] COND TRUE p9 != 0 [L126] lk9 = 1 VAL [lk10=0, lk11=0, lk12=0, lk13=0, lk14=0, lk15=0, lk1=0, lk2=0, lk3=0, lk4=1, lk5=1, lk6=1, lk7=1, lk8=1, lk9=1, p10=1, p11=0, p12=1, p13=1, p14=1, p15=1, p1=0, p2=0, p3=0, p4=1, p5=1, p6=1, p7=1, p8=1, p9=1] [L129] COND TRUE p10 != 0 [L130] lk10 = 1 VAL [lk10=1, lk11=0, lk12=0, lk13=0, lk14=0, lk15=0, lk1=0, lk2=0, lk3=0, lk4=1, lk5=1, lk6=1, lk7=1, lk8=1, lk9=1, p10=1, p11=0, p12=1, p13=1, p14=1, p15=1, p1=0, p2=0, p3=0, p4=1, p5=1, p6=1, p7=1, p8=1, p9=1] [L133] COND FALSE !(p11 != 0) VAL [lk10=1, lk11=0, lk12=0, lk13=0, lk14=0, lk15=0, lk1=0, lk2=0, lk3=0, lk4=1, lk5=1, lk6=1, lk7=1, lk8=1, lk9=1, p10=1, p11=0, p12=1, p13=1, p14=1, p15=1, p1=0, p2=0, p3=0, p4=1, p5=1, p6=1, p7=1, p8=1, p9=1] [L137] COND TRUE p12 != 0 [L138] lk12 = 1 VAL [lk10=1, lk11=0, lk12=1, lk13=0, lk14=0, lk15=0, lk1=0, lk2=0, lk3=0, lk4=1, lk5=1, lk6=1, lk7=1, lk8=1, lk9=1, p10=1, p11=0, p12=1, p13=1, p14=1, p15=1, p1=0, p2=0, p3=0, p4=1, p5=1, p6=1, p7=1, p8=1, p9=1] [L141] COND TRUE p13 != 0 [L142] lk13 = 1 VAL [lk10=1, lk11=0, lk12=1, lk13=1, lk14=0, lk15=0, lk1=0, lk2=0, lk3=0, lk4=1, lk5=1, lk6=1, lk7=1, lk8=1, lk9=1, p10=1, p11=0, p12=1, p13=1, p14=1, p15=1, p1=0, p2=0, p3=0, p4=1, p5=1, p6=1, p7=1, p8=1, p9=1] [L145] COND TRUE p14 != 0 [L146] lk14 = 1 VAL [lk10=1, lk11=0, lk12=1, lk13=1, lk14=1, lk15=0, lk1=0, lk2=0, lk3=0, lk4=1, lk5=1, lk6=1, lk7=1, lk8=1, lk9=1, p10=1, p11=0, p12=1, p13=1, p14=1, p15=1, p1=0, p2=0, p3=0, p4=1, p5=1, p6=1, p7=1, p8=1, p9=1] [L149] COND TRUE p15 != 0 [L150] lk15 = 1 VAL [lk10=1, lk11=0, lk12=1, lk13=1, lk14=1, lk15=1, lk1=0, lk2=0, lk3=0, lk4=1, lk5=1, lk6=1, lk7=1, lk8=1, lk9=1, p10=1, p11=0, p12=1, p13=1, p14=1, p15=1, p1=0, p2=0, p3=0, p4=1, p5=1, p6=1, p7=1, p8=1, p9=1] [L155] COND FALSE !(p1 != 0) VAL [lk10=1, lk11=0, lk12=1, lk13=1, lk14=1, lk15=1, lk1=0, lk2=0, lk3=0, lk4=1, lk5=1, lk6=1, lk7=1, lk8=1, lk9=1, p10=1, p11=0, p12=1, p13=1, p14=1, p15=1, p1=0, p2=0, p3=0, p4=1, p5=1, p6=1, p7=1, p8=1, p9=1] [L160] COND FALSE !(p2 != 0) VAL [lk10=1, lk11=0, lk12=1, lk13=1, lk14=1, lk15=1, lk1=0, lk2=0, lk3=0, lk4=1, lk5=1, lk6=1, lk7=1, lk8=1, lk9=1, p10=1, p11=0, p12=1, p13=1, p14=1, p15=1, p1=0, p3=0, p4=1, p5=1, p6=1, p7=1, p8=1, p9=1] [L233] CALL reach_error() [L3] __assert_fail("0", "test_locks_15-1.c", 3, "reach_error") - UnprovableResult [Line: 6]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 58 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 0.9s, OverallIterations: 7, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 336 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 336 mSDsluCounter, 977 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 307 mSDsCounter, 5 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 21 IncrementalHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 5 mSolverCounterUnsat, 670 mSDtfsCounter, 21 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 16 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=136occurred in iteration=5, InterpolantAutomatonStates: 17, 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, 6 MinimizatonAttempts, 9 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 126 NumberOfCodeBlocks, 126 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 97 ConstructedInterpolants, 0 QuantifiedInterpolants, 257 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-09 08:08:14,947 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/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 Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/locks/test_locks_15-1.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 11a9c91fdf6b42598924d9a4ae5a3db9994a05118a3b564c2bd29b9bad4177b0 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 08:08:17,151 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 08:08:17,243 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2024-11-09 08:08:17,249 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 08:08:17,250 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 08:08:17,286 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 08:08:17,287 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 08:08:17,287 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 08:08:17,288 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 08:08:17,288 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 08:08:17,289 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 08:08:17,289 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 08:08:17,289 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 08:08:17,291 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 08:08:17,291 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 08:08:17,292 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 08:08:17,292 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 08:08:17,292 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 08:08:17,293 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 08:08:17,295 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 08:08:17,296 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-09 08:08:17,296 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-09 08:08:17,296 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-09 08:08:17,296 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 08:08:17,297 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-09 08:08:17,297 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-09 08:08:17,297 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 08:08:17,297 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-09 08:08:17,298 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-09 08:08:17,298 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 08:08:17,298 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 08:08:17,298 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 08:08:17,299 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 08:08:17,299 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 08:08:17,303 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 08:08:17,303 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 08:08:17,303 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 08:08:17,303 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 08:08:17,304 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-09 08:08:17,305 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-09 08:08:17,305 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 08:08:17,305 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 08:08:17,305 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 08:08:17,306 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 08:08:17,306 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/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/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 valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) 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 -> 11a9c91fdf6b42598924d9a4ae5a3db9994a05118a3b564c2bd29b9bad4177b0 [2024-11-09 08:08:17,659 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 08:08:17,681 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 08:08:17,684 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 08:08:17,686 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 08:08:17,686 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 08:08:17,687 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/locks/test_locks_15-1.c [2024-11-09 08:08:19,202 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 08:08:19,429 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 08:08:19,430 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/locks/test_locks_15-1.c [2024-11-09 08:08:19,442 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8b6145d52/b4b17eaa41dc43a3ba7a5ac81e16dc0e/FLAG08327793b [2024-11-09 08:08:19,460 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8b6145d52/b4b17eaa41dc43a3ba7a5ac81e16dc0e [2024-11-09 08:08:19,462 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 08:08:19,464 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 08:08:19,467 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 08:08:19,468 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 08:08:19,473 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 08:08:19,474 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 08:08:19" (1/1) ... [2024-11-09 08:08:19,475 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7d3791b8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:08:19, skipping insertion in model container [2024-11-09 08:08:19,475 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 08:08:19" (1/1) ... [2024-11-09 08:08:19,506 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 08:08:19,756 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 08:08:19,774 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 08:08:19,811 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 08:08:19,836 INFO L204 MainTranslator]: Completed translation [2024-11-09 08:08:19,837 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:08:19 WrapperNode [2024-11-09 08:08:19,837 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 08:08:19,838 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 08:08:19,838 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 08:08:19,838 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 08:08:19,844 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:08:19" (1/1) ... [2024-11-09 08:08:19,854 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:08:19" (1/1) ... [2024-11-09 08:08:19,880 INFO L138 Inliner]: procedures = 12, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 195 [2024-11-09 08:08:19,881 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 08:08:19,886 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 08:08:19,886 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 08:08:19,886 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 08:08:19,897 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:08:19" (1/1) ... [2024-11-09 08:08:19,897 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:08:19" (1/1) ... [2024-11-09 08:08:19,905 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:08:19" (1/1) ... [2024-11-09 08:08:19,929 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-11-09 08:08:19,929 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:08:19" (1/1) ... [2024-11-09 08:08:19,930 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:08:19" (1/1) ... [2024-11-09 08:08:19,934 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:08:19" (1/1) ... [2024-11-09 08:08:19,941 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:08:19" (1/1) ... [2024-11-09 08:08:19,949 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:08:19" (1/1) ... [2024-11-09 08:08:19,951 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:08:19" (1/1) ... [2024-11-09 08:08:19,954 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 08:08:19,956 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 08:08:19,957 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 08:08:19,958 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 08:08:19,959 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:08:19" (1/1) ... [2024-11-09 08:08:19,964 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 08:08:19,976 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 08:08:19,992 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-09 08:08:19,995 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-09 08:08:20,050 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 08:08:20,051 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 08:08:20,051 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 08:08:20,051 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-09 08:08:20,127 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 08:08:20,130 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 08:08:20,503 INFO L? ?]: Removed 38 outVars from TransFormulas that were not future-live. [2024-11-09 08:08:20,506 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 08:08:20,524 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 08:08:20,525 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-09 08:08:20,526 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 08:08:20 BoogieIcfgContainer [2024-11-09 08:08:20,526 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 08:08:20,528 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 08:08:20,528 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 08:08:20,531 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 08:08:20,532 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 08:08:19" (1/3) ... [2024-11-09 08:08:20,532 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2bafa102 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 08:08:20, skipping insertion in model container [2024-11-09 08:08:20,532 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:08:19" (2/3) ... [2024-11-09 08:08:20,533 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2bafa102 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 08:08:20, skipping insertion in model container [2024-11-09 08:08:20,533 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 08:08:20" (3/3) ... [2024-11-09 08:08:20,534 INFO L112 eAbstractionObserver]: Analyzing ICFG test_locks_15-1.c [2024-11-09 08:08:20,551 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 08:08:20,552 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-09 08:08:20,600 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 08:08:20,608 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=None, 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;@17c13874, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 08:08:20,609 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-09 08:08:20,613 INFO L276 IsEmpty]: Start isEmpty. Operand has 58 states, 55 states have (on average 1.9090909090909092) internal successors, (105), 57 states have internal predecessors, (105), 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-11-09 08:08:20,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-09 08:08:20,619 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 08:08:20,620 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-09 08:08:20,620 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-09 08:08:20,626 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 08:08:20,627 INFO L85 PathProgramCache]: Analyzing trace with hash 28959894, now seen corresponding path program 1 times [2024-11-09 08:08:20,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 08:08:20,641 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1252279424] [2024-11-09 08:08:20,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:08:20,642 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 08:08:20,643 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 08:08:20,646 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 08:08:20,647 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-09 08:08:20,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:08:20,713 INFO L255 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-09 08:08:20,716 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 08:08:20,735 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 08:08:20,736 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 08:08:20,736 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 08:08:20,737 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1252279424] [2024-11-09 08:08:20,737 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1252279424] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 08:08:20,737 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 08:08:20,737 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 08:08:20,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [484393493] [2024-11-09 08:08:20,740 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 08:08:20,743 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-09 08:08:20,744 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 08:08:20,787 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-09 08:08:20,789 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 08:08:20,791 INFO L87 Difference]: Start difference. First operand has 58 states, 55 states have (on average 1.9090909090909092) internal successors, (105), 57 states have internal predecessors, (105), 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) Second operand has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 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-11-09 08:08:20,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 08:08:20,810 INFO L93 Difference]: Finished difference Result 57 states and 101 transitions. [2024-11-09 08:08:20,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-09 08:08:20,813 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), 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) Word has length 5 [2024-11-09 08:08:20,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 08:08:20,821 INFO L225 Difference]: With dead ends: 57 [2024-11-09 08:08:20,821 INFO L226 Difference]: Without dead ends: 55 [2024-11-09 08:08:20,823 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 4 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-11-09 08:08:20,828 INFO L432 NwaCegarLoop]: 101 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 08:08:20,829 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 08:08:20,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2024-11-09 08:08:20,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2024-11-09 08:08:20,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 53 states have (on average 1.8679245283018868) internal successors, (99), 54 states have internal predecessors, (99), 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-11-09 08:08:20,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 99 transitions. [2024-11-09 08:08:20,868 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 99 transitions. Word has length 5 [2024-11-09 08:08:20,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 08:08:20,868 INFO L471 AbstractCegarLoop]: Abstraction has 55 states and 99 transitions. [2024-11-09 08:08:20,868 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), 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-11-09 08:08:20,869 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 99 transitions. [2024-11-09 08:08:20,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-09 08:08:20,869 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 08:08:20,870 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-09 08:08:20,876 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2024-11-09 08:08:21,072 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 08:08:21,073 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-09 08:08:21,074 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 08:08:21,074 INFO L85 PathProgramCache]: Analyzing trace with hash 889700686, now seen corresponding path program 1 times [2024-11-09 08:08:21,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 08:08:21,075 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1573932959] [2024-11-09 08:08:21,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:08:21,075 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 08:08:21,076 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 08:08:21,080 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 08:08:21,082 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-09 08:08:21,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:08:21,143 INFO L255 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-09 08:08:21,144 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 08:08:21,177 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 08:08:21,177 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 08:08:21,177 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 08:08:21,178 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1573932959] [2024-11-09 08:08:21,178 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1573932959] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 08:08:21,178 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 08:08:21,178 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 08:08:21,178 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1969815525] [2024-11-09 08:08:21,178 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 08:08:21,180 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 08:08:21,180 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 08:08:21,181 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 08:08:21,182 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 08:08:21,182 INFO L87 Difference]: Start difference. First operand 55 states and 99 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 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-11-09 08:08:21,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 08:08:21,201 INFO L93 Difference]: Finished difference Result 54 states and 98 transitions. [2024-11-09 08:08:21,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 08:08:21,202 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 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) Word has length 6 [2024-11-09 08:08:21,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 08:08:21,204 INFO L225 Difference]: With dead ends: 54 [2024-11-09 08:08:21,204 INFO L226 Difference]: Without dead ends: 52 [2024-11-09 08:08:21,205 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-11-09 08:08:21,206 INFO L432 NwaCegarLoop]: 98 mSDtfsCounter, 93 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 1 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 08:08:21,207 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 98 Invalid, 1 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 08:08:21,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2024-11-09 08:08:21,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2024-11-09 08:08:21,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 51 states have (on average 1.8823529411764706) internal successors, (96), 51 states have internal predecessors, (96), 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-11-09 08:08:21,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 96 transitions. [2024-11-09 08:08:21,215 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 96 transitions. Word has length 6 [2024-11-09 08:08:21,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 08:08:21,215 INFO L471 AbstractCegarLoop]: Abstraction has 52 states and 96 transitions. [2024-11-09 08:08:21,215 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 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-11-09 08:08:21,216 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 96 transitions. [2024-11-09 08:08:21,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-09 08:08:21,216 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 08:08:21,217 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 08:08:21,221 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-09 08:08:21,420 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 08:08:21,420 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-09 08:08:21,421 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 08:08:21,421 INFO L85 PathProgramCache]: Analyzing trace with hash 1809554789, now seen corresponding path program 1 times [2024-11-09 08:08:21,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 08:08:21,422 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [624869352] [2024-11-09 08:08:21,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:08:21,423 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 08:08:21,423 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 08:08:21,430 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 08:08:21,438 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-09 08:08:21,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:08:21,494 INFO L255 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-09 08:08:21,496 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 08:08:21,576 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 08:08:21,576 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 08:08:21,577 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 08:08:21,577 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [624869352] [2024-11-09 08:08:21,577 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [624869352] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 08:08:21,577 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 08:08:21,578 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 08:08:21,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2125825157] [2024-11-09 08:08:21,578 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 08:08:21,579 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 08:08:21,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 08:08:21,580 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 08:08:21,583 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 08:08:21,583 INFO L87 Difference]: Start difference. First operand 52 states and 96 transitions. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 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-11-09 08:08:21,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 08:08:21,625 INFO L93 Difference]: Finished difference Result 101 states and 186 transitions. [2024-11-09 08:08:21,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 08:08:21,625 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 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) Word has length 23 [2024-11-09 08:08:21,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 08:08:21,627 INFO L225 Difference]: With dead ends: 101 [2024-11-09 08:08:21,629 INFO L226 Difference]: Without dead ends: 101 [2024-11-09 08:08:21,629 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 21 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-11-09 08:08:21,630 INFO L432 NwaCegarLoop]: 153 mSDtfsCounter, 77 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 242 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 08:08:21,632 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 242 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 08:08:21,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2024-11-09 08:08:21,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 98. [2024-11-09 08:08:21,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 97 states have (on average 1.8969072164948453) internal successors, (184), 97 states have internal predecessors, (184), 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-11-09 08:08:21,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 184 transitions. [2024-11-09 08:08:21,652 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 184 transitions. Word has length 23 [2024-11-09 08:08:21,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 08:08:21,653 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 184 transitions. [2024-11-09 08:08:21,653 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 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-11-09 08:08:21,654 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 184 transitions. [2024-11-09 08:08:21,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-09 08:08:21,654 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 08:08:21,655 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 08:08:21,661 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-11-09 08:08:21,855 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 08:08:21,856 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-09 08:08:21,856 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 08:08:21,857 INFO L85 PathProgramCache]: Analyzing trace with hash 1809331837, now seen corresponding path program 1 times [2024-11-09 08:08:21,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 08:08:21,857 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1688339829] [2024-11-09 08:08:21,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:08:21,858 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 08:08:21,858 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 08:08:21,862 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 08:08:21,863 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-09 08:08:21,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:08:21,903 INFO L255 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-09 08:08:21,904 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 08:08:21,953 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 08:08:21,957 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 08:08:21,958 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 08:08:21,966 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1688339829] [2024-11-09 08:08:21,968 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1688339829] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 08:08:21,968 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 08:08:21,969 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 08:08:21,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [180994543] [2024-11-09 08:08:21,969 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 08:08:21,969 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 08:08:21,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 08:08:21,970 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 08:08:21,971 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 08:08:21,972 INFO L87 Difference]: Start difference. First operand 98 states and 184 transitions. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 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-11-09 08:08:21,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 08:08:21,999 INFO L93 Difference]: Finished difference Result 99 states and 185 transitions. [2024-11-09 08:08:22,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 08:08:22,001 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 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) Word has length 23 [2024-11-09 08:08:22,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 08:08:22,002 INFO L225 Difference]: With dead ends: 99 [2024-11-09 08:08:22,002 INFO L226 Difference]: Without dead ends: 99 [2024-11-09 08:08:22,002 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 21 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-11-09 08:08:22,003 INFO L432 NwaCegarLoop]: 95 mSDtfsCounter, 14 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 186 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 08:08:22,006 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 186 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 08:08:22,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2024-11-09 08:08:22,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2024-11-09 08:08:22,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 98 states have (on average 1.8877551020408163) internal successors, (185), 98 states have internal predecessors, (185), 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-11-09 08:08:22,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 185 transitions. [2024-11-09 08:08:22,021 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 185 transitions. Word has length 23 [2024-11-09 08:08:22,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 08:08:22,025 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 185 transitions. [2024-11-09 08:08:22,025 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 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-11-09 08:08:22,025 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 185 transitions. [2024-11-09 08:08:22,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-09 08:08:22,026 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 08:08:22,026 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 08:08:22,034 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-11-09 08:08:22,226 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 08:08:22,227 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-09 08:08:22,227 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 08:08:22,228 INFO L85 PathProgramCache]: Analyzing trace with hash 120611047, now seen corresponding path program 1 times [2024-11-09 08:08:22,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 08:08:22,228 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [161328548] [2024-11-09 08:08:22,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:08:22,228 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 08:08:22,229 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 08:08:22,230 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 08:08:22,231 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-11-09 08:08:22,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:08:22,270 INFO L255 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-09 08:08:22,276 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 08:08:22,340 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 08:08:22,340 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 08:08:22,340 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 08:08:22,341 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [161328548] [2024-11-09 08:08:22,341 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [161328548] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 08:08:22,341 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 08:08:22,341 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 08:08:22,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [806871148] [2024-11-09 08:08:22,341 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 08:08:22,341 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 08:08:22,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 08:08:22,342 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 08:08:22,342 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 08:08:22,342 INFO L87 Difference]: Start difference. First operand 99 states and 185 transitions. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 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-11-09 08:08:22,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 08:08:22,368 INFO L93 Difference]: Finished difference Result 139 states and 253 transitions. [2024-11-09 08:08:22,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 08:08:22,369 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 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) Word has length 23 [2024-11-09 08:08:22,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 08:08:22,370 INFO L225 Difference]: With dead ends: 139 [2024-11-09 08:08:22,370 INFO L226 Difference]: Without dead ends: 139 [2024-11-09 08:08:22,371 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 21 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-11-09 08:08:22,372 INFO L432 NwaCegarLoop]: 99 mSDtfsCounter, 77 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 08:08:22,372 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 136 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 08:08:22,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2024-11-09 08:08:22,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 136. [2024-11-09 08:08:22,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 135 states have (on average 1.8592592592592592) internal successors, (251), 135 states have internal predecessors, (251), 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-11-09 08:08:22,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 251 transitions. [2024-11-09 08:08:22,381 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 251 transitions. Word has length 23 [2024-11-09 08:08:22,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 08:08:22,382 INFO L471 AbstractCegarLoop]: Abstraction has 136 states and 251 transitions. [2024-11-09 08:08:22,382 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 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-11-09 08:08:22,382 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 251 transitions. [2024-11-09 08:08:22,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-09 08:08:22,383 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 08:08:22,383 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 08:08:22,388 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2024-11-09 08:08:22,584 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 08:08:22,584 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-09 08:08:22,585 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 08:08:22,585 INFO L85 PathProgramCache]: Analyzing trace with hash 120388095, now seen corresponding path program 1 times [2024-11-09 08:08:22,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 08:08:22,586 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [215910371] [2024-11-09 08:08:22,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:08:22,586 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 08:08:22,586 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 08:08:22,589 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 08:08:22,590 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-11-09 08:08:22,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:08:22,636 INFO L255 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-09 08:08:22,638 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 08:08:22,681 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 08:08:22,682 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 08:08:22,682 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 08:08:22,682 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [215910371] [2024-11-09 08:08:22,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [215910371] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 08:08:22,682 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 08:08:22,682 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 08:08:22,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [176747660] [2024-11-09 08:08:22,682 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 08:08:22,683 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 08:08:22,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 08:08:22,683 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 08:08:22,683 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 08:08:22,683 INFO L87 Difference]: Start difference. First operand 136 states and 251 transitions. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 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-11-09 08:08:22,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 08:08:22,700 INFO L93 Difference]: Finished difference Result 137 states and 246 transitions. [2024-11-09 08:08:22,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 08:08:22,701 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 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) Word has length 23 [2024-11-09 08:08:22,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 08:08:22,702 INFO L225 Difference]: With dead ends: 137 [2024-11-09 08:08:22,702 INFO L226 Difference]: Without dead ends: 137 [2024-11-09 08:08:22,702 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 21 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-11-09 08:08:22,703 INFO L432 NwaCegarLoop]: 124 mSDtfsCounter, 75 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 214 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 08:08:22,703 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 214 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 08:08:22,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2024-11-09 08:08:22,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 134. [2024-11-09 08:08:22,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 133 states have (on average 1.8345864661654134) internal successors, (244), 133 states have internal predecessors, (244), 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-11-09 08:08:22,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 244 transitions. [2024-11-09 08:08:22,722 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 244 transitions. Word has length 23 [2024-11-09 08:08:22,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 08:08:22,723 INFO L471 AbstractCegarLoop]: Abstraction has 134 states and 244 transitions. [2024-11-09 08:08:22,723 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 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-11-09 08:08:22,723 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 244 transitions. [2024-11-09 08:08:22,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-09 08:08:22,724 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 08:08:22,724 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 08:08:22,728 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2024-11-09 08:08:22,925 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 08:08:22,926 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-09 08:08:22,927 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 08:08:22,927 INFO L85 PathProgramCache]: Analyzing trace with hash -1873533659, now seen corresponding path program 1 times [2024-11-09 08:08:22,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 08:08:22,927 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1651514881] [2024-11-09 08:08:22,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:08:22,928 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 08:08:22,928 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 08:08:22,931 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 08:08:22,932 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2024-11-09 08:08:22,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 08:08:22,968 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 08:08:22,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 08:08:23,025 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2024-11-09 08:08:23,025 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-09 08:08:23,028 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (1 of 2 remaining) [2024-11-09 08:08:23,030 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (0 of 2 remaining) [2024-11-09 08:08:23,037 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2024-11-09 08:08:23,235 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 08:08:23,239 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2024-11-09 08:08:23,284 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-09 08:08:23,287 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.11 08:08:23 BoogieIcfgContainer [2024-11-09 08:08:23,287 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-09 08:08:23,288 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-09 08:08:23,288 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-09 08:08:23,288 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-09 08:08:23,289 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 08:08:20" (3/4) ... [2024-11-09 08:08:23,292 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-09 08:08:23,294 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-09 08:08:23,294 INFO L158 Benchmark]: Toolchain (without parser) took 3830.59ms. Allocated memory was 69.2MB in the beginning and 92.3MB in the end (delta: 23.1MB). Free memory was 39.3MB in the beginning and 32.8MB in the end (delta: 6.5MB). Peak memory consumption was 29.3MB. Max. memory is 16.1GB. [2024-11-09 08:08:23,295 INFO L158 Benchmark]: CDTParser took 1.27ms. Allocated memory is still 46.1MB. Free memory is still 24.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 08:08:23,295 INFO L158 Benchmark]: CACSL2BoogieTranslator took 369.70ms. Allocated memory is still 69.2MB. Free memory was 39.1MB in the beginning and 45.0MB in the end (delta: -5.9MB). Peak memory consumption was 11.6MB. Max. memory is 16.1GB. [2024-11-09 08:08:23,295 INFO L158 Benchmark]: Boogie Procedure Inliner took 43.18ms. Allocated memory is still 69.2MB. Free memory was 45.0MB in the beginning and 42.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 08:08:23,296 INFO L158 Benchmark]: Boogie Preprocessor took 68.70ms. Allocated memory is still 69.2MB. Free memory was 42.9MB in the beginning and 40.6MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 08:08:23,296 INFO L158 Benchmark]: RCFGBuilder took 569.71ms. Allocated memory is still 69.2MB. Free memory was 40.6MB in the beginning and 39.5MB in the end (delta: 1.1MB). Peak memory consumption was 14.6MB. Max. memory is 16.1GB. [2024-11-09 08:08:23,296 INFO L158 Benchmark]: TraceAbstraction took 2759.23ms. Allocated memory was 69.2MB in the beginning and 92.3MB in the end (delta: 23.1MB). Free memory was 38.7MB in the beginning and 32.8MB in the end (delta: 5.9MB). Peak memory consumption was 28.3MB. Max. memory is 16.1GB. [2024-11-09 08:08:23,296 INFO L158 Benchmark]: Witness Printer took 6.00ms. Allocated memory is still 92.3MB. Free memory is still 32.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 08:08:23,298 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.27ms. Allocated memory is still 46.1MB. Free memory is still 24.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 369.70ms. Allocated memory is still 69.2MB. Free memory was 39.1MB in the beginning and 45.0MB in the end (delta: -5.9MB). Peak memory consumption was 11.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 43.18ms. Allocated memory is still 69.2MB. Free memory was 45.0MB in the beginning and 42.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 68.70ms. Allocated memory is still 69.2MB. Free memory was 42.9MB in the beginning and 40.6MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 569.71ms. Allocated memory is still 69.2MB. Free memory was 40.6MB in the beginning and 39.5MB in the end (delta: 1.1MB). Peak memory consumption was 14.6MB. Max. memory is 16.1GB. * TraceAbstraction took 2759.23ms. Allocated memory was 69.2MB in the beginning and 92.3MB in the end (delta: 23.1MB). Free memory was 38.7MB in the beginning and 32.8MB in the end (delta: 5.9MB). Peak memory consumption was 28.3MB. Max. memory is 16.1GB. * Witness Printer took 6.00ms. Allocated memory is still 92.3MB. Free memory is still 32.8MB. There was no memory consumed. 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 - UnprovableResult [Line: 3]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 3. Possible FailurePath: [L8] int p1 = __VERIFIER_nondet_int(); [L9] int lk1; [L11] int p2 = __VERIFIER_nondet_int(); [L12] int lk2; [L14] int p3 = __VERIFIER_nondet_int(); [L15] int lk3; [L17] int p4 = __VERIFIER_nondet_int(); [L18] int lk4; [L20] int p5 = __VERIFIER_nondet_int(); [L21] int lk5; [L23] int p6 = __VERIFIER_nondet_int(); [L24] int lk6; [L26] int p7 = __VERIFIER_nondet_int(); [L27] int lk7; [L29] int p8 = __VERIFIER_nondet_int(); [L30] int lk8; [L32] int p9 = __VERIFIER_nondet_int(); [L33] int lk9; [L35] int p10 = __VERIFIER_nondet_int(); [L36] int lk10; [L38] int p11 = __VERIFIER_nondet_int(); [L39] int lk11; [L41] int p12 = __VERIFIER_nondet_int(); [L42] int lk12; [L44] int p13 = __VERIFIER_nondet_int(); [L45] int lk13; [L47] int p14 = __VERIFIER_nondet_int(); [L48] int lk14; [L50] int p15 = __VERIFIER_nondet_int(); [L51] int lk15; [L54] int cond; [L56] COND TRUE 1 [L57] cond = __VERIFIER_nondet_int() [L58] COND FALSE !(cond == 0) [L61] lk1 = 0 [L63] lk2 = 0 [L65] lk3 = 0 [L67] lk4 = 0 [L69] lk5 = 0 [L71] lk6 = 0 [L73] lk7 = 0 [L75] lk8 = 0 [L77] lk9 = 0 [L79] lk10 = 0 [L81] lk11 = 0 [L83] lk12 = 0 [L85] lk13 = 0 [L87] lk14 = 0 [L89] lk15 = 0 VAL [lk10=0, lk11=0, lk12=0, lk13=0, lk14=0, lk15=0, lk1=0, lk2=0, lk3=0, lk4=0, lk5=0, lk6=0, lk7=0, lk8=0, lk9=0] [L93] COND FALSE !(p1 != 0) VAL [lk10=0, lk11=0, lk12=0, lk13=0, lk14=0, lk15=0, lk1=0, lk2=0, lk3=0, lk4=0, lk5=0, lk6=0, lk7=0, lk8=0, lk9=0, p1=0] [L97] COND FALSE !(p2 != 0) VAL [lk10=0, lk11=0, lk12=0, lk13=0, lk14=0, lk15=0, lk1=0, lk2=0, lk3=0, lk4=0, lk5=0, lk6=0, lk7=0, lk8=0, lk9=0, p1=0, p2=0] [L101] COND FALSE !(p3 != 0) VAL [lk10=0, lk11=0, lk12=0, lk13=0, lk14=0, lk15=0, lk1=0, lk2=0, lk3=0, lk4=0, lk5=0, lk6=0, lk7=0, lk8=0, lk9=0, p1=0, p2=0, p3=0] [L105] COND TRUE p4 != 0 [L106] lk4 = 1 VAL [lk10=0, lk11=0, lk12=0, lk13=0, lk14=0, lk15=0, lk1=0, lk2=0, lk3=0, lk4=1, lk5=0, lk6=0, lk7=0, lk8=0, lk9=0, p1=0, p2=0, p3=0, p4=2] [L109] COND TRUE p5 != 0 [L110] lk5 = 1 VAL [lk10=0, lk11=0, lk12=0, lk13=0, lk14=0, lk15=0, lk1=0, lk2=0, lk3=0, lk4=1, lk5=1, lk6=0, lk7=0, lk8=0, lk9=0, p1=0, p2=0, p3=0, p4=2, p5=2] [L113] COND TRUE p6 != 0 [L114] lk6 = 1 VAL [lk10=0, lk11=0, lk12=0, lk13=0, lk14=0, lk15=0, lk1=0, lk2=0, lk3=0, lk4=1, lk5=1, lk6=1, lk7=0, lk8=0, lk9=0, p1=0, p2=0, p3=0, p4=2, p5=2, p6=2] [L117] COND TRUE p7 != 0 [L118] lk7 = 1 VAL [lk10=0, lk11=0, lk12=0, lk13=0, lk14=0, lk15=0, lk1=0, lk2=0, lk3=0, lk4=1, lk5=1, lk6=1, lk7=1, lk8=0, lk9=0, p1=0, p2=0, p3=0, p4=2, p5=2, p6=2, p7=2] [L121] COND TRUE p8 != 0 [L122] lk8 = 1 VAL [lk10=0, lk11=0, lk12=0, lk13=0, lk14=0, lk15=0, lk1=0, lk2=0, lk3=0, lk4=1, lk5=1, lk6=1, lk7=1, lk8=1, lk9=0, p1=0, p2=0, p3=0, p4=2, p5=2, p6=2, p7=2, p8=2] [L125] COND TRUE p9 != 0 [L126] lk9 = 1 VAL [lk10=0, lk11=0, lk12=0, lk13=0, lk14=0, lk15=0, lk1=0, lk2=0, lk3=0, lk4=1, lk5=1, lk6=1, lk7=1, lk8=1, lk9=1, p1=0, p2=0, p3=0, p4=2, p5=2, p6=2, p7=2, p8=2, p9=2] [L129] COND TRUE p10 != 0 [L130] lk10 = 1 VAL [lk10=1, lk11=0, lk12=0, lk13=0, lk14=0, lk15=0, lk1=0, lk2=0, lk3=0, lk4=1, lk5=1, lk6=1, lk7=1, lk8=1, lk9=1, p10=2, p1=0, p2=0, p3=0, p4=2, p5=2, p6=2, p7=2, p8=2, p9=2] [L133] COND FALSE !(p11 != 0) VAL [lk10=1, lk11=0, lk12=0, lk13=0, lk14=0, lk15=0, lk1=0, lk2=0, lk3=0, lk4=1, lk5=1, lk6=1, lk7=1, lk8=1, lk9=1, p10=2, p11=0, p1=0, p2=0, p3=0, p4=2, p5=2, p6=2, p7=2, p8=2, p9=2] [L137] COND TRUE p12 != 0 [L138] lk12 = 1 VAL [lk10=1, lk11=0, lk12=1, lk13=0, lk14=0, lk15=0, lk1=0, lk2=0, lk3=0, lk4=1, lk5=1, lk6=1, lk7=1, lk8=1, lk9=1, p10=2, p11=0, p12=2, p1=0, p2=0, p3=0, p4=2, p5=2, p6=2, p7=2, p8=2, p9=2] [L141] COND TRUE p13 != 0 [L142] lk13 = 1 VAL [lk10=1, lk11=0, lk12=1, lk13=1, lk14=0, lk15=0, lk1=0, lk2=0, lk3=0, lk4=1, lk5=1, lk6=1, lk7=1, lk8=1, lk9=1, p10=2, p11=0, p12=2, p13=2, p1=0, p2=0, p3=0, p4=2, p5=2, p6=2, p7=2, p8=2, p9=2] [L145] COND TRUE p14 != 0 [L146] lk14 = 1 VAL [lk10=1, lk11=0, lk12=1, lk13=1, lk14=1, lk15=0, lk1=0, lk2=0, lk3=0, lk4=1, lk5=1, lk6=1, lk7=1, lk8=1, lk9=1, p10=2, p11=0, p12=2, p13=2, p14=2, p1=0, p2=0, p3=0, p4=2, p5=2, p6=2, p7=2, p8=2, p9=2] [L149] COND TRUE p15 != 0 [L150] lk15 = 1 VAL [lk10=1, lk11=0, lk12=1, lk13=1, lk14=1, lk15=1, lk1=0, lk2=0, lk3=0, lk4=1, lk5=1, lk6=1, lk7=1, lk8=1, lk9=1, p10=2, p11=0, p12=2, p13=2, p14=2, p15=2, p1=0, p2=0, p3=0, p4=2, p5=2, p6=2, p7=2, p8=2, p9=2] [L155] COND FALSE !(p1 != 0) VAL [lk10=1, lk11=0, lk12=1, lk13=1, lk14=1, lk15=1, lk1=0, lk2=0, lk3=0, lk4=1, lk5=1, lk6=1, lk7=1, lk8=1, lk9=1, p10=2, p11=0, p12=2, p13=2, p14=2, p15=2, p1=0, p2=0, p3=0, p4=2, p5=2, p6=2, p7=2, p8=2, p9=2] [L160] COND FALSE !(p2 != 0) VAL [lk10=1, lk11=0, lk12=1, lk13=1, lk14=1, lk15=1, lk1=0, lk2=0, lk3=0, lk4=1, lk5=1, lk6=1, lk7=1, lk8=1, lk9=1, p10=2, p11=0, p12=2, p13=2, p14=2, p15=2, p1=0, p3=0, p4=2, p5=2, p6=2, p7=2, p8=2, p9=2] [L233] CALL reach_error() [L3] __assert_fail("0", "test_locks_15-1.c", 3, "reach_error") - UnprovableResult [Line: 6]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 58 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 2.7s, OverallIterations: 7, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 336 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 336 mSDsluCounter, 977 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 307 mSDsCounter, 5 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 21 IncrementalHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 5 mSolverCounterUnsat, 670 mSDtfsCounter, 21 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 97 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=136occurred in iteration=5, InterpolantAutomatonStates: 17, 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, 6 MinimizatonAttempts, 9 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 126 NumberOfCodeBlocks, 126 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 97 ConstructedInterpolants, 0 QuantifiedInterpolants, 257 SizeOfPredicates, 0 NumberOfNonLiveVariables, 279 ConjunctsInSsa, 11 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-09 08:08:23,327 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/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 Result: UNKNOWN: Overapproximated counterexample