./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/locks/test_locks_15-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 4f9af400 extending candidate: java ['java'] extending candidate: /usr/bin/java ['java', '/usr/bin/java'] extending candidate: /opt/oracle-jdk-bin-*/bin/java ['java', '/usr/bin/java'] extending candidate: /opt/openjdk-*/bin/java ['java', '/usr/bin/java'] extending candidate: /usr/lib/jvm/java-*-openjdk-amd64/bin/java ['java', '/usr/bin/java', '/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java', '/usr/lib/jvm/java-17-openjdk-amd64/bin/java', '/usr/lib/jvm/java-11-openjdk-amd64/bin/java', '/usr/lib/jvm/java-1.17.0-openjdk-amd64/bin/java'] ['/root/.sdkman/candidates/java/21.0.5-tem/bin/java', '-Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config', '-Xmx15G', '-Xms4m', '-jar', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar', '-data', '@noDefault', '-ultimatedata', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data', '-tc', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml', '-i', '../sv-benchmarks/c/locks/test_locks_15-1.c', '-s', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf', '--cacsl2boogietranslator.entry.function', 'main', '--witnessprinter.witness.directory', '/storage/repos/ultimate-jdk21/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) )\nCHECK( init(main()), LTL(G valid-deref) )\nCHECK( init(main()), LTL(G valid-memtrack) )\n\n', '--witnessprinter.graph.data.producer', 'Automizer', '--witnessprinter.graph.data.architecture', '32bit', '--witnessprinter.graph.data.programhash', '11a9c91fdf6b42598924d9a4ae5a3db9994a05118a3b564c2bd29b9bad4177b0'] Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/locks/test_locks_15-1.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 11a9c91fdf6b42598924d9a4ae5a3db9994a05118a3b564c2bd29b9bad4177b0 --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 16:51:46,845 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 16:51:46,941 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-07 16:51:46,947 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 16:51:46,949 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 16:51:46,977 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 16:51:46,978 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 16:51:46,979 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 16:51:46,979 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 16:51:46,980 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 16:51:46,980 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 16:51:46,981 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 16:51:46,981 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 16:51:46,981 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 16:51:46,981 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 16:51:46,981 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 16:51:46,982 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 16:51:46,982 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-07 16:51:46,982 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 16:51:46,982 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 16:51:46,982 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-07 16:51:46,982 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-07 16:51:46,983 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-07 16:51:46,983 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 16:51:46,983 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-07 16:51:46,983 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 16:51:46,983 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-07 16:51:46,983 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 16:51:46,983 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 16:51:46,984 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 16:51:46,984 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 16:51:46,984 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 16:51:46,984 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 16:51:46,984 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 16:51:46,984 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 16:51:46,985 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 16:51:46,985 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-07 16:51:46,985 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-07 16:51:46,985 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 16:51:46,985 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 16:51:46,986 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 16:51:46,986 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 16:51:46,986 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 11a9c91fdf6b42598924d9a4ae5a3db9994a05118a3b564c2bd29b9bad4177b0 [2024-11-07 16:51:47,270 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 16:51:47,277 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 16:51:47,279 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 16:51:47,280 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 16:51:47,280 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 16:51:47,282 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/locks/test_locks_15-1.c [2024-11-07 16:51:48,556 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 16:51:48,820 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 16:51:48,822 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/locks/test_locks_15-1.c [2024-11-07 16:51:48,831 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/2b0fdf40b/8a773d4e9f7e4adf87c28a13689ff757/FLAG1ff3cb4e3 [2024-11-07 16:51:48,850 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/2b0fdf40b/8a773d4e9f7e4adf87c28a13689ff757 [2024-11-07 16:51:48,854 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 16:51:48,855 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 16:51:48,858 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 16:51:48,858 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 16:51:48,863 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 16:51:48,864 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 04:51:48" (1/1) ... [2024-11-07 16:51:48,865 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@15b3e18c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:51:48, skipping insertion in model container [2024-11-07 16:51:48,865 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 04:51:48" (1/1) ... [2024-11-07 16:51:48,888 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 16:51:49,059 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 16:51:49,074 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 16:51:49,109 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 16:51:49,128 INFO L204 MainTranslator]: Completed translation [2024-11-07 16:51:49,129 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:51:49 WrapperNode [2024-11-07 16:51:49,129 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 16:51:49,130 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 16:51:49,130 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 16:51:49,130 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 16:51:49,136 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:51:49" (1/1) ... [2024-11-07 16:51:49,144 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:51:49" (1/1) ... [2024-11-07 16:51:49,171 INFO L138 Inliner]: procedures = 12, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 211 [2024-11-07 16:51:49,172 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 16:51:49,173 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 16:51:49,175 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 16:51:49,175 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 16:51:49,182 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:51:49" (1/1) ... [2024-11-07 16:51:49,182 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:51:49" (1/1) ... [2024-11-07 16:51:49,184 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:51:49" (1/1) ... [2024-11-07 16:51:49,196 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-07 16:51:49,196 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:51:49" (1/1) ... [2024-11-07 16:51:49,196 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:51:49" (1/1) ... [2024-11-07 16:51:49,202 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:51:49" (1/1) ... [2024-11-07 16:51:49,210 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:51:49" (1/1) ... [2024-11-07 16:51:49,215 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:51:49" (1/1) ... [2024-11-07 16:51:49,216 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:51:49" (1/1) ... [2024-11-07 16:51:49,218 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 16:51:49,222 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 16:51:49,222 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 16:51:49,222 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 16:51:49,223 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:51:49" (1/1) ... [2024-11-07 16:51:49,229 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 16:51:49,243 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 16:51:49,258 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-07 16:51:49,266 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-07 16:51:49,288 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 16:51:49,289 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 16:51:49,289 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 16:51:49,289 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-07 16:51:49,354 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 16:51:49,356 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 16:51:49,622 INFO L? ?]: Removed 38 outVars from TransFormulas that were not future-live. [2024-11-07 16:51:49,623 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 16:51:49,632 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 16:51:49,633 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-07 16:51:49,634 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 04:51:49 BoogieIcfgContainer [2024-11-07 16:51:49,634 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 16:51:49,636 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 16:51:49,636 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 16:51:49,641 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 16:51:49,642 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 04:51:48" (1/3) ... [2024-11-07 16:51:49,643 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@26eea86a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 04:51:49, skipping insertion in model container [2024-11-07 16:51:49,643 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:51:49" (2/3) ... [2024-11-07 16:51:49,644 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@26eea86a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 04:51:49, skipping insertion in model container [2024-11-07 16:51:49,644 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 04:51:49" (3/3) ... [2024-11-07 16:51:49,645 INFO L112 eAbstractionObserver]: Analyzing ICFG test_locks_15-1.c [2024-11-07 16:51:49,660 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 16:51:49,661 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-07 16:51:49,702 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 16:51:49,714 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;@3e9f2bb3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 16:51:49,715 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-07 16:51:49,720 INFO L276 IsEmpty]: Start isEmpty. Operand has 58 states, 55 states have (on average 1.9090909090909092) internal successors, (105), 57 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:51:49,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-07 16:51:49,725 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:51:49,726 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-07 16:51:49,726 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-07 16:51:49,731 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:51:49,732 INFO L85 PathProgramCache]: Analyzing trace with hash 28959894, now seen corresponding path program 1 times [2024-11-07 16:51:49,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:51:49,760 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1366760614] [2024-11-07 16:51:49,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:51:49,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:51:49,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:51:49,903 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 16:51:49,903 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:51:49,904 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1366760614] [2024-11-07 16:51:49,906 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1366760614] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:51:49,907 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 16:51:49,907 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 16:51:49,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1118286047] [2024-11-07 16:51:49,909 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:51:49,913 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-07 16:51:49,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:51:49,938 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-07 16:51:49,941 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 16:51:49,943 INFO L87 Difference]: Start difference. First operand has 58 states, 55 states have (on average 1.9090909090909092) internal successors, (105), 57 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:51:49,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:51:49,958 INFO L93 Difference]: Finished difference Result 57 states and 101 transitions. [2024-11-07 16:51:49,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-07 16:51:49,960 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2024-11-07 16:51:49,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:51:49,966 INFO L225 Difference]: With dead ends: 57 [2024-11-07 16:51:49,966 INFO L226 Difference]: Without dead ends: 55 [2024-11-07 16:51:49,969 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 16:51:49,972 INFO L432 NwaCegarLoop]: 101 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 16:51:49,975 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 16:51:49,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2024-11-07 16:51:50,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2024-11-07 16:51:50,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 53 states have (on average 1.8679245283018868) internal successors, (99), 54 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:51:50,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 99 transitions. [2024-11-07 16:51:50,011 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 99 transitions. Word has length 5 [2024-11-07 16:51:50,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:51:50,011 INFO L471 AbstractCegarLoop]: Abstraction has 55 states and 99 transitions. [2024-11-07 16:51:50,011 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:51:50,012 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 99 transitions. [2024-11-07 16:51:50,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-07 16:51:50,012 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:51:50,012 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-07 16:51:50,012 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-07 16:51:50,012 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-07 16:51:50,013 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:51:50,013 INFO L85 PathProgramCache]: Analyzing trace with hash 889700686, now seen corresponding path program 1 times [2024-11-07 16:51:50,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:51:50,013 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1421290849] [2024-11-07 16:51:50,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:51:50,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:51:50,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:51:50,089 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 16:51:50,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:51:50,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1421290849] [2024-11-07 16:51:50,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1421290849] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:51:50,090 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 16:51:50,090 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 16:51:50,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1255017340] [2024-11-07 16:51:50,090 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:51:50,091 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 16:51:50,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:51:50,091 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 16:51:50,091 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 16:51:50,091 INFO L87 Difference]: Start difference. First operand 55 states and 99 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:51:50,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:51:50,109 INFO L93 Difference]: Finished difference Result 54 states and 98 transitions. [2024-11-07 16:51:50,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 16:51:50,111 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2024-11-07 16:51:50,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:51:50,112 INFO L225 Difference]: With dead ends: 54 [2024-11-07 16:51:50,112 INFO L226 Difference]: Without dead ends: 52 [2024-11-07 16:51:50,112 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 16:51:50,113 INFO L432 NwaCegarLoop]: 98 mSDtfsCounter, 93 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 1 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 16:51:50,113 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 98 Invalid, 1 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 16:51:50,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2024-11-07 16:51:50,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2024-11-07 16:51:50,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 51 states have (on average 1.8823529411764706) internal successors, (96), 51 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:51:50,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 96 transitions. [2024-11-07 16:51:50,118 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 96 transitions. Word has length 6 [2024-11-07 16:51:50,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:51:50,119 INFO L471 AbstractCegarLoop]: Abstraction has 52 states and 96 transitions. [2024-11-07 16:51:50,119 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:51:50,119 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 96 transitions. [2024-11-07 16:51:50,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-07 16:51:50,119 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:51:50,119 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:51:50,119 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-07 16:51:50,120 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-07 16:51:50,120 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:51:50,120 INFO L85 PathProgramCache]: Analyzing trace with hash 1809554789, now seen corresponding path program 1 times [2024-11-07 16:51:50,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:51:50,120 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [673376755] [2024-11-07 16:51:50,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:51:50,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:51:50,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:51:50,212 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 16:51:50,213 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:51:50,213 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [673376755] [2024-11-07 16:51:50,213 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [673376755] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:51:50,213 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 16:51:50,213 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 16:51:50,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [92397533] [2024-11-07 16:51:50,214 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:51:50,214 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 16:51:50,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:51:50,215 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 16:51:50,215 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 16:51:50,215 INFO L87 Difference]: Start difference. First operand 52 states and 96 transitions. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:51:50,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:51:50,247 INFO L93 Difference]: Finished difference Result 101 states and 186 transitions. [2024-11-07 16:51:50,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 16:51:50,248 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2024-11-07 16:51:50,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:51:50,249 INFO L225 Difference]: With dead ends: 101 [2024-11-07 16:51:50,249 INFO L226 Difference]: Without dead ends: 101 [2024-11-07 16:51:50,249 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 16:51:50,250 INFO L432 NwaCegarLoop]: 153 mSDtfsCounter, 77 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 242 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 16:51:50,250 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 242 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 16:51:50,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2024-11-07 16:51:50,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 98. [2024-11-07 16:51:50,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 97 states have (on average 1.8969072164948453) internal successors, (184), 97 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:51:50,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 184 transitions. [2024-11-07 16:51:50,270 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 184 transitions. Word has length 23 [2024-11-07 16:51:50,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:51:50,270 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 184 transitions. [2024-11-07 16:51:50,270 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:51:50,270 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 184 transitions. [2024-11-07 16:51:50,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-07 16:51:50,271 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:51:50,271 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:51:50,271 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-07 16:51:50,271 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-07 16:51:50,271 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:51:50,272 INFO L85 PathProgramCache]: Analyzing trace with hash 1809331837, now seen corresponding path program 1 times [2024-11-07 16:51:50,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:51:50,272 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1640096942] [2024-11-07 16:51:50,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:51:50,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:51:50,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:51:50,340 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 16:51:50,341 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:51:50,341 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1640096942] [2024-11-07 16:51:50,341 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1640096942] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:51:50,341 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 16:51:50,341 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 16:51:50,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [394945227] [2024-11-07 16:51:50,342 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:51:50,342 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 16:51:50,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:51:50,343 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 16:51:50,343 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 16:51:50,343 INFO L87 Difference]: Start difference. First operand 98 states and 184 transitions. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:51:50,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:51:50,370 INFO L93 Difference]: Finished difference Result 99 states and 185 transitions. [2024-11-07 16:51:50,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 16:51:50,370 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2024-11-07 16:51:50,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:51:50,373 INFO L225 Difference]: With dead ends: 99 [2024-11-07 16:51:50,375 INFO L226 Difference]: Without dead ends: 99 [2024-11-07 16:51:50,375 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 16:51:50,377 INFO L432 NwaCegarLoop]: 95 mSDtfsCounter, 14 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 186 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 16:51:50,378 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 186 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 16:51:50,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2024-11-07 16:51:50,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2024-11-07 16:51:50,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 98 states have (on average 1.8877551020408163) internal successors, (185), 98 states have internal predecessors, (185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:51:50,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 185 transitions. [2024-11-07 16:51:50,388 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 185 transitions. Word has length 23 [2024-11-07 16:51:50,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:51:50,388 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 185 transitions. [2024-11-07 16:51:50,393 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:51:50,393 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 185 transitions. [2024-11-07 16:51:50,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-07 16:51:50,396 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:51:50,396 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:51:50,396 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-07 16:51:50,397 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-07 16:51:50,397 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:51:50,397 INFO L85 PathProgramCache]: Analyzing trace with hash 120611047, now seen corresponding path program 1 times [2024-11-07 16:51:50,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:51:50,397 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2056167766] [2024-11-07 16:51:50,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:51:50,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:51:50,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:51:50,460 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 16:51:50,460 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:51:50,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2056167766] [2024-11-07 16:51:50,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2056167766] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:51:50,461 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 16:51:50,461 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 16:51:50,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1035252822] [2024-11-07 16:51:50,461 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:51:50,461 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 16:51:50,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:51:50,462 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 16:51:50,462 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 16:51:50,462 INFO L87 Difference]: Start difference. First operand 99 states and 185 transitions. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:51:50,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:51:50,488 INFO L93 Difference]: Finished difference Result 139 states and 253 transitions. [2024-11-07 16:51:50,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 16:51:50,490 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2024-11-07 16:51:50,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:51:50,492 INFO L225 Difference]: With dead ends: 139 [2024-11-07 16:51:50,492 INFO L226 Difference]: Without dead ends: 139 [2024-11-07 16:51:50,492 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 16:51:50,492 INFO L432 NwaCegarLoop]: 99 mSDtfsCounter, 77 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 16:51:50,493 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 136 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 16:51:50,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2024-11-07 16:51:50,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 136. [2024-11-07 16:51:50,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 135 states have (on average 1.8592592592592592) internal successors, (251), 135 states have internal predecessors, (251), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:51:50,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 251 transitions. [2024-11-07 16:51:50,513 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 251 transitions. Word has length 23 [2024-11-07 16:51:50,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:51:50,513 INFO L471 AbstractCegarLoop]: Abstraction has 136 states and 251 transitions. [2024-11-07 16:51:50,513 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:51:50,513 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 251 transitions. [2024-11-07 16:51:50,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-07 16:51:50,514 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:51:50,514 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:51:50,514 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-07 16:51:50,515 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-07 16:51:50,550 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:51:50,551 INFO L85 PathProgramCache]: Analyzing trace with hash 120388095, now seen corresponding path program 1 times [2024-11-07 16:51:50,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:51:50,551 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [188948269] [2024-11-07 16:51:50,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:51:50,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:51:50,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:51:50,609 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 16:51:50,609 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:51:50,609 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [188948269] [2024-11-07 16:51:50,609 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [188948269] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:51:50,610 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 16:51:50,610 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 16:51:50,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [283440731] [2024-11-07 16:51:50,610 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:51:50,610 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 16:51:50,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:51:50,611 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 16:51:50,611 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 16:51:50,611 INFO L87 Difference]: Start difference. First operand 136 states and 251 transitions. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:51:50,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:51:50,633 INFO L93 Difference]: Finished difference Result 137 states and 246 transitions. [2024-11-07 16:51:50,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 16:51:50,634 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2024-11-07 16:51:50,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:51:50,635 INFO L225 Difference]: With dead ends: 137 [2024-11-07 16:51:50,637 INFO L226 Difference]: Without dead ends: 137 [2024-11-07 16:51:50,637 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 16:51:50,638 INFO L432 NwaCegarLoop]: 124 mSDtfsCounter, 75 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 214 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 16:51:50,638 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 214 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 16:51:50,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2024-11-07 16:51:50,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 134. [2024-11-07 16:51:50,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 133 states have (on average 1.8345864661654134) internal successors, (244), 133 states have internal predecessors, (244), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:51:50,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 244 transitions. [2024-11-07 16:51:50,654 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 244 transitions. Word has length 23 [2024-11-07 16:51:50,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:51:50,654 INFO L471 AbstractCegarLoop]: Abstraction has 134 states and 244 transitions. [2024-11-07 16:51:50,654 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:51:50,654 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 244 transitions. [2024-11-07 16:51:50,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-07 16:51:50,655 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:51:50,655 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:51:50,655 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-07 16:51:50,656 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-07 16:51:50,656 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:51:50,656 INFO L85 PathProgramCache]: Analyzing trace with hash -1873533659, now seen corresponding path program 1 times [2024-11-07 16:51:50,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:51:50,656 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2072942316] [2024-11-07 16:51:50,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:51:50,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:51:50,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 16:51:50,669 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-07 16:51:50,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 16:51:50,705 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-07 16:51:50,706 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-07 16:51:50,707 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (1 of 2 remaining) [2024-11-07 16:51:50,708 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (0 of 2 remaining) [2024-11-07 16:51:50,709 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-07 16:51:50,712 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:51:50,780 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-07 16:51:50,783 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 04:51:50 BoogieIcfgContainer [2024-11-07 16:51:50,784 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-07 16:51:50,784 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-07 16:51:50,784 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-07 16:51:50,784 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-07 16:51:50,787 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 04:51:49" (3/4) ... [2024-11-07 16:51:50,789 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-07 16:51:50,790 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-07 16:51:50,791 INFO L158 Benchmark]: Toolchain (without parser) took 1936.08ms. Allocated memory is still 100.7MB. Free memory was 77.2MB in the beginning and 59.4MB in the end (delta: 17.8MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-07 16:51:50,792 INFO L158 Benchmark]: CDTParser took 0.31ms. Allocated memory is still 83.9MB. Free memory is still 47.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 16:51:50,792 INFO L158 Benchmark]: CACSL2BoogieTranslator took 271.37ms. Allocated memory is still 100.7MB. Free memory was 77.0MB in the beginning and 65.2MB in the end (delta: 11.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-07 16:51:50,793 INFO L158 Benchmark]: Boogie Procedure Inliner took 42.42ms. Allocated memory is still 100.7MB. Free memory was 65.2MB in the beginning and 63.7MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 16:51:50,793 INFO L158 Benchmark]: Boogie Preprocessor took 48.53ms. Allocated memory is still 100.7MB. Free memory was 63.7MB in the beginning and 61.9MB in the end (delta: 1.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-07 16:51:50,794 INFO L158 Benchmark]: RCFGBuilder took 411.81ms. Allocated memory is still 100.7MB. Free memory was 61.9MB in the beginning and 44.4MB in the end (delta: 17.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-07 16:51:50,794 INFO L158 Benchmark]: TraceAbstraction took 1147.61ms. Allocated memory is still 100.7MB. Free memory was 44.0MB in the beginning and 59.4MB in the end (delta: -15.5MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 16:51:50,794 INFO L158 Benchmark]: Witness Printer took 6.25ms. Allocated memory is still 100.7MB. Free memory was 59.4MB in the beginning and 59.4MB in the end (delta: 18.9kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 16:51:50,795 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.31ms. Allocated memory is still 83.9MB. Free memory is still 47.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 271.37ms. Allocated memory is still 100.7MB. Free memory was 77.0MB in the beginning and 65.2MB in the end (delta: 11.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 42.42ms. Allocated memory is still 100.7MB. Free memory was 65.2MB in the beginning and 63.7MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 48.53ms. Allocated memory is still 100.7MB. Free memory was 63.7MB in the beginning and 61.9MB in the end (delta: 1.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 411.81ms. Allocated memory is still 100.7MB. Free memory was 61.9MB in the beginning and 44.4MB in the end (delta: 17.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 1147.61ms. Allocated memory is still 100.7MB. Free memory was 44.0MB in the beginning and 59.4MB in the end (delta: -15.5MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 6.25ms. Allocated memory is still 100.7MB. Free memory was 59.4MB in the beginning and 59.4MB in the end (delta: 18.9kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 3]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 3. Possible FailurePath: [L8] int p1 = __VERIFIER_nondet_int(); [L9] int lk1; [L11] int p2 = __VERIFIER_nondet_int(); [L12] int lk2; [L14] int p3 = __VERIFIER_nondet_int(); [L15] int lk3; [L17] int p4 = __VERIFIER_nondet_int(); [L18] int lk4; [L20] int p5 = __VERIFIER_nondet_int(); [L21] int lk5; [L23] int p6 = __VERIFIER_nondet_int(); [L24] int lk6; [L26] int p7 = __VERIFIER_nondet_int(); [L27] int lk7; [L29] int p8 = __VERIFIER_nondet_int(); [L30] int lk8; [L32] int p9 = __VERIFIER_nondet_int(); [L33] int lk9; [L35] int p10 = __VERIFIER_nondet_int(); [L36] int lk10; [L38] int p11 = __VERIFIER_nondet_int(); [L39] int lk11; [L41] int p12 = __VERIFIER_nondet_int(); [L42] int lk12; [L44] int p13 = __VERIFIER_nondet_int(); [L45] int lk13; [L47] int p14 = __VERIFIER_nondet_int(); [L48] int lk14; [L50] int p15 = __VERIFIER_nondet_int(); [L51] int lk15; [L54] int cond; VAL [p10=1, p11=0, p12=1, p13=1, p14=1, p15=1, p1=0, p2=0, p3=0, p4=1, p5=1, p6=1, p7=1, p8=1, p9=1] [L56] COND TRUE 1 [L57] cond = __VERIFIER_nondet_int() [L58] COND FALSE !(cond == 0) [L61] lk1 = 0 [L63] lk2 = 0 [L65] lk3 = 0 [L67] lk4 = 0 [L69] lk5 = 0 [L71] lk6 = 0 [L73] lk7 = 0 [L75] lk8 = 0 [L77] lk9 = 0 [L79] lk10 = 0 [L81] lk11 = 0 [L83] lk12 = 0 [L85] lk13 = 0 [L87] lk14 = 0 [L89] lk15 = 0 VAL [lk10=0, lk11=0, lk12=0, lk13=0, lk14=0, lk15=0, lk1=0, lk2=0, lk3=0, lk4=0, lk5=0, lk6=0, lk7=0, lk8=0, lk9=0, p10=1, p11=0, p12=1, p13=1, p14=1, p15=1, p1=0, p2=0, p3=0, p4=1, p5=1, p6=1, p7=1, p8=1, p9=1] [L93] COND FALSE !(p1 != 0) VAL [lk10=0, lk11=0, lk12=0, lk13=0, lk14=0, lk15=0, lk1=0, lk2=0, lk3=0, lk4=0, lk5=0, lk6=0, lk7=0, lk8=0, lk9=0, p10=1, p11=0, p12=1, p13=1, p14=1, p15=1, p1=0, p2=0, p3=0, p4=1, p5=1, p6=1, p7=1, p8=1, p9=1] [L97] COND FALSE !(p2 != 0) VAL [lk10=0, lk11=0, lk12=0, lk13=0, lk14=0, lk15=0, lk1=0, lk2=0, lk3=0, lk4=0, lk5=0, lk6=0, lk7=0, lk8=0, lk9=0, p10=1, p11=0, p12=1, p13=1, p14=1, p15=1, p1=0, p2=0, p3=0, p4=1, p5=1, p6=1, p7=1, p8=1, p9=1] [L101] COND FALSE !(p3 != 0) VAL [lk10=0, lk11=0, lk12=0, lk13=0, lk14=0, lk15=0, lk1=0, lk2=0, lk3=0, lk4=0, lk5=0, lk6=0, lk7=0, lk8=0, lk9=0, p10=1, p11=0, p12=1, p13=1, p14=1, p15=1, p1=0, p2=0, p3=0, p4=1, p5=1, p6=1, p7=1, p8=1, p9=1] [L105] COND TRUE p4 != 0 [L106] lk4 = 1 VAL [lk10=0, lk11=0, lk12=0, lk13=0, lk14=0, lk15=0, lk1=0, lk2=0, lk3=0, lk4=1, lk5=0, lk6=0, lk7=0, lk8=0, lk9=0, p10=1, p11=0, p12=1, p13=1, p14=1, p15=1, p1=0, p2=0, p3=0, p4=1, p5=1, p6=1, p7=1, p8=1, p9=1] [L109] COND TRUE p5 != 0 [L110] lk5 = 1 VAL [lk10=0, lk11=0, lk12=0, lk13=0, lk14=0, lk15=0, lk1=0, lk2=0, lk3=0, lk4=1, lk5=1, lk6=0, lk7=0, lk8=0, lk9=0, p10=1, p11=0, p12=1, p13=1, p14=1, p15=1, p1=0, p2=0, p3=0, p4=1, p5=1, p6=1, p7=1, p8=1, p9=1] [L113] COND TRUE p6 != 0 [L114] lk6 = 1 VAL [lk10=0, lk11=0, lk12=0, lk13=0, lk14=0, lk15=0, lk1=0, lk2=0, lk3=0, lk4=1, lk5=1, lk6=1, lk7=0, lk8=0, lk9=0, p10=1, p11=0, p12=1, p13=1, p14=1, p15=1, p1=0, p2=0, p3=0, p4=1, p5=1, p6=1, p7=1, p8=1, p9=1] [L117] COND TRUE p7 != 0 [L118] lk7 = 1 VAL [lk10=0, lk11=0, lk12=0, lk13=0, lk14=0, lk15=0, lk1=0, lk2=0, lk3=0, lk4=1, lk5=1, lk6=1, lk7=1, lk8=0, lk9=0, p10=1, p11=0, p12=1, p13=1, p14=1, p15=1, p1=0, p2=0, p3=0, p4=1, p5=1, p6=1, p7=1, p8=1, p9=1] [L121] COND TRUE p8 != 0 [L122] lk8 = 1 VAL [lk10=0, lk11=0, lk12=0, lk13=0, lk14=0, lk15=0, lk1=0, lk2=0, lk3=0, lk4=1, lk5=1, lk6=1, lk7=1, lk8=1, lk9=0, p10=1, p11=0, p12=1, p13=1, p14=1, p15=1, p1=0, p2=0, p3=0, p4=1, p5=1, p6=1, p7=1, p8=1, p9=1] [L125] COND TRUE p9 != 0 [L126] lk9 = 1 VAL [lk10=0, lk11=0, lk12=0, lk13=0, lk14=0, lk15=0, lk1=0, lk2=0, lk3=0, lk4=1, lk5=1, lk6=1, lk7=1, lk8=1, lk9=1, p10=1, p11=0, p12=1, p13=1, p14=1, p15=1, p1=0, p2=0, p3=0, p4=1, p5=1, p6=1, p7=1, p8=1, p9=1] [L129] COND TRUE p10 != 0 [L130] lk10 = 1 VAL [lk10=1, lk11=0, lk12=0, lk13=0, lk14=0, lk15=0, lk1=0, lk2=0, lk3=0, lk4=1, lk5=1, lk6=1, lk7=1, lk8=1, lk9=1, p10=1, p11=0, p12=1, p13=1, p14=1, p15=1, p1=0, p2=0, p3=0, p4=1, p5=1, p6=1, p7=1, p8=1, p9=1] [L133] COND FALSE !(p11 != 0) VAL [lk10=1, lk11=0, lk12=0, lk13=0, lk14=0, lk15=0, lk1=0, lk2=0, lk3=0, lk4=1, lk5=1, lk6=1, lk7=1, lk8=1, lk9=1, p10=1, p11=0, p12=1, p13=1, p14=1, p15=1, p1=0, p2=0, p3=0, p4=1, p5=1, p6=1, p7=1, p8=1, p9=1] [L137] COND TRUE p12 != 0 [L138] lk12 = 1 VAL [lk10=1, lk11=0, lk12=1, lk13=0, lk14=0, lk15=0, lk1=0, lk2=0, lk3=0, lk4=1, lk5=1, lk6=1, lk7=1, lk8=1, lk9=1, p10=1, p11=0, p12=1, p13=1, p14=1, p15=1, p1=0, p2=0, p3=0, p4=1, p5=1, p6=1, p7=1, p8=1, p9=1] [L141] COND TRUE p13 != 0 [L142] lk13 = 1 VAL [lk10=1, lk11=0, lk12=1, lk13=1, lk14=0, lk15=0, lk1=0, lk2=0, lk3=0, lk4=1, lk5=1, lk6=1, lk7=1, lk8=1, lk9=1, p10=1, p11=0, p12=1, p13=1, p14=1, p15=1, p1=0, p2=0, p3=0, p4=1, p5=1, p6=1, p7=1, p8=1, p9=1] [L145] COND TRUE p14 != 0 [L146] lk14 = 1 VAL [lk10=1, lk11=0, lk12=1, lk13=1, lk14=1, lk15=0, lk1=0, lk2=0, lk3=0, lk4=1, lk5=1, lk6=1, lk7=1, lk8=1, lk9=1, p10=1, p11=0, p12=1, p13=1, p14=1, p15=1, p1=0, p2=0, p3=0, p4=1, p5=1, p6=1, p7=1, p8=1, p9=1] [L149] COND TRUE p15 != 0 [L150] lk15 = 1 VAL [lk10=1, lk11=0, lk12=1, lk13=1, lk14=1, lk15=1, lk1=0, lk2=0, lk3=0, lk4=1, lk5=1, lk6=1, lk7=1, lk8=1, lk9=1, p10=1, p11=0, p12=1, p13=1, p14=1, p15=1, p1=0, p2=0, p3=0, p4=1, p5=1, p6=1, p7=1, p8=1, p9=1] [L155] COND FALSE !(p1 != 0) VAL [lk10=1, lk11=0, lk12=1, lk13=1, lk14=1, lk15=1, lk1=0, lk2=0, lk3=0, lk4=1, lk5=1, lk6=1, lk7=1, lk8=1, lk9=1, p10=1, p11=0, p12=1, p13=1, p14=1, p15=1, p1=0, p2=0, p3=0, p4=1, p5=1, p6=1, p7=1, p8=1, p9=1] [L160] COND FALSE !(p2 != 0) VAL [lk10=1, lk11=0, lk12=1, lk13=1, lk14=1, lk15=1, lk1=0, lk2=0, lk3=0, lk4=1, lk5=1, lk6=1, lk7=1, lk8=1, lk9=1, p10=1, p11=0, p12=1, p13=1, p14=1, p15=1, p1=0, p3=0, p4=1, p5=1, p6=1, p7=1, p8=1, p9=1] [L233] CALL reach_error() [L3] __assert_fail("0", "test_locks_15-1.c", 3, "reach_error") - UnprovableResult [Line: 6]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 58 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 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, 336 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 336 mSDsluCounter, 977 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 307 mSDsCounter, 5 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 21 IncrementalHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 5 mSolverCounterUnsat, 670 mSDtfsCounter, 21 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 16 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=136occurred in iteration=5, InterpolantAutomatonStates: 17, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 6 MinimizatonAttempts, 9 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 126 NumberOfCodeBlocks, 126 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 97 ConstructedInterpolants, 0 QuantifiedInterpolants, 257 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-07 16:51:50,828 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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 Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/locks/test_locks_15-1.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 11a9c91fdf6b42598924d9a4ae5a3db9994a05118a3b564c2bd29b9bad4177b0 --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 16:51:53,164 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 16:51:53,259 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2024-11-07 16:51:53,267 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 16:51:53,268 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 16:51:53,288 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 16:51:53,288 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 16:51:53,289 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 16:51:53,289 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 16:51:53,289 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 16:51:53,289 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 16:51:53,289 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 16:51:53,289 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 16:51:53,289 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 16:51:53,289 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 16:51:53,290 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 16:51:53,290 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 16:51:53,290 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-07 16:51:53,290 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 16:51:53,290 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 16:51:53,290 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-07 16:51:53,290 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-07 16:51:53,291 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-07 16:51:53,291 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 16:51:53,291 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-07 16:51:53,291 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-07 16:51:53,291 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 16:51:53,291 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-07 16:51:53,291 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-07 16:51:53,291 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 16:51:53,295 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 16:51:53,295 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 16:51:53,295 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 16:51:53,295 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 16:51:53,295 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 16:51:53,296 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 16:51:53,296 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 16:51:53,296 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 16:51:53,296 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-07 16:51:53,296 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-07 16:51:53,296 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 16:51:53,296 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 16:51:53,296 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 16:51:53,296 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 16:51:53,296 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 11a9c91fdf6b42598924d9a4ae5a3db9994a05118a3b564c2bd29b9bad4177b0 [2024-11-07 16:51:53,589 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 16:51:53,597 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 16:51:53,599 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 16:51:53,600 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 16:51:53,600 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 16:51:53,601 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/locks/test_locks_15-1.c [2024-11-07 16:51:55,002 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 16:51:55,308 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 16:51:55,308 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/locks/test_locks_15-1.c [2024-11-07 16:51:55,320 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/4f3f3caa4/8c18c54bd0634a39b6e2e7b3f570938d/FLAG5155aa702 [2024-11-07 16:51:55,339 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/4f3f3caa4/8c18c54bd0634a39b6e2e7b3f570938d [2024-11-07 16:51:55,342 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 16:51:55,344 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 16:51:55,345 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 16:51:55,345 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 16:51:55,350 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 16:51:55,351 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 04:51:55" (1/1) ... [2024-11-07 16:51:55,353 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@269273e4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:51:55, skipping insertion in model container [2024-11-07 16:51:55,353 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 04:51:55" (1/1) ... [2024-11-07 16:51:55,370 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 16:51:55,539 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 16:51:55,555 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 16:51:55,594 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 16:51:55,609 INFO L204 MainTranslator]: Completed translation [2024-11-07 16:51:55,610 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:51:55 WrapperNode [2024-11-07 16:51:55,610 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 16:51:55,611 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 16:51:55,612 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 16:51:55,612 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 16:51:55,621 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:51:55" (1/1) ... [2024-11-07 16:51:55,630 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:51:55" (1/1) ... [2024-11-07 16:51:55,656 INFO L138 Inliner]: procedures = 12, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 195 [2024-11-07 16:51:55,658 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 16:51:55,659 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 16:51:55,659 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 16:51:55,659 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 16:51:55,668 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:51:55" (1/1) ... [2024-11-07 16:51:55,669 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:51:55" (1/1) ... [2024-11-07 16:51:55,676 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:51:55" (1/1) ... [2024-11-07 16:51:55,694 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-07 16:51:55,694 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:51:55" (1/1) ... [2024-11-07 16:51:55,695 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:51:55" (1/1) ... [2024-11-07 16:51:55,703 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:51:55" (1/1) ... [2024-11-07 16:51:55,711 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:51:55" (1/1) ... [2024-11-07 16:51:55,715 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:51:55" (1/1) ... [2024-11-07 16:51:55,720 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:51:55" (1/1) ... [2024-11-07 16:51:55,722 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 16:51:55,722 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 16:51:55,725 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 16:51:55,725 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 16:51:55,726 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:51:55" (1/1) ... [2024-11-07 16:51:55,735 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 16:51:55,748 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 16:51:55,763 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-07 16:51:55,770 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-07 16:51:55,791 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 16:51:55,791 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 16:51:55,791 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 16:51:55,791 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-07 16:51:55,875 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 16:51:55,877 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 16:51:56,196 INFO L? ?]: Removed 38 outVars from TransFormulas that were not future-live. [2024-11-07 16:51:56,197 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 16:51:56,211 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 16:51:56,212 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-07 16:51:56,212 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 04:51:56 BoogieIcfgContainer [2024-11-07 16:51:56,212 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 16:51:56,215 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 16:51:56,215 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 16:51:56,221 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 16:51:56,221 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 04:51:55" (1/3) ... [2024-11-07 16:51:56,222 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@26300c4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 04:51:56, skipping insertion in model container [2024-11-07 16:51:56,222 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:51:55" (2/3) ... [2024-11-07 16:51:56,222 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@26300c4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 04:51:56, skipping insertion in model container [2024-11-07 16:51:56,223 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 04:51:56" (3/3) ... [2024-11-07 16:51:56,224 INFO L112 eAbstractionObserver]: Analyzing ICFG test_locks_15-1.c [2024-11-07 16:51:56,238 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 16:51:56,238 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-07 16:51:56,274 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 16:51:56,290 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;@642db94b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 16:51:56,291 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-07 16:51:56,295 INFO L276 IsEmpty]: Start isEmpty. Operand has 58 states, 55 states have (on average 1.9090909090909092) internal successors, (105), 57 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:51:56,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-07 16:51:56,300 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:51:56,301 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-07 16:51:56,301 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-07 16:51:56,305 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:51:56,305 INFO L85 PathProgramCache]: Analyzing trace with hash 28959894, now seen corresponding path program 1 times [2024-11-07 16:51:56,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 16:51:56,313 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1262903929] [2024-11-07 16:51:56,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:51:56,314 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 16:51:56,314 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 16:51:56,317 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 16:51:56,319 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-07 16:51:56,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:51:56,372 INFO L255 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-07 16:51:56,375 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 16:51:56,393 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 16:51:56,394 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 16:51:56,395 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 16:51:56,396 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1262903929] [2024-11-07 16:51:56,396 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1262903929] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:51:56,396 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 16:51:56,397 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 16:51:56,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1913747608] [2024-11-07 16:51:56,399 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:51:56,402 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-07 16:51:56,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 16:51:56,423 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-07 16:51:56,423 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 16:51:56,425 INFO L87 Difference]: Start difference. First operand has 58 states, 55 states have (on average 1.9090909090909092) internal successors, (105), 57 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:51:56,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:51:56,442 INFO L93 Difference]: Finished difference Result 57 states and 101 transitions. [2024-11-07 16:51:56,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-07 16:51:56,444 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2024-11-07 16:51:56,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:51:56,451 INFO L225 Difference]: With dead ends: 57 [2024-11-07 16:51:56,452 INFO L226 Difference]: Without dead ends: 55 [2024-11-07 16:51:56,453 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 16:51:56,456 INFO L432 NwaCegarLoop]: 101 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 16:51:56,459 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 16:51:56,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2024-11-07 16:51:56,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2024-11-07 16:51:56,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 53 states have (on average 1.8679245283018868) internal successors, (99), 54 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:51:56,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 99 transitions. [2024-11-07 16:51:56,500 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 99 transitions. Word has length 5 [2024-11-07 16:51:56,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:51:56,500 INFO L471 AbstractCegarLoop]: Abstraction has 55 states and 99 transitions. [2024-11-07 16:51:56,501 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:51:56,501 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 99 transitions. [2024-11-07 16:51:56,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-07 16:51:56,501 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:51:56,501 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-07 16:51:56,505 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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-11-07 16:51:56,702 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 16:51:56,703 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-07 16:51:56,703 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:51:56,703 INFO L85 PathProgramCache]: Analyzing trace with hash 889700686, now seen corresponding path program 1 times [2024-11-07 16:51:56,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 16:51:56,704 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [208899817] [2024-11-07 16:51:56,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:51:56,704 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 16:51:56,704 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 16:51:56,706 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 16:51:56,709 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-07 16:51:56,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:51:56,740 INFO L255 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-07 16:51:56,740 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 16:51:56,760 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 16:51:56,761 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 16:51:56,761 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 16:51:56,761 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [208899817] [2024-11-07 16:51:56,761 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [208899817] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:51:56,761 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 16:51:56,761 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 16:51:56,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1445113368] [2024-11-07 16:51:56,761 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:51:56,762 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 16:51:56,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 16:51:56,763 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 16:51:56,763 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 16:51:56,763 INFO L87 Difference]: Start difference. First operand 55 states and 99 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:51:56,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:51:56,779 INFO L93 Difference]: Finished difference Result 54 states and 98 transitions. [2024-11-07 16:51:56,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 16:51:56,780 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2024-11-07 16:51:56,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:51:56,781 INFO L225 Difference]: With dead ends: 54 [2024-11-07 16:51:56,782 INFO L226 Difference]: Without dead ends: 52 [2024-11-07 16:51:56,783 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 16:51:56,783 INFO L432 NwaCegarLoop]: 98 mSDtfsCounter, 93 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 1 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 16:51:56,784 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 98 Invalid, 1 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 16:51:56,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2024-11-07 16:51:56,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2024-11-07 16:51:56,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 51 states have (on average 1.8823529411764706) internal successors, (96), 51 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:51:56,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 96 transitions. [2024-11-07 16:51:56,793 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 96 transitions. Word has length 6 [2024-11-07 16:51:56,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:51:56,794 INFO L471 AbstractCegarLoop]: Abstraction has 52 states and 96 transitions. [2024-11-07 16:51:56,794 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:51:56,794 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 96 transitions. [2024-11-07 16:51:56,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-07 16:51:56,795 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:51:56,795 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:51:56,798 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-07 16:51:56,997 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 16:51:56,998 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-07 16:51:56,998 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:51:56,998 INFO L85 PathProgramCache]: Analyzing trace with hash 1809554789, now seen corresponding path program 1 times [2024-11-07 16:51:56,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 16:51:56,999 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [641102733] [2024-11-07 16:51:56,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:51:56,999 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 16:51:56,999 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 16:51:57,001 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 16:51:57,011 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-07 16:51:57,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:51:57,058 INFO L255 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-07 16:51:57,059 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 16:51:57,112 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 16:51:57,112 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 16:51:57,112 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 16:51:57,112 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [641102733] [2024-11-07 16:51:57,113 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [641102733] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:51:57,113 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 16:51:57,113 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 16:51:57,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [468085639] [2024-11-07 16:51:57,114 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:51:57,115 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 16:51:57,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 16:51:57,115 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 16:51:57,116 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 16:51:57,117 INFO L87 Difference]: Start difference. First operand 52 states and 96 transitions. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:51:57,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:51:57,151 INFO L93 Difference]: Finished difference Result 101 states and 186 transitions. [2024-11-07 16:51:57,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 16:51:57,152 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2024-11-07 16:51:57,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:51:57,153 INFO L225 Difference]: With dead ends: 101 [2024-11-07 16:51:57,154 INFO L226 Difference]: Without dead ends: 101 [2024-11-07 16:51:57,155 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 16:51:57,155 INFO L432 NwaCegarLoop]: 153 mSDtfsCounter, 77 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 242 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 16:51:57,156 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 242 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 16:51:57,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2024-11-07 16:51:57,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 98. [2024-11-07 16:51:57,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 97 states have (on average 1.8969072164948453) internal successors, (184), 97 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:51:57,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 184 transitions. [2024-11-07 16:51:57,171 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 184 transitions. Word has length 23 [2024-11-07 16:51:57,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:51:57,171 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 184 transitions. [2024-11-07 16:51:57,171 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:51:57,171 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 184 transitions. [2024-11-07 16:51:57,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-07 16:51:57,174 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:51:57,174 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:51:57,178 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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)] Forceful destruction successful, exit code 0 [2024-11-07 16:51:57,377 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 16:51:57,377 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-07 16:51:57,377 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:51:57,378 INFO L85 PathProgramCache]: Analyzing trace with hash 1809331837, now seen corresponding path program 1 times [2024-11-07 16:51:57,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 16:51:57,378 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1093277642] [2024-11-07 16:51:57,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:51:57,378 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 16:51:57,378 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 16:51:57,380 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 16:51:57,385 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-07 16:51:57,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:51:57,431 INFO L255 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-07 16:51:57,433 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 16:51:57,489 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 16:51:57,489 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 16:51:57,489 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 16:51:57,489 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1093277642] [2024-11-07 16:51:57,489 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1093277642] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:51:57,489 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 16:51:57,489 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 16:51:57,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1808380207] [2024-11-07 16:51:57,489 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:51:57,490 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 16:51:57,490 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 16:51:57,490 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 16:51:57,490 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 16:51:57,490 INFO L87 Difference]: Start difference. First operand 98 states and 184 transitions. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:51:57,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:51:57,519 INFO L93 Difference]: Finished difference Result 99 states and 185 transitions. [2024-11-07 16:51:57,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 16:51:57,520 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2024-11-07 16:51:57,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:51:57,521 INFO L225 Difference]: With dead ends: 99 [2024-11-07 16:51:57,521 INFO L226 Difference]: Without dead ends: 99 [2024-11-07 16:51:57,521 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 16:51:57,522 INFO L432 NwaCegarLoop]: 95 mSDtfsCounter, 14 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 186 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 16:51:57,522 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 186 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 16:51:57,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2024-11-07 16:51:57,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2024-11-07 16:51:57,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 98 states have (on average 1.8877551020408163) internal successors, (185), 98 states have internal predecessors, (185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:51:57,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 185 transitions. [2024-11-07 16:51:57,541 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 185 transitions. Word has length 23 [2024-11-07 16:51:57,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:51:57,541 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 185 transitions. [2024-11-07 16:51:57,542 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:51:57,542 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 185 transitions. [2024-11-07 16:51:57,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-07 16:51:57,542 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:51:57,542 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:51:57,547 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-11-07 16:51:57,743 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 16:51:57,743 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-07 16:51:57,744 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:51:57,744 INFO L85 PathProgramCache]: Analyzing trace with hash 120611047, now seen corresponding path program 1 times [2024-11-07 16:51:57,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 16:51:57,744 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [20880531] [2024-11-07 16:51:57,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:51:57,744 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 16:51:57,744 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 16:51:57,747 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 16:51:57,747 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-11-07 16:51:57,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:51:57,793 INFO L255 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-07 16:51:57,796 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 16:51:57,835 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 16:51:57,835 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 16:51:57,835 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 16:51:57,835 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [20880531] [2024-11-07 16:51:57,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [20880531] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:51:57,835 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 16:51:57,835 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 16:51:57,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [395200505] [2024-11-07 16:51:57,836 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:51:57,836 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 16:51:57,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 16:51:57,836 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 16:51:57,836 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 16:51:57,836 INFO L87 Difference]: Start difference. First operand 99 states and 185 transitions. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:51:57,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:51:57,860 INFO L93 Difference]: Finished difference Result 139 states and 253 transitions. [2024-11-07 16:51:57,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 16:51:57,860 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2024-11-07 16:51:57,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:51:57,863 INFO L225 Difference]: With dead ends: 139 [2024-11-07 16:51:57,865 INFO L226 Difference]: Without dead ends: 139 [2024-11-07 16:51:57,866 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 16:51:57,867 INFO L432 NwaCegarLoop]: 99 mSDtfsCounter, 77 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 16:51:57,867 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 136 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 16:51:57,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2024-11-07 16:51:57,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 136. [2024-11-07 16:51:57,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 135 states have (on average 1.8592592592592592) internal successors, (251), 135 states have internal predecessors, (251), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:51:57,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 251 transitions. [2024-11-07 16:51:57,884 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 251 transitions. Word has length 23 [2024-11-07 16:51:57,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:51:57,885 INFO L471 AbstractCegarLoop]: Abstraction has 136 states and 251 transitions. [2024-11-07 16:51:57,885 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:51:57,885 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 251 transitions. [2024-11-07 16:51:57,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-07 16:51:57,886 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:51:57,886 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:51:57,892 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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-11-07 16:51:58,086 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 16:51:58,087 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-07 16:51:58,087 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:51:58,087 INFO L85 PathProgramCache]: Analyzing trace with hash 120388095, now seen corresponding path program 1 times [2024-11-07 16:51:58,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 16:51:58,088 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [90652834] [2024-11-07 16:51:58,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:51:58,088 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 16:51:58,088 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 16:51:58,091 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 16:51:58,092 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-11-07 16:51:58,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:51:58,136 INFO L255 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-07 16:51:58,137 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 16:51:58,173 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 16:51:58,173 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 16:51:58,173 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 16:51:58,173 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [90652834] [2024-11-07 16:51:58,173 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [90652834] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:51:58,173 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 16:51:58,173 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 16:51:58,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [39181816] [2024-11-07 16:51:58,174 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:51:58,174 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 16:51:58,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 16:51:58,174 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 16:51:58,174 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 16:51:58,175 INFO L87 Difference]: Start difference. First operand 136 states and 251 transitions. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:51:58,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:51:58,188 INFO L93 Difference]: Finished difference Result 137 states and 246 transitions. [2024-11-07 16:51:58,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 16:51:58,189 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2024-11-07 16:51:58,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:51:58,190 INFO L225 Difference]: With dead ends: 137 [2024-11-07 16:51:58,190 INFO L226 Difference]: Without dead ends: 137 [2024-11-07 16:51:58,190 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 16:51:58,191 INFO L432 NwaCegarLoop]: 124 mSDtfsCounter, 75 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 214 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 16:51:58,191 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 214 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 16:51:58,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2024-11-07 16:51:58,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 134. [2024-11-07 16:51:58,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 133 states have (on average 1.8345864661654134) internal successors, (244), 133 states have internal predecessors, (244), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:51:58,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 244 transitions. [2024-11-07 16:51:58,198 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 244 transitions. Word has length 23 [2024-11-07 16:51:58,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:51:58,198 INFO L471 AbstractCegarLoop]: Abstraction has 134 states and 244 transitions. [2024-11-07 16:51:58,198 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:51:58,198 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 244 transitions. [2024-11-07 16:51:58,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-07 16:51:58,199 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:51:58,199 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:51:58,202 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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)] Ended with exit code 0 [2024-11-07 16:51:58,401 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 16:51:58,402 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-07 16:51:58,402 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:51:58,402 INFO L85 PathProgramCache]: Analyzing trace with hash -1873533659, now seen corresponding path program 1 times [2024-11-07 16:51:58,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 16:51:58,403 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [794396782] [2024-11-07 16:51:58,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:51:58,403 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 16:51:58,403 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 16:51:58,405 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 16:51:58,406 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2024-11-07 16:51:58,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 16:51:58,444 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-07 16:51:58,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 16:51:58,507 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2024-11-07 16:51:58,507 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-07 16:51:58,508 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (1 of 2 remaining) [2024-11-07 16:51:58,509 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (0 of 2 remaining) [2024-11-07 16:51:58,513 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2024-11-07 16:51:58,710 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 16:51:58,714 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:51:58,771 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-07 16:51:58,774 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 04:51:58 BoogieIcfgContainer [2024-11-07 16:51:58,774 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-07 16:51:58,775 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-07 16:51:58,775 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-07 16:51:58,775 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-07 16:51:58,776 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 04:51:56" (3/4) ... [2024-11-07 16:51:58,779 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-07 16:51:58,780 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-07 16:51:58,782 INFO L158 Benchmark]: Toolchain (without parser) took 3437.42ms. Allocated memory is still 117.4MB. Free memory was 93.9MB in the beginning and 45.7MB in the end (delta: 48.2MB). Peak memory consumption was 46.8MB. Max. memory is 16.1GB. [2024-11-07 16:51:58,782 INFO L158 Benchmark]: CDTParser took 0.30ms. Allocated memory is still 83.9MB. Free memory is still 49.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 16:51:58,782 INFO L158 Benchmark]: CACSL2BoogieTranslator took 265.94ms. Allocated memory is still 117.4MB. Free memory was 93.9MB in the beginning and 81.5MB in the end (delta: 12.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-07 16:51:58,782 INFO L158 Benchmark]: Boogie Procedure Inliner took 46.82ms. Allocated memory is still 117.4MB. Free memory was 81.5MB in the beginning and 80.0MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 16:51:58,782 INFO L158 Benchmark]: Boogie Preprocessor took 62.85ms. Allocated memory is still 117.4MB. Free memory was 80.0MB in the beginning and 78.2MB in the end (delta: 1.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-07 16:51:58,782 INFO L158 Benchmark]: RCFGBuilder took 489.96ms. Allocated memory is still 117.4MB. Free memory was 78.2MB in the beginning and 58.9MB in the end (delta: 19.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-07 16:51:58,783 INFO L158 Benchmark]: TraceAbstraction took 2559.36ms. Allocated memory is still 117.4MB. Free memory was 58.3MB in the beginning and 46.4MB in the end (delta: 11.9MB). Peak memory consumption was 13.2MB. Max. memory is 16.1GB. [2024-11-07 16:51:58,783 INFO L158 Benchmark]: Witness Printer took 5.19ms. Allocated memory is still 117.4MB. Free memory was 46.4MB in the beginning and 45.7MB in the end (delta: 707.8kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 16:51:58,786 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.30ms. Allocated memory is still 83.9MB. Free memory is still 49.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 265.94ms. Allocated memory is still 117.4MB. Free memory was 93.9MB in the beginning and 81.5MB in the end (delta: 12.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 46.82ms. Allocated memory is still 117.4MB. Free memory was 81.5MB in the beginning and 80.0MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 62.85ms. Allocated memory is still 117.4MB. Free memory was 80.0MB in the beginning and 78.2MB in the end (delta: 1.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 489.96ms. Allocated memory is still 117.4MB. Free memory was 78.2MB in the beginning and 58.9MB in the end (delta: 19.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 2559.36ms. Allocated memory is still 117.4MB. Free memory was 58.3MB in the beginning and 46.4MB in the end (delta: 11.9MB). Peak memory consumption was 13.2MB. Max. memory is 16.1GB. * Witness Printer took 5.19ms. Allocated memory is still 117.4MB. Free memory was 46.4MB in the beginning and 45.7MB in the end (delta: 707.8kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 3]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 3. Possible FailurePath: [L8] int p1 = __VERIFIER_nondet_int(); [L9] int lk1; [L11] int p2 = __VERIFIER_nondet_int(); [L12] int lk2; [L14] int p3 = __VERIFIER_nondet_int(); [L15] int lk3; [L17] int p4 = __VERIFIER_nondet_int(); [L18] int lk4; [L20] int p5 = __VERIFIER_nondet_int(); [L21] int lk5; [L23] int p6 = __VERIFIER_nondet_int(); [L24] int lk6; [L26] int p7 = __VERIFIER_nondet_int(); [L27] int lk7; [L29] int p8 = __VERIFIER_nondet_int(); [L30] int lk8; [L32] int p9 = __VERIFIER_nondet_int(); [L33] int lk9; [L35] int p10 = __VERIFIER_nondet_int(); [L36] int lk10; [L38] int p11 = __VERIFIER_nondet_int(); [L39] int lk11; [L41] int p12 = __VERIFIER_nondet_int(); [L42] int lk12; [L44] int p13 = __VERIFIER_nondet_int(); [L45] int lk13; [L47] int p14 = __VERIFIER_nondet_int(); [L48] int lk14; [L50] int p15 = __VERIFIER_nondet_int(); [L51] int lk15; [L54] int cond; [L56] COND TRUE 1 [L57] cond = __VERIFIER_nondet_int() [L58] COND FALSE !(cond == 0) [L61] lk1 = 0 [L63] lk2 = 0 [L65] lk3 = 0 [L67] lk4 = 0 [L69] lk5 = 0 [L71] lk6 = 0 [L73] lk7 = 0 [L75] lk8 = 0 [L77] lk9 = 0 [L79] lk10 = 0 [L81] lk11 = 0 [L83] lk12 = 0 [L85] lk13 = 0 [L87] lk14 = 0 [L89] lk15 = 0 VAL [lk10=0, lk11=0, lk12=0, lk13=0, lk14=0, lk15=0, lk1=0, lk2=0, lk3=0, lk4=0, lk5=0, lk6=0, lk7=0, lk8=0, lk9=0] [L93] COND FALSE !(p1 != 0) VAL [lk10=0, lk11=0, lk12=0, lk13=0, lk14=0, lk15=0, lk1=0, lk2=0, lk3=0, lk4=0, lk5=0, lk6=0, lk7=0, lk8=0, lk9=0, p1=0] [L97] COND FALSE !(p2 != 0) VAL [lk10=0, lk11=0, lk12=0, lk13=0, lk14=0, lk15=0, lk1=0, lk2=0, lk3=0, lk4=0, lk5=0, lk6=0, lk7=0, lk8=0, lk9=0, p1=0, p2=0] [L101] COND FALSE !(p3 != 0) VAL [lk10=0, lk11=0, lk12=0, lk13=0, lk14=0, lk15=0, lk1=0, lk2=0, lk3=0, lk4=0, lk5=0, lk6=0, lk7=0, lk8=0, lk9=0, p1=0, p2=0, p3=0] [L105] COND TRUE p4 != 0 [L106] lk4 = 1 VAL [lk10=0, lk11=0, lk12=0, lk13=0, lk14=0, lk15=0, lk1=0, lk2=0, lk3=0, lk4=1, lk5=0, lk6=0, lk7=0, lk8=0, lk9=0, p1=0, p2=0, p3=0, p4=2] [L109] COND TRUE p5 != 0 [L110] lk5 = 1 VAL [lk10=0, lk11=0, lk12=0, lk13=0, lk14=0, lk15=0, lk1=0, lk2=0, lk3=0, lk4=1, lk5=1, lk6=0, lk7=0, lk8=0, lk9=0, p1=0, p2=0, p3=0, p4=2, p5=2] [L113] COND TRUE p6 != 0 [L114] lk6 = 1 VAL [lk10=0, lk11=0, lk12=0, lk13=0, lk14=0, lk15=0, lk1=0, lk2=0, lk3=0, lk4=1, lk5=1, lk6=1, lk7=0, lk8=0, lk9=0, p1=0, p2=0, p3=0, p4=2, p5=2, p6=2] [L117] COND TRUE p7 != 0 [L118] lk7 = 1 VAL [lk10=0, lk11=0, lk12=0, lk13=0, lk14=0, lk15=0, lk1=0, lk2=0, lk3=0, lk4=1, lk5=1, lk6=1, lk7=1, lk8=0, lk9=0, p1=0, p2=0, p3=0, p4=2, p5=2, p6=2, p7=2] [L121] COND TRUE p8 != 0 [L122] lk8 = 1 VAL [lk10=0, lk11=0, lk12=0, lk13=0, lk14=0, lk15=0, lk1=0, lk2=0, lk3=0, lk4=1, lk5=1, lk6=1, lk7=1, lk8=1, lk9=0, p1=0, p2=0, p3=0, p4=2, p5=2, p6=2, p7=2, p8=2] [L125] COND TRUE p9 != 0 [L126] lk9 = 1 VAL [lk10=0, lk11=0, lk12=0, lk13=0, lk14=0, lk15=0, lk1=0, lk2=0, lk3=0, lk4=1, lk5=1, lk6=1, lk7=1, lk8=1, lk9=1, p1=0, p2=0, p3=0, p4=2, p5=2, p6=2, p7=2, p8=2, p9=2] [L129] COND TRUE p10 != 0 [L130] lk10 = 1 VAL [lk10=1, lk11=0, lk12=0, lk13=0, lk14=0, lk15=0, lk1=0, lk2=0, lk3=0, lk4=1, lk5=1, lk6=1, lk7=1, lk8=1, lk9=1, p10=2, p1=0, p2=0, p3=0, p4=2, p5=2, p6=2, p7=2, p8=2, p9=2] [L133] COND FALSE !(p11 != 0) VAL [lk10=1, lk11=0, lk12=0, lk13=0, lk14=0, lk15=0, lk1=0, lk2=0, lk3=0, lk4=1, lk5=1, lk6=1, lk7=1, lk8=1, lk9=1, p10=2, p11=0, p1=0, p2=0, p3=0, p4=2, p5=2, p6=2, p7=2, p8=2, p9=2] [L137] COND TRUE p12 != 0 [L138] lk12 = 1 VAL [lk10=1, lk11=0, lk12=1, lk13=0, lk14=0, lk15=0, lk1=0, lk2=0, lk3=0, lk4=1, lk5=1, lk6=1, lk7=1, lk8=1, lk9=1, p10=2, p11=0, p12=2, p1=0, p2=0, p3=0, p4=2, p5=2, p6=2, p7=2, p8=2, p9=2] [L141] COND TRUE p13 != 0 [L142] lk13 = 1 VAL [lk10=1, lk11=0, lk12=1, lk13=1, lk14=0, lk15=0, lk1=0, lk2=0, lk3=0, lk4=1, lk5=1, lk6=1, lk7=1, lk8=1, lk9=1, p10=2, p11=0, p12=2, p13=2, p1=0, p2=0, p3=0, p4=2, p5=2, p6=2, p7=2, p8=2, p9=2] [L145] COND TRUE p14 != 0 [L146] lk14 = 1 VAL [lk10=1, lk11=0, lk12=1, lk13=1, lk14=1, lk15=0, lk1=0, lk2=0, lk3=0, lk4=1, lk5=1, lk6=1, lk7=1, lk8=1, lk9=1, p10=2, p11=0, p12=2, p13=2, p14=2, p1=0, p2=0, p3=0, p4=2, p5=2, p6=2, p7=2, p8=2, p9=2] [L149] COND TRUE p15 != 0 [L150] lk15 = 1 VAL [lk10=1, lk11=0, lk12=1, lk13=1, lk14=1, lk15=1, lk1=0, lk2=0, lk3=0, lk4=1, lk5=1, lk6=1, lk7=1, lk8=1, lk9=1, p10=2, p11=0, p12=2, p13=2, p14=2, p15=2, p1=0, p2=0, p3=0, p4=2, p5=2, p6=2, p7=2, p8=2, p9=2] [L155] COND FALSE !(p1 != 0) VAL [lk10=1, lk11=0, lk12=1, lk13=1, lk14=1, lk15=1, lk1=0, lk2=0, lk3=0, lk4=1, lk5=1, lk6=1, lk7=1, lk8=1, lk9=1, p10=2, p11=0, p12=2, p13=2, p14=2, p15=2, p1=0, p2=0, p3=0, p4=2, p5=2, p6=2, p7=2, p8=2, p9=2] [L160] COND FALSE !(p2 != 0) VAL [lk10=1, lk11=0, lk12=1, lk13=1, lk14=1, lk15=1, lk1=0, lk2=0, lk3=0, lk4=1, lk5=1, lk6=1, lk7=1, lk8=1, lk9=1, p10=2, p11=0, p12=2, p13=2, p14=2, p15=2, p1=0, p3=0, p4=2, p5=2, p6=2, p7=2, p8=2, p9=2] [L233] CALL reach_error() [L3] __assert_fail("0", "test_locks_15-1.c", 3, "reach_error") - UnprovableResult [Line: 6]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 58 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 2.5s, OverallIterations: 7, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 336 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 336 mSDsluCounter, 977 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 307 mSDsCounter, 5 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 21 IncrementalHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 5 mSolverCounterUnsat, 670 mSDtfsCounter, 21 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 97 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=136occurred in iteration=5, InterpolantAutomatonStates: 17, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 6 MinimizatonAttempts, 9 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 126 NumberOfCodeBlocks, 126 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 97 ConstructedInterpolants, 0 QuantifiedInterpolants, 257 SizeOfPredicates, 0 NumberOfNonLiveVariables, 279 ConjunctsInSsa, 11 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-07 16:51:58,815 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample