./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/valid-memsafety.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/locks/test_locks_14-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 4a390ef5 Calling Ultimate with: /root/.sdkman/candidates/java/current/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 /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/locks/test_locks_14-2.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 75f53c568c86c59ddc62d2fd150ff0a5ed9b51ea17cada3ff1a95dec57d9167c --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 16:40:50,311 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 16:40:50,377 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-10-24 16:40:50,382 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 16:40:50,382 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 16:40:50,401 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 16:40:50,402 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 16:40:50,402 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 16:40:50,403 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 16:40:50,407 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 16:40:50,407 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 16:40:50,408 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 16:40:50,408 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 16:40:50,409 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 16:40:50,409 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 16:40:50,409 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 16:40:50,410 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 16:40:50,410 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-24 16:40:50,412 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 16:40:50,412 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 16:40:50,412 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-24 16:40:50,413 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-24 16:40:50,413 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-10-24 16:40:50,414 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 16:40:50,415 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-24 16:40:50,415 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 16:40:50,415 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-24 16:40:50,415 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 16:40:50,416 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 16:40:50,416 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 16:40:50,416 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 16:40:50,416 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 16:40:50,417 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 16:40:50,417 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 16:40:50,418 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 16:40:50,418 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 16:40:50,419 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-24 16:40:50,419 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-24 16:40:50,420 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 16:40:50,420 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 16:40:50,420 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 16:40:50,421 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 16:40:50,421 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 -> 75f53c568c86c59ddc62d2fd150ff0a5ed9b51ea17cada3ff1a95dec57d9167c [2024-10-24 16:40:50,696 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 16:40:50,723 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 16:40:50,727 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 16:40:50,729 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 16:40:50,729 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 16:40:50,731 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/locks/test_locks_14-2.c [2024-10-24 16:40:52,252 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 16:40:52,449 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 16:40:52,449 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/locks/test_locks_14-2.c [2024-10-24 16:40:52,457 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a164645e6/41f80f27f5de42f7a32ca7de34a020fc/FLAG1f14f8a0f [2024-10-24 16:40:52,469 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a164645e6/41f80f27f5de42f7a32ca7de34a020fc [2024-10-24 16:40:52,471 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 16:40:52,472 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 16:40:52,473 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 16:40:52,474 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 16:40:52,480 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 16:40:52,481 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 04:40:52" (1/1) ... [2024-10-24 16:40:52,484 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@79263f01 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:40:52, skipping insertion in model container [2024-10-24 16:40:52,484 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 04:40:52" (1/1) ... [2024-10-24 16:40:52,512 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 16:40:52,723 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 16:40:52,733 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 16:40:52,769 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 16:40:52,795 INFO L204 MainTranslator]: Completed translation [2024-10-24 16:40:52,795 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:40:52 WrapperNode [2024-10-24 16:40:52,795 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 16:40:52,796 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 16:40:52,797 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 16:40:52,797 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 16:40:52,804 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:40:52" (1/1) ... [2024-10-24 16:40:52,814 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:40:52" (1/1) ... [2024-10-24 16:40:52,842 INFO L138 Inliner]: procedures = 12, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 199 [2024-10-24 16:40:52,842 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 16:40:52,844 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 16:40:52,844 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 16:40:52,844 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 16:40:52,854 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:40:52" (1/1) ... [2024-10-24 16:40:52,855 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:40:52" (1/1) ... [2024-10-24 16:40:52,858 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:40:52" (1/1) ... [2024-10-24 16:40:52,880 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-24 16:40:52,881 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:40:52" (1/1) ... [2024-10-24 16:40:52,881 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:40:52" (1/1) ... [2024-10-24 16:40:52,885 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:40:52" (1/1) ... [2024-10-24 16:40:52,892 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:40:52" (1/1) ... [2024-10-24 16:40:52,893 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:40:52" (1/1) ... [2024-10-24 16:40:52,896 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:40:52" (1/1) ... [2024-10-24 16:40:52,899 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 16:40:52,900 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 16:40:52,900 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 16:40:52,903 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 16:40:52,904 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:40:52" (1/1) ... [2024-10-24 16:40:52,913 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 16:40:52,922 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 16:40:52,934 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-10-24 16:40:52,936 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-10-24 16:40:52,983 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 16:40:52,983 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 16:40:52,983 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 16:40:52,983 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-24 16:40:53,049 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 16:40:53,051 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 16:40:53,349 INFO L? ?]: Removed 36 outVars from TransFormulas that were not future-live. [2024-10-24 16:40:53,349 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 16:40:53,390 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 16:40:53,390 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-24 16:40:53,392 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 04:40:53 BoogieIcfgContainer [2024-10-24 16:40:53,392 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 16:40:53,395 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 16:40:53,395 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 16:40:53,398 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 16:40:53,398 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 04:40:52" (1/3) ... [2024-10-24 16:40:53,398 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5751e98f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 04:40:53, skipping insertion in model container [2024-10-24 16:40:53,398 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:40:52" (2/3) ... [2024-10-24 16:40:53,399 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5751e98f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 04:40:53, skipping insertion in model container [2024-10-24 16:40:53,399 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 04:40:53" (3/3) ... [2024-10-24 16:40:53,400 INFO L112 eAbstractionObserver]: Analyzing ICFG test_locks_14-2.c [2024-10-24 16:40:53,415 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 16:40:53,416 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-10-24 16:40:53,457 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 16:40:53,462 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;@1932d7ce, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 16:40:53,462 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-10-24 16:40:53,466 INFO L276 IsEmpty]: Start isEmpty. Operand has 52 states, 49 states have (on average 1.9591836734693877) 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-10-24 16:40:53,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-10-24 16:40:53,471 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:40:53,472 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-10-24 16:40:53,473 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-24 16:40:53,477 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:40:53,478 INFO L85 PathProgramCache]: Analyzing trace with hash 9251162, now seen corresponding path program 1 times [2024-10-24 16:40:53,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 16:40:53,485 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1499851612] [2024-10-24 16:40:53,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:40:53,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 16:40:53,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:40:53,629 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 16:40:53,630 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 16:40:53,630 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1499851612] [2024-10-24 16:40:53,631 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1499851612] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 16:40:53,631 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 16:40:53,633 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 16:40:53,635 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1138886665] [2024-10-24 16:40:53,635 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 16:40:53,639 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-24 16:40:53,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 16:40:53,664 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-24 16:40:53,665 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 16:40:53,667 INFO L87 Difference]: Start difference. First operand has 52 states, 49 states have (on average 1.9591836734693877) 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) Second operand has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 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-10-24 16:40:53,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:40:53,689 INFO L93 Difference]: Finished difference Result 52 states and 93 transitions. [2024-10-24 16:40:53,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-24 16:40:53,691 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 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 4 [2024-10-24 16:40:53,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:40:53,701 INFO L225 Difference]: With dead ends: 52 [2024-10-24 16:40:53,701 INFO L226 Difference]: Without dead ends: 51 [2024-10-24 16:40:53,703 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 16:40:53,707 INFO L432 NwaCegarLoop]: 91 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 16:40:53,708 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 91 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 16:40:53,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2024-10-24 16:40:53,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2024-10-24 16:40:53,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 49 states have (on average 1.8775510204081634) internal successors, (92), 50 states have internal predecessors, (92), 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-10-24 16:40:53,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 92 transitions. [2024-10-24 16:40:53,736 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 92 transitions. Word has length 4 [2024-10-24 16:40:53,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:40:53,736 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 92 transitions. [2024-10-24 16:40:53,737 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 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-10-24 16:40:53,737 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 92 transitions. [2024-10-24 16:40:53,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-10-24 16:40:53,737 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:40:53,737 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-10-24 16:40:53,737 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-24 16:40:53,738 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-24 16:40:53,738 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:40:53,738 INFO L85 PathProgramCache]: Analyzing trace with hash 279252761, now seen corresponding path program 1 times [2024-10-24 16:40:53,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 16:40:53,739 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1609340842] [2024-10-24 16:40:53,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:40:53,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 16:40:53,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:40:53,816 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 16:40:53,817 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 16:40:53,817 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1609340842] [2024-10-24 16:40:53,817 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1609340842] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 16:40:53,817 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 16:40:53,818 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-24 16:40:53,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1134460813] [2024-10-24 16:40:53,819 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 16:40:53,820 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 16:40:53,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 16:40:53,821 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 16:40:53,821 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 16:40:53,821 INFO L87 Difference]: Start difference. First operand 51 states and 92 transitions. Second operand has 3 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-10-24 16:40:53,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:40:53,835 INFO L93 Difference]: Finished difference Result 50 states and 91 transitions. [2024-10-24 16:40:53,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 16:40:53,839 INFO L78 Accepts]: Start accepts. Automaton has has 3 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-10-24 16:40:53,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:40:53,840 INFO L225 Difference]: With dead ends: 50 [2024-10-24 16:40:53,842 INFO L226 Difference]: Without dead ends: 48 [2024-10-24 16:40:53,842 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 16:40:53,843 INFO L432 NwaCegarLoop]: 90 mSDtfsCounter, 87 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 90 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-10-24 16:40:53,844 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 90 Invalid, 1 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 16:40:53,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2024-10-24 16:40:53,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2024-10-24 16:40:53,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 47 states have (on average 1.8936170212765957) internal successors, (89), 47 states have internal predecessors, (89), 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-10-24 16:40:53,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 89 transitions. [2024-10-24 16:40:53,852 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 89 transitions. Word has length 5 [2024-10-24 16:40:53,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:40:53,853 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 89 transitions. [2024-10-24 16:40:53,853 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 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-10-24 16:40:53,853 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 89 transitions. [2024-10-24 16:40:53,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-10-24 16:40:53,854 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:40:53,855 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] [2024-10-24 16:40:53,855 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-24 16:40:53,855 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-24 16:40:53,857 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:40:53,858 INFO L85 PathProgramCache]: Analyzing trace with hash 842408509, now seen corresponding path program 1 times [2024-10-24 16:40:53,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 16:40:53,858 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [292078282] [2024-10-24 16:40:53,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:40:53,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 16:40:53,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:40:53,966 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 16:40:53,969 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 16:40:53,969 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [292078282] [2024-10-24 16:40:53,969 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [292078282] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 16:40:53,969 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 16:40:53,969 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 16:40:53,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [66951890] [2024-10-24 16:40:53,970 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 16:40:53,970 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 16:40:53,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 16:40:53,971 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 16:40:53,973 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 16:40:53,973 INFO L87 Difference]: Start difference. First operand 48 states and 89 transitions. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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-10-24 16:40:54,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:40:54,001 INFO L93 Difference]: Finished difference Result 94 states and 174 transitions. [2024-10-24 16:40:54,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 16:40:54,001 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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 21 [2024-10-24 16:40:54,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:40:54,003 INFO L225 Difference]: With dead ends: 94 [2024-10-24 16:40:54,003 INFO L226 Difference]: Without dead ends: 94 [2024-10-24 16:40:54,004 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-10-24 16:40:54,005 INFO L432 NwaCegarLoop]: 89 mSDtfsCounter, 69 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 173 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 16:40:54,007 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 173 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 16:40:54,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2024-10-24 16:40:54,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 63. [2024-10-24 16:40:54,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 62 states have (on average 1.903225806451613) internal successors, (118), 62 states have internal predecessors, (118), 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-10-24 16:40:54,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 118 transitions. [2024-10-24 16:40:54,022 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 118 transitions. Word has length 21 [2024-10-24 16:40:54,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:40:54,023 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 118 transitions. [2024-10-24 16:40:54,023 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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-10-24 16:40:54,024 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 118 transitions. [2024-10-24 16:40:54,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-10-24 16:40:54,025 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:40:54,025 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] [2024-10-24 16:40:54,025 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-24 16:40:54,026 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-24 16:40:54,026 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:40:54,027 INFO L85 PathProgramCache]: Analyzing trace with hash 842631461, now seen corresponding path program 1 times [2024-10-24 16:40:54,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 16:40:54,028 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [49112126] [2024-10-24 16:40:54,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:40:54,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 16:40:54,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:40:54,105 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 16:40:54,105 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 16:40:54,106 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [49112126] [2024-10-24 16:40:54,106 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [49112126] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 16:40:54,106 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 16:40:54,106 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 16:40:54,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1584153452] [2024-10-24 16:40:54,107 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 16:40:54,107 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 16:40:54,107 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 16:40:54,108 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 16:40:54,108 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 16:40:54,109 INFO L87 Difference]: Start difference. First operand 63 states and 118 transitions. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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-10-24 16:40:54,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:40:54,137 INFO L93 Difference]: Finished difference Result 95 states and 174 transitions. [2024-10-24 16:40:54,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 16:40:54,137 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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 21 [2024-10-24 16:40:54,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:40:54,139 INFO L225 Difference]: With dead ends: 95 [2024-10-24 16:40:54,139 INFO L226 Difference]: Without dead ends: 95 [2024-10-24 16:40:54,139 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-10-24 16:40:54,140 INFO L432 NwaCegarLoop]: 141 mSDtfsCounter, 72 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 223 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 16:40:54,141 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 223 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 16:40:54,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2024-10-24 16:40:54,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 92. [2024-10-24 16:40:54,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 91 states have (on average 1.89010989010989) internal successors, (172), 91 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 16:40:54,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 172 transitions. [2024-10-24 16:40:54,150 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 172 transitions. Word has length 21 [2024-10-24 16:40:54,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:40:54,151 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 172 transitions. [2024-10-24 16:40:54,151 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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-10-24 16:40:54,151 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 172 transitions. [2024-10-24 16:40:54,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-10-24 16:40:54,152 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:40:54,152 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] [2024-10-24 16:40:54,153 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-24 16:40:54,153 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-24 16:40:54,153 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:40:54,154 INFO L85 PathProgramCache]: Analyzing trace with hash -1151736197, now seen corresponding path program 1 times [2024-10-24 16:40:54,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 16:40:54,154 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [866201907] [2024-10-24 16:40:54,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:40:54,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 16:40:54,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:40:54,204 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 16:40:54,204 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 16:40:54,205 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [866201907] [2024-10-24 16:40:54,205 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [866201907] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 16:40:54,205 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 16:40:54,205 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 16:40:54,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [64009307] [2024-10-24 16:40:54,205 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 16:40:54,206 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 16:40:54,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 16:40:54,207 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 16:40:54,207 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 16:40:54,207 INFO L87 Difference]: Start difference. First operand 92 states and 172 transitions. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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-10-24 16:40:54,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:40:54,229 INFO L93 Difference]: Finished difference Result 97 states and 174 transitions. [2024-10-24 16:40:54,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 16:40:54,233 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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 21 [2024-10-24 16:40:54,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:40:54,234 INFO L225 Difference]: With dead ends: 97 [2024-10-24 16:40:54,234 INFO L226 Difference]: Without dead ends: 97 [2024-10-24 16:40:54,235 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-10-24 16:40:54,236 INFO L432 NwaCegarLoop]: 114 mSDtfsCounter, 70 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 197 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 16:40:54,236 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 197 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 16:40:54,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2024-10-24 16:40:54,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 94. [2024-10-24 16:40:54,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 93 states have (on average 1.8494623655913978) internal successors, (172), 93 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 16:40:54,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 172 transitions. [2024-10-24 16:40:54,244 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 172 transitions. Word has length 21 [2024-10-24 16:40:54,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:40:54,244 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 172 transitions. [2024-10-24 16:40:54,245 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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-10-24 16:40:54,245 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 172 transitions. [2024-10-24 16:40:54,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-10-24 16:40:54,245 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:40:54,246 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] [2024-10-24 16:40:54,246 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-24 16:40:54,246 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-24 16:40:54,247 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:40:54,247 INFO L85 PathProgramCache]: Analyzing trace with hash -1151513245, now seen corresponding path program 1 times [2024-10-24 16:40:54,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 16:40:54,247 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [810993909] [2024-10-24 16:40:54,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:40:54,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 16:40:54,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:40:54,291 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 16:40:54,291 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 16:40:54,292 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [810993909] [2024-10-24 16:40:54,292 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [810993909] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 16:40:54,292 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 16:40:54,292 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 16:40:54,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1712248085] [2024-10-24 16:40:54,293 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 16:40:54,294 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 16:40:54,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 16:40:54,294 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 16:40:54,294 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 16:40:54,294 INFO L87 Difference]: Start difference. First operand 94 states and 172 transitions. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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-10-24 16:40:54,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:40:54,310 INFO L93 Difference]: Finished difference Result 128 states and 229 transitions. [2024-10-24 16:40:54,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 16:40:54,311 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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 21 [2024-10-24 16:40:54,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:40:54,312 INFO L225 Difference]: With dead ends: 128 [2024-10-24 16:40:54,312 INFO L226 Difference]: Without dead ends: 128 [2024-10-24 16:40:54,312 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-10-24 16:40:54,313 INFO L432 NwaCegarLoop]: 92 mSDtfsCounter, 71 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 16:40:54,314 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 125 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 16:40:54,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2024-10-24 16:40:54,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 125. [2024-10-24 16:40:54,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 124 states have (on average 1.8306451612903225) internal successors, (227), 124 states have internal predecessors, (227), 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-10-24 16:40:54,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 227 transitions. [2024-10-24 16:40:54,324 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 227 transitions. Word has length 21 [2024-10-24 16:40:54,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:40:54,325 INFO L471 AbstractCegarLoop]: Abstraction has 125 states and 227 transitions. [2024-10-24 16:40:54,325 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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-10-24 16:40:54,325 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 227 transitions. [2024-10-24 16:40:54,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-10-24 16:40:54,326 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:40:54,326 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] [2024-10-24 16:40:54,326 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-24 16:40:54,326 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-24 16:40:54,329 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:40:54,329 INFO L85 PathProgramCache]: Analyzing trace with hash 1555106149, now seen corresponding path program 1 times [2024-10-24 16:40:54,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 16:40:54,329 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [947209420] [2024-10-24 16:40:54,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:40:54,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 16:40:54,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 16:40:54,346 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-24 16:40:54,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 16:40:54,388 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-24 16:40:54,388 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-24 16:40:54,390 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (1 of 2 remaining) [2024-10-24 16:40:54,391 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (0 of 2 remaining) [2024-10-24 16:40:54,392 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-24 16:40:54,394 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2024-10-24 16:40:54,445 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-24 16:40:54,451 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.10 04:40:54 BoogieIcfgContainer [2024-10-24 16:40:54,451 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-24 16:40:54,452 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-24 16:40:54,452 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-24 16:40:54,452 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-24 16:40:54,454 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 04:40:53" (3/4) ... [2024-10-24 16:40:54,456 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-24 16:40:54,457 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-24 16:40:54,458 INFO L158 Benchmark]: Toolchain (without parser) took 1985.23ms. Allocated memory was 148.9MB in the beginning and 207.6MB in the end (delta: 58.7MB). Free memory was 94.2MB in the beginning and 100.7MB in the end (delta: -6.5MB). Peak memory consumption was 55.4MB. Max. memory is 16.1GB. [2024-10-24 16:40:54,458 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 148.9MB. Free memory is still 108.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 16:40:54,458 INFO L158 Benchmark]: CACSL2BoogieTranslator took 322.30ms. Allocated memory is still 148.9MB. Free memory was 93.9MB in the beginning and 80.6MB in the end (delta: 13.3MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-24 16:40:54,459 INFO L158 Benchmark]: Boogie Procedure Inliner took 46.54ms. Allocated memory is still 148.9MB. Free memory was 80.6MB in the beginning and 78.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-24 16:40:54,459 INFO L158 Benchmark]: Boogie Preprocessor took 55.30ms. Allocated memory is still 148.9MB. Free memory was 78.5MB in the beginning and 76.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-24 16:40:54,461 INFO L158 Benchmark]: RCFGBuilder took 492.65ms. Allocated memory was 148.9MB in the beginning and 207.6MB in the end (delta: 58.7MB). Free memory was 76.4MB in the beginning and 177.3MB in the end (delta: -100.9MB). Peak memory consumption was 23.9MB. Max. memory is 16.1GB. [2024-10-24 16:40:54,461 INFO L158 Benchmark]: TraceAbstraction took 1056.40ms. Allocated memory is still 207.6MB. Free memory was 176.2MB in the beginning and 101.8MB in the end (delta: 74.4MB). Peak memory consumption was 75.5MB. Max. memory is 16.1GB. [2024-10-24 16:40:54,462 INFO L158 Benchmark]: Witness Printer took 5.57ms. Allocated memory is still 207.6MB. Free memory was 101.8MB in the beginning and 100.7MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 16:40:54,463 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 148.9MB. Free memory is still 108.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 322.30ms. Allocated memory is still 148.9MB. Free memory was 93.9MB in the beginning and 80.6MB in the end (delta: 13.3MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 46.54ms. Allocated memory is still 148.9MB. Free memory was 80.6MB in the beginning and 78.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 55.30ms. Allocated memory is still 148.9MB. Free memory was 78.5MB in the beginning and 76.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 492.65ms. Allocated memory was 148.9MB in the beginning and 207.6MB in the end (delta: 58.7MB). Free memory was 76.4MB in the beginning and 177.3MB in the end (delta: -100.9MB). Peak memory consumption was 23.9MB. Max. memory is 16.1GB. * TraceAbstraction took 1056.40ms. Allocated memory is still 207.6MB. Free memory was 176.2MB in the beginning and 101.8MB in the end (delta: 74.4MB). Peak memory consumption was 75.5MB. Max. memory is 16.1GB. * Witness Printer took 5.57ms. Allocated memory is still 207.6MB. Free memory was 101.8MB in the beginning and 100.7MB in the end (delta: 1.0MB). 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; [L51] int cond; VAL [p10=1, p11=0, p12=1, p13=1, p14=1, p1=0, p2=0, p3=0, p4=1, p5=1, p6=1, p7=1, p8=1, p9=1] [L53] COND TRUE 1 [L54] cond = __VERIFIER_nondet_int() [L55] COND FALSE !(cond == 0) [L58] lk1 = 0 [L60] lk2 = 0 [L62] lk3 = 0 [L64] lk4 = 0 [L66] lk5 = 0 [L68] lk6 = 0 [L70] lk7 = 0 [L72] lk8 = 0 [L74] lk9 = 0 [L76] lk10 = 0 [L78] lk11 = 0 [L80] lk12 = 0 [L82] lk13 = 0 [L84] lk14 = 0 VAL [lk10=0, lk11=0, lk12=0, lk13=0, lk14=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, p1=0, p2=0, p3=0, p4=1, p5=1, p6=1, p7=1, p8=1, p9=1] [L88] COND FALSE !(p1 != 0) VAL [lk10=0, lk11=0, lk12=0, lk13=0, lk14=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, p1=0, p2=0, p3=0, p4=1, p5=1, p6=1, p7=1, p8=1, p9=1] [L92] COND FALSE !(p2 != 0) VAL [lk10=0, lk11=0, lk12=0, lk13=0, lk14=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, p1=0, p2=0, p3=0, p4=1, p5=1, p6=1, p7=1, p8=1, p9=1] [L96] COND FALSE !(p3 != 0) VAL [lk10=0, lk11=0, lk12=0, lk13=0, lk14=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, p1=0, p2=0, p3=0, p4=1, p5=1, p6=1, p7=1, p8=1, p9=1] [L100] COND TRUE p4 != 0 [L101] lk4 = 1 VAL [lk10=0, lk11=0, lk12=0, lk13=0, lk14=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, p1=0, p2=0, p3=0, p4=1, p5=1, p6=1, p7=1, p8=1, p9=1] [L104] COND TRUE p5 != 0 [L105] lk5 = 1 VAL [lk10=0, lk11=0, lk12=0, lk13=0, lk14=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, p1=0, p2=0, p3=0, p4=1, p5=1, p6=1, p7=1, p8=1, p9=1] [L108] COND TRUE p6 != 0 [L109] lk6 = 1 VAL [lk10=0, lk11=0, lk12=0, lk13=0, lk14=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, p1=0, p2=0, p3=0, p4=1, p5=1, p6=1, p7=1, p8=1, p9=1] [L112] COND TRUE p7 != 0 [L113] lk7 = 1 VAL [lk10=0, lk11=0, lk12=0, lk13=0, lk14=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, p1=0, p2=0, p3=0, p4=1, p5=1, p6=1, p7=1, p8=1, p9=1] [L116] COND TRUE p8 != 0 [L117] lk8 = 1 VAL [lk10=0, lk11=0, lk12=0, lk13=0, lk14=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, p1=0, p2=0, p3=0, p4=1, p5=1, p6=1, p7=1, p8=1, p9=1] [L120] COND TRUE p9 != 0 [L121] lk9 = 1 VAL [lk10=0, lk11=0, lk12=0, lk13=0, lk14=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, p1=0, p2=0, p3=0, p4=1, p5=1, p6=1, p7=1, p8=1, p9=1] [L124] COND TRUE p10 != 0 [L125] lk10 = 1 VAL [lk10=1, lk11=0, lk12=0, lk13=0, lk14=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, p1=0, p2=0, p3=0, p4=1, p5=1, p6=1, p7=1, p8=1, p9=1] [L128] COND FALSE !(p11 != 0) VAL [lk10=1, lk11=0, lk12=0, lk13=0, lk14=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, p1=0, p2=0, p3=0, p4=1, p5=1, p6=1, p7=1, p8=1, p9=1] [L132] COND TRUE p12 != 0 [L133] lk12 = 1 VAL [lk10=1, lk11=0, lk12=1, lk13=0, lk14=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, p1=0, p2=0, p3=0, p4=1, p5=1, p6=1, p7=1, p8=1, p9=1] [L136] COND TRUE p13 != 0 [L137] lk13 = 1 VAL [lk10=1, lk11=0, lk12=1, lk13=1, lk14=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, p1=0, p2=0, p3=0, p4=1, p5=1, p6=1, p7=1, p8=1, p9=1] [L140] COND TRUE p14 != 0 [L141] lk14 = 1 VAL [lk10=1, lk11=0, lk12=1, lk13=1, lk14=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, p1=0, p2=0, p3=0, p4=1, p5=1, p6=1, p7=1, p8=1, p9=1] [L146] COND FALSE !(p1 != 0) VAL [lk10=1, lk11=0, lk12=1, lk13=1, lk14=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, p1=0, p2=0, p3=0, p4=1, p5=1, p6=1, p7=1, p8=1, p9=1] [L151] COND FALSE !(p2 != 0) VAL [lk10=1, lk11=0, lk12=1, lk13=1, lk14=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, p1=0, p3=0, p4=1, p5=1, p6=1, p7=1, p8=1, p9=1] [L219] CALL reach_error() [L3] __assert_fail("0", "test_locks_14-2.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, 52 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 1.0s, OverallIterations: 7, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 369 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 369 mSDsluCounter, 899 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 282 mSDsCounter, 5 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 28 IncrementalHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 5 mSolverCounterUnsat, 617 mSDtfsCounter, 28 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 15 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=125occurred in iteration=6, 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, 40 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 114 NumberOfCodeBlocks, 114 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 87 ConstructedInterpolants, 0 QuantifiedInterpolants, 237 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-10-24 16:40:54,498 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/current/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 /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/locks/test_locks_14-2.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 75f53c568c86c59ddc62d2fd150ff0a5ed9b51ea17cada3ff1a95dec57d9167c --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 16:40:56,763 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 16:40:56,820 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2024-10-24 16:40:56,827 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 16:40:56,827 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 16:40:56,864 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 16:40:56,865 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 16:40:56,865 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 16:40:56,866 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 16:40:56,866 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 16:40:56,867 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 16:40:56,867 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 16:40:56,868 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 16:40:56,870 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 16:40:56,871 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 16:40:56,871 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 16:40:56,871 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 16:40:56,871 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-24 16:40:56,872 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 16:40:56,872 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 16:40:56,875 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-24 16:40:56,876 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-24 16:40:56,876 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-10-24 16:40:56,876 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 16:40:56,877 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-24 16:40:56,877 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-24 16:40:56,877 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 16:40:56,877 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-24 16:40:56,877 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-24 16:40:56,877 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 16:40:56,878 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 16:40:56,878 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 16:40:56,878 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 16:40:56,878 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 16:40:56,878 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 16:40:56,879 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 16:40:56,879 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 16:40:56,881 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 16:40:56,881 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-24 16:40:56,881 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-24 16:40:56,882 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 16:40:56,882 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 16:40:56,882 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 16:40:56,882 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 16:40:56,882 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-24 16:40:56,882 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 -> 75f53c568c86c59ddc62d2fd150ff0a5ed9b51ea17cada3ff1a95dec57d9167c [2024-10-24 16:40:57,219 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 16:40:57,240 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 16:40:57,243 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 16:40:57,244 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 16:40:57,246 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 16:40:57,248 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/locks/test_locks_14-2.c [2024-10-24 16:40:58,852 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 16:40:59,084 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 16:40:59,085 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/locks/test_locks_14-2.c [2024-10-24 16:40:59,093 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4227dfa18/8d0feab4ac65458282f4719620b6563b/FLAG3c4b11cea [2024-10-24 16:40:59,105 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4227dfa18/8d0feab4ac65458282f4719620b6563b [2024-10-24 16:40:59,107 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 16:40:59,108 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 16:40:59,109 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 16:40:59,110 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 16:40:59,115 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 16:40:59,116 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 04:40:59" (1/1) ... [2024-10-24 16:40:59,117 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@b5ab787 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:40:59, skipping insertion in model container [2024-10-24 16:40:59,117 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 04:40:59" (1/1) ... [2024-10-24 16:40:59,145 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 16:40:59,370 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 16:40:59,389 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 16:40:59,421 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 16:40:59,440 INFO L204 MainTranslator]: Completed translation [2024-10-24 16:40:59,441 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:40:59 WrapperNode [2024-10-24 16:40:59,441 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 16:40:59,442 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 16:40:59,443 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 16:40:59,443 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 16:40:59,449 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:40:59" (1/1) ... [2024-10-24 16:40:59,460 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:40:59" (1/1) ... [2024-10-24 16:40:59,488 INFO L138 Inliner]: procedures = 12, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 184 [2024-10-24 16:40:59,491 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 16:40:59,492 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 16:40:59,492 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 16:40:59,492 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 16:40:59,504 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:40:59" (1/1) ... [2024-10-24 16:40:59,504 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:40:59" (1/1) ... [2024-10-24 16:40:59,507 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:40:59" (1/1) ... [2024-10-24 16:40:59,524 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-24 16:40:59,525 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:40:59" (1/1) ... [2024-10-24 16:40:59,525 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:40:59" (1/1) ... [2024-10-24 16:40:59,537 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:40:59" (1/1) ... [2024-10-24 16:40:59,543 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:40:59" (1/1) ... [2024-10-24 16:40:59,544 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:40:59" (1/1) ... [2024-10-24 16:40:59,545 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:40:59" (1/1) ... [2024-10-24 16:40:59,553 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 16:40:59,554 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 16:40:59,554 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 16:40:59,557 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 16:40:59,558 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:40:59" (1/1) ... [2024-10-24 16:40:59,563 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 16:40:59,576 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 16:40:59,597 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-10-24 16:40:59,602 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-10-24 16:40:59,641 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 16:40:59,641 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 16:40:59,641 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 16:40:59,641 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-24 16:40:59,712 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 16:40:59,716 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 16:41:00,022 INFO L? ?]: Removed 36 outVars from TransFormulas that were not future-live. [2024-10-24 16:41:00,022 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 16:41:00,053 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 16:41:00,054 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-24 16:41:00,055 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 04:41:00 BoogieIcfgContainer [2024-10-24 16:41:00,055 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 16:41:00,056 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 16:41:00,057 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 16:41:00,060 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 16:41:00,060 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 04:40:59" (1/3) ... [2024-10-24 16:41:00,061 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@478d7e9f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 04:41:00, skipping insertion in model container [2024-10-24 16:41:00,062 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:40:59" (2/3) ... [2024-10-24 16:41:00,062 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@478d7e9f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 04:41:00, skipping insertion in model container [2024-10-24 16:41:00,063 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 04:41:00" (3/3) ... [2024-10-24 16:41:00,064 INFO L112 eAbstractionObserver]: Analyzing ICFG test_locks_14-2.c [2024-10-24 16:41:00,097 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 16:41:00,099 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-10-24 16:41:00,152 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 16:41:00,161 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;@53a4fa37, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 16:41:00,162 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-10-24 16:41:00,167 INFO L276 IsEmpty]: Start isEmpty. Operand has 52 states, 49 states have (on average 1.9591836734693877) 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-10-24 16:41:00,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-10-24 16:41:00,174 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:41:00,175 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-10-24 16:41:00,176 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-24 16:41:00,182 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:41:00,183 INFO L85 PathProgramCache]: Analyzing trace with hash 9251162, now seen corresponding path program 1 times [2024-10-24 16:41:00,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 16:41:00,195 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1477635398] [2024-10-24 16:41:00,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:41:00,195 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-10-24 16:41:00,196 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 16:41:00,199 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-10-24 16:41:00,201 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-10-24 16:41:00,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:41:00,270 INFO L255 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-24 16:41:00,274 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 16:41:00,290 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 16:41:00,291 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 16:41:00,292 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 16:41:00,292 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1477635398] [2024-10-24 16:41:00,292 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1477635398] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 16:41:00,293 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 16:41:00,293 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 16:41:00,295 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1500347418] [2024-10-24 16:41:00,295 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 16:41:00,300 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-24 16:41:00,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 16:41:00,333 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-24 16:41:00,334 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 16:41:00,336 INFO L87 Difference]: Start difference. First operand has 52 states, 49 states have (on average 1.9591836734693877) 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) Second operand has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 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-10-24 16:41:00,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:41:00,366 INFO L93 Difference]: Finished difference Result 52 states and 93 transitions. [2024-10-24 16:41:00,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-24 16:41:00,369 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 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 4 [2024-10-24 16:41:00,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:41:00,378 INFO L225 Difference]: With dead ends: 52 [2024-10-24 16:41:00,378 INFO L226 Difference]: Without dead ends: 51 [2024-10-24 16:41:00,380 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 16:41:00,385 INFO L432 NwaCegarLoop]: 91 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 16:41:00,386 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 91 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 16:41:00,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2024-10-24 16:41:00,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2024-10-24 16:41:00,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 49 states have (on average 1.8775510204081634) internal successors, (92), 50 states have internal predecessors, (92), 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-10-24 16:41:00,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 92 transitions. [2024-10-24 16:41:00,423 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 92 transitions. Word has length 4 [2024-10-24 16:41:00,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:41:00,423 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 92 transitions. [2024-10-24 16:41:00,424 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 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-10-24 16:41:00,424 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 92 transitions. [2024-10-24 16:41:00,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-10-24 16:41:00,424 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:41:00,424 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-10-24 16:41:00,427 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 (2)] Ended with exit code 0 [2024-10-24 16:41:00,627 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-10-24 16:41:00,628 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-24 16:41:00,628 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:41:00,629 INFO L85 PathProgramCache]: Analyzing trace with hash 279252761, now seen corresponding path program 1 times [2024-10-24 16:41:00,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 16:41:00,629 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [119213120] [2024-10-24 16:41:00,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:41:00,629 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-10-24 16:41:00,629 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 16:41:00,631 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-10-24 16:41:00,632 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-10-24 16:41:00,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:41:00,678 INFO L255 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-24 16:41:00,679 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 16:41:00,702 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 16:41:00,702 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 16:41:00,702 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 16:41:00,702 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [119213120] [2024-10-24 16:41:00,702 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [119213120] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 16:41:00,703 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 16:41:00,703 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-24 16:41:00,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [310631649] [2024-10-24 16:41:00,703 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 16:41:00,705 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 16:41:00,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 16:41:00,706 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 16:41:00,707 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 16:41:00,707 INFO L87 Difference]: Start difference. First operand 51 states and 92 transitions. Second operand has 3 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-10-24 16:41:00,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:41:00,720 INFO L93 Difference]: Finished difference Result 50 states and 91 transitions. [2024-10-24 16:41:00,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 16:41:00,723 INFO L78 Accepts]: Start accepts. Automaton has has 3 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-10-24 16:41:00,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:41:00,724 INFO L225 Difference]: With dead ends: 50 [2024-10-24 16:41:00,724 INFO L226 Difference]: Without dead ends: 48 [2024-10-24 16:41:00,724 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 16:41:00,725 INFO L432 NwaCegarLoop]: 90 mSDtfsCounter, 87 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 90 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-10-24 16:41:00,726 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 90 Invalid, 1 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 16:41:00,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2024-10-24 16:41:00,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2024-10-24 16:41:00,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 47 states have (on average 1.8936170212765957) internal successors, (89), 47 states have internal predecessors, (89), 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-10-24 16:41:00,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 89 transitions. [2024-10-24 16:41:00,733 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 89 transitions. Word has length 5 [2024-10-24 16:41:00,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:41:00,733 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 89 transitions. [2024-10-24 16:41:00,733 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 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-10-24 16:41:00,733 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 89 transitions. [2024-10-24 16:41:00,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-10-24 16:41:00,734 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:41:00,734 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] [2024-10-24 16:41:00,738 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 (3)] Forceful destruction successful, exit code 0 [2024-10-24 16:41:00,936 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-10-24 16:41:00,938 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-24 16:41:00,938 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:41:00,938 INFO L85 PathProgramCache]: Analyzing trace with hash 842408509, now seen corresponding path program 1 times [2024-10-24 16:41:00,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 16:41:00,939 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [778745579] [2024-10-24 16:41:00,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:41:00,939 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-10-24 16:41:00,940 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 16:41:00,943 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-10-24 16:41:00,947 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-10-24 16:41:00,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:41:00,998 INFO L255 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-24 16:41:01,000 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 16:41:01,072 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 16:41:01,072 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 16:41:01,072 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 16:41:01,072 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [778745579] [2024-10-24 16:41:01,073 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [778745579] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 16:41:01,073 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 16:41:01,073 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 16:41:01,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [395788289] [2024-10-24 16:41:01,073 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 16:41:01,073 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 16:41:01,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 16:41:01,076 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 16:41:01,077 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 16:41:01,077 INFO L87 Difference]: Start difference. First operand 48 states and 89 transitions. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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-10-24 16:41:01,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:41:01,113 INFO L93 Difference]: Finished difference Result 94 states and 174 transitions. [2024-10-24 16:41:01,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 16:41:01,114 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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 21 [2024-10-24 16:41:01,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:41:01,115 INFO L225 Difference]: With dead ends: 94 [2024-10-24 16:41:01,115 INFO L226 Difference]: Without dead ends: 94 [2024-10-24 16:41:01,116 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 16:41:01,118 INFO L432 NwaCegarLoop]: 89 mSDtfsCounter, 69 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 173 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 16:41:01,120 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 173 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 16:41:01,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2024-10-24 16:41:01,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 63. [2024-10-24 16:41:01,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 62 states have (on average 1.903225806451613) internal successors, (118), 62 states have internal predecessors, (118), 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-10-24 16:41:01,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 118 transitions. [2024-10-24 16:41:01,135 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 118 transitions. Word has length 21 [2024-10-24 16:41:01,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:41:01,135 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 118 transitions. [2024-10-24 16:41:01,136 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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-10-24 16:41:01,136 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 118 transitions. [2024-10-24 16:41:01,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-10-24 16:41:01,137 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:41:01,137 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] [2024-10-24 16:41:01,141 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-10-24 16:41:01,337 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-10-24 16:41:01,338 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-24 16:41:01,339 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:41:01,339 INFO L85 PathProgramCache]: Analyzing trace with hash 842631461, now seen corresponding path program 1 times [2024-10-24 16:41:01,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 16:41:01,340 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [863971552] [2024-10-24 16:41:01,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:41:01,340 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-10-24 16:41:01,340 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 16:41:01,343 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-10-24 16:41:01,344 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-10-24 16:41:01,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:41:01,384 INFO L255 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-24 16:41:01,385 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 16:41:01,430 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 16:41:01,430 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 16:41:01,430 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 16:41:01,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [863971552] [2024-10-24 16:41:01,431 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [863971552] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 16:41:01,431 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 16:41:01,431 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 16:41:01,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1836761506] [2024-10-24 16:41:01,431 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 16:41:01,432 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 16:41:01,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 16:41:01,432 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 16:41:01,433 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 16:41:01,433 INFO L87 Difference]: Start difference. First operand 63 states and 118 transitions. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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-10-24 16:41:01,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:41:01,460 INFO L93 Difference]: Finished difference Result 95 states and 174 transitions. [2024-10-24 16:41:01,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 16:41:01,461 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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 21 [2024-10-24 16:41:01,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:41:01,462 INFO L225 Difference]: With dead ends: 95 [2024-10-24 16:41:01,462 INFO L226 Difference]: Without dead ends: 95 [2024-10-24 16:41:01,463 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 16:41:01,464 INFO L432 NwaCegarLoop]: 141 mSDtfsCounter, 72 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 223 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 16:41:01,464 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 223 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 16:41:01,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2024-10-24 16:41:01,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 92. [2024-10-24 16:41:01,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 91 states have (on average 1.89010989010989) internal successors, (172), 91 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 16:41:01,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 172 transitions. [2024-10-24 16:41:01,479 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 172 transitions. Word has length 21 [2024-10-24 16:41:01,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:41:01,479 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 172 transitions. [2024-10-24 16:41:01,479 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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-10-24 16:41:01,480 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 172 transitions. [2024-10-24 16:41:01,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-10-24 16:41:01,480 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:41:01,480 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] [2024-10-24 16:41:01,485 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-10-24 16:41:01,684 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-10-24 16:41:01,684 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-24 16:41:01,685 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:41:01,685 INFO L85 PathProgramCache]: Analyzing trace with hash -1151736197, now seen corresponding path program 1 times [2024-10-24 16:41:01,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 16:41:01,685 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [885613167] [2024-10-24 16:41:01,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:41:01,686 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-10-24 16:41:01,686 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 16:41:01,687 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-10-24 16:41:01,688 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-10-24 16:41:01,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:41:01,729 INFO L255 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-24 16:41:01,730 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 16:41:01,770 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 16:41:01,770 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 16:41:01,771 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 16:41:01,771 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [885613167] [2024-10-24 16:41:01,771 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [885613167] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 16:41:01,771 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 16:41:01,771 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 16:41:01,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1130067464] [2024-10-24 16:41:01,772 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 16:41:01,772 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 16:41:01,772 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 16:41:01,772 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 16:41:01,773 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 16:41:01,773 INFO L87 Difference]: Start difference. First operand 92 states and 172 transitions. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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-10-24 16:41:01,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:41:01,787 INFO L93 Difference]: Finished difference Result 97 states and 174 transitions. [2024-10-24 16:41:01,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 16:41:01,788 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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 21 [2024-10-24 16:41:01,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:41:01,789 INFO L225 Difference]: With dead ends: 97 [2024-10-24 16:41:01,789 INFO L226 Difference]: Without dead ends: 97 [2024-10-24 16:41:01,789 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 16:41:01,790 INFO L432 NwaCegarLoop]: 114 mSDtfsCounter, 70 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 197 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 16:41:01,790 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 197 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 16:41:01,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2024-10-24 16:41:01,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 94. [2024-10-24 16:41:01,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 93 states have (on average 1.8494623655913978) internal successors, (172), 93 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 16:41:01,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 172 transitions. [2024-10-24 16:41:01,805 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 172 transitions. Word has length 21 [2024-10-24 16:41:01,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:41:01,805 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 172 transitions. [2024-10-24 16:41:01,806 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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-10-24 16:41:01,806 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 172 transitions. [2024-10-24 16:41:01,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-10-24 16:41:01,806 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:41:01,806 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] [2024-10-24 16:41:01,812 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 (6)] Forceful destruction successful, exit code 0 [2024-10-24 16:41:02,007 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-10-24 16:41:02,008 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-24 16:41:02,008 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:41:02,008 INFO L85 PathProgramCache]: Analyzing trace with hash -1151513245, now seen corresponding path program 1 times [2024-10-24 16:41:02,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 16:41:02,009 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1384037156] [2024-10-24 16:41:02,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:41:02,009 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-10-24 16:41:02,009 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 16:41:02,010 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-10-24 16:41:02,012 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-10-24 16:41:02,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:41:02,046 INFO L255 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-24 16:41:02,047 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 16:41:02,097 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 16:41:02,097 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 16:41:02,097 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 16:41:02,097 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1384037156] [2024-10-24 16:41:02,097 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1384037156] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 16:41:02,097 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 16:41:02,098 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 16:41:02,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1598898771] [2024-10-24 16:41:02,098 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 16:41:02,098 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 16:41:02,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 16:41:02,099 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 16:41:02,099 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 16:41:02,099 INFO L87 Difference]: Start difference. First operand 94 states and 172 transitions. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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-10-24 16:41:02,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:41:02,124 INFO L93 Difference]: Finished difference Result 128 states and 229 transitions. [2024-10-24 16:41:02,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 16:41:02,124 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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 21 [2024-10-24 16:41:02,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:41:02,126 INFO L225 Difference]: With dead ends: 128 [2024-10-24 16:41:02,126 INFO L226 Difference]: Without dead ends: 128 [2024-10-24 16:41:02,126 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 16:41:02,127 INFO L432 NwaCegarLoop]: 92 mSDtfsCounter, 71 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 16:41:02,127 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 125 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 16:41:02,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2024-10-24 16:41:02,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 125. [2024-10-24 16:41:02,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 124 states have (on average 1.8306451612903225) internal successors, (227), 124 states have internal predecessors, (227), 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-10-24 16:41:02,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 227 transitions. [2024-10-24 16:41:02,139 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 227 transitions. Word has length 21 [2024-10-24 16:41:02,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:41:02,140 INFO L471 AbstractCegarLoop]: Abstraction has 125 states and 227 transitions. [2024-10-24 16:41:02,140 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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-10-24 16:41:02,140 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 227 transitions. [2024-10-24 16:41:02,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-10-24 16:41:02,141 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:41:02,141 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] [2024-10-24 16:41:02,146 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-10-24 16:41:02,342 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-10-24 16:41:02,342 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-24 16:41:02,343 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:41:02,343 INFO L85 PathProgramCache]: Analyzing trace with hash 1555106149, now seen corresponding path program 1 times [2024-10-24 16:41:02,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 16:41:02,343 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1571223133] [2024-10-24 16:41:02,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:41:02,343 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-10-24 16:41:02,344 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 16:41:02,347 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-10-24 16:41:02,348 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-10-24 16:41:02,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 16:41:02,402 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-24 16:41:02,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 16:41:02,482 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2024-10-24 16:41:02,482 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-24 16:41:02,483 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (1 of 2 remaining) [2024-10-24 16:41:02,485 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (0 of 2 remaining) [2024-10-24 16:41:02,491 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-10-24 16:41:02,691 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-10-24 16:41:02,694 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2024-10-24 16:41:02,730 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-24 16:41:02,732 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.10 04:41:02 BoogieIcfgContainer [2024-10-24 16:41:02,733 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-24 16:41:02,733 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-24 16:41:02,733 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-24 16:41:02,733 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-24 16:41:02,734 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 04:41:00" (3/4) ... [2024-10-24 16:41:02,737 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-24 16:41:02,738 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-24 16:41:02,738 INFO L158 Benchmark]: Toolchain (without parser) took 3629.92ms. Allocated memory was 69.2MB in the beginning and 86.0MB in the end (delta: 16.8MB). Free memory was 48.7MB in the beginning and 46.1MB in the end (delta: 2.7MB). Peak memory consumption was 20.8MB. Max. memory is 16.1GB. [2024-10-24 16:41:02,738 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 46.1MB. Free memory was 23.2MB in the beginning and 23.1MB in the end (delta: 52.5kB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 16:41:02,739 INFO L158 Benchmark]: CACSL2BoogieTranslator took 332.22ms. Allocated memory is still 69.2MB. Free memory was 48.4MB in the beginning and 34.7MB in the end (delta: 13.7MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-24 16:41:02,739 INFO L158 Benchmark]: Boogie Procedure Inliner took 49.13ms. Allocated memory is still 69.2MB. Free memory was 34.7MB in the beginning and 32.8MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-24 16:41:02,739 INFO L158 Benchmark]: Boogie Preprocessor took 61.03ms. Allocated memory is still 69.2MB. Free memory was 32.8MB in the beginning and 30.6MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-24 16:41:02,740 INFO L158 Benchmark]: RCFGBuilder took 500.93ms. Allocated memory is still 69.2MB. Free memory was 30.6MB in the beginning and 29.7MB in the end (delta: 815.1kB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-24 16:41:02,740 INFO L158 Benchmark]: TraceAbstraction took 2676.26ms. Allocated memory was 69.2MB in the beginning and 86.0MB in the end (delta: 16.8MB). Free memory was 29.2MB in the beginning and 46.1MB in the end (delta: -16.9MB). Peak memory consumption was 679.2kB. Max. memory is 16.1GB. [2024-10-24 16:41:02,740 INFO L158 Benchmark]: Witness Printer took 4.56ms. Allocated memory is still 86.0MB. Free memory is still 46.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 16:41:02,742 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.22ms. Allocated memory is still 46.1MB. Free memory was 23.2MB in the beginning and 23.1MB in the end (delta: 52.5kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 332.22ms. Allocated memory is still 69.2MB. Free memory was 48.4MB in the beginning and 34.7MB in the end (delta: 13.7MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 49.13ms. Allocated memory is still 69.2MB. Free memory was 34.7MB in the beginning and 32.8MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 61.03ms. Allocated memory is still 69.2MB. Free memory was 32.8MB in the beginning and 30.6MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 500.93ms. Allocated memory is still 69.2MB. Free memory was 30.6MB in the beginning and 29.7MB in the end (delta: 815.1kB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * TraceAbstraction took 2676.26ms. Allocated memory was 69.2MB in the beginning and 86.0MB in the end (delta: 16.8MB). Free memory was 29.2MB in the beginning and 46.1MB in the end (delta: -16.9MB). Peak memory consumption was 679.2kB. Max. memory is 16.1GB. * Witness Printer took 4.56ms. Allocated memory is still 86.0MB. Free memory is still 46.1MB. 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; [L51] int cond; [L53] COND TRUE 1 [L54] cond = __VERIFIER_nondet_int() [L55] COND FALSE !(cond == 0) [L58] lk1 = 0 [L60] lk2 = 0 [L62] lk3 = 0 [L64] lk4 = 0 [L66] lk5 = 0 [L68] lk6 = 0 [L70] lk7 = 0 [L72] lk8 = 0 [L74] lk9 = 0 [L76] lk10 = 0 [L78] lk11 = 0 [L80] lk12 = 0 [L82] lk13 = 0 [L84] lk14 = 0 VAL [lk10=0, lk11=0, lk12=0, lk13=0, lk14=0, lk1=0, lk2=0, lk3=0, lk4=0, lk5=0, lk6=0, lk7=0, lk8=0, lk9=0] [L88] COND FALSE !(p1 != 0) VAL [lk10=0, lk11=0, lk12=0, lk13=0, lk14=0, lk1=0, lk2=0, lk3=0, lk4=0, lk5=0, lk6=0, lk7=0, lk8=0, lk9=0, p1=0] [L92] COND FALSE !(p2 != 0) VAL [lk10=0, lk11=0, lk12=0, lk13=0, lk14=0, lk1=0, lk2=0, lk3=0, lk4=0, lk5=0, lk6=0, lk7=0, lk8=0, lk9=0, p1=0, p2=0] [L96] COND FALSE !(p3 != 0) VAL [lk10=0, lk11=0, lk12=0, lk13=0, lk14=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] [L100] COND TRUE p4 != 0 [L101] lk4 = 1 VAL [lk10=0, lk11=0, lk12=0, lk13=0, lk14=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] [L104] COND TRUE p5 != 0 [L105] lk5 = 1 VAL [lk10=0, lk11=0, lk12=0, lk13=0, lk14=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] [L108] COND TRUE p6 != 0 [L109] lk6 = 1 VAL [lk10=0, lk11=0, lk12=0, lk13=0, lk14=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] [L112] COND TRUE p7 != 0 [L113] lk7 = 1 VAL [lk10=0, lk11=0, lk12=0, lk13=0, lk14=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] [L116] COND TRUE p8 != 0 [L117] lk8 = 1 VAL [lk10=0, lk11=0, lk12=0, lk13=0, lk14=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] [L120] COND TRUE p9 != 0 [L121] lk9 = 1 VAL [lk10=0, lk11=0, lk12=0, lk13=0, lk14=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] [L124] COND TRUE p10 != 0 [L125] lk10 = 1 VAL [lk10=1, lk11=0, lk12=0, lk13=0, lk14=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] [L128] COND FALSE !(p11 != 0) VAL [lk10=1, lk11=0, lk12=0, lk13=0, lk14=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] [L132] COND TRUE p12 != 0 [L133] lk12 = 1 VAL [lk10=1, lk11=0, lk12=1, lk13=0, lk14=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] [L136] COND TRUE p13 != 0 [L137] lk13 = 1 VAL [lk10=1, lk11=0, lk12=1, lk13=1, lk14=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] [L140] COND TRUE p14 != 0 [L141] lk14 = 1 VAL [lk10=1, lk11=0, lk12=1, lk13=1, lk14=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, p1=0, p2=0, p3=0, p4=2, p5=2, p6=2, p7=2, p8=2, p9=2] [L146] COND FALSE !(p1 != 0) VAL [lk10=1, lk11=0, lk12=1, lk13=1, lk14=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, p1=0, p2=0, p3=0, p4=2, p5=2, p6=2, p7=2, p8=2, p9=2] [L151] COND FALSE !(p2 != 0) VAL [lk10=1, lk11=0, lk12=1, lk13=1, lk14=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, p1=0, p3=0, p4=2, p5=2, p6=2, p7=2, p8=2, p9=2] [L219] CALL reach_error() [L3] __assert_fail("0", "test_locks_14-2.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, 52 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 2.6s, OverallIterations: 7, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 369 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 369 mSDsluCounter, 899 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 282 mSDsCounter, 5 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 28 IncrementalHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 5 mSolverCounterUnsat, 617 mSDtfsCounter, 28 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 87 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=125occurred in iteration=6, 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, 40 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 114 NumberOfCodeBlocks, 114 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 87 ConstructedInterpolants, 0 QuantifiedInterpolants, 237 SizeOfPredicates, 0 NumberOfNonLiveVariables, 267 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-10-24 16:41:02,772 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample