./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/loops/array-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 3061b6dc 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/loops/array-1.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 229f3e8ce4e3b13e76b58dc42b5f9a4638bd79f9f3aa927499d1d902ea457152 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-19 07:04:46,701 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 07:04:46,778 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-19 07:04:46,782 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 07:04:46,784 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 07:04:46,815 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 07:04:46,816 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 07:04:46,816 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 07:04:46,818 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 07:04:46,820 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 07:04:46,820 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 07:04:46,821 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 07:04:46,821 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 07:04:46,824 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 07:04:46,825 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 07:04:46,825 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 07:04:46,826 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 07:04:46,826 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 07:04:46,826 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 07:04:46,826 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 07:04:46,827 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-19 07:04:46,827 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-19 07:04:46,827 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-19 07:04:46,828 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 07:04:46,828 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-19 07:04:46,828 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 07:04:46,829 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-19 07:04:46,829 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 07:04:46,829 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 07:04:46,829 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 07:04:46,830 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 07:04:46,830 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 07:04:46,831 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 07:04:46,831 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 07:04:46,832 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 07:04:46,832 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 07:04:46,832 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-19 07:04:46,832 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-19 07:04:46,833 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 07:04:46,833 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 07:04:46,833 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 07:04:46,835 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 07:04:46,835 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 -> 229f3e8ce4e3b13e76b58dc42b5f9a4638bd79f9f3aa927499d1d902ea457152 [2024-11-19 07:04:47,073 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 07:04:47,099 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 07:04:47,102 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 07:04:47,104 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 07:04:47,104 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 07:04:47,106 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/loops/array-1.c [2024-11-19 07:04:48,590 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 07:04:48,785 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 07:04:48,786 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loops/array-1.c [2024-11-19 07:04:48,792 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/86b5371ce/b3e01a3374614a318b1e96f76839cc9b/FLAGa53a9be0b [2024-11-19 07:04:48,806 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/86b5371ce/b3e01a3374614a318b1e96f76839cc9b [2024-11-19 07:04:48,809 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 07:04:48,810 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 07:04:48,814 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 07:04:48,814 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 07:04:48,819 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 07:04:48,820 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 07:04:48" (1/1) ... [2024-11-19 07:04:48,821 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6275357d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:04:48, skipping insertion in model container [2024-11-19 07:04:48,822 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 07:04:48" (1/1) ... [2024-11-19 07:04:48,842 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 07:04:49,045 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 07:04:49,053 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 07:04:49,068 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 07:04:49,085 INFO L204 MainTranslator]: Completed translation [2024-11-19 07:04:49,085 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:04:49 WrapperNode [2024-11-19 07:04:49,085 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 07:04:49,086 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 07:04:49,087 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 07:04:49,087 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 07:04:49,095 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:04:49" (1/1) ... [2024-11-19 07:04:49,105 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:04:49" (1/1) ... [2024-11-19 07:04:49,121 INFO L138 Inliner]: procedures = 14, calls = 16, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 52 [2024-11-19 07:04:49,122 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 07:04:49,122 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 07:04:49,122 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 07:04:49,123 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 07:04:49,133 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:04:49" (1/1) ... [2024-11-19 07:04:49,133 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:04:49" (1/1) ... [2024-11-19 07:04:49,135 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:04:49" (1/1) ... [2024-11-19 07:04:49,149 INFO L175 MemorySlicer]: Split 6 memory accesses to 2 slices as follows [2, 4]. 67 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 1 writes are split as follows [0, 1]. [2024-11-19 07:04:49,150 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:04:49" (1/1) ... [2024-11-19 07:04:49,150 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:04:49" (1/1) ... [2024-11-19 07:04:49,155 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:04:49" (1/1) ... [2024-11-19 07:04:49,159 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:04:49" (1/1) ... [2024-11-19 07:04:49,164 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:04:49" (1/1) ... [2024-11-19 07:04:49,165 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:04:49" (1/1) ... [2024-11-19 07:04:49,169 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 07:04:49,170 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 07:04:49,171 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 07:04:49,171 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 07:04:49,172 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:04:49" (1/1) ... [2024-11-19 07:04:49,179 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 07:04:49,192 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 07:04:49,213 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-19 07:04:49,220 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-19 07:04:49,270 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 07:04:49,270 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-19 07:04:49,271 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-19 07:04:49,271 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-19 07:04:49,271 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-19 07:04:49,271 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-19 07:04:49,272 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 07:04:49,272 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 07:04:49,272 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-19 07:04:49,272 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-19 07:04:49,272 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-19 07:04:49,359 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 07:04:49,362 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 07:04:49,597 INFO L? ?]: Removed 30 outVars from TransFormulas that were not future-live. [2024-11-19 07:04:49,597 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 07:04:49,615 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 07:04:49,615 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-19 07:04:49,616 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:04:49 BoogieIcfgContainer [2024-11-19 07:04:49,616 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 07:04:49,618 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 07:04:49,618 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 07:04:49,622 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 07:04:49,622 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 07:04:48" (1/3) ... [2024-11-19 07:04:49,623 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@13503e6b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 07:04:49, skipping insertion in model container [2024-11-19 07:04:49,623 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:04:49" (2/3) ... [2024-11-19 07:04:49,624 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@13503e6b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 07:04:49, skipping insertion in model container [2024-11-19 07:04:49,625 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:04:49" (3/3) ... [2024-11-19 07:04:49,627 INFO L112 eAbstractionObserver]: Analyzing ICFG array-1.c [2024-11-19 07:04:49,645 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 07:04:49,646 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 10 error locations. [2024-11-19 07:04:49,694 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 07:04:49,700 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;@34594bb2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 07:04:49,701 INFO L334 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2024-11-19 07:04:49,705 INFO L276 IsEmpty]: Start isEmpty. Operand has 30 states, 19 states have (on average 1.736842105263158) internal successors, (33), 29 states have internal predecessors, (33), 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-19 07:04:49,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-11-19 07:04:49,710 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 07:04:49,710 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-11-19 07:04:49,711 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2024-11-19 07:04:49,717 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 07:04:49,718 INFO L85 PathProgramCache]: Analyzing trace with hash 925724, now seen corresponding path program 1 times [2024-11-19 07:04:49,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 07:04:49,728 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1744322934] [2024-11-19 07:04:49,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 07:04:49,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 07:04:49,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 07:04:49,987 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-19 07:04:49,988 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 07:04:49,988 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1744322934] [2024-11-19 07:04:49,988 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1744322934] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 07:04:49,989 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 07:04:49,989 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 07:04:49,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [240938584] [2024-11-19 07:04:49,991 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 07:04:49,995 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 07:04:49,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 07:04:50,021 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 07:04:50,022 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 07:04:50,024 INFO L87 Difference]: Start difference. First operand has 30 states, 19 states have (on average 1.736842105263158) internal successors, (33), 29 states have internal predecessors, (33), 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 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 07:04:50,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 07:04:50,087 INFO L93 Difference]: Finished difference Result 25 states and 26 transitions. [2024-11-19 07:04:50,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 07:04:50,091 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2024-11-19 07:04:50,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 07:04:50,097 INFO L225 Difference]: With dead ends: 25 [2024-11-19 07:04:50,097 INFO L226 Difference]: Without dead ends: 23 [2024-11-19 07:04:50,099 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-19 07:04:50,102 INFO L432 NwaCegarLoop]: 17 mSDtfsCounter, 15 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 07:04:50,104 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 18 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 07:04:50,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2024-11-19 07:04:50,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2024-11-19 07:04:50,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 17 states have (on average 1.411764705882353) internal successors, (24), 22 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-19 07:04:50,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 24 transitions. [2024-11-19 07:04:50,131 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 24 transitions. Word has length 4 [2024-11-19 07:04:50,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 07:04:50,132 INFO L471 AbstractCegarLoop]: Abstraction has 23 states and 24 transitions. [2024-11-19 07:04:50,132 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 07:04:50,132 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 24 transitions. [2024-11-19 07:04:50,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-11-19 07:04:50,133 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 07:04:50,133 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-11-19 07:04:50,133 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-19 07:04:50,134 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2024-11-19 07:04:50,134 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 07:04:50,135 INFO L85 PathProgramCache]: Analyzing trace with hash 925725, now seen corresponding path program 1 times [2024-11-19 07:04:50,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 07:04:50,135 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [601951897] [2024-11-19 07:04:50,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 07:04:50,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 07:04:50,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 07:04:50,359 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-19 07:04:50,361 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 07:04:50,361 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [601951897] [2024-11-19 07:04:50,362 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [601951897] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 07:04:50,362 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 07:04:50,362 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 07:04:50,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1993936127] [2024-11-19 07:04:50,390 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 07:04:50,391 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 07:04:50,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 07:04:50,393 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 07:04:50,395 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-19 07:04:50,396 INFO L87 Difference]: Start difference. First operand 23 states and 24 transitions. Second operand has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 07:04:50,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 07:04:50,481 INFO L93 Difference]: Finished difference Result 22 states and 23 transitions. [2024-11-19 07:04:50,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 07:04:50,482 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2024-11-19 07:04:50,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 07:04:50,482 INFO L225 Difference]: With dead ends: 22 [2024-11-19 07:04:50,483 INFO L226 Difference]: Without dead ends: 22 [2024-11-19 07:04:50,483 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-19 07:04:50,484 INFO L432 NwaCegarLoop]: 14 mSDtfsCounter, 9 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 07:04:50,485 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 26 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 07:04:50,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2024-11-19 07:04:50,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2024-11-19 07:04:50,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 21 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 07:04:50,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 23 transitions. [2024-11-19 07:04:50,491 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 23 transitions. Word has length 4 [2024-11-19 07:04:50,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 07:04:50,492 INFO L471 AbstractCegarLoop]: Abstraction has 22 states and 23 transitions. [2024-11-19 07:04:50,492 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 07:04:50,493 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 23 transitions. [2024-11-19 07:04:50,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-11-19 07:04:50,493 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 07:04:50,493 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-11-19 07:04:50,494 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-19 07:04:50,494 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2024-11-19 07:04:50,494 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 07:04:50,496 INFO L85 PathProgramCache]: Analyzing trace with hash 925766, now seen corresponding path program 1 times [2024-11-19 07:04:50,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 07:04:50,497 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1329914963] [2024-11-19 07:04:50,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 07:04:50,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 07:04:50,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 07:04:50,735 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 07:04:50,736 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 07:04:50,736 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1329914963] [2024-11-19 07:04:50,736 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1329914963] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 07:04:50,736 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 07:04:50,736 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 07:04:50,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [684671985] [2024-11-19 07:04:50,737 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 07:04:50,737 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 07:04:50,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 07:04:50,739 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 07:04:50,739 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-19 07:04:50,739 INFO L87 Difference]: Start difference. First operand 22 states and 23 transitions. Second operand has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 07:04:50,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 07:04:50,790 INFO L93 Difference]: Finished difference Result 30 states and 32 transitions. [2024-11-19 07:04:50,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 07:04:50,790 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2024-11-19 07:04:50,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 07:04:50,792 INFO L225 Difference]: With dead ends: 30 [2024-11-19 07:04:50,792 INFO L226 Difference]: Without dead ends: 30 [2024-11-19 07:04:50,793 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-19 07:04:50,794 INFO L432 NwaCegarLoop]: 18 mSDtfsCounter, 15 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 07:04:50,795 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 28 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 07:04:50,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2024-11-19 07:04:50,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 28. [2024-11-19 07:04:50,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 27 states have internal predecessors, (30), 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-19 07:04:50,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 30 transitions. [2024-11-19 07:04:50,800 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 30 transitions. Word has length 4 [2024-11-19 07:04:50,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 07:04:50,800 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 30 transitions. [2024-11-19 07:04:50,800 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 07:04:50,800 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 30 transitions. [2024-11-19 07:04:50,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-19 07:04:50,801 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 07:04:50,801 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 07:04:50,801 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-19 07:04:50,801 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2024-11-19 07:04:50,802 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 07:04:50,802 INFO L85 PathProgramCache]: Analyzing trace with hash 719409802, now seen corresponding path program 1 times [2024-11-19 07:04:50,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 07:04:50,802 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [881047617] [2024-11-19 07:04:50,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 07:04:50,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 07:04:50,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 07:04:51,020 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 07:04:51,021 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 07:04:51,021 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [881047617] [2024-11-19 07:04:51,022 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [881047617] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 07:04:51,022 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [370685645] [2024-11-19 07:04:51,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 07:04:51,023 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 07:04:51,023 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 07:04:51,025 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 07:04:51,026 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-19 07:04:51,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 07:04:51,090 INFO L255 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-19 07:04:51,095 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 07:04:51,182 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 07:04:51,182 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 07:04:51,256 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 07:04:51,257 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [370685645] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 07:04:51,257 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 07:04:51,258 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 9 [2024-11-19 07:04:51,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1292724946] [2024-11-19 07:04:51,260 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 07:04:51,260 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-19 07:04:51,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 07:04:51,261 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-19 07:04:51,262 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-19 07:04:51,263 INFO L87 Difference]: Start difference. First operand 28 states and 30 transitions. Second operand has 9 states, 9 states have (on average 3.0) internal successors, (27), 9 states have internal predecessors, (27), 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-19 07:04:51,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 07:04:51,335 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2024-11-19 07:04:51,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 07:04:51,335 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.0) internal successors, (27), 9 states have internal predecessors, (27), 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 10 [2024-11-19 07:04:51,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 07:04:51,337 INFO L225 Difference]: With dead ends: 20 [2024-11-19 07:04:51,337 INFO L226 Difference]: Without dead ends: 20 [2024-11-19 07:04:51,338 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2024-11-19 07:04:51,338 INFO L432 NwaCegarLoop]: 14 mSDtfsCounter, 17 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 07:04:51,339 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 71 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 07:04:51,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2024-11-19 07:04:51,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2024-11-19 07:04:51,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 19 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-19 07:04:51,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 20 transitions. [2024-11-19 07:04:51,343 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 20 transitions. Word has length 10 [2024-11-19 07:04:51,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 07:04:51,344 INFO L471 AbstractCegarLoop]: Abstraction has 20 states and 20 transitions. [2024-11-19 07:04:51,344 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.0) internal successors, (27), 9 states have internal predecessors, (27), 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-19 07:04:51,344 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2024-11-19 07:04:51,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-19 07:04:51,345 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 07:04:51,346 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 07:04:51,364 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-19 07:04:51,546 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 07:04:51,547 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2024-11-19 07:04:51,547 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 07:04:51,548 INFO L85 PathProgramCache]: Analyzing trace with hash 1530103683, now seen corresponding path program 1 times [2024-11-19 07:04:51,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 07:04:51,548 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1094584945] [2024-11-19 07:04:51,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 07:04:51,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 07:04:51,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 07:04:52,251 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 07:04:52,252 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 07:04:52,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1094584945] [2024-11-19 07:04:52,252 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1094584945] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 07:04:52,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1121526332] [2024-11-19 07:04:52,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 07:04:52,253 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 07:04:52,253 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 07:04:52,256 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 07:04:52,259 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-19 07:04:52,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 07:04:52,321 INFO L255 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-19 07:04:52,323 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 07:04:52,395 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 1 [2024-11-19 07:04:52,507 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2024-11-19 07:04:52,527 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 07:04:52,528 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 07:04:52,762 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 40 [2024-11-19 07:04:52,782 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 07:04:52,782 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 40 treesize of output 87 [2024-11-19 07:04:52,826 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 18 [2024-11-19 07:04:52,934 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 07:04:52,935 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1121526332] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 07:04:52,935 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 07:04:52,935 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 22 [2024-11-19 07:04:52,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1682138464] [2024-11-19 07:04:52,935 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 07:04:52,936 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-11-19 07:04:52,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 07:04:52,937 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-11-19 07:04:52,937 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=376, Unknown=0, NotChecked=0, Total=462 [2024-11-19 07:04:52,938 INFO L87 Difference]: Start difference. First operand 20 states and 20 transitions. Second operand has 22 states, 22 states have (on average 1.5909090909090908) internal successors, (35), 22 states have internal predecessors, (35), 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-19 07:04:53,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 07:04:53,089 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2024-11-19 07:04:53,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-19 07:04:53,090 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 1.5909090909090908) internal successors, (35), 22 states have internal predecessors, (35), 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 14 [2024-11-19 07:04:53,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 07:04:53,090 INFO L225 Difference]: With dead ends: 25 [2024-11-19 07:04:53,090 INFO L226 Difference]: Without dead ends: 25 [2024-11-19 07:04:53,091 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 167 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=105, Invalid=447, Unknown=0, NotChecked=0, Total=552 [2024-11-19 07:04:53,091 INFO L432 NwaCegarLoop]: 9 mSDtfsCounter, 10 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 07:04:53,092 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 70 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 07:04:53,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2024-11-19 07:04:53,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2024-11-19 07:04:53,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 23 states have (on average 1.0869565217391304) internal successors, (25), 24 states have internal predecessors, (25), 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-19 07:04:53,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2024-11-19 07:04:53,096 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 25 transitions. Word has length 14 [2024-11-19 07:04:53,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 07:04:53,096 INFO L471 AbstractCegarLoop]: Abstraction has 25 states and 25 transitions. [2024-11-19 07:04:53,097 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 1.5909090909090908) internal successors, (35), 22 states have internal predecessors, (35), 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-19 07:04:53,097 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2024-11-19 07:04:53,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-19 07:04:53,098 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 07:04:53,099 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 07:04:53,116 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-19 07:04:53,299 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 07:04:53,300 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2024-11-19 07:04:53,300 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 07:04:53,301 INFO L85 PathProgramCache]: Analyzing trace with hash 1530111660, now seen corresponding path program 1 times [2024-11-19 07:04:53,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 07:04:53,301 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1731869746] [2024-11-19 07:04:53,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 07:04:53,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 07:04:53,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 07:04:53,389 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-19 07:04:53,389 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 07:04:53,389 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1731869746] [2024-11-19 07:04:53,389 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1731869746] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 07:04:53,390 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 07:04:53,390 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 07:04:53,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [524719484] [2024-11-19 07:04:53,390 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 07:04:53,390 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 07:04:53,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 07:04:53,391 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 07:04:53,391 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 07:04:53,392 INFO L87 Difference]: Start difference. First operand 25 states and 25 transitions. Second operand has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 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-19 07:04:53,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 07:04:53,411 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2024-11-19 07:04:53,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 07:04:53,412 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 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 14 [2024-11-19 07:04:53,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 07:04:53,412 INFO L225 Difference]: With dead ends: 24 [2024-11-19 07:04:53,413 INFO L226 Difference]: Without dead ends: 17 [2024-11-19 07:04:53,413 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-19 07:04:53,413 INFO L432 NwaCegarLoop]: 14 mSDtfsCounter, 6 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 07:04:53,414 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 26 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 07:04:53,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2024-11-19 07:04:53,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2024-11-19 07:04:53,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 16 states have (on average 1.0) 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-19 07:04:53,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 16 transitions. [2024-11-19 07:04:53,419 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 16 transitions. Word has length 14 [2024-11-19 07:04:53,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 07:04:53,420 INFO L471 AbstractCegarLoop]: Abstraction has 17 states and 16 transitions. [2024-11-19 07:04:53,421 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 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-19 07:04:53,421 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 16 transitions. [2024-11-19 07:04:53,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-19 07:04:53,422 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 07:04:53,422 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 07:04:53,422 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-19 07:04:53,422 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2024-11-19 07:04:53,423 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 07:04:53,423 INFO L85 PathProgramCache]: Analyzing trace with hash 283652614, now seen corresponding path program 1 times [2024-11-19 07:04:53,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 07:04:53,423 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1636849777] [2024-11-19 07:04:53,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 07:04:53,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 07:04:53,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 07:04:53,938 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 07:04:53,938 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 07:04:53,938 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1636849777] [2024-11-19 07:04:53,939 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1636849777] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 07:04:53,939 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1444559710] [2024-11-19 07:04:53,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 07:04:53,939 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 07:04:53,939 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 07:04:53,941 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 07:04:53,943 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-19 07:04:53,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 07:04:53,994 INFO L255 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-19 07:04:53,996 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 07:04:54,035 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 1 [2024-11-19 07:04:54,130 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-11-19 07:04:54,147 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 07:04:54,148 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 07:04:54,322 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 40 [2024-11-19 07:04:54,342 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 07:04:54,343 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 40 treesize of output 87 [2024-11-19 07:04:54,389 INFO L349 Elim1Store]: treesize reduction 28, result has 17.6 percent of original size [2024-11-19 07:04:54,389 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 106 treesize of output 52 [2024-11-19 07:04:54,402 INFO L349 Elim1Store]: treesize reduction 5, result has 50.0 percent of original size [2024-11-19 07:04:54,403 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 11 [2024-11-19 07:04:54,415 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-19 07:04:54,416 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 5 [2024-11-19 07:04:54,514 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 07:04:54,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1444559710] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 07:04:54,516 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 07:04:54,516 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 9] total 21 [2024-11-19 07:04:54,517 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1351593574] [2024-11-19 07:04:54,517 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 07:04:54,517 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-11-19 07:04:54,517 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 07:04:54,518 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-11-19 07:04:54,520 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=333, Unknown=0, NotChecked=0, Total=420 [2024-11-19 07:04:54,520 INFO L87 Difference]: Start difference. First operand 17 states and 16 transitions. Second operand has 21 states, 21 states have (on average 1.8571428571428572) internal successors, (39), 21 states have internal predecessors, (39), 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-19 07:04:54,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 07:04:54,594 INFO L93 Difference]: Finished difference Result 14 states and 13 transitions. [2024-11-19 07:04:54,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-19 07:04:54,594 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 1.8571428571428572) internal successors, (39), 21 states have internal predecessors, (39), 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 16 [2024-11-19 07:04:54,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 07:04:54,595 INFO L225 Difference]: With dead ends: 14 [2024-11-19 07:04:54,595 INFO L226 Difference]: Without dead ends: 0 [2024-11-19 07:04:54,595 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 20 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 162 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=96, Invalid=366, Unknown=0, NotChecked=0, Total=462 [2024-11-19 07:04:54,596 INFO L432 NwaCegarLoop]: 4 mSDtfsCounter, 3 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 07:04:54,596 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 25 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 07:04:54,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-19 07:04:54,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-19 07:04:54,597 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-19 07:04:54,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-19 07:04:54,597 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 16 [2024-11-19 07:04:54,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 07:04:54,597 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-19 07:04:54,597 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 1.8571428571428572) internal successors, (39), 21 states have internal predecessors, (39), 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-19 07:04:54,597 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-19 07:04:54,598 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-19 07:04:54,603 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 10 remaining) [2024-11-19 07:04:54,603 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 10 remaining) [2024-11-19 07:04:54,604 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 10 remaining) [2024-11-19 07:04:54,604 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 10 remaining) [2024-11-19 07:04:54,604 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 10 remaining) [2024-11-19 07:04:54,605 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 10 remaining) [2024-11-19 07:04:54,609 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 10 remaining) [2024-11-19 07:04:54,609 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 10 remaining) [2024-11-19 07:04:54,609 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK (1 of 10 remaining) [2024-11-19 07:04:54,609 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK (0 of 10 remaining) [2024-11-19 07:04:54,627 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-19 07:04:54,810 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 07:04:54,813 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2024-11-19 07:04:54,814 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-19 07:04:54,818 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 07:04:54 BoogieIcfgContainer [2024-11-19 07:04:54,818 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-19 07:04:54,819 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-19 07:04:54,819 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-19 07:04:54,819 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-19 07:04:54,819 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:04:49" (3/4) ... [2024-11-19 07:04:54,822 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-19 07:04:54,831 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2024-11-19 07:04:54,831 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2024-11-19 07:04:54,832 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-19 07:04:54,832 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-19 07:04:54,904 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-19 07:04:54,905 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-19 07:04:54,905 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-19 07:04:54,905 INFO L158 Benchmark]: Toolchain (without parser) took 6095.07ms. Allocated memory was 161.5MB in the beginning and 209.7MB in the end (delta: 48.2MB). Free memory was 106.9MB in the beginning and 74.8MB in the end (delta: 32.1MB). Peak memory consumption was 80.9MB. Max. memory is 16.1GB. [2024-11-19 07:04:54,905 INFO L158 Benchmark]: CDTParser took 0.23ms. Allocated memory is still 161.5MB. Free memory is still 125.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 07:04:54,906 INFO L158 Benchmark]: CACSL2BoogieTranslator took 271.91ms. Allocated memory is still 161.5MB. Free memory was 106.9MB in the beginning and 94.3MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-19 07:04:54,906 INFO L158 Benchmark]: Boogie Procedure Inliner took 35.59ms. Allocated memory is still 161.5MB. Free memory was 94.3MB in the beginning and 92.9MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 07:04:54,906 INFO L158 Benchmark]: Boogie Preprocessor took 46.84ms. Allocated memory is still 161.5MB. Free memory was 92.9MB in the beginning and 91.0MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-19 07:04:54,906 INFO L158 Benchmark]: RCFGBuilder took 445.87ms. Allocated memory is still 161.5MB. Free memory was 91.0MB in the beginning and 76.9MB in the end (delta: 14.0MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-19 07:04:54,907 INFO L158 Benchmark]: TraceAbstraction took 5199.85ms. Allocated memory was 161.5MB in the beginning and 209.7MB in the end (delta: 48.2MB). Free memory was 76.3MB in the beginning and 79.0MB in the end (delta: -2.7MB). Peak memory consumption was 47.4MB. Max. memory is 16.1GB. [2024-11-19 07:04:54,907 INFO L158 Benchmark]: Witness Printer took 86.23ms. Allocated memory is still 209.7MB. Free memory was 79.0MB in the beginning and 74.8MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-19 07:04:54,908 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.23ms. Allocated memory is still 161.5MB. Free memory is still 125.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 271.91ms. Allocated memory is still 161.5MB. Free memory was 106.9MB in the beginning and 94.3MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 35.59ms. Allocated memory is still 161.5MB. Free memory was 94.3MB in the beginning and 92.9MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 46.84ms. Allocated memory is still 161.5MB. Free memory was 92.9MB in the beginning and 91.0MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 445.87ms. Allocated memory is still 161.5MB. Free memory was 91.0MB in the beginning and 76.9MB in the end (delta: 14.0MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 5199.85ms. Allocated memory was 161.5MB in the beginning and 209.7MB in the end (delta: 48.2MB). Free memory was 76.3MB in the beginning and 79.0MB in the end (delta: -2.7MB). Peak memory consumption was 47.4MB. Max. memory is 16.1GB. * Witness Printer took 86.23ms. Allocated memory is still 209.7MB. Free memory was 79.0MB in the beginning and 74.8MB 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: -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: 3]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 13]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 30 locations, 10 error locations. Started 1 CEGAR loops. OverallTime: 5.1s, OverallIterations: 7, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 75 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 75 mSDsluCounter, 264 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 174 mSDsCounter, 12 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 293 IncrementalHoareTripleChecker+Invalid, 305 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 12 mSolverCounterUnsat, 90 mSDtfsCounter, 293 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 116 GetRequests, 55 SyntacticMatches, 3 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 335 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=30occurred in iteration=0, InterpolantAutomatonStates: 37, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 7 MinimizatonAttempts, 2 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 3.3s InterpolantComputationTime, 106 NumberOfCodeBlocks, 106 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 133 ConstructedInterpolants, 0 QuantifiedInterpolants, 1568 SizeOfPredicates, 17 NumberOfNonLiveVariables, 225 ConjunctsInSsa, 33 ConjunctsInUnsatCore, 13 InterpolantComputations, 4 PerfectInterpolantSequences, 4/13 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 10 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2024-11-19 07:04:54,937 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE