./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/valid-memsafety.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-memory-alloca/java_Break-alloca.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 4a390ef5 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-memory-alloca/java_Break-alloca.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-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 64bit --witnessprinter.graph.data.programhash 103924553f8844e2e517be0615203791d7df69423e0df1cd576bc344a47cd3cc --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 16:09:54,744 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 16:09:54,834 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Default.epf [2024-10-24 16:09:54,838 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 16:09:54,839 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 16:09:54,858 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 16:09:54,859 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 16:09:54,859 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 16:09:54,860 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 16:09:54,860 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 16:09:54,860 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 16:09:54,861 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 16:09:54,861 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 16:09:54,862 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 16:09:54,862 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 16:09:54,862 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 16:09:54,866 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-24 16:09:54,866 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 16:09:54,866 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-24 16:09:54,867 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-24 16:09:54,867 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-10-24 16:09:54,867 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 16:09:54,868 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-24 16:09:54,868 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 16:09:54,868 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-24 16:09:54,868 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 16:09:54,869 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 16:09:54,869 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 16:09:54,869 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 16:09:54,869 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 16:09:54,870 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 16:09:54,870 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 16:09:54,870 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 16:09:54,870 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-24 16:09:54,871 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-24 16:09:54,871 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 16:09:54,874 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 16:09:54,874 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 16:09:54,875 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 16:09:54,875 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 103924553f8844e2e517be0615203791d7df69423e0df1cd576bc344a47cd3cc [2024-10-24 16:09:55,124 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 16:09:55,148 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 16:09:55,152 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 16:09:55,153 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 16:09:55,154 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 16:09:55,155 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-memory-alloca/java_Break-alloca.i [2024-10-24 16:09:56,563 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 16:09:56,791 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 16:09:56,793 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-memory-alloca/java_Break-alloca.i [2024-10-24 16:09:56,807 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b78deb4bb/074fa39746ae4c34944fc87b5b401c7a/FLAG4e0b9839e [2024-10-24 16:09:56,820 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b78deb4bb/074fa39746ae4c34944fc87b5b401c7a [2024-10-24 16:09:56,822 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 16:09:56,823 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 16:09:56,825 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 16:09:56,825 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 16:09:56,829 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 16:09:56,830 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 04:09:56" (1/1) ... [2024-10-24 16:09:56,831 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@d2c9222 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:09:56, skipping insertion in model container [2024-10-24 16:09:56,831 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 04:09:56" (1/1) ... [2024-10-24 16:09:56,868 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 16:09:57,243 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 16:09:57,259 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 16:09:57,294 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 16:09:57,326 INFO L204 MainTranslator]: Completed translation [2024-10-24 16:09:57,326 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:09:57 WrapperNode [2024-10-24 16:09:57,327 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 16:09:57,328 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 16:09:57,328 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 16:09:57,328 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 16:09:57,335 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:09:57" (1/1) ... [2024-10-24 16:09:57,351 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:09:57" (1/1) ... [2024-10-24 16:09:57,370 INFO L138 Inliner]: procedures = 109, calls = 16, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 42 [2024-10-24 16:09:57,372 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 16:09:57,372 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 16:09:57,373 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 16:09:57,373 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 16:09:57,382 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:09:57" (1/1) ... [2024-10-24 16:09:57,383 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:09:57" (1/1) ... [2024-10-24 16:09:57,386 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:09:57" (1/1) ... [2024-10-24 16:09:57,406 INFO L175 MemorySlicer]: Split 8 memory accesses to 2 slices as follows [4, 4]. 50 percent of accesses are in the largest equivalence class. The 0 initializations are split as follows [0, 0]. The 4 writes are split as follows [2, 2]. [2024-10-24 16:09:57,407 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:09:57" (1/1) ... [2024-10-24 16:09:57,407 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:09:57" (1/1) ... [2024-10-24 16:09:57,414 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:09:57" (1/1) ... [2024-10-24 16:09:57,417 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:09:57" (1/1) ... [2024-10-24 16:09:57,424 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:09:57" (1/1) ... [2024-10-24 16:09:57,425 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:09:57" (1/1) ... [2024-10-24 16:09:57,426 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 16:09:57,429 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 16:09:57,429 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 16:09:57,429 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 16:09:57,430 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:09:57" (1/1) ... [2024-10-24 16:09:57,435 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 16:09:57,446 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 16:09:57,462 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-24 16:09:57,467 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-24 16:09:57,511 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-24 16:09:57,513 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-24 16:09:57,513 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-24 16:09:57,513 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-24 16:09:57,513 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-24 16:09:57,513 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-24 16:09:57,514 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 16:09:57,514 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 16:09:57,612 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 16:09:57,613 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 16:09:57,771 INFO L? ?]: Removed 36 outVars from TransFormulas that were not future-live. [2024-10-24 16:09:57,774 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 16:09:57,812 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 16:09:57,812 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-24 16:09:57,813 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 04:09:57 BoogieIcfgContainer [2024-10-24 16:09:57,813 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 16:09:57,815 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 16:09:57,815 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 16:09:57,820 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 16:09:57,820 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 04:09:56" (1/3) ... [2024-10-24 16:09:57,821 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5db16227 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 04:09:57, skipping insertion in model container [2024-10-24 16:09:57,821 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:09:57" (2/3) ... [2024-10-24 16:09:57,821 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5db16227 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 04:09:57, skipping insertion in model container [2024-10-24 16:09:57,822 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 04:09:57" (3/3) ... [2024-10-24 16:09:57,823 INFO L112 eAbstractionObserver]: Analyzing ICFG java_Break-alloca.i [2024-10-24 16:09:57,839 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 16:09:57,840 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 17 error locations. [2024-10-24 16:09:57,872 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 16:09:57,877 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;@408f9d98, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 16:09:57,877 INFO L334 AbstractCegarLoop]: Starting to check reachability of 17 error locations. [2024-10-24 16:09:57,880 INFO L276 IsEmpty]: Start isEmpty. Operand has 30 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 29 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 16:09:57,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2024-10-24 16:09:57,886 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:09:57,886 INFO L215 NwaCegarLoop]: trace histogram [1, 1] [2024-10-24 16:09:57,887 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2024-10-24 16:09:57,891 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:09:57,892 INFO L85 PathProgramCache]: Analyzing trace with hash 2608, now seen corresponding path program 1 times [2024-10-24 16:09:57,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 16:09:57,901 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1365200752] [2024-10-24 16:09:57,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:09:57,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 16:09:58,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:09:58,188 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 16:09:58,189 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 16:09:58,189 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1365200752] [2024-10-24 16:09:58,190 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1365200752] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 16:09:58,191 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 16:09:58,191 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-24 16:09:58,192 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [743614264] [2024-10-24 16:09:58,193 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 16:09:58,198 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 16:09:58,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 16:09:58,227 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 16:09:58,228 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 16:09:58,230 INFO L87 Difference]: Start difference. First operand has 30 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 29 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 16:09:58,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:09:58,296 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2024-10-24 16:09:58,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 16:09:58,298 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 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 2 [2024-10-24 16:09:58,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:09:58,305 INFO L225 Difference]: With dead ends: 26 [2024-10-24 16:09:58,306 INFO L226 Difference]: Without dead ends: 25 [2024-10-24 16:09:58,307 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 16:09:58,311 INFO L432 NwaCegarLoop]: 8 mSDtfsCounter, 18 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 16:09:58,313 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 8 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 16:09:58,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2024-10-24 16:09:58,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2024-10-24 16:09:58,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 12 states have (on average 2.0833333333333335) 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-10-24 16:09:58,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2024-10-24 16:09:58,344 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 25 transitions. Word has length 2 [2024-10-24 16:09:58,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:09:58,344 INFO L471 AbstractCegarLoop]: Abstraction has 25 states and 25 transitions. [2024-10-24 16:09:58,345 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 16:09:58,345 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2024-10-24 16:09:58,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2024-10-24 16:09:58,346 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:09:58,346 INFO L215 NwaCegarLoop]: trace histogram [1, 1] [2024-10-24 16:09:58,347 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-24 16:09:58,347 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2024-10-24 16:09:58,348 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:09:58,348 INFO L85 PathProgramCache]: Analyzing trace with hash 2609, now seen corresponding path program 1 times [2024-10-24 16:09:58,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 16:09:58,349 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1761389270] [2024-10-24 16:09:58,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:09:58,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 16:09:58,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:09:58,485 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 16:09:58,486 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 16:09:58,486 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1761389270] [2024-10-24 16:09:58,486 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1761389270] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 16:09:58,486 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 16:09:58,487 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-24 16:09:58,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1165307449] [2024-10-24 16:09:58,487 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 16:09:58,488 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 16:09:58,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 16:09:58,489 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 16:09:58,489 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 16:09:58,489 INFO L87 Difference]: Start difference. First operand 25 states and 25 transitions. Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 16:09:58,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:09:58,518 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2024-10-24 16:09:58,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 16:09:58,518 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 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 2 [2024-10-24 16:09:58,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:09:58,519 INFO L225 Difference]: With dead ends: 21 [2024-10-24 16:09:58,519 INFO L226 Difference]: Without dead ends: 21 [2024-10-24 16:09:58,519 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 16:09:58,520 INFO L432 NwaCegarLoop]: 8 mSDtfsCounter, 20 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 16:09:58,521 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 8 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 16:09:58,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2024-10-24 16:09:58,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2024-10-24 16:09:58,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 12 states have (on average 1.75) internal successors, (21), 20 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 16:09:58,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2024-10-24 16:09:58,526 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 2 [2024-10-24 16:09:58,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:09:58,527 INFO L471 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2024-10-24 16:09:58,527 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 16:09:58,527 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2024-10-24 16:09:58,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-10-24 16:09:58,528 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:09:58,528 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-10-24 16:09:58,528 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-24 16:09:58,528 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2024-10-24 16:09:58,529 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:09:58,529 INFO L85 PathProgramCache]: Analyzing trace with hash 80824, now seen corresponding path program 1 times [2024-10-24 16:09:58,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 16:09:58,530 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1880899139] [2024-10-24 16:09:58,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:09:58,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 16:09:58,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:09:58,609 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 16:09:58,609 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 16:09:58,609 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1880899139] [2024-10-24 16:09:58,609 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1880899139] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 16:09:58,609 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 16:09:58,610 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-24 16:09:58,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [181873140] [2024-10-24 16:09:58,610 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 16:09:58,610 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 16:09:58,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 16:09:58,611 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 16:09:58,611 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 16:09:58,611 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 16:09:58,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:09:58,645 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2024-10-24 16:09:58,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 16:09:58,646 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2024-10-24 16:09:58,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:09:58,646 INFO L225 Difference]: With dead ends: 17 [2024-10-24 16:09:58,646 INFO L226 Difference]: Without dead ends: 17 [2024-10-24 16:09:58,647 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 16:09:58,648 INFO L432 NwaCegarLoop]: 4 mSDtfsCounter, 9 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 4 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 16:09:58,648 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 4 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 16:09:58,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2024-10-24 16:09:58,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2024-10-24 16:09:58,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 16 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 16:09:58,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2024-10-24 16:09:58,651 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 3 [2024-10-24 16:09:58,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:09:58,652 INFO L471 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2024-10-24 16:09:58,652 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 16:09:58,652 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2024-10-24 16:09:58,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-10-24 16:09:58,653 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:09:58,653 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-10-24 16:09:58,653 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-24 16:09:58,653 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2024-10-24 16:09:58,654 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:09:58,654 INFO L85 PathProgramCache]: Analyzing trace with hash 80825, now seen corresponding path program 1 times [2024-10-24 16:09:58,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 16:09:58,655 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [735446663] [2024-10-24 16:09:58,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:09:58,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 16:09:58,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:09:58,722 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 16:09:58,722 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 16:09:58,722 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [735446663] [2024-10-24 16:09:58,723 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [735446663] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 16:09:58,723 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 16:09:58,723 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-24 16:09:58,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [949426857] [2024-10-24 16:09:58,723 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 16:09:58,724 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 16:09:58,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 16:09:58,724 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 16:09:58,724 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 16:09:58,725 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 16:09:58,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:09:58,745 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2024-10-24 16:09:58,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 16:09:58,746 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2024-10-24 16:09:58,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:09:58,746 INFO L225 Difference]: With dead ends: 13 [2024-10-24 16:09:58,746 INFO L226 Difference]: Without dead ends: 13 [2024-10-24 16:09:58,747 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 16:09:58,748 INFO L432 NwaCegarLoop]: 4 mSDtfsCounter, 9 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 5 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 16:09:58,748 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 5 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 16:09:58,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2024-10-24 16:09:58,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2024-10-24 16:09:58,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 12 states have (on average 1.0833333333333333) internal successors, (13), 12 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 16:09:58,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2024-10-24 16:09:58,751 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 3 [2024-10-24 16:09:58,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:09:58,751 INFO L471 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2024-10-24 16:09:58,751 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 16:09:58,752 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2024-10-24 16:09:58,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-10-24 16:09:58,752 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:09:58,752 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 16:09:58,752 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-24 16:09:58,753 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2024-10-24 16:09:58,753 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:09:58,753 INFO L85 PathProgramCache]: Analyzing trace with hash -1077241318, now seen corresponding path program 1 times [2024-10-24 16:09:58,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 16:09:58,754 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1896138222] [2024-10-24 16:09:58,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:09:58,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 16:09:58,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:09:58,843 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 16:09:58,855 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 16:09:58,855 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1896138222] [2024-10-24 16:09:58,855 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1896138222] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 16:09:58,855 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 16:09:58,855 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 16:09:58,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1394896127] [2024-10-24 16:09:58,856 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 16:09:58,856 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 16:09:58,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 16:09:58,857 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 16:09:58,857 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 16:09:58,857 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 16:09:58,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:09:58,898 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2024-10-24 16:09:58,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 16:09:58,898 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 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 8 [2024-10-24 16:09:58,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:09:58,899 INFO L225 Difference]: With dead ends: 18 [2024-10-24 16:09:58,899 INFO L226 Difference]: Without dead ends: 18 [2024-10-24 16:09:58,899 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-24 16:09:58,900 INFO L432 NwaCegarLoop]: 5 mSDtfsCounter, 3 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 13 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 16:09:58,900 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 13 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 16:09:58,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2024-10-24 16:09:58,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 16. [2024-10-24 16:09:58,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 15 states have (on average 1.0666666666666667) internal successors, (16), 15 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-10-24 16:09:58,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2024-10-24 16:09:58,903 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 8 [2024-10-24 16:09:58,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:09:58,904 INFO L471 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2024-10-24 16:09:58,904 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 16:09:58,904 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2024-10-24 16:09:58,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-10-24 16:09:58,904 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:09:58,904 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 16:09:58,905 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-24 16:09:58,905 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2024-10-24 16:09:58,905 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:09:58,905 INFO L85 PathProgramCache]: Analyzing trace with hash -2136886066, now seen corresponding path program 1 times [2024-10-24 16:09:58,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 16:09:58,906 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [68602423] [2024-10-24 16:09:58,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:09:58,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 16:09:58,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:09:59,094 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 16:09:59,095 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 16:09:59,095 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [68602423] [2024-10-24 16:09:59,095 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [68602423] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 16:09:59,095 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1802983925] [2024-10-24 16:09:59,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:09:59,096 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 16:09:59,096 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 16:09:59,099 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-10-24 16:09:59,100 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-10-24 16:09:59,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:09:59,177 INFO L255 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-24 16:09:59,181 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 16:09:59,235 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 15 treesize of output 1 [2024-10-24 16:09:59,286 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 36 treesize of output 13 [2024-10-24 16:09:59,310 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-10-24 16:09:59,314 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 16:09:59,315 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 16:09:59,397 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 16:09:59,397 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1802983925] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 16:09:59,398 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-24 16:09:59,398 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2024-10-24 16:09:59,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [309935164] [2024-10-24 16:09:59,398 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-24 16:09:59,398 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-24 16:09:59,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 16:09:59,402 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-24 16:09:59,403 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2024-10-24 16:09:59,403 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand has 12 states, 12 states have (on average 2.8333333333333335) internal successors, (34), 12 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 16:09:59,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:09:59,525 INFO L93 Difference]: Finished difference Result 32 states and 32 transitions. [2024-10-24 16:09:59,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-24 16:09:59,526 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.8333333333333335) internal successors, (34), 12 states have internal predecessors, (34), 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 15 [2024-10-24 16:09:59,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:09:59,526 INFO L225 Difference]: With dead ends: 32 [2024-10-24 16:09:59,527 INFO L226 Difference]: Without dead ends: 32 [2024-10-24 16:09:59,528 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=79, Invalid=193, Unknown=0, NotChecked=0, Total=272 [2024-10-24 16:09:59,528 INFO L432 NwaCegarLoop]: 5 mSDtfsCounter, 8 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 16:09:59,529 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 26 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 16:09:59,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2024-10-24 16:09:59,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 30. [2024-10-24 16:09:59,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 29 states have (on average 1.0344827586206897) internal successors, (30), 29 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-10-24 16:09:59,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 30 transitions. [2024-10-24 16:09:59,538 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 30 transitions. Word has length 15 [2024-10-24 16:09:59,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:09:59,538 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 30 transitions. [2024-10-24 16:09:59,538 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.8333333333333335) internal successors, (34), 12 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 16:09:59,538 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2024-10-24 16:09:59,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-10-24 16:09:59,539 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:09:59,539 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1] [2024-10-24 16:09:59,558 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-24 16:09:59,739 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-10-24 16:09:59,740 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2024-10-24 16:09:59,740 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:09:59,740 INFO L85 PathProgramCache]: Analyzing trace with hash -864733362, now seen corresponding path program 2 times [2024-10-24 16:09:59,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 16:09:59,741 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1032850226] [2024-10-24 16:09:59,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:09:59,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 16:09:59,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:10:00,125 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 16:10:00,126 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 16:10:00,126 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1032850226] [2024-10-24 16:10:00,126 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1032850226] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 16:10:00,126 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1611815020] [2024-10-24 16:10:00,126 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-24 16:10:00,126 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 16:10:00,127 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 16:10:00,129 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-10-24 16:10:00,130 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-10-24 16:10:00,190 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-10-24 16:10:00,190 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-24 16:10:00,191 INFO L255 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-10-24 16:10:00,193 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 16:10:00,490 WARN L873 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_main_#t~malloc3#1.base_14| Int) (|v_ULTIMATE.start_main_#t~malloc2#1.base_14| Int)) (and (= |c_#valid| (store (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_#t~malloc2#1.base_14| 0) |v_ULTIMATE.start_main_#t~malloc3#1.base_14| 0)) (= (select (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_#t~malloc2#1.base_14| 1) |v_ULTIMATE.start_main_#t~malloc3#1.base_14|) 0) (= (select |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_#t~malloc2#1.base_14|) 0))) is different from true [2024-10-24 16:10:00,491 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-10-24 16:10:00,491 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 16:10:00,492 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1611815020] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 16:10:00,492 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-24 16:10:00,492 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [12] total 14 [2024-10-24 16:10:00,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [952391036] [2024-10-24 16:10:00,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 16:10:00,493 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 16:10:00,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 16:10:00,494 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 16:10:00,494 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=117, Unknown=1, NotChecked=22, Total=182 [2024-10-24 16:10:00,494 INFO L87 Difference]: Start difference. First operand 30 states and 30 transitions. Second operand has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 16:10:00,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:10:00,517 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2024-10-24 16:10:00,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 16:10:00,518 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2024-10-24 16:10:00,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:10:00,518 INFO L225 Difference]: With dead ends: 29 [2024-10-24 16:10:00,518 INFO L226 Difference]: Without dead ends: 0 [2024-10-24 16:10:00,519 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=117, Unknown=1, NotChecked=22, Total=182 [2024-10-24 16:10:00,519 INFO L432 NwaCegarLoop]: 3 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 3 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 11 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 16:10:00,520 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 3 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 11 Unchecked, 0.0s Time] [2024-10-24 16:10:00,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-24 16:10:00,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-24 16:10:00,520 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-10-24 16:10:00,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-24 16:10:00,521 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 29 [2024-10-24 16:10:00,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:10:00,521 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-24 16:10:00,521 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 16:10:00,522 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-24 16:10:00,522 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-24 16:10:00,524 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 17 remaining) [2024-10-24 16:10:00,525 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 17 remaining) [2024-10-24 16:10:00,525 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 17 remaining) [2024-10-24 16:10:00,525 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 17 remaining) [2024-10-24 16:10:00,526 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 17 remaining) [2024-10-24 16:10:00,526 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 17 remaining) [2024-10-24 16:10:00,526 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 17 remaining) [2024-10-24 16:10:00,526 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 17 remaining) [2024-10-24 16:10:00,527 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 17 remaining) [2024-10-24 16:10:00,527 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 17 remaining) [2024-10-24 16:10:00,527 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 17 remaining) [2024-10-24 16:10:00,527 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 17 remaining) [2024-10-24 16:10:00,528 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 17 remaining) [2024-10-24 16:10:00,528 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 17 remaining) [2024-10-24 16:10:00,528 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 17 remaining) [2024-10-24 16:10:00,528 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 17 remaining) [2024-10-24 16:10:00,528 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK (0 of 17 remaining) [2024-10-24 16:10:00,547 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-24 16:10:00,729 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2024-10-24 16:10:00,732 INFO L407 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1] [2024-10-24 16:10:00,734 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-24 16:10:00,737 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.10 04:10:00 BoogieIcfgContainer [2024-10-24 16:10:00,737 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-24 16:10:00,738 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-24 16:10:00,738 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-24 16:10:00,738 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-24 16:10:00,738 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 04:09:57" (3/4) ... [2024-10-24 16:10:00,741 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-24 16:10:00,750 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 15 nodes and edges [2024-10-24 16:10:00,750 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2024-10-24 16:10:00,750 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2024-10-24 16:10:00,751 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2024-10-24 16:10:00,834 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-24 16:10:00,834 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-24 16:10:00,834 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-24 16:10:00,835 INFO L158 Benchmark]: Toolchain (without parser) took 4012.14ms. Allocated memory was 163.6MB in the beginning and 201.3MB in the end (delta: 37.7MB). Free memory was 105.9MB in the beginning and 147.5MB in the end (delta: -41.7MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 16:10:00,835 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 100.7MB. Free memory was 55.9MB in the beginning and 55.8MB in the end (delta: 92.4kB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 16:10:00,836 INFO L158 Benchmark]: CACSL2BoogieTranslator took 501.78ms. Allocated memory is still 163.6MB. Free memory was 105.9MB in the beginning and 129.5MB in the end (delta: -23.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-10-24 16:10:00,836 INFO L158 Benchmark]: Boogie Procedure Inliner took 44.14ms. Allocated memory is still 163.6MB. Free memory was 129.5MB in the beginning and 128.3MB in the end (delta: 1.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-24 16:10:00,836 INFO L158 Benchmark]: Boogie Preprocessor took 53.93ms. Allocated memory is still 163.6MB. Free memory was 128.3MB in the beginning and 126.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-24 16:10:00,837 INFO L158 Benchmark]: RCFGBuilder took 384.13ms. Allocated memory is still 163.6MB. Free memory was 126.2MB in the beginning and 110.7MB in the end (delta: 15.6MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-10-24 16:10:00,837 INFO L158 Benchmark]: TraceAbstraction took 2922.16ms. Allocated memory was 163.6MB in the beginning and 201.3MB in the end (delta: 37.7MB). Free memory was 110.7MB in the beginning and 152.5MB in the end (delta: -41.8MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 16:10:00,837 INFO L158 Benchmark]: Witness Printer took 96.77ms. Allocated memory is still 201.3MB. Free memory was 152.5MB in the beginning and 147.5MB in the end (delta: 5.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-24 16:10:00,839 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.18ms. Allocated memory is still 100.7MB. Free memory was 55.9MB in the beginning and 55.8MB in the end (delta: 92.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 501.78ms. Allocated memory is still 163.6MB. Free memory was 105.9MB in the beginning and 129.5MB in the end (delta: -23.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 44.14ms. Allocated memory is still 163.6MB. Free memory was 129.5MB in the beginning and 128.3MB in the end (delta: 1.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 53.93ms. Allocated memory is still 163.6MB. Free memory was 128.3MB in the beginning and 126.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 384.13ms. Allocated memory is still 163.6MB. Free memory was 126.2MB in the beginning and 110.7MB in the end (delta: 15.6MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 2922.16ms. Allocated memory was 163.6MB in the beginning and 201.3MB in the end (delta: 37.7MB). Free memory was 110.7MB in the beginning and 152.5MB in the end (delta: -41.8MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 96.77ms. Allocated memory is still 201.3MB. Free memory was 152.5MB in the beginning and 147.5MB in the end (delta: 5.0MB). 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: -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: 546]: 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, 17 error locations. Started 1 CEGAR loops. OverallTime: 2.9s, OverallIterations: 7, TraceHistogramMax: 4, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 0.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 67 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 67 mSDsluCounter, 67 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 11 IncrementalHoareTripleChecker+Unchecked, 30 mSDsCounter, 12 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 163 IncrementalHoareTripleChecker+Invalid, 186 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 12 mSolverCounterUnsat, 37 mSDtfsCounter, 163 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 90 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=30occurred in iteration=0, InterpolantAutomatonStates: 30, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 7 MinimizatonAttempts, 4 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 106 NumberOfCodeBlocks, 85 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 111 ConstructedInterpolants, 1 QuantifiedInterpolants, 1168 SizeOfPredicates, 5 NumberOfNonLiveVariables, 172 ConjunctsInSsa, 26 ConjunctsInUnsatCore, 10 InterpolantComputations, 6 PerfectInterpolantSequences, 30/69 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 17 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2024-10-24 16:10:00,874 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE