./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/valid-memcleanup.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety-bftpd/bftpd_1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (memcleanup) Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety-bftpd/bftpd_1.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-memcleanup) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 10f5db0b7f76a0d4c4c35217e21dd4a594e7457adb3230ac21a302fd5d7ee15c --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 17:23:20,606 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 17:23:20,661 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Default.epf [2024-10-11 17:23:20,665 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 17:23:20,665 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 17:23:20,685 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 17:23:20,686 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 17:23:20,686 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 17:23:20,687 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 17:23:20,687 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 17:23:20,687 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 17:23:20,687 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 17:23:20,688 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 17:23:20,691 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 17:23:20,691 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 17:23:20,692 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 17:23:20,692 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 17:23:20,692 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 17:23:20,692 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 17:23:20,693 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 17:23:20,693 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 17:23:20,693 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 17:23:20,695 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-11 17:23:20,695 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-11 17:23:20,696 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 17:23:20,696 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 17:23:20,696 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-11 17:23:20,696 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 17:23:20,696 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-11 17:23:20,697 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 17:23:20,697 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 17:23:20,697 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 17:23:20,697 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 17:23:20,697 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 17:23:20,697 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 17:23:20,697 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 17:23:20,698 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 17:23:20,698 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 17:23:20,698 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 17:23:20,698 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 17:23:20,698 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 17:23:20,699 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 17:23:20,699 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 17:23:20,699 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 17:23:20,700 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 17:23:20,700 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-memcleanup) ) 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 -> 10f5db0b7f76a0d4c4c35217e21dd4a594e7457adb3230ac21a302fd5d7ee15c [2024-10-11 17:23:20,882 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 17:23:20,904 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 17:23:20,906 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 17:23:20,907 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 17:23:20,907 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 17:23:20,909 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety-bftpd/bftpd_1.i [2024-10-11 17:23:22,150 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 17:23:22,330 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 17:23:22,331 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety-bftpd/bftpd_1.i [2024-10-11 17:23:22,342 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/f54afb563/f38f63805e994a0bb9c7cfbd49193e46/FLAG139f77326 [2024-10-11 17:23:22,360 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/f54afb563/f38f63805e994a0bb9c7cfbd49193e46 [2024-10-11 17:23:22,363 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 17:23:22,364 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 17:23:22,366 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 17:23:22,366 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 17:23:22,370 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 17:23:22,370 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 05:23:22" (1/1) ... [2024-10-11 17:23:22,371 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@59c82821 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:23:22, skipping insertion in model container [2024-10-11 17:23:22,371 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 05:23:22" (1/1) ... [2024-10-11 17:23:22,404 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 17:23:22,661 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 17:23:22,673 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 17:23:22,713 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 17:23:22,746 INFO L204 MainTranslator]: Completed translation [2024-10-11 17:23:22,746 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:23:22 WrapperNode [2024-10-11 17:23:22,746 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 17:23:22,747 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 17:23:22,747 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 17:23:22,747 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 17:23:22,752 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:23:22" (1/1) ... [2024-10-11 17:23:22,761 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:23:22" (1/1) ... [2024-10-11 17:23:22,783 INFO L138 Inliner]: procedures = 168, calls = 43, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 83 [2024-10-11 17:23:22,784 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 17:23:22,784 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 17:23:22,784 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 17:23:22,784 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 17:23:22,792 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:23:22" (1/1) ... [2024-10-11 17:23:22,792 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:23:22" (1/1) ... [2024-10-11 17:23:22,794 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:23:22" (1/1) ... [2024-10-11 17:23:22,804 INFO L175 MemorySlicer]: Split 24 memory accesses to 3 slices as follows [9, 9, 6]. 38 percent of accesses are in the largest equivalence class. The 21 initializations are split as follows [9, 6, 6]. The 0 writes are split as follows [0, 0, 0]. [2024-10-11 17:23:22,804 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:23:22" (1/1) ... [2024-10-11 17:23:22,804 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:23:22" (1/1) ... [2024-10-11 17:23:22,808 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:23:22" (1/1) ... [2024-10-11 17:23:22,810 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:23:22" (1/1) ... [2024-10-11 17:23:22,811 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:23:22" (1/1) ... [2024-10-11 17:23:22,811 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:23:22" (1/1) ... [2024-10-11 17:23:22,813 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 17:23:22,817 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 17:23:22,817 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 17:23:22,817 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 17:23:22,818 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:23:22" (1/1) ... [2024-10-11 17:23:22,822 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 17:23:22,831 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 17:23:22,843 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 17:23:22,844 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 17:23:22,878 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-11 17:23:22,879 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-11 17:23:22,879 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-10-11 17:23:22,879 INFO L130 BoogieDeclarations]: Found specification of procedure parse_input [2024-10-11 17:23:22,880 INFO L138 BoogieDeclarations]: Found implementation of procedure parse_input [2024-10-11 17:23:22,880 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-11 17:23:22,880 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 17:23:22,880 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-10-11 17:23:22,881 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-10-11 17:23:22,881 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-10-11 17:23:22,881 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-11 17:23:22,881 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-10-11 17:23:22,882 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-10-11 17:23:22,882 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2024-10-11 17:23:22,882 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 17:23:22,882 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-11 17:23:22,882 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-10-11 17:23:22,882 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 17:23:22,882 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 17:23:22,995 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 17:23:22,998 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 17:23:23,112 INFO L? ?]: Removed 24 outVars from TransFormulas that were not future-live. [2024-10-11 17:23:23,113 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 17:23:23,153 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 17:23:23,154 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 17:23:23,154 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 05:23:23 BoogieIcfgContainer [2024-10-11 17:23:23,154 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 17:23:23,158 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 17:23:23,159 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 17:23:23,163 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 17:23:23,163 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 05:23:22" (1/3) ... [2024-10-11 17:23:23,163 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f5705ff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 05:23:23, skipping insertion in model container [2024-10-11 17:23:23,163 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:23:22" (2/3) ... [2024-10-11 17:23:23,164 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f5705ff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 05:23:23, skipping insertion in model container [2024-10-11 17:23:23,164 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 05:23:23" (3/3) ... [2024-10-11 17:23:23,165 INFO L112 eAbstractionObserver]: Analyzing ICFG bftpd_1.i [2024-10-11 17:23:23,190 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 17:23:23,190 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 17:23:23,222 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 17:23:23,226 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;@5660a5d3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 17:23:23,227 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 17:23:23,229 INFO L276 IsEmpty]: Start isEmpty. Operand has 24 states, 18 states have (on average 1.5) internal successors, (27), 19 states have internal predecessors, (27), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 17:23:23,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-10-11 17:23:23,237 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:23:23,238 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:23:23,238 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-11 17:23:23,242 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:23:23,242 INFO L85 PathProgramCache]: Analyzing trace with hash -1554353902, now seen corresponding path program 1 times [2024-10-11 17:23:23,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:23:23,248 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [543778092] [2024-10-11 17:23:23,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:23:23,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:23:23,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:23:23,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 17:23:23,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:23:23,433 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 17:23:23,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:23:23,440 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 17:23:23,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:23:23,447 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-10-11 17:23:23,447 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:23:23,447 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [543778092] [2024-10-11 17:23:23,448 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [543778092] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:23:23,448 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:23:23,448 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 17:23:23,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1701830548] [2024-10-11 17:23:23,450 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:23:23,453 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:23:23,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:23:23,472 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:23:23,472 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:23:23,474 INFO L87 Difference]: Start difference. First operand has 24 states, 18 states have (on average 1.5) internal successors, (27), 19 states have internal predecessors, (27), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-11 17:23:23,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:23:23,528 INFO L93 Difference]: Finished difference Result 26 states and 36 transitions. [2024-10-11 17:23:23,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:23:23,530 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 21 [2024-10-11 17:23:23,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:23:23,537 INFO L225 Difference]: With dead ends: 26 [2024-10-11 17:23:23,537 INFO L226 Difference]: Without dead ends: 25 [2024-10-11 17:23:23,538 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:23:23,541 INFO L432 NwaCegarLoop]: 25 mSDtfsCounter, 11 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 17:23:23,542 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 32 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 17:23:23,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2024-10-11 17:23:23,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 23. [2024-10-11 17:23:23,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 18 states have (on average 1.3888888888888888) internal successors, (25), 18 states have internal predecessors, (25), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 17:23:23,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 31 transitions. [2024-10-11 17:23:23,572 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 31 transitions. Word has length 21 [2024-10-11 17:23:23,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:23:23,572 INFO L471 AbstractCegarLoop]: Abstraction has 23 states and 31 transitions. [2024-10-11 17:23:23,572 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-11 17:23:23,572 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 31 transitions. [2024-10-11 17:23:23,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-10-11 17:23:23,574 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:23:23,574 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:23:23,574 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 17:23:23,575 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-11 17:23:23,575 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:23:23,575 INFO L85 PathProgramCache]: Analyzing trace with hash 1017768982, now seen corresponding path program 1 times [2024-10-11 17:23:23,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:23:23,576 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1658534525] [2024-10-11 17:23:23,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:23:23,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:23:23,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:23:23,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 17:23:23,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:23:23,727 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 17:23:23,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:23:23,741 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 17:23:23,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:23:23,754 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-10-11 17:23:23,755 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:23:23,755 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1658534525] [2024-10-11 17:23:23,755 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1658534525] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 17:23:23,755 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1297404715] [2024-10-11 17:23:23,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:23:23,758 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 17:23:23,758 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 17:23:23,760 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 17:23:23,762 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-11 17:23:23,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:23:23,854 INFO L255 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-11 17:23:23,859 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 17:23:23,875 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-10-11 17:23:23,875 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 17:23:23,876 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1297404715] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:23:23,876 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 17:23:23,876 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 4 [2024-10-11 17:23:23,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1780019554] [2024-10-11 17:23:23,877 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:23:23,878 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:23:23,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:23:23,879 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:23:23,880 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 17:23:23,880 INFO L87 Difference]: Start difference. First operand 23 states and 31 transitions. Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-11 17:23:23,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:23:23,900 INFO L93 Difference]: Finished difference Result 27 states and 37 transitions. [2024-10-11 17:23:23,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:23:23,901 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 21 [2024-10-11 17:23:23,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:23:23,901 INFO L225 Difference]: With dead ends: 27 [2024-10-11 17:23:23,901 INFO L226 Difference]: Without dead ends: 27 [2024-10-11 17:23:23,902 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 17:23:23,903 INFO L432 NwaCegarLoop]: 26 mSDtfsCounter, 4 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 17:23:23,903 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 49 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 17:23:23,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2024-10-11 17:23:23,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 24. [2024-10-11 17:23:23,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 19 states have (on average 1.368421052631579) internal successors, (26), 19 states have internal predecessors, (26), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 17:23:23,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 32 transitions. [2024-10-11 17:23:23,907 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 32 transitions. Word has length 21 [2024-10-11 17:23:23,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:23:23,907 INFO L471 AbstractCegarLoop]: Abstraction has 24 states and 32 transitions. [2024-10-11 17:23:23,907 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-11 17:23:23,908 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 32 transitions. [2024-10-11 17:23:23,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-10-11 17:23:23,908 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:23:23,908 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:23:23,926 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-11 17:23:24,113 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 17:23:24,115 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-11 17:23:24,115 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:23:24,115 INFO L85 PathProgramCache]: Analyzing trace with hash 450619462, now seen corresponding path program 1 times [2024-10-11 17:23:24,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:23:24,116 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [125177385] [2024-10-11 17:23:24,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:23:24,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:23:24,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:23:24,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 17:23:24,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:23:24,214 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 17:23:24,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:23:24,224 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 17:23:24,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:23:24,231 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-10-11 17:23:24,232 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:23:24,232 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [125177385] [2024-10-11 17:23:24,233 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [125177385] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 17:23:24,233 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1325582060] [2024-10-11 17:23:24,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:23:24,234 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 17:23:24,234 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 17:23:24,236 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 17:23:24,237 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-11 17:23:24,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:23:24,303 INFO L255 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-11 17:23:24,305 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 17:23:24,368 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2024-10-11 17:23:24,369 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 17:23:24,369 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1325582060] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:23:24,370 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 17:23:24,370 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 7 [2024-10-11 17:23:24,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2048378952] [2024-10-11 17:23:24,370 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:23:24,371 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 17:23:24,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:23:24,371 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 17:23:24,371 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-11 17:23:24,372 INFO L87 Difference]: Start difference. First operand 24 states and 32 transitions. Second operand has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-11 17:23:24,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:23:24,410 INFO L93 Difference]: Finished difference Result 30 states and 43 transitions. [2024-10-11 17:23:24,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 17:23:24,411 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 30 [2024-10-11 17:23:24,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:23:24,412 INFO L225 Difference]: With dead ends: 30 [2024-10-11 17:23:24,412 INFO L226 Difference]: Without dead ends: 28 [2024-10-11 17:23:24,412 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-11 17:23:24,413 INFO L432 NwaCegarLoop]: 24 mSDtfsCounter, 4 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 17:23:24,413 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 52 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 17:23:24,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2024-10-11 17:23:24,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2024-10-11 17:23:24,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 20 states have (on average 1.35) internal successors, (27), 21 states have internal predecessors, (27), 5 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (9), 5 states have call predecessors, (9), 5 states have call successors, (9) [2024-10-11 17:23:24,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 41 transitions. [2024-10-11 17:23:24,421 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 41 transitions. Word has length 30 [2024-10-11 17:23:24,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:23:24,421 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 41 transitions. [2024-10-11 17:23:24,421 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-11 17:23:24,421 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 41 transitions. [2024-10-11 17:23:24,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-10-11 17:23:24,424 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:23:24,424 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:23:24,437 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-11 17:23:24,625 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 17:23:24,625 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-11 17:23:24,626 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:23:24,626 INFO L85 PathProgramCache]: Analyzing trace with hash 1475508463, now seen corresponding path program 1 times [2024-10-11 17:23:24,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:23:24,627 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1232638629] [2024-10-11 17:23:24,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:23:24,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:23:24,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:23:24,692 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 17:23:24,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:23:24,700 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 17:23:24,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:23:24,720 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-11 17:23:24,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:23:24,725 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 5 proven. 10 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-10-11 17:23:24,725 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:23:24,726 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1232638629] [2024-10-11 17:23:24,726 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1232638629] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 17:23:24,726 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [640675243] [2024-10-11 17:23:24,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:23:24,726 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 17:23:24,726 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 17:23:24,728 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 17:23:24,729 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-11 17:23:24,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:23:24,794 INFO L255 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 17:23:24,795 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 17:23:24,812 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 18 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-10-11 17:23:24,812 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 17:23:24,838 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 5 proven. 10 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-10-11 17:23:24,839 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [640675243] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 17:23:24,839 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 17:23:24,839 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 5 [2024-10-11 17:23:24,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [158635971] [2024-10-11 17:23:24,839 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 17:23:24,839 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 17:23:24,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:23:24,840 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 17:23:24,840 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 17:23:24,840 INFO L87 Difference]: Start difference. First operand 28 states and 41 transitions. Second operand has 5 states, 5 states have (on average 6.0) internal successors, (30), 4 states have internal predecessors, (30), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-11 17:23:24,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:23:24,896 INFO L93 Difference]: Finished difference Result 32 states and 47 transitions. [2024-10-11 17:23:24,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 17:23:24,897 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 4 states have internal predecessors, (30), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 32 [2024-10-11 17:23:24,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:23:24,897 INFO L225 Difference]: With dead ends: 32 [2024-10-11 17:23:24,897 INFO L226 Difference]: Without dead ends: 32 [2024-10-11 17:23:24,898 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 69 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-10-11 17:23:24,898 INFO L432 NwaCegarLoop]: 26 mSDtfsCounter, 26 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 17:23:24,898 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 59 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 17:23:24,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2024-10-11 17:23:24,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2024-10-11 17:23:24,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 24 states have (on average 1.375) internal successors, (33), 25 states have internal predecessors, (33), 5 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (9), 5 states have call predecessors, (9), 5 states have call successors, (9) [2024-10-11 17:23:24,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 47 transitions. [2024-10-11 17:23:24,902 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 47 transitions. Word has length 32 [2024-10-11 17:23:24,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:23:24,903 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 47 transitions. [2024-10-11 17:23:24,903 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 4 states have internal predecessors, (30), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-11 17:23:24,903 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 47 transitions. [2024-10-11 17:23:24,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-10-11 17:23:24,904 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:23:24,904 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:23:24,917 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-11 17:23:25,104 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 17:23:25,105 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-11 17:23:25,105 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:23:25,105 INFO L85 PathProgramCache]: Analyzing trace with hash 2035751631, now seen corresponding path program 1 times [2024-10-11 17:23:25,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:23:25,105 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2067671681] [2024-10-11 17:23:25,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:23:25,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:23:25,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:23:25,333 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 17:23:25,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:23:25,432 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 17:23:25,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:23:25,502 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 17:23:25,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:23:25,566 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 14 proven. 8 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-11 17:23:25,566 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:23:25,566 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2067671681] [2024-10-11 17:23:25,566 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2067671681] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 17:23:25,566 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1040848132] [2024-10-11 17:23:25,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:23:25,567 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 17:23:25,567 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 17:23:25,569 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 17:23:25,570 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-11 17:23:25,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:23:25,646 INFO L255 TraceCheckSpWp]: Trace formula consists of 273 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-10-11 17:23:25,647 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 17:23:25,713 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-10-11 17:23:25,713 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 17:23:25,714 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1040848132] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:23:25,714 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 17:23:25,714 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [9] total 13 [2024-10-11 17:23:25,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1760386112] [2024-10-11 17:23:25,714 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:23:25,714 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 17:23:25,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:23:25,715 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 17:23:25,715 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2024-10-11 17:23:25,715 INFO L87 Difference]: Start difference. First operand 32 states and 47 transitions. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-11 17:23:25,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:23:25,749 INFO L93 Difference]: Finished difference Result 33 states and 48 transitions. [2024-10-11 17:23:25,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 17:23:25,750 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 36 [2024-10-11 17:23:25,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:23:25,750 INFO L225 Difference]: With dead ends: 33 [2024-10-11 17:23:25,751 INFO L226 Difference]: Without dead ends: 33 [2024-10-11 17:23:25,751 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2024-10-11 17:23:25,751 INFO L432 NwaCegarLoop]: 25 mSDtfsCounter, 32 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 17:23:25,752 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 58 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 17:23:25,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2024-10-11 17:23:25,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2024-10-11 17:23:25,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 25 states have (on average 1.36) internal successors, (34), 26 states have internal predecessors, (34), 5 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (9), 5 states have call predecessors, (9), 5 states have call successors, (9) [2024-10-11 17:23:25,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 48 transitions. [2024-10-11 17:23:25,757 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 48 transitions. Word has length 36 [2024-10-11 17:23:25,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:23:25,757 INFO L471 AbstractCegarLoop]: Abstraction has 33 states and 48 transitions. [2024-10-11 17:23:25,757 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-11 17:23:25,757 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 48 transitions. [2024-10-11 17:23:25,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-10-11 17:23:25,758 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:23:25,758 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:23:25,771 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-10-11 17:23:25,962 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 17:23:25,963 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-11 17:23:25,963 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:23:25,963 INFO L85 PathProgramCache]: Analyzing trace with hash -850061345, now seen corresponding path program 1 times [2024-10-11 17:23:25,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:23:25,963 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [788750491] [2024-10-11 17:23:25,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:23:25,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:23:25,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:23:26,001 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 17:23:26,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:23:26,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 17:23:26,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:23:26,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 17:23:26,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:23:26,029 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-10-11 17:23:26,029 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:23:26,030 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [788750491] [2024-10-11 17:23:26,030 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [788750491] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 17:23:26,030 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1064299298] [2024-10-11 17:23:26,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:23:26,030 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 17:23:26,030 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 17:23:26,031 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 17:23:26,033 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-10-11 17:23:26,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:23:26,111 INFO L255 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 17:23:26,112 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 17:23:26,115 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-10-11 17:23:26,115 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 17:23:26,115 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1064299298] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:23:26,116 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 17:23:26,116 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 4 [2024-10-11 17:23:26,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1261378517] [2024-10-11 17:23:26,116 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:23:26,117 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:23:26,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:23:26,117 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:23:26,117 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 17:23:26,117 INFO L87 Difference]: Start difference. First operand 33 states and 48 transitions. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-11 17:23:26,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:23:26,126 INFO L93 Difference]: Finished difference Result 33 states and 47 transitions. [2024-10-11 17:23:26,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:23:26,126 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 36 [2024-10-11 17:23:26,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:23:26,127 INFO L225 Difference]: With dead ends: 33 [2024-10-11 17:23:26,127 INFO L226 Difference]: Without dead ends: 33 [2024-10-11 17:23:26,127 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 17:23:26,128 INFO L432 NwaCegarLoop]: 27 mSDtfsCounter, 3 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 17:23:26,128 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 50 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 17:23:26,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2024-10-11 17:23:26,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2024-10-11 17:23:26,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 25 states have (on average 1.32) internal successors, (33), 26 states have internal predecessors, (33), 5 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (9), 5 states have call predecessors, (9), 5 states have call successors, (9) [2024-10-11 17:23:26,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 47 transitions. [2024-10-11 17:23:26,133 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 47 transitions. Word has length 36 [2024-10-11 17:23:26,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:23:26,134 INFO L471 AbstractCegarLoop]: Abstraction has 33 states and 47 transitions. [2024-10-11 17:23:26,134 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-11 17:23:26,134 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 47 transitions. [2024-10-11 17:23:26,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-10-11 17:23:26,135 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:23:26,135 INFO L215 NwaCegarLoop]: trace histogram [5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:23:26,147 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-10-11 17:23:26,335 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 17:23:26,336 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-11 17:23:26,336 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:23:26,336 INFO L85 PathProgramCache]: Analyzing trace with hash 1261011509, now seen corresponding path program 1 times [2024-10-11 17:23:26,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:23:26,336 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2130872001] [2024-10-11 17:23:26,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:23:26,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:23:26,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:23:26,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 17:23:26,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:23:26,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 17:23:26,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:23:26,418 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 17:23:26,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:23:26,424 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2024-10-11 17:23:26,424 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:23:26,424 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2130872001] [2024-10-11 17:23:26,424 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2130872001] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 17:23:26,424 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1308755580] [2024-10-11 17:23:26,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:23:26,425 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 17:23:26,425 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 17:23:26,427 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 17:23:26,427 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-10-11 17:23:26,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:23:26,505 INFO L255 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-10-11 17:23:26,507 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 17:23:26,549 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2024-10-11 17:23:26,550 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 17:23:26,550 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1308755580] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:23:26,550 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 17:23:26,550 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 6 [2024-10-11 17:23:26,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1404184908] [2024-10-11 17:23:26,550 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:23:26,551 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 17:23:26,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:23:26,551 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 17:23:26,551 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-11 17:23:26,552 INFO L87 Difference]: Start difference. First operand 33 states and 47 transitions. Second operand has 5 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-11 17:23:26,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:23:26,601 INFO L93 Difference]: Finished difference Result 72 states and 101 transitions. [2024-10-11 17:23:26,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 17:23:26,602 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 40 [2024-10-11 17:23:26,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:23:26,603 INFO L225 Difference]: With dead ends: 72 [2024-10-11 17:23:26,603 INFO L226 Difference]: Without dead ends: 72 [2024-10-11 17:23:26,603 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-10-11 17:23:26,603 INFO L432 NwaCegarLoop]: 39 mSDtfsCounter, 47 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 112 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 17:23:26,604 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 112 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 17:23:26,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2024-10-11 17:23:26,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 60. [2024-10-11 17:23:26,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 48 states have (on average 1.2916666666666667) internal successors, (62), 50 states have internal predecessors, (62), 7 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (18), 7 states have call predecessors, (18), 7 states have call successors, (18) [2024-10-11 17:23:26,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 87 transitions. [2024-10-11 17:23:26,610 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 87 transitions. Word has length 40 [2024-10-11 17:23:26,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:23:26,610 INFO L471 AbstractCegarLoop]: Abstraction has 60 states and 87 transitions. [2024-10-11 17:23:26,611 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-11 17:23:26,611 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 87 transitions. [2024-10-11 17:23:26,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-10-11 17:23:26,612 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:23:26,612 INFO L215 NwaCegarLoop]: trace histogram [5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:23:26,624 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-10-11 17:23:26,815 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2024-10-11 17:23:26,816 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-11 17:23:26,816 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:23:26,816 INFO L85 PathProgramCache]: Analyzing trace with hash 1535771123, now seen corresponding path program 1 times [2024-10-11 17:23:26,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:23:26,816 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1970568350] [2024-10-11 17:23:26,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:23:26,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:23:26,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 17:23:26,828 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-11 17:23:26,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 17:23:26,850 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-11 17:23:26,850 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-11 17:23:26,851 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (0 of 1 remaining) [2024-10-11 17:23:26,852 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-11 17:23:26,854 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:23:26,887 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 17:23:26,891 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 05:23:26 BoogieIcfgContainer [2024-10-11 17:23:26,891 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 17:23:26,892 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 17:23:26,892 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 17:23:26,892 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 17:23:26,892 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 05:23:23" (3/4) ... [2024-10-11 17:23:26,894 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-11 17:23:26,894 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 17:23:26,895 INFO L158 Benchmark]: Toolchain (without parser) took 4531.16ms. Allocated memory was 163.6MB in the beginning and 218.1MB in the end (delta: 54.5MB). Free memory was 107.1MB in the beginning and 59.7MB in the end (delta: 47.4MB). Peak memory consumption was 104.8MB. Max. memory is 16.1GB. [2024-10-11 17:23:26,895 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 163.6MB. Free memory is still 125.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 17:23:26,895 INFO L158 Benchmark]: CACSL2BoogieTranslator took 380.77ms. Allocated memory is still 163.6MB. Free memory was 107.1MB in the beginning and 84.5MB in the end (delta: 22.6MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2024-10-11 17:23:26,895 INFO L158 Benchmark]: Boogie Procedure Inliner took 36.66ms. Allocated memory is still 163.6MB. Free memory was 84.5MB in the beginning and 82.3MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 17:23:26,896 INFO L158 Benchmark]: Boogie Preprocessor took 29.01ms. Allocated memory is still 163.6MB. Free memory was 82.3MB in the beginning and 80.3MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 17:23:26,896 INFO L158 Benchmark]: RCFGBuilder took 337.30ms. Allocated memory is still 163.6MB. Free memory was 79.9MB in the beginning and 131.5MB in the end (delta: -51.7MB). Peak memory consumption was 22.9MB. Max. memory is 16.1GB. [2024-10-11 17:23:26,896 INFO L158 Benchmark]: TraceAbstraction took 3732.70ms. Allocated memory was 163.6MB in the beginning and 218.1MB in the end (delta: 54.5MB). Free memory was 130.8MB in the beginning and 59.7MB in the end (delta: 71.1MB). Peak memory consumption was 126.0MB. Max. memory is 16.1GB. [2024-10-11 17:23:26,896 INFO L158 Benchmark]: Witness Printer took 2.95ms. Allocated memory is still 218.1MB. Free memory is still 59.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 17:23:26,897 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17ms. Allocated memory is still 163.6MB. Free memory is still 125.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 380.77ms. Allocated memory is still 163.6MB. Free memory was 107.1MB in the beginning and 84.5MB in the end (delta: 22.6MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 36.66ms. Allocated memory is still 163.6MB. Free memory was 84.5MB in the beginning and 82.3MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 29.01ms. Allocated memory is still 163.6MB. Free memory was 82.3MB in the beginning and 80.3MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 337.30ms. Allocated memory is still 163.6MB. Free memory was 79.9MB in the beginning and 131.5MB in the end (delta: -51.7MB). Peak memory consumption was 22.9MB. Max. memory is 16.1GB. * TraceAbstraction took 3732.70ms. Allocated memory was 163.6MB in the beginning and 218.1MB in the end (delta: 54.5MB). Free memory was 130.8MB in the beginning and 59.7MB in the end (delta: 71.1MB). Peak memory consumption was 126.0MB. Max. memory is 16.1GB. * Witness Printer took 2.95ms. Allocated memory is still 218.1MB. Free memory is still 59.7MB. 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: 722]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of strcmp at line 693. Possible FailurePath: [L685] int state = STATE_1; [L686] char *global = 0; [L687-L690] const struct command commands[] = { {"c1",c1,STATE_1}, {"c2",c2,STATE_2} }; [L687-L690] const struct command commands[] = { {"c1",c1,STATE_1}, {"c2",c2,STATE_2} }; [L687-L690] const struct command commands[] = { {"c1",c1,STATE_1}, {"c2",c2,STATE_2} }; [L687-L690] const struct command commands[] = { {"c1",c1,STATE_1}, {"c2",c2,STATE_2} }; [L687-L690] const struct command commands[] = { {"c1",c1,STATE_1}, {"c2",c2,STATE_2} }; [L687-L690] const struct command commands[] = { {"c1",c1,STATE_1}, {"c2",c2,STATE_2} }; [L687-L690] const struct command commands[] = { {"c1",c1,STATE_1}, {"c2",c2,STATE_2} }; [L723] CALL parse_input("c1") VAL [\old(state)=0, commands={6:0}, global={0:0}, state=0] [L692] int i = 0; VAL [\old(input)={3:0}, \old(state)=0, commands={6:0}, global={0:0}, i=0, state=0] [L692] COND TRUE i < 2 [L693] EXPR commands[i].name VAL [\old(input)={3:0}, \old(state)=0, commands={6:0}, global={0:0}, i=0, state=0] [L693] COND TRUE strcmp(commands[i].name,input) == 0 [L694] EXPR commands[i].state_needed VAL [\old(input)={3:0}, \old(state)=0, commands={6:0}, global={0:0}, i=0, state=0] [L694] COND TRUE state >= commands[i].state_needed [L695] EXPR commands[i].function [L695] CALL commands[i].function() [L702] char *x = (char *)malloc(sizeof(char)); [L703] COND FALSE !(!x) VAL [\old(state)=0, commands={6:0}, global={0:0}, state=0, x={-3:0}] [L706] COND FALSE !(\read(*global)) VAL [\old(state)=0, commands={6:0}, global={0:0}, state=0, x={-3:0}] [L709] global = x [L710] state = STATE_2 VAL [\old(state)=0, commands={6:0}, global={-3:0}, state=1] [L695] RET commands[i].function() [L723] RET parse_input("c1") VAL [commands={6:0}, global={-3:0}, state=1] [L724] CALL parse_input("c1") VAL [\old(state)=1, commands={6:0}, global={-3:0}, state=1] [L692] int i = 0; VAL [\old(input)={4:0}, \old(state)=1, commands={6:0}, global={-3:0}, i=0, state=1] [L692] COND TRUE i < 2 [L693] EXPR commands[i].name VAL [\old(input)={4:0}, \old(state)=1, commands={6:0}, global={-3:0}, i=0, state=1] [L693] COND FALSE !(strcmp(commands[i].name,input) == 0) [L692] i++ VAL [\old(input)={4:0}, \old(state)=1, commands={6:0}, global={-3:0}, i=1, state=1] [L692] COND TRUE i < 2 [L693] EXPR commands[i].name VAL [\old(input)={4:0}, \old(state)=1, commands={6:0}, global={-3:0}, i=1, state=1] [L693] COND FALSE !(strcmp(commands[i].name,input) == 0) [L692] i++ VAL [\old(input)={4:0}, \old(state)=1, commands={6:0}, global={-3:0}, i=2, state=1] [L692] COND FALSE !(i < 2) VAL [\old(input)={4:0}, \old(state)=1, commands={6:0}, global={-3:0}, state=1] [L724] RET parse_input("c1") VAL [commands={6:0}, global={-3:0}, state=1] [L725] CALL parse_input("c2") VAL [\old(state)=1, commands={6:0}, global={-3:0}, state=1] [L692] int i = 0; VAL [\old(input)={5:0}, \old(state)=1, commands={6:0}, global={-3:0}, i=0, state=1] [L692] COND TRUE i < 2 [L693] EXPR commands[i].name VAL [\old(input)={5:0}, \old(state)=1, commands={6:0}, global={-3:0}, i=0, state=1] [L693] COND FALSE !(strcmp(commands[i].name,input) == 0) [L692] i++ VAL [\old(input)={5:0}, \old(state)=1, commands={6:0}, global={-3:0}, i=1, state=1] [L692] COND TRUE i < 2 [L693] EXPR commands[i].name VAL [\old(input)={5:0}, \old(state)=1, commands={6:0}, global={-3:0}, i=1, state=1] [L693] COND FALSE !(strcmp(commands[i].name,input) == 0) [L692] i++ VAL [\old(input)={5:0}, \old(state)=1, commands={6:0}, global={-3:0}, i=2, state=1] [L692] COND FALSE !(i < 2) VAL [\old(input)={5:0}, \old(state)=1, commands={6:0}, global={-3:0}, state=1] [L725] RET parse_input("c2") VAL [commands={6:0}, global={-3:0}, state=1] [L726] return 0; VAL [\result=0, commands={6:0}, global={-3:0}, state=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 24 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.6s, OverallIterations: 8, TraceHistogramMax: 5, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 127 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 127 mSDsluCounter, 412 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 220 mSDsCounter, 16 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 169 IncrementalHoareTripleChecker+Invalid, 185 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 16 mSolverCounterUnsat, 192 mSDtfsCounter, 169 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 298 GetRequests, 263 SyntacticMatches, 2 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=60occurred in iteration=7, InterpolantAutomatonStates: 30, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 7 MinimizatonAttempts, 17 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 451 NumberOfCodeBlocks, 451 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 429 ConstructedInterpolants, 0 QuantifiedInterpolants, 1444 SizeOfPredicates, 2 NumberOfNonLiveVariables, 1437 ConjunctsInSsa, 41 ConjunctsInUnsatCore, 14 InterpolantComputations, 6 PerfectInterpolantSequences, 317/397 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-10-11 17:23:26,923 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety-bftpd/bftpd_1.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-memcleanup) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 10f5db0b7f76a0d4c4c35217e21dd4a594e7457adb3230ac21a302fd5d7ee15c --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 17:23:28,666 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 17:23:28,723 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Bitvector.epf [2024-10-11 17:23:28,729 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 17:23:28,729 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 17:23:28,751 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 17:23:28,752 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 17:23:28,752 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 17:23:28,752 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 17:23:28,753 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 17:23:28,753 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 17:23:28,753 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 17:23:28,754 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 17:23:28,754 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 17:23:28,754 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 17:23:28,754 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 17:23:28,755 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 17:23:28,755 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 17:23:28,755 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 17:23:28,756 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 17:23:28,756 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 17:23:28,756 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 17:23:28,756 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-11 17:23:28,757 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-11 17:23:28,757 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 17:23:28,757 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 17:23:28,757 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-11 17:23:28,758 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-11 17:23:28,758 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 17:23:28,758 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-11 17:23:28,758 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-11 17:23:28,759 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 17:23:28,759 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 17:23:28,759 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 17:23:28,759 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 17:23:28,760 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 17:23:28,760 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 17:23:28,760 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 17:23:28,760 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 17:23:28,760 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 17:23:28,761 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 17:23:28,762 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-11 17:23:28,762 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-11 17:23:28,762 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 17:23:28,763 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 17:23:28,763 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 17:23:28,763 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 17:23:28,763 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-11 17:23:28,764 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-memcleanup) ) 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 -> 10f5db0b7f76a0d4c4c35217e21dd4a594e7457adb3230ac21a302fd5d7ee15c [2024-10-11 17:23:28,994 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 17:23:29,012 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 17:23:29,015 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 17:23:29,015 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 17:23:29,016 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 17:23:29,019 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety-bftpd/bftpd_1.i [2024-10-11 17:23:30,241 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 17:23:30,440 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 17:23:30,440 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety-bftpd/bftpd_1.i [2024-10-11 17:23:30,450 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/a993d2c5f/db31af809cf64e699fee5ae31b3379c6/FLAG172742267 [2024-10-11 17:23:30,817 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/a993d2c5f/db31af809cf64e699fee5ae31b3379c6 [2024-10-11 17:23:30,819 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 17:23:30,820 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 17:23:30,821 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 17:23:30,822 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 17:23:30,825 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 17:23:30,826 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 05:23:30" (1/1) ... [2024-10-11 17:23:30,827 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@405f6f27 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:23:30, skipping insertion in model container [2024-10-11 17:23:30,828 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 05:23:30" (1/1) ... [2024-10-11 17:23:30,880 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 17:23:31,158 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 17:23:31,173 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 17:23:31,223 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 17:23:31,267 INFO L204 MainTranslator]: Completed translation [2024-10-11 17:23:31,268 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:23:31 WrapperNode [2024-10-11 17:23:31,268 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 17:23:31,268 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 17:23:31,269 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 17:23:31,269 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 17:23:31,274 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:23:31" (1/1) ... [2024-10-11 17:23:31,293 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:23:31" (1/1) ... [2024-10-11 17:23:31,312 INFO L138 Inliner]: procedures = 169, calls = 43, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 84 [2024-10-11 17:23:31,312 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 17:23:31,313 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 17:23:31,313 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 17:23:31,314 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 17:23:31,321 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:23:31" (1/1) ... [2024-10-11 17:23:31,321 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:23:31" (1/1) ... [2024-10-11 17:23:31,323 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:23:31" (1/1) ... [2024-10-11 17:23:31,344 INFO L175 MemorySlicer]: Split 24 memory accesses to 3 slices as follows [6, 9, 9]. 38 percent of accesses are in the largest equivalence class. The 21 initializations are split as follows [6, 6, 9]. The 0 writes are split as follows [0, 0, 0]. [2024-10-11 17:23:31,344 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:23:31" (1/1) ... [2024-10-11 17:23:31,344 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:23:31" (1/1) ... [2024-10-11 17:23:31,351 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:23:31" (1/1) ... [2024-10-11 17:23:31,355 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:23:31" (1/1) ... [2024-10-11 17:23:31,356 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:23:31" (1/1) ... [2024-10-11 17:23:31,360 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:23:31" (1/1) ... [2024-10-11 17:23:31,362 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 17:23:31,366 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 17:23:31,366 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 17:23:31,366 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 17:23:31,366 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:23:31" (1/1) ... [2024-10-11 17:23:31,372 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 17:23:31,379 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 17:23:31,391 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 17:23:31,396 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 17:23:31,425 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-10-11 17:23:31,425 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-10-11 17:23:31,425 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2024-10-11 17:23:31,425 INFO L130 BoogieDeclarations]: Found specification of procedure parse_input [2024-10-11 17:23:31,426 INFO L138 BoogieDeclarations]: Found implementation of procedure parse_input [2024-10-11 17:23:31,426 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-11 17:23:31,426 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 17:23:31,426 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-10-11 17:23:31,426 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-10-11 17:23:31,426 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-10-11 17:23:31,426 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-11 17:23:31,426 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-10-11 17:23:31,426 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-10-11 17:23:31,426 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2024-10-11 17:23:31,426 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-11 17:23:31,426 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-10-11 17:23:31,429 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-10-11 17:23:31,430 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 17:23:31,430 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 17:23:31,533 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 17:23:31,535 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 17:23:31,710 INFO L? ?]: Removed 24 outVars from TransFormulas that were not future-live. [2024-10-11 17:23:31,710 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 17:23:31,746 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 17:23:31,746 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 17:23:31,747 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 05:23:31 BoogieIcfgContainer [2024-10-11 17:23:31,747 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 17:23:31,748 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 17:23:31,749 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 17:23:31,751 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 17:23:31,752 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 05:23:30" (1/3) ... [2024-10-11 17:23:31,752 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e07bb96 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 05:23:31, skipping insertion in model container [2024-10-11 17:23:31,752 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:23:31" (2/3) ... [2024-10-11 17:23:31,752 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e07bb96 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 05:23:31, skipping insertion in model container [2024-10-11 17:23:31,753 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 05:23:31" (3/3) ... [2024-10-11 17:23:31,754 INFO L112 eAbstractionObserver]: Analyzing ICFG bftpd_1.i [2024-10-11 17:23:31,767 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 17:23:31,768 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 17:23:31,807 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 17:23:31,813 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;@7413b325, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 17:23:31,813 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 17:23:31,819 INFO L276 IsEmpty]: Start isEmpty. Operand has 24 states, 18 states have (on average 1.5) internal successors, (27), 19 states have internal predecessors, (27), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 17:23:31,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-10-11 17:23:31,826 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:23:31,827 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:23:31,827 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-11 17:23:31,830 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:23:31,831 INFO L85 PathProgramCache]: Analyzing trace with hash -1554353902, now seen corresponding path program 1 times [2024-10-11 17:23:31,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 17:23:31,851 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [566325956] [2024-10-11 17:23:31,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:23:31,852 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 17:23:31,852 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 17:23:31,876 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 17:23:31,878 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-10-11 17:23:31,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:23:31,976 INFO L255 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-11 17:23:31,979 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 17:23:31,999 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-10-11 17:23:31,999 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 17:23:32,000 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 17:23:32,001 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [566325956] [2024-10-11 17:23:32,001 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [566325956] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:23:32,001 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:23:32,001 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:23:32,003 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1012315479] [2024-10-11 17:23:32,003 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:23:32,006 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 17:23:32,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 17:23:32,032 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 17:23:32,033 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 17:23:32,035 INFO L87 Difference]: Start difference. First operand has 24 states, 18 states have (on average 1.5) internal successors, (27), 19 states have internal predecessors, (27), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-11 17:23:32,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:23:32,054 INFO L93 Difference]: Finished difference Result 24 states and 32 transitions. [2024-10-11 17:23:32,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 17:23:32,056 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 21 [2024-10-11 17:23:32,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:23:32,061 INFO L225 Difference]: With dead ends: 24 [2024-10-11 17:23:32,061 INFO L226 Difference]: Without dead ends: 23 [2024-10-11 17:23:32,062 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 17:23:32,065 INFO L432 NwaCegarLoop]: 30 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 17:23:32,065 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 30 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 17:23:32,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2024-10-11 17:23:32,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2024-10-11 17:23:32,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 18 states have (on average 1.3888888888888888) internal successors, (25), 18 states have internal predecessors, (25), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 17:23:32,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 31 transitions. [2024-10-11 17:23:32,090 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 31 transitions. Word has length 21 [2024-10-11 17:23:32,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:23:32,090 INFO L471 AbstractCegarLoop]: Abstraction has 23 states and 31 transitions. [2024-10-11 17:23:32,090 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-11 17:23:32,091 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 31 transitions. [2024-10-11 17:23:32,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-10-11 17:23:32,093 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:23:32,093 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:23:32,098 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-10-11 17:23:32,293 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 17:23:32,294 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-11 17:23:32,294 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:23:32,294 INFO L85 PathProgramCache]: Analyzing trace with hash 1017768982, now seen corresponding path program 1 times [2024-10-11 17:23:32,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 17:23:32,295 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [61910443] [2024-10-11 17:23:32,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:23:32,295 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 17:23:32,295 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 17:23:32,297 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 17:23:32,298 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-10-11 17:23:32,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:23:32,370 INFO L255 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-11 17:23:32,371 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 17:23:32,394 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-10-11 17:23:32,394 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 17:23:32,394 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 17:23:32,394 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [61910443] [2024-10-11 17:23:32,395 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [61910443] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:23:32,395 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:23:32,395 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 17:23:32,395 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2088390987] [2024-10-11 17:23:32,395 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:23:32,396 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:23:32,396 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 17:23:32,396 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:23:32,397 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:23:32,397 INFO L87 Difference]: Start difference. First operand 23 states and 31 transitions. Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-11 17:23:32,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:23:32,425 INFO L93 Difference]: Finished difference Result 27 states and 37 transitions. [2024-10-11 17:23:32,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:23:32,426 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 21 [2024-10-11 17:23:32,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:23:32,426 INFO L225 Difference]: With dead ends: 27 [2024-10-11 17:23:32,426 INFO L226 Difference]: Without dead ends: 27 [2024-10-11 17:23:32,426 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:23:32,427 INFO L432 NwaCegarLoop]: 26 mSDtfsCounter, 4 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 17:23:32,427 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 49 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 17:23:32,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2024-10-11 17:23:32,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 24. [2024-10-11 17:23:32,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 19 states have (on average 1.368421052631579) internal successors, (26), 19 states have internal predecessors, (26), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 17:23:32,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 32 transitions. [2024-10-11 17:23:32,436 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 32 transitions. Word has length 21 [2024-10-11 17:23:32,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:23:32,436 INFO L471 AbstractCegarLoop]: Abstraction has 24 states and 32 transitions. [2024-10-11 17:23:32,437 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-11 17:23:32,437 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 32 transitions. [2024-10-11 17:23:32,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-10-11 17:23:32,438 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:23:32,439 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:23:32,443 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-10-11 17:23:32,640 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 17:23:32,641 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-11 17:23:32,641 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:23:32,641 INFO L85 PathProgramCache]: Analyzing trace with hash 450619462, now seen corresponding path program 1 times [2024-10-11 17:23:32,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 17:23:32,642 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [457494089] [2024-10-11 17:23:32,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:23:32,642 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 17:23:32,642 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 17:23:32,644 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 17:23:32,645 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-10-11 17:23:32,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:23:32,704 INFO L255 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 17:23:32,705 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 17:23:32,731 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 14 proven. 1 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-10-11 17:23:32,732 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 17:23:32,777 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-10-11 17:23:32,778 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 17:23:32,778 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [457494089] [2024-10-11 17:23:32,778 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [457494089] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 17:23:32,778 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 17:23:32,778 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2024-10-11 17:23:32,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [172037367] [2024-10-11 17:23:32,778 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 17:23:32,779 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 17:23:32,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 17:23:32,779 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 17:23:32,780 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-10-11 17:23:32,780 INFO L87 Difference]: Start difference. First operand 24 states and 32 transitions. Second operand has 6 states, 6 states have (on average 4.5) internal successors, (27), 6 states have internal predecessors, (27), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 17:23:32,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:23:32,836 INFO L93 Difference]: Finished difference Result 31 states and 43 transitions. [2024-10-11 17:23:32,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 17:23:32,837 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 6 states have internal predecessors, (27), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) Word has length 30 [2024-10-11 17:23:32,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:23:32,838 INFO L225 Difference]: With dead ends: 31 [2024-10-11 17:23:32,838 INFO L226 Difference]: Without dead ends: 31 [2024-10-11 17:23:32,838 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-10-11 17:23:32,840 INFO L432 NwaCegarLoop]: 28 mSDtfsCounter, 13 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 17:23:32,841 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 95 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 17:23:32,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2024-10-11 17:23:32,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 28. [2024-10-11 17:23:32,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 23 states have (on average 1.391304347826087) internal successors, (32), 23 states have internal predecessors, (32), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 17:23:32,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 38 transitions. [2024-10-11 17:23:32,846 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 38 transitions. Word has length 30 [2024-10-11 17:23:32,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:23:32,847 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 38 transitions. [2024-10-11 17:23:32,847 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 6 states have internal predecessors, (27), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 17:23:32,847 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 38 transitions. [2024-10-11 17:23:32,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-10-11 17:23:32,848 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:23:32,848 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:23:32,851 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-10-11 17:23:33,048 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 17:23:33,048 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-11 17:23:33,049 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:23:33,049 INFO L85 PathProgramCache]: Analyzing trace with hash 2035751631, now seen corresponding path program 1 times [2024-10-11 17:23:33,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 17:23:33,049 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1859057980] [2024-10-11 17:23:33,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:23:33,050 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 17:23:33,050 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 17:23:33,052 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 17:23:33,053 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-10-11 17:23:33,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:23:33,150 INFO L255 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-11 17:23:33,153 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 17:23:33,237 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-10-11 17:23:33,238 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 17:23:33,238 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 17:23:33,238 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1859057980] [2024-10-11 17:23:33,238 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1859057980] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:23:33,238 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:23:33,238 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 17:23:33,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2055365429] [2024-10-11 17:23:33,239 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:23:33,239 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 17:23:33,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 17:23:33,240 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 17:23:33,240 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 17:23:33,240 INFO L87 Difference]: Start difference. First operand 28 states and 38 transitions. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-11 17:23:33,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:23:33,294 INFO L93 Difference]: Finished difference Result 29 states and 39 transitions. [2024-10-11 17:23:33,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 17:23:33,295 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 36 [2024-10-11 17:23:33,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:23:33,295 INFO L225 Difference]: With dead ends: 29 [2024-10-11 17:23:33,295 INFO L226 Difference]: Without dead ends: 29 [2024-10-11 17:23:33,295 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 17:23:33,296 INFO L432 NwaCegarLoop]: 25 mSDtfsCounter, 32 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 17:23:33,297 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 58 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 17:23:33,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2024-10-11 17:23:33,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2024-10-11 17:23:33,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 24 states have (on average 1.375) internal successors, (33), 24 states have internal predecessors, (33), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 17:23:33,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 39 transitions. [2024-10-11 17:23:33,300 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 39 transitions. Word has length 36 [2024-10-11 17:23:33,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:23:33,301 INFO L471 AbstractCegarLoop]: Abstraction has 29 states and 39 transitions. [2024-10-11 17:23:33,301 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-11 17:23:33,301 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 39 transitions. [2024-10-11 17:23:33,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-10-11 17:23:33,302 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:23:33,302 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:23:33,306 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-10-11 17:23:33,502 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 17:23:33,502 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-11 17:23:33,503 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:23:33,503 INFO L85 PathProgramCache]: Analyzing trace with hash -850061345, now seen corresponding path program 1 times [2024-10-11 17:23:33,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 17:23:33,503 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [263752944] [2024-10-11 17:23:33,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:23:33,504 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 17:23:33,504 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 17:23:33,506 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 17:23:33,507 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-10-11 17:23:33,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:23:33,592 INFO L255 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-11 17:23:33,594 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 17:23:33,599 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-10-11 17:23:33,600 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 17:23:33,600 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 17:23:33,600 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [263752944] [2024-10-11 17:23:33,600 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [263752944] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:23:33,600 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:23:33,600 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 17:23:33,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [137333754] [2024-10-11 17:23:33,600 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:23:33,600 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:23:33,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 17:23:33,601 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:23:33,601 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:23:33,601 INFO L87 Difference]: Start difference. First operand 29 states and 39 transitions. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-11 17:23:33,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:23:33,610 INFO L93 Difference]: Finished difference Result 29 states and 38 transitions. [2024-10-11 17:23:33,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:23:33,611 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 36 [2024-10-11 17:23:33,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:23:33,611 INFO L225 Difference]: With dead ends: 29 [2024-10-11 17:23:33,611 INFO L226 Difference]: Without dead ends: 29 [2024-10-11 17:23:33,611 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:23:33,612 INFO L432 NwaCegarLoop]: 27 mSDtfsCounter, 3 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 17:23:33,615 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 50 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 17:23:33,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2024-10-11 17:23:33,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2024-10-11 17:23:33,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 24 states have (on average 1.3333333333333333) internal successors, (32), 24 states have internal predecessors, (32), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 17:23:33,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 38 transitions. [2024-10-11 17:23:33,619 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 38 transitions. Word has length 36 [2024-10-11 17:23:33,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:23:33,619 INFO L471 AbstractCegarLoop]: Abstraction has 29 states and 38 transitions. [2024-10-11 17:23:33,619 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-11 17:23:33,619 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 38 transitions. [2024-10-11 17:23:33,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-10-11 17:23:33,620 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:23:33,620 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:23:33,624 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2024-10-11 17:23:33,823 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 17:23:33,824 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-11 17:23:33,824 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:23:33,824 INFO L85 PathProgramCache]: Analyzing trace with hash -1140276714, now seen corresponding path program 2 times [2024-10-11 17:23:33,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 17:23:33,825 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [615853103] [2024-10-11 17:23:33,825 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-11 17:23:33,825 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 17:23:33,825 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 17:23:33,826 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 17:23:33,827 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-10-11 17:23:33,900 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-11 17:23:33,900 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 17:23:33,902 INFO L255 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-11 17:23:33,904 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 17:23:33,967 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2024-10-11 17:23:33,967 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 17:23:33,967 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 17:23:33,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [615853103] [2024-10-11 17:23:33,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [615853103] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:23:33,968 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:23:33,968 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:23:33,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [201353646] [2024-10-11 17:23:33,968 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:23:33,968 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 17:23:33,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 17:23:33,968 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 17:23:33,969 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 17:23:33,969 INFO L87 Difference]: Start difference. First operand 29 states and 38 transitions. Second operand has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-11 17:23:34,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:23:34,004 INFO L93 Difference]: Finished difference Result 35 states and 49 transitions. [2024-10-11 17:23:34,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 17:23:34,004 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 39 [2024-10-11 17:23:34,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:23:34,006 INFO L225 Difference]: With dead ends: 35 [2024-10-11 17:23:34,006 INFO L226 Difference]: Without dead ends: 33 [2024-10-11 17:23:34,006 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 17:23:34,007 INFO L432 NwaCegarLoop]: 23 mSDtfsCounter, 4 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 17:23:34,007 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 49 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 17:23:34,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2024-10-11 17:23:34,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2024-10-11 17:23:34,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 25 states have (on average 1.32) internal successors, (33), 26 states have internal predecessors, (33), 5 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (9), 5 states have call predecessors, (9), 5 states have call successors, (9) [2024-10-11 17:23:34,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 47 transitions. [2024-10-11 17:23:34,016 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 47 transitions. Word has length 39 [2024-10-11 17:23:34,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:23:34,016 INFO L471 AbstractCegarLoop]: Abstraction has 33 states and 47 transitions. [2024-10-11 17:23:34,016 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-11 17:23:34,016 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 47 transitions. [2024-10-11 17:23:34,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-10-11 17:23:34,017 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:23:34,017 INFO L215 NwaCegarLoop]: trace histogram [5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:23:34,024 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2024-10-11 17:23:34,223 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 17:23:34,223 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-11 17:23:34,224 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:23:34,224 INFO L85 PathProgramCache]: Analyzing trace with hash 1261011509, now seen corresponding path program 1 times [2024-10-11 17:23:34,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 17:23:34,224 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [653642343] [2024-10-11 17:23:34,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:23:34,224 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 17:23:34,224 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 17:23:34,226 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 17:23:34,227 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2024-10-11 17:23:34,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:23:34,287 INFO L255 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-11 17:23:34,289 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 17:23:34,382 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2024-10-11 17:23:34,382 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 17:23:34,382 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 17:23:34,382 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [653642343] [2024-10-11 17:23:34,382 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [653642343] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:23:34,383 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:23:34,383 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 17:23:34,383 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2038166466] [2024-10-11 17:23:34,383 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:23:34,383 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 17:23:34,383 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 17:23:34,384 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 17:23:34,384 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 17:23:34,384 INFO L87 Difference]: Start difference. First operand 33 states and 47 transitions. Second operand has 5 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-11 17:23:34,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:23:34,452 INFO L93 Difference]: Finished difference Result 72 states and 101 transitions. [2024-10-11 17:23:34,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 17:23:34,453 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 40 [2024-10-11 17:23:34,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:23:34,454 INFO L225 Difference]: With dead ends: 72 [2024-10-11 17:23:34,454 INFO L226 Difference]: Without dead ends: 72 [2024-10-11 17:23:34,455 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-11 17:23:34,455 INFO L432 NwaCegarLoop]: 39 mSDtfsCounter, 47 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 112 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 17:23:34,455 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 112 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 17:23:34,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2024-10-11 17:23:34,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 60. [2024-10-11 17:23:34,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 48 states have (on average 1.2916666666666667) internal successors, (62), 50 states have internal predecessors, (62), 7 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (18), 7 states have call predecessors, (18), 7 states have call successors, (18) [2024-10-11 17:23:34,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 87 transitions. [2024-10-11 17:23:34,471 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 87 transitions. Word has length 40 [2024-10-11 17:23:34,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:23:34,472 INFO L471 AbstractCegarLoop]: Abstraction has 60 states and 87 transitions. [2024-10-11 17:23:34,472 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-11 17:23:34,472 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 87 transitions. [2024-10-11 17:23:34,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-10-11 17:23:34,474 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:23:34,474 INFO L215 NwaCegarLoop]: trace histogram [5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:23:34,479 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2024-10-11 17:23:34,674 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 17:23:34,676 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-11 17:23:34,676 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:23:34,676 INFO L85 PathProgramCache]: Analyzing trace with hash 1535771123, now seen corresponding path program 1 times [2024-10-11 17:23:34,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 17:23:34,676 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1121724050] [2024-10-11 17:23:34,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:23:34,677 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 17:23:34,677 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 17:23:34,679 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 17:23:34,680 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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 (9)] Waiting until timeout for monitored process [2024-10-11 17:23:34,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 17:23:34,758 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-11 17:23:34,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 17:23:34,845 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2024-10-11 17:23:34,845 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-11 17:23:34,846 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (0 of 1 remaining) [2024-10-11 17:23:34,856 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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 (9)] Forceful destruction successful, exit code 0 [2024-10-11 17:23:35,048 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 17:23:35,054 INFO L407 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1] [2024-10-11 17:23:35,084 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 17:23:35,087 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 05:23:35 BoogieIcfgContainer [2024-10-11 17:23:35,088 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 17:23:35,088 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 17:23:35,088 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 17:23:35,088 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 17:23:35,089 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 05:23:31" (3/4) ... [2024-10-11 17:23:35,090 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-11 17:23:35,091 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 17:23:35,091 INFO L158 Benchmark]: Toolchain (without parser) took 4271.52ms. Allocated memory was 65.0MB in the beginning and 96.5MB in the end (delta: 31.5MB). Free memory was 32.0MB in the beginning and 68.1MB in the end (delta: -36.1MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 17:23:35,091 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 52.4MB. Free memory is still 35.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 17:23:35,092 INFO L158 Benchmark]: CACSL2BoogieTranslator took 446.51ms. Allocated memory is still 65.0MB. Free memory was 31.8MB in the beginning and 40.7MB in the end (delta: -8.9MB). Peak memory consumption was 7.9MB. Max. memory is 16.1GB. [2024-10-11 17:23:35,093 INFO L158 Benchmark]: Boogie Procedure Inliner took 44.12ms. Allocated memory is still 65.0MB. Free memory was 40.7MB in the beginning and 38.6MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 17:23:35,093 INFO L158 Benchmark]: Boogie Preprocessor took 52.04ms. Allocated memory is still 65.0MB. Free memory was 38.6MB in the beginning and 36.0MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 17:23:35,093 INFO L158 Benchmark]: RCFGBuilder took 381.46ms. Allocated memory is still 65.0MB. Free memory was 36.0MB in the beginning and 31.1MB in the end (delta: 4.9MB). Peak memory consumption was 12.8MB. Max. memory is 16.1GB. [2024-10-11 17:23:35,093 INFO L158 Benchmark]: TraceAbstraction took 3339.54ms. Allocated memory was 65.0MB in the beginning and 96.5MB in the end (delta: 31.5MB). Free memory was 30.4MB in the beginning and 68.8MB in the end (delta: -38.4MB). Peak memory consumption was 26.5MB. Max. memory is 16.1GB. [2024-10-11 17:23:35,095 INFO L158 Benchmark]: Witness Printer took 2.75ms. Allocated memory is still 96.5MB. Free memory was 68.8MB in the beginning and 68.1MB in the end (delta: 716.2kB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 17:23:35,096 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.14ms. Allocated memory is still 52.4MB. Free memory is still 35.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 446.51ms. Allocated memory is still 65.0MB. Free memory was 31.8MB in the beginning and 40.7MB in the end (delta: -8.9MB). Peak memory consumption was 7.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 44.12ms. Allocated memory is still 65.0MB. Free memory was 40.7MB in the beginning and 38.6MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 52.04ms. Allocated memory is still 65.0MB. Free memory was 38.6MB in the beginning and 36.0MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 381.46ms. Allocated memory is still 65.0MB. Free memory was 36.0MB in the beginning and 31.1MB in the end (delta: 4.9MB). Peak memory consumption was 12.8MB. Max. memory is 16.1GB. * TraceAbstraction took 3339.54ms. Allocated memory was 65.0MB in the beginning and 96.5MB in the end (delta: 31.5MB). Free memory was 30.4MB in the beginning and 68.8MB in the end (delta: -38.4MB). Peak memory consumption was 26.5MB. Max. memory is 16.1GB. * Witness Printer took 2.75ms. Allocated memory is still 96.5MB. Free memory was 68.8MB in the beginning and 68.1MB in the end (delta: 716.2kB). 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: 722]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of strcmp at line 693. Possible FailurePath: [L685] int state = STATE_1; [L686] char *global = 0; [L687-L690] const struct command commands[] = { {"c1",c1,STATE_1}, {"c2",c2,STATE_2} }; [L687-L690] const struct command commands[] = { {"c1",c1,STATE_1}, {"c2",c2,STATE_2} }; [L687-L690] const struct command commands[] = { {"c1",c1,STATE_1}, {"c2",c2,STATE_2} }; [L687-L690] const struct command commands[] = { {"c1",c1,STATE_1}, {"c2",c2,STATE_2} }; [L687-L690] const struct command commands[] = { {"c1",c1,STATE_1}, {"c2",c2,STATE_2} }; [L687-L690] const struct command commands[] = { {"c1",c1,STATE_1}, {"c2",c2,STATE_2} }; [L687-L690] const struct command commands[] = { {"c1",c1,STATE_1}, {"c2",c2,STATE_2} }; [L723] CALL parse_input("c1") VAL [\old(state)=0, commands={6:0}, global={0:0}, state=0] [L692] int i = 0; VAL [\old(input)={3:0}, \old(state)=0, commands={6:0}, global={0:0}, i=0, state=0] [L692] COND TRUE i < 2 [L693] EXPR commands[i].name VAL [\old(input)={3:0}, \old(state)=0, commands={6:0}, global={0:0}, i=0, state=0] [L693] COND TRUE strcmp(commands[i].name,input) == 0 [L694] EXPR commands[i].state_needed VAL [\old(input)={3:0}, \old(state)=0, commands={6:0}, global={0:0}, i=0, state=0] [L694] COND TRUE state >= commands[i].state_needed [L695] EXPR commands[i].function [L695] CALL commands[i].function() [L702] char *x = (char *)malloc(sizeof(char)); [L703] COND FALSE !(!x) VAL [\old(state)=0, commands={6:0}, global={0:0}, state=0, x={7:0}] [L706] COND FALSE !(\read(*global)) VAL [\old(state)=0, commands={6:0}, global={0:0}, state=0, x={7:0}] [L709] global = x [L710] state = STATE_2 VAL [\old(state)=0, commands={6:0}, global={7:0}, state=1] [L695] RET commands[i].function() [L723] RET parse_input("c1") VAL [commands={6:0}, global={7:0}, state=1] [L724] CALL parse_input("c1") VAL [\old(state)=1, commands={6:0}, global={7:0}, state=1] [L692] int i = 0; VAL [\old(input)={4:0}, \old(state)=1, commands={6:0}, global={7:0}, i=0, state=1] [L692] COND TRUE i < 2 [L693] EXPR commands[i].name VAL [\old(input)={4:0}, \old(state)=1, commands={6:0}, global={7:0}, i=0, state=1] [L693] COND FALSE !(strcmp(commands[i].name,input) == 0) [L692] i++ VAL [\old(input)={4:0}, \old(state)=1, commands={6:0}, global={7:0}, i=1, state=1] [L692] COND TRUE i < 2 [L693] EXPR commands[i].name VAL [\old(input)={4:0}, \old(state)=1, commands={6:0}, global={7:0}, i=1, state=1] [L693] COND FALSE !(strcmp(commands[i].name,input) == 0) [L692] i++ VAL [\old(input)={4:0}, \old(state)=1, commands={6:0}, global={7:0}, i=2, state=1] [L692] COND FALSE !(i < 2) VAL [\old(input)={4:0}, \old(state)=1, commands={6:0}, global={7:0}, state=1] [L724] RET parse_input("c1") VAL [commands={6:0}, global={7:0}, state=1] [L725] CALL parse_input("c2") VAL [\old(state)=1, commands={6:0}, global={7:0}, state=1] [L692] int i = 0; VAL [\old(input)={5:0}, \old(state)=1, commands={6:0}, global={7:0}, i=0, state=1] [L692] COND TRUE i < 2 [L693] EXPR commands[i].name VAL [\old(input)={5:0}, \old(state)=1, commands={6:0}, global={7:0}, i=0, state=1] [L693] COND FALSE !(strcmp(commands[i].name,input) == 0) [L692] i++ VAL [\old(input)={5:0}, \old(state)=1, commands={6:0}, global={7:0}, i=1, state=1] [L692] COND TRUE i < 2 [L693] EXPR commands[i].name VAL [\old(input)={5:0}, \old(state)=1, commands={6:0}, global={7:0}, i=1, state=1] [L693] COND FALSE !(strcmp(commands[i].name,input) == 0) [L692] i++ VAL [\old(input)={5:0}, \old(state)=1, commands={6:0}, global={7:0}, i=2, state=1] [L692] COND FALSE !(i < 2) VAL [\old(input)={5:0}, \old(state)=1, commands={6:0}, global={7:0}, state=1] [L725] RET parse_input("c2") VAL [commands={6:0}, global={7:0}, state=1] [L726] return 0; VAL [\result=0, commands={6:0}, global={7:0}, state=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 24 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.3s, OverallIterations: 8, TraceHistogramMax: 6, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 0.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 103 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 103 mSDsluCounter, 443 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 245 mSDsCounter, 13 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 153 IncrementalHoareTripleChecker+Invalid, 166 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 13 mSolverCounterUnsat, 198 mSDtfsCounter, 153 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 247 GetRequests, 231 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=60occurred in iteration=7, InterpolantAutomatonStates: 29, 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, 7 MinimizatonAttempts, 18 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 263 NumberOfCodeBlocks, 263 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 245 ConstructedInterpolants, 0 QuantifiedInterpolants, 512 SizeOfPredicates, 2 NumberOfNonLiveVariables, 954 ConjunctsInSsa, 29 ConjunctsInUnsatCore, 8 InterpolantComputations, 6 PerfectInterpolantSequences, 261/281 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-10-11 17:23:35,118 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample