./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/ldv-regression/test15.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 023d838f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/ldv-regression/test15.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 939029ab77d002766921942100a4b605c93056ce11f57a75c8adfebda75a0e43 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 15:07:13,687 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 15:07:13,796 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-10 15:07:13,802 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 15:07:13,803 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 15:07:13,822 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 15:07:13,822 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 15:07:13,823 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 15:07:13,823 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 15:07:13,824 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 15:07:13,824 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 15:07:13,824 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 15:07:13,825 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 15:07:13,825 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 15:07:13,827 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 15:07:13,828 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 15:07:13,828 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 15:07:13,828 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 15:07:13,829 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 15:07:13,829 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 15:07:13,829 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-10 15:07:13,833 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-10 15:07:13,834 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-10 15:07:13,834 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 15:07:13,834 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-10 15:07:13,834 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 15:07:13,835 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-10 15:07:13,835 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 15:07:13,835 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 15:07:13,835 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 15:07:13,835 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 15:07:13,836 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 15:07:13,836 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 15:07:13,836 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 15:07:13,837 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 15:07:13,837 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 15:07:13,840 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 15:07:13,841 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 15:07:13,841 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 15:07:13,841 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 15:07:13,841 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 15:07:13,842 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 15:07:13,842 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 939029ab77d002766921942100a4b605c93056ce11f57a75c8adfebda75a0e43 [2024-11-10 15:07:14,097 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 15:07:14,126 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 15:07:14,130 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 15:07:14,131 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 15:07:14,131 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 15:07:14,133 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-regression/test15.c [2024-11-10 15:07:15,627 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 15:07:15,786 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 15:07:15,787 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-regression/test15.c [2024-11-10 15:07:15,793 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cd7c3fd18/88b3ce39733249a19915999be7485c17/FLAGb52c1cfe8 [2024-11-10 15:07:15,804 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cd7c3fd18/88b3ce39733249a19915999be7485c17 [2024-11-10 15:07:15,806 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 15:07:15,807 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 15:07:15,808 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 15:07:15,808 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 15:07:15,812 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 15:07:15,813 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 03:07:15" (1/1) ... [2024-11-10 15:07:15,814 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@41c7019f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:07:15, skipping insertion in model container [2024-11-10 15:07:15,814 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 03:07:15" (1/1) ... [2024-11-10 15:07:15,830 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 15:07:16,001 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 15:07:16,008 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 15:07:16,020 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 15:07:16,034 INFO L204 MainTranslator]: Completed translation [2024-11-10 15:07:16,034 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:07:16 WrapperNode [2024-11-10 15:07:16,034 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 15:07:16,035 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 15:07:16,035 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 15:07:16,035 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 15:07:16,041 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:07:16" (1/1) ... [2024-11-10 15:07:16,047 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:07:16" (1/1) ... [2024-11-10 15:07:16,060 INFO L138 Inliner]: procedures = 14, calls = 22, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 49 [2024-11-10 15:07:16,061 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 15:07:16,062 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 15:07:16,062 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 15:07:16,062 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 15:07:16,071 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:07:16" (1/1) ... [2024-11-10 15:07:16,071 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:07:16" (1/1) ... [2024-11-10 15:07:16,072 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:07:16" (1/1) ... [2024-11-10 15:07:16,087 INFO L175 MemorySlicer]: Split 7 memory accesses to 3 slices as follows [2, 3, 2]. 43 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 2 writes are split as follows [0, 1, 1]. [2024-11-10 15:07:16,088 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:07:16" (1/1) ... [2024-11-10 15:07:16,088 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:07:16" (1/1) ... [2024-11-10 15:07:16,093 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:07:16" (1/1) ... [2024-11-10 15:07:16,093 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:07:16" (1/1) ... [2024-11-10 15:07:16,094 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:07:16" (1/1) ... [2024-11-10 15:07:16,095 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:07:16" (1/1) ... [2024-11-10 15:07:16,097 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 15:07:16,097 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 15:07:16,098 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 15:07:16,098 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 15:07:16,101 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:07:16" (1/1) ... [2024-11-10 15:07:16,108 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 15:07:16,120 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 15:07:16,134 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-10 15:07:16,140 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-10 15:07:16,219 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 15:07:16,219 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-10 15:07:16,219 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-10 15:07:16,219 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-10 15:07:16,220 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-10 15:07:16,220 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-10 15:07:16,220 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-10 15:07:16,220 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-10 15:07:16,220 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 15:07:16,220 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 15:07:16,220 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-10 15:07:16,221 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-10 15:07:16,221 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-10 15:07:16,221 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-10 15:07:16,285 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 15:07:16,287 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 15:07:16,429 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L12: call ULTIMATE.dealloc(main_~#a~0#1.base, main_~#a~0#1.offset);havoc main_~#a~0#1.base, main_~#a~0#1.offset;call ULTIMATE.dealloc(main_~#b~0#1.base, main_~#b~0#1.offset);havoc main_~#b~0#1.base, main_~#b~0#1.offset; [2024-11-10 15:07:16,439 INFO L? ?]: Removed 31 outVars from TransFormulas that were not future-live. [2024-11-10 15:07:16,439 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 15:07:16,451 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 15:07:16,451 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 15:07:16,452 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 03:07:16 BoogieIcfgContainer [2024-11-10 15:07:16,452 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 15:07:16,454 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 15:07:16,454 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 15:07:16,457 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 15:07:16,458 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 03:07:15" (1/3) ... [2024-11-10 15:07:16,459 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2edf5d8d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 03:07:16, skipping insertion in model container [2024-11-10 15:07:16,459 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:07:16" (2/3) ... [2024-11-10 15:07:16,459 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2edf5d8d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 03:07:16, skipping insertion in model container [2024-11-10 15:07:16,459 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 03:07:16" (3/3) ... [2024-11-10 15:07:16,460 INFO L112 eAbstractionObserver]: Analyzing ICFG test15.c [2024-11-10 15:07:16,476 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 15:07:16,477 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 12 error locations. [2024-11-10 15:07:16,514 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 15:07:16,520 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;@5a83a8d3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 15:07:16,520 INFO L334 AbstractCegarLoop]: Starting to check reachability of 12 error locations. [2024-11-10 15:07:16,525 INFO L276 IsEmpty]: Start isEmpty. Operand has 31 states, 18 states have (on average 1.7222222222222223) internal successors, (31), 30 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:07:16,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-11-10 15:07:16,531 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:07:16,532 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-11-10 15:07:16,533 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 9 more)] === [2024-11-10 15:07:16,538 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:07:16,539 INFO L85 PathProgramCache]: Analyzing trace with hash 64512, now seen corresponding path program 1 times [2024-11-10 15:07:16,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:07:16,548 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [610371802] [2024-11-10 15:07:16,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:07:16,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:07:16,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:07:16,803 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 15:07:16,806 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:07:16,807 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [610371802] [2024-11-10 15:07:16,807 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [610371802] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:07:16,808 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:07:16,808 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 15:07:16,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1710464400] [2024-11-10 15:07:16,811 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:07:16,814 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 15:07:16,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:07:16,843 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 15:07:16,844 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 15:07:16,846 INFO L87 Difference]: Start difference. First operand has 31 states, 18 states have (on average 1.7222222222222223) internal successors, (31), 30 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:07:16,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:07:16,906 INFO L93 Difference]: Finished difference Result 28 states and 27 transitions. [2024-11-10 15:07:16,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 15:07:16,909 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2024-11-10 15:07:16,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:07:16,915 INFO L225 Difference]: With dead ends: 28 [2024-11-10 15:07:16,915 INFO L226 Difference]: Without dead ends: 25 [2024-11-10 15:07:16,917 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 15:07:16,922 INFO L432 NwaCegarLoop]: 15 mSDtfsCounter, 17 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 15:07:16,923 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 17 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 15:07:16,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2024-11-10 15:07:16,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2024-11-10 15:07:16,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 15 states have (on average 1.6) internal successors, (24), 24 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:07:16,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 24 transitions. [2024-11-10 15:07:16,951 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 24 transitions. Word has length 3 [2024-11-10 15:07:16,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:07:16,952 INFO L471 AbstractCegarLoop]: Abstraction has 25 states and 24 transitions. [2024-11-10 15:07:16,952 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:07:16,953 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 24 transitions. [2024-11-10 15:07:16,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-11-10 15:07:16,953 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:07:16,953 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-11-10 15:07:16,953 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-10 15:07:16,953 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 9 more)] === [2024-11-10 15:07:16,954 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:07:16,954 INFO L85 PathProgramCache]: Analyzing trace with hash 64513, now seen corresponding path program 1 times [2024-11-10 15:07:16,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:07:16,954 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [944691768] [2024-11-10 15:07:16,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:07:16,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:07:16,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:07:17,097 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 15:07:17,098 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:07:17,098 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [944691768] [2024-11-10 15:07:17,098 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [944691768] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:07:17,098 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:07:17,098 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 15:07:17,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1375051762] [2024-11-10 15:07:17,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:07:17,100 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 15:07:17,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:07:17,101 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 15:07:17,103 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 15:07:17,104 INFO L87 Difference]: Start difference. First operand 25 states and 24 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:07:17,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:07:17,135 INFO L93 Difference]: Finished difference Result 23 states and 22 transitions. [2024-11-10 15:07:17,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 15:07:17,136 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2024-11-10 15:07:17,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:07:17,137 INFO L225 Difference]: With dead ends: 23 [2024-11-10 15:07:17,137 INFO L226 Difference]: Without dead ends: 23 [2024-11-10 15:07:17,138 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 15:07:17,139 INFO L432 NwaCegarLoop]: 13 mSDtfsCounter, 13 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 15:07:17,140 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 18 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 15:07:17,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2024-11-10 15:07:17,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2024-11-10 15:07:17,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 22 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:07:17,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 22 transitions. [2024-11-10 15:07:17,144 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 22 transitions. Word has length 3 [2024-11-10 15:07:17,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:07:17,144 INFO L471 AbstractCegarLoop]: Abstraction has 23 states and 22 transitions. [2024-11-10 15:07:17,144 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:07:17,145 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 22 transitions. [2024-11-10 15:07:17,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-10 15:07:17,145 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:07:17,145 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-10 15:07:17,145 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-10 15:07:17,146 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 9 more)] === [2024-11-10 15:07:17,146 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:07:17,146 INFO L85 PathProgramCache]: Analyzing trace with hash 61996029, now seen corresponding path program 1 times [2024-11-10 15:07:17,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:07:17,147 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [462608657] [2024-11-10 15:07:17,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:07:17,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:07:17,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:07:17,201 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 15:07:17,201 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:07:17,201 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [462608657] [2024-11-10 15:07:17,202 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [462608657] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:07:17,202 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:07:17,202 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 15:07:17,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [742805701] [2024-11-10 15:07:17,202 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:07:17,202 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 15:07:17,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:07:17,203 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 15:07:17,203 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 15:07:17,203 INFO L87 Difference]: Start difference. First operand 23 states and 22 transitions. Second operand has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:07:17,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:07:17,259 INFO L93 Difference]: Finished difference Result 22 states and 21 transitions. [2024-11-10 15:07:17,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 15:07:17,260 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2024-11-10 15:07:17,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:07:17,261 INFO L225 Difference]: With dead ends: 22 [2024-11-10 15:07:17,261 INFO L226 Difference]: Without dead ends: 22 [2024-11-10 15:07:17,262 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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-11-10 15:07:17,264 INFO L432 NwaCegarLoop]: 11 mSDtfsCounter, 15 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 15:07:17,265 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 19 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 15:07:17,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2024-11-10 15:07:17,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2024-11-10 15:07:17,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 15 states have (on average 1.4) internal successors, (21), 21 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:07:17,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 21 transitions. [2024-11-10 15:07:17,268 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 21 transitions. Word has length 5 [2024-11-10 15:07:17,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:07:17,268 INFO L471 AbstractCegarLoop]: Abstraction has 22 states and 21 transitions. [2024-11-10 15:07:17,268 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:07:17,268 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 21 transitions. [2024-11-10 15:07:17,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-10 15:07:17,269 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:07:17,269 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-10 15:07:17,269 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-10 15:07:17,270 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 9 more)] === [2024-11-10 15:07:17,271 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:07:17,271 INFO L85 PathProgramCache]: Analyzing trace with hash 61996030, now seen corresponding path program 1 times [2024-11-10 15:07:17,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:07:17,271 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [462612105] [2024-11-10 15:07:17,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:07:17,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:07:17,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:07:17,432 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 15:07:17,432 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:07:17,433 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [462612105] [2024-11-10 15:07:17,433 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [462612105] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:07:17,433 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:07:17,433 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 15:07:17,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1812947076] [2024-11-10 15:07:17,434 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:07:17,434 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 15:07:17,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:07:17,435 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 15:07:17,435 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 15:07:17,435 INFO L87 Difference]: Start difference. First operand 22 states and 21 transitions. Second operand has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:07:17,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:07:17,488 INFO L93 Difference]: Finished difference Result 21 states and 20 transitions. [2024-11-10 15:07:17,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 15:07:17,489 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2024-11-10 15:07:17,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:07:17,490 INFO L225 Difference]: With dead ends: 21 [2024-11-10 15:07:17,490 INFO L226 Difference]: Without dead ends: 21 [2024-11-10 15:07:17,490 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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-11-10 15:07:17,491 INFO L432 NwaCegarLoop]: 12 mSDtfsCounter, 10 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 15:07:17,491 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 26 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 15:07:17,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2024-11-10 15:07:17,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2024-11-10 15:07:17,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 15 states have (on average 1.3333333333333333) internal successors, (20), 20 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:07:17,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 20 transitions. [2024-11-10 15:07:17,497 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 20 transitions. Word has length 5 [2024-11-10 15:07:17,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:07:17,498 INFO L471 AbstractCegarLoop]: Abstraction has 21 states and 20 transitions. [2024-11-10 15:07:17,498 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:07:17,498 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 20 transitions. [2024-11-10 15:07:17,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-10 15:07:17,498 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:07:17,499 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-10 15:07:17,499 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-10 15:07:17,499 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 9 more)] === [2024-11-10 15:07:17,500 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:07:17,500 INFO L85 PathProgramCache]: Analyzing trace with hash 1921876893, now seen corresponding path program 1 times [2024-11-10 15:07:17,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:07:17,500 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1743115607] [2024-11-10 15:07:17,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:07:17,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:07:17,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:07:17,637 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 15:07:17,638 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:07:17,638 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1743115607] [2024-11-10 15:07:17,639 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1743115607] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:07:17,639 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:07:17,639 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 15:07:17,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1193534355] [2024-11-10 15:07:17,640 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:07:17,640 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 15:07:17,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:07:17,642 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 15:07:17,643 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-10 15:07:17,643 INFO L87 Difference]: Start difference. First operand 21 states and 20 transitions. Second operand has 5 states, 4 states have (on average 1.5) internal successors, (6), 5 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:07:17,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:07:17,694 INFO L93 Difference]: Finished difference Result 19 states and 18 transitions. [2024-11-10 15:07:17,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 15:07:17,695 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.5) internal successors, (6), 5 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2024-11-10 15:07:17,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:07:17,696 INFO L225 Difference]: With dead ends: 19 [2024-11-10 15:07:17,696 INFO L226 Difference]: Without dead ends: 19 [2024-11-10 15:07:17,696 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-10 15:07:17,697 INFO L432 NwaCegarLoop]: 9 mSDtfsCounter, 11 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 15:07:17,697 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 16 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 15:07:17,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2024-11-10 15:07:17,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2024-11-10 15:07:17,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 15 states have (on average 1.2) internal successors, (18), 18 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:07:17,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 18 transitions. [2024-11-10 15:07:17,703 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 18 transitions. Word has length 6 [2024-11-10 15:07:17,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:07:17,703 INFO L471 AbstractCegarLoop]: Abstraction has 19 states and 18 transitions. [2024-11-10 15:07:17,703 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.5) internal successors, (6), 5 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:07:17,704 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 18 transitions. [2024-11-10 15:07:17,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-10 15:07:17,704 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:07:17,704 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-10 15:07:17,705 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-10 15:07:17,705 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 9 more)] === [2024-11-10 15:07:17,706 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:07:17,706 INFO L85 PathProgramCache]: Analyzing trace with hash 1921876894, now seen corresponding path program 1 times [2024-11-10 15:07:17,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:07:17,707 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1146876617] [2024-11-10 15:07:17,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:07:17,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:07:17,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:07:17,849 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 15:07:17,850 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:07:17,850 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1146876617] [2024-11-10 15:07:17,851 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1146876617] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:07:17,851 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:07:17,851 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 15:07:17,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1296597358] [2024-11-10 15:07:17,851 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:07:17,852 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 15:07:17,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:07:17,854 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 15:07:17,855 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 15:07:17,855 INFO L87 Difference]: Start difference. First operand 19 states and 18 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:07:17,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:07:17,900 INFO L93 Difference]: Finished difference Result 17 states and 16 transitions. [2024-11-10 15:07:17,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 15:07:17,901 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2024-11-10 15:07:17,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:07:17,902 INFO L225 Difference]: With dead ends: 17 [2024-11-10 15:07:17,902 INFO L226 Difference]: Without dead ends: 17 [2024-11-10 15:07:17,903 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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-11-10 15:07:17,907 INFO L432 NwaCegarLoop]: 11 mSDtfsCounter, 5 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 15:07:17,908 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 23 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 15:07:17,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2024-11-10 15:07:17,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2024-11-10 15:07:17,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 15 states have (on average 1.0666666666666667) internal successors, (16), 16 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:07:17,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 16 transitions. [2024-11-10 15:07:17,910 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 16 transitions. Word has length 6 [2024-11-10 15:07:17,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:07:17,910 INFO L471 AbstractCegarLoop]: Abstraction has 17 states and 16 transitions. [2024-11-10 15:07:17,910 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:07:17,911 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 16 transitions. [2024-11-10 15:07:17,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-10 15:07:17,911 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:07:17,911 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:07:17,911 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-10 15:07:17,912 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 9 more)] === [2024-11-10 15:07:17,912 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:07:17,914 INFO L85 PathProgramCache]: Analyzing trace with hash 1934466004, now seen corresponding path program 1 times [2024-11-10 15:07:17,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:07:17,914 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1670776647] [2024-11-10 15:07:17,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:07:17,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:07:17,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:07:18,131 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 15:07:18,131 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:07:18,132 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1670776647] [2024-11-10 15:07:18,132 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1670776647] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:07:18,132 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:07:18,132 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-10 15:07:18,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [267921118] [2024-11-10 15:07:18,132 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:07:18,133 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-10 15:07:18,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:07:18,133 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-10 15:07:18,134 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-10 15:07:18,134 INFO L87 Difference]: Start difference. First operand 17 states and 16 transitions. Second operand has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 7 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:07:18,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:07:18,174 INFO L93 Difference]: Finished difference Result 14 states and 13 transitions. [2024-11-10 15:07:18,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-10 15:07:18,175 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 7 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2024-11-10 15:07:18,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:07:18,176 INFO L225 Difference]: With dead ends: 14 [2024-11-10 15:07:18,176 INFO L226 Difference]: Without dead ends: 14 [2024-11-10 15:07:18,176 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-10 15:07:18,177 INFO L432 NwaCegarLoop]: 8 mSDtfsCounter, 0 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 15:07:18,177 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 30 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 15:07:18,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2024-11-10 15:07:18,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2024-11-10 15:07:18,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 13 states have (on average 1.0) internal successors, (13), 13 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:07:18,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 13 transitions. [2024-11-10 15:07:18,182 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 13 transitions. Word has length 13 [2024-11-10 15:07:18,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:07:18,182 INFO L471 AbstractCegarLoop]: Abstraction has 14 states and 13 transitions. [2024-11-10 15:07:18,182 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 7 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:07:18,183 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 13 transitions. [2024-11-10 15:07:18,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-10 15:07:18,183 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:07:18,183 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:07:18,183 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-10 15:07:18,183 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 9 more)] === [2024-11-10 15:07:18,184 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:07:18,184 INFO L85 PathProgramCache]: Analyzing trace with hash 1934467734, now seen corresponding path program 1 times [2024-11-10 15:07:18,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:07:18,184 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1925113271] [2024-11-10 15:07:18,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:07:18,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:07:18,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:07:18,276 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 15:07:18,276 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:07:18,276 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1925113271] [2024-11-10 15:07:18,276 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1925113271] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:07:18,276 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:07:18,277 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 15:07:18,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1547247829] [2024-11-10 15:07:18,277 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:07:18,278 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 15:07:18,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:07:18,278 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 15:07:18,279 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 15:07:18,279 INFO L87 Difference]: Start difference. First operand 14 states and 13 transitions. Second operand has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:07:18,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:07:18,299 INFO L93 Difference]: Finished difference Result 13 states and 12 transitions. [2024-11-10 15:07:18,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 15:07:18,299 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2024-11-10 15:07:18,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:07:18,300 INFO L225 Difference]: With dead ends: 13 [2024-11-10 15:07:18,300 INFO L226 Difference]: Without dead ends: 0 [2024-11-10 15:07:18,300 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 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-11-10 15:07:18,301 INFO L432 NwaCegarLoop]: 5 mSDtfsCounter, 0 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 15:07:18,301 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 8 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 15:07:18,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-10 15:07:18,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-10 15:07:18,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:07:18,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-10 15:07:18,302 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 13 [2024-11-10 15:07:18,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:07:18,303 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-10 15:07:18,303 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:07:18,303 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-10 15:07:18,303 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-10 15:07:18,305 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (11 of 12 remaining) [2024-11-10 15:07:18,306 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (10 of 12 remaining) [2024-11-10 15:07:18,306 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 12 remaining) [2024-11-10 15:07:18,306 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 12 remaining) [2024-11-10 15:07:18,307 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 12 remaining) [2024-11-10 15:07:18,307 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 12 remaining) [2024-11-10 15:07:18,307 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 12 remaining) [2024-11-10 15:07:18,307 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 12 remaining) [2024-11-10 15:07:18,307 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 12 remaining) [2024-11-10 15:07:18,307 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 12 remaining) [2024-11-10 15:07:18,308 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 12 remaining) [2024-11-10 15:07:18,308 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 12 remaining) [2024-11-10 15:07:18,308 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-10 15:07:18,311 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:07:18,313 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-10 15:07:18,316 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 03:07:18 BoogieIcfgContainer [2024-11-10 15:07:18,317 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-10 15:07:18,317 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-10 15:07:18,317 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-10 15:07:18,318 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-10 15:07:18,321 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 03:07:16" (3/4) ... [2024-11-10 15:07:18,323 INFO L143 WitnessPrinter]: Generating witness for correct program [2024-11-10 15:07:18,330 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 19 nodes and edges [2024-11-10 15:07:18,330 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2024-11-10 15:07:18,330 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-10 15:07:18,330 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-10 15:07:18,408 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-10 15:07:18,408 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-10 15:07:18,408 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-10 15:07:18,409 INFO L158 Benchmark]: Toolchain (without parser) took 2601.41ms. Allocated memory is still 203.4MB. Free memory was 131.5MB in the beginning and 111.5MB in the end (delta: 20.0MB). Peak memory consumption was 21.5MB. Max. memory is 16.1GB. [2024-11-10 15:07:18,409 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 109.1MB. Free memory is still 68.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 15:07:18,409 INFO L158 Benchmark]: CACSL2BoogieTranslator took 226.12ms. Allocated memory is still 203.4MB. Free memory was 131.3MB in the beginning and 119.4MB in the end (delta: 11.9MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-11-10 15:07:18,410 INFO L158 Benchmark]: Boogie Procedure Inliner took 26.24ms. Allocated memory is still 203.4MB. Free memory was 119.4MB in the beginning and 117.9MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-10 15:07:18,410 INFO L158 Benchmark]: Boogie Preprocessor took 35.14ms. Allocated memory is still 203.4MB. Free memory was 117.9MB in the beginning and 116.0MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-10 15:07:18,410 INFO L158 Benchmark]: IcfgBuilder took 354.48ms. Allocated memory is still 203.4MB. Free memory was 116.0MB in the beginning and 160.5MB in the end (delta: -44.5MB). Peak memory consumption was 7.5MB. Max. memory is 16.1GB. [2024-11-10 15:07:18,411 INFO L158 Benchmark]: TraceAbstraction took 1862.72ms. Allocated memory is still 203.4MB. Free memory was 159.2MB in the beginning and 115.7MB in the end (delta: 43.5MB). Peak memory consumption was 45.4MB. Max. memory is 16.1GB. [2024-11-10 15:07:18,411 INFO L158 Benchmark]: Witness Printer took 90.83ms. Allocated memory is still 203.4MB. Free memory was 115.7MB in the beginning and 111.5MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-10 15:07:18,412 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22ms. Allocated memory is still 109.1MB. Free memory is still 68.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 226.12ms. Allocated memory is still 203.4MB. Free memory was 131.3MB in the beginning and 119.4MB in the end (delta: 11.9MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 26.24ms. Allocated memory is still 203.4MB. Free memory was 119.4MB in the beginning and 117.9MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 35.14ms. Allocated memory is still 203.4MB. Free memory was 117.9MB in the beginning and 116.0MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * IcfgBuilder took 354.48ms. Allocated memory is still 203.4MB. Free memory was 116.0MB in the beginning and 160.5MB in the end (delta: -44.5MB). Peak memory consumption was 7.5MB. Max. memory is 16.1GB. * TraceAbstraction took 1862.72ms. Allocated memory is still 203.4MB. Free memory was 159.2MB in the beginning and 115.7MB in the end (delta: 43.5MB). Peak memory consumption was 45.4MB. Max. memory is 16.1GB. * Witness Printer took 90.83ms. Allocated memory is still 203.4MB. Free memory was 115.7MB in the beginning and 111.5MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. 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 - PositiveResult [Line: 11]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 3]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 31 locations, 12 error locations. Started 1 CEGAR loops. OverallTime: 1.8s, OverallIterations: 8, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 71 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 71 mSDsluCounter, 157 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 73 mSDsCounter, 6 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 180 IncrementalHoareTripleChecker+Invalid, 186 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 6 mSolverCounterUnsat, 84 mSDtfsCounter, 180 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 31 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=31occurred in iteration=0, InterpolantAutomatonStates: 33, 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, 8 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 54 NumberOfCodeBlocks, 54 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 46 ConstructedInterpolants, 0 QuantifiedInterpolants, 334 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 12 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2024-11-10 15:07:18,442 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE