./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/openbsd_cbzero-alloca-1.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-memory-alloca/openbsd_cbzero-alloca-1.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-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 717baf941b5233bcdd3406dedb0f8a4ec61d7d81c585f16d362540f6a1da773f --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 17:50:55,841 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 17:50:55,910 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Default.epf [2024-10-11 17:50:55,915 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 17:50:55,916 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 17:50:55,943 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 17:50:55,944 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 17:50:55,944 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 17:50:55,945 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 17:50:55,945 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 17:50:55,946 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 17:50:55,946 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 17:50:55,947 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 17:50:55,947 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 17:50:55,949 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 17:50:55,949 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 17:50:55,949 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 17:50:55,950 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 17:50:55,950 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-11 17:50:55,950 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-11 17:50:55,950 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-10-11 17:50:55,954 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 17:50:55,954 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-11 17:50:55,955 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 17:50:55,955 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-11 17:50:55,955 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 17:50:55,955 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 17:50:55,955 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 17:50:55,955 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 17:50:55,956 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 17:50:55,956 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 17:50:55,956 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 17:50:55,956 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 17:50:55,956 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 17:50:55,956 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 17:50:55,957 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 17:50:55,957 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 17:50:55,957 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 17:50:55,957 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 17:50:55,957 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-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 -> 717baf941b5233bcdd3406dedb0f8a4ec61d7d81c585f16d362540f6a1da773f [2024-10-11 17:50:56,166 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 17:50:56,187 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 17:50:56,190 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 17:50:56,191 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 17:50:56,192 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 17:50:56,192 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-memory-alloca/openbsd_cbzero-alloca-1.i [2024-10-11 17:50:57,497 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 17:50:57,683 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 17:50:57,684 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-memory-alloca/openbsd_cbzero-alloca-1.i [2024-10-11 17:50:57,693 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/d90d66f96/186ad953614641b5aca65a4b87b689c8/FLAGe50e9c7c7 [2024-10-11 17:50:57,707 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/d90d66f96/186ad953614641b5aca65a4b87b689c8 [2024-10-11 17:50:57,709 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 17:50:57,711 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 17:50:57,712 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 17:50:57,712 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 17:50:57,717 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 17:50:57,717 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 05:50:57" (1/1) ... [2024-10-11 17:50:57,719 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4fba3d56 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:50:57, skipping insertion in model container [2024-10-11 17:50:57,720 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 05:50:57" (1/1) ... [2024-10-11 17:50:57,745 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 17:50:57,947 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 17:50:57,955 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 17:50:57,984 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 17:50:58,005 INFO L204 MainTranslator]: Completed translation [2024-10-11 17:50:58,006 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:50:58 WrapperNode [2024-10-11 17:50:58,006 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 17:50:58,007 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 17:50:58,007 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 17:50:58,008 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 17:50:58,013 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:50:58" (1/1) ... [2024-10-11 17:50:58,024 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:50:58" (1/1) ... [2024-10-11 17:50:58,038 INFO L138 Inliner]: procedures = 111, calls = 7, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 43 [2024-10-11 17:50:58,038 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 17:50:58,039 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 17:50:58,039 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 17:50:58,039 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 17:50:58,046 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:50:58" (1/1) ... [2024-10-11 17:50:58,046 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:50:58" (1/1) ... [2024-10-11 17:50:58,048 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:50:58" (1/1) ... [2024-10-11 17:50:58,058 INFO L175 MemorySlicer]: Split 1 memory accesses to 1 slices as follows [1]. 100 percent of accesses are in the largest equivalence class. The 0 initializations are split as follows [0]. The 1 writes are split as follows [1]. [2024-10-11 17:50:58,059 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:50:58" (1/1) ... [2024-10-11 17:50:58,059 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:50:58" (1/1) ... [2024-10-11 17:50:58,061 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:50:58" (1/1) ... [2024-10-11 17:50:58,065 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:50:58" (1/1) ... [2024-10-11 17:50:58,066 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:50:58" (1/1) ... [2024-10-11 17:50:58,067 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:50:58" (1/1) ... [2024-10-11 17:50:58,068 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 17:50:58,069 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 17:50:58,069 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 17:50:58,069 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 17:50:58,070 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:50:58" (1/1) ... [2024-10-11 17:50:58,074 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 17:50:58,083 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 17:50:58,099 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 17:50:58,102 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 17:50:58,136 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-11 17:50:58,136 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-11 17:50:58,136 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-11 17:50:58,136 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 17:50:58,137 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 17:50:58,211 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 17:50:58,213 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 17:50:58,298 INFO L? ?]: Removed 21 outVars from TransFormulas that were not future-live. [2024-10-11 17:50:58,298 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 17:50:58,318 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 17:50:58,318 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 17:50:58,318 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 05:50:58 BoogieIcfgContainer [2024-10-11 17:50:58,318 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 17:50:58,320 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 17:50:58,320 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 17:50:58,323 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 17:50:58,325 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 05:50:57" (1/3) ... [2024-10-11 17:50:58,325 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e281cfa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 05:50:58, skipping insertion in model container [2024-10-11 17:50:58,326 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:50:58" (2/3) ... [2024-10-11 17:50:58,326 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e281cfa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 05:50:58, skipping insertion in model container [2024-10-11 17:50:58,326 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 05:50:58" (3/3) ... [2024-10-11 17:50:58,327 INFO L112 eAbstractionObserver]: Analyzing ICFG openbsd_cbzero-alloca-1.i [2024-10-11 17:50:58,342 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 17:50:58,342 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2024-10-11 17:50:58,380 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 17:50:58,385 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;@443af072, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 17:50:58,385 INFO L334 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2024-10-11 17:50:58,388 INFO L276 IsEmpty]: Start isEmpty. Operand has 13 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 12 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-11 17:50:58,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-10-11 17:50:58,393 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:50:58,393 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-10-11 17:50:58,394 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-11 17:50:58,397 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:50:58,398 INFO L85 PathProgramCache]: Analyzing trace with hash 66653603, now seen corresponding path program 1 times [2024-10-11 17:50:58,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:50:58,417 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [292238104] [2024-10-11 17:50:58,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:50:58,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:50:58,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:50:58,603 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-11 17:50:58,604 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:50:58,604 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [292238104] [2024-10-11 17:50:58,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [292238104] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:50:58,605 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:50:58,605 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 17:50:58,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [968079067] [2024-10-11 17:50:58,607 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:50:58,610 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 17:50:58,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:50:58,631 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 17:50:58,632 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 17:50:58,633 INFO L87 Difference]: Start difference. First operand has 13 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 12 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) Second operand has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:50:58,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:50:58,683 INFO L93 Difference]: Finished difference Result 14 states and 17 transitions. [2024-10-11 17:50:58,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 17:50:58,688 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2024-10-11 17:50:58,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:50:58,695 INFO L225 Difference]: With dead ends: 14 [2024-10-11 17:50:58,695 INFO L226 Difference]: Without dead ends: 13 [2024-10-11 17:50:58,697 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-11 17:50:58,700 INFO L432 NwaCegarLoop]: 12 mSDtfsCounter, 2 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 17:50:58,702 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 28 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 17:50:58,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2024-10-11 17:50:58,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2024-10-11 17:50:58,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 10 states have (on average 1.6) internal successors, (16), 12 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-11 17:50:58,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 16 transitions. [2024-10-11 17:50:58,729 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 16 transitions. Word has length 5 [2024-10-11 17:50:58,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:50:58,730 INFO L471 AbstractCegarLoop]: Abstraction has 13 states and 16 transitions. [2024-10-11 17:50:58,730 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:50:58,730 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 16 transitions. [2024-10-11 17:50:58,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-10-11 17:50:58,731 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:50:58,731 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-10-11 17:50:58,731 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 17:50:58,731 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-11 17:50:58,732 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:50:58,732 INFO L85 PathProgramCache]: Analyzing trace with hash 66655525, now seen corresponding path program 1 times [2024-10-11 17:50:58,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:50:58,733 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [917015185] [2024-10-11 17:50:58,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:50:58,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:50:58,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:50:58,777 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-11 17:50:58,778 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:50:58,778 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [917015185] [2024-10-11 17:50:58,778 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [917015185] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:50:58,778 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:50:58,778 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-11 17:50:58,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1935227784] [2024-10-11 17:50:58,779 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:50:58,780 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:50:58,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:50:58,781 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:50:58,782 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:50:58,782 INFO L87 Difference]: Start difference. First operand 13 states and 16 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:50:58,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:50:58,794 INFO L93 Difference]: Finished difference Result 14 states and 16 transitions. [2024-10-11 17:50:58,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:50:58,795 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2024-10-11 17:50:58,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:50:58,795 INFO L225 Difference]: With dead ends: 14 [2024-10-11 17:50:58,795 INFO L226 Difference]: Without dead ends: 13 [2024-10-11 17:50:58,796 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-11 17:50:58,799 INFO L432 NwaCegarLoop]: 13 mSDtfsCounter, 2 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 17:50:58,799 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 17 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 17:50:58,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2024-10-11 17:50:58,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 12. [2024-10-11 17:50:58,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 11 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:50:58,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 14 transitions. [2024-10-11 17:50:58,803 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 14 transitions. Word has length 5 [2024-10-11 17:50:58,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:50:58,803 INFO L471 AbstractCegarLoop]: Abstraction has 12 states and 14 transitions. [2024-10-11 17:50:58,803 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:50:58,804 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 14 transitions. [2024-10-11 17:50:58,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-10-11 17:50:58,804 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:50:58,804 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:50:58,804 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 17:50:58,804 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-11 17:50:58,805 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:50:58,805 INFO L85 PathProgramCache]: Analyzing trace with hash -370350892, now seen corresponding path program 1 times [2024-10-11 17:50:58,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:50:58,806 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [20962931] [2024-10-11 17:50:58,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:50:58,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:50:58,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:50:58,985 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-11 17:50:58,985 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:50:58,986 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [20962931] [2024-10-11 17:50:58,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [20962931] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:50:58,986 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:50:58,986 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 17:50:58,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [144123058] [2024-10-11 17:50:58,986 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:50:58,986 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 17:50:58,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:50:58,987 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 17:50:58,987 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 17:50:58,987 INFO L87 Difference]: Start difference. First operand 12 states and 14 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 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-11 17:50:59,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:50:59,016 INFO L93 Difference]: Finished difference Result 11 states and 13 transitions. [2024-10-11 17:50:59,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 17:50:59,017 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 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 7 [2024-10-11 17:50:59,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:50:59,017 INFO L225 Difference]: With dead ends: 11 [2024-10-11 17:50:59,017 INFO L226 Difference]: Without dead ends: 11 [2024-10-11 17:50:59,017 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 17:50:59,018 INFO L432 NwaCegarLoop]: 8 mSDtfsCounter, 3 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 17:50:59,019 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 18 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 17:50:59,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2024-10-11 17:50:59,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2024-10-11 17:50:59,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 10 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-11 17:50:59,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 13 transitions. [2024-10-11 17:50:59,024 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 13 transitions. Word has length 7 [2024-10-11 17:50:59,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:50:59,024 INFO L471 AbstractCegarLoop]: Abstraction has 11 states and 13 transitions. [2024-10-11 17:50:59,024 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 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-11 17:50:59,024 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 13 transitions. [2024-10-11 17:50:59,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-10-11 17:50:59,025 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:50:59,025 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:50:59,025 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 17:50:59,026 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-11 17:50:59,026 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:50:59,027 INFO L85 PathProgramCache]: Analyzing trace with hash -370350891, now seen corresponding path program 1 times [2024-10-11 17:50:59,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:50:59,027 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [476695483] [2024-10-11 17:50:59,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:50:59,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:50:59,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:50:59,278 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-11 17:50:59,278 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:50:59,278 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [476695483] [2024-10-11 17:50:59,278 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [476695483] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:50:59,278 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:50:59,278 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 17:50:59,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [417994455] [2024-10-11 17:50:59,279 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:50:59,279 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 17:50:59,279 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:50:59,279 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 17:50:59,280 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 17:50:59,280 INFO L87 Difference]: Start difference. First operand 11 states and 13 transitions. Second operand has 5 states, 4 states have (on average 1.75) internal successors, (7), 5 states have internal predecessors, (7), 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-11 17:50:59,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:50:59,310 INFO L93 Difference]: Finished difference Result 17 states and 21 transitions. [2024-10-11 17:50:59,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 17:50:59,311 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.75) internal successors, (7), 5 states have internal predecessors, (7), 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 7 [2024-10-11 17:50:59,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:50:59,311 INFO L225 Difference]: With dead ends: 17 [2024-10-11 17:50:59,311 INFO L226 Difference]: Without dead ends: 17 [2024-10-11 17:50:59,312 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 17:50:59,312 INFO L432 NwaCegarLoop]: 9 mSDtfsCounter, 2 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 17:50:59,313 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 30 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 17:50:59,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2024-10-11 17:50:59,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 16. [2024-10-11 17:50:59,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 15 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:50:59,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 20 transitions. [2024-10-11 17:50:59,318 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 20 transitions. Word has length 7 [2024-10-11 17:50:59,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:50:59,318 INFO L471 AbstractCegarLoop]: Abstraction has 16 states and 20 transitions. [2024-10-11 17:50:59,319 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.75) internal successors, (7), 5 states have internal predecessors, (7), 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-11 17:50:59,319 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 20 transitions. [2024-10-11 17:50:59,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-10-11 17:50:59,320 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:50:59,320 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:50:59,321 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 17:50:59,321 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-11 17:50:59,322 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:50:59,322 INFO L85 PathProgramCache]: Analyzing trace with hash -313092589, now seen corresponding path program 1 times [2024-10-11 17:50:59,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:50:59,323 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [780435826] [2024-10-11 17:50:59,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:50:59,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:50:59,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:50:59,496 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-11 17:50:59,496 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:50:59,497 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [780435826] [2024-10-11 17:50:59,497 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [780435826] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:50:59,497 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:50:59,497 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 17:50:59,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1089212486] [2024-10-11 17:50:59,497 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:50:59,497 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 17:50:59,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:50:59,498 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 17:50:59,498 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-11 17:50:59,498 INFO L87 Difference]: Start difference. First operand 16 states and 20 transitions. Second operand has 6 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 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-11 17:50:59,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:50:59,529 INFO L93 Difference]: Finished difference Result 20 states and 25 transitions. [2024-10-11 17:50:59,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 17:50:59,530 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 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 7 [2024-10-11 17:50:59,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:50:59,531 INFO L225 Difference]: With dead ends: 20 [2024-10-11 17:50:59,531 INFO L226 Difference]: Without dead ends: 20 [2024-10-11 17:50:59,532 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-11 17:50:59,533 INFO L432 NwaCegarLoop]: 7 mSDtfsCounter, 3 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 17:50:59,536 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 22 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 17:50:59,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2024-10-11 17:50:59,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 14. [2024-10-11 17:50:59,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 13 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-11 17:50:59,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 17 transitions. [2024-10-11 17:50:59,539 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 17 transitions. Word has length 7 [2024-10-11 17:50:59,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:50:59,539 INFO L471 AbstractCegarLoop]: Abstraction has 14 states and 17 transitions. [2024-10-11 17:50:59,540 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 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-11 17:50:59,540 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 17 transitions. [2024-10-11 17:50:59,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-10-11 17:50:59,540 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:50:59,540 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:50:59,540 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 17:50:59,541 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-11 17:50:59,541 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:50:59,541 INFO L85 PathProgramCache]: Analyzing trace with hash 1404022538, now seen corresponding path program 1 times [2024-10-11 17:50:59,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:50:59,541 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [409294635] [2024-10-11 17:50:59,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:50:59,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:50:59,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:50:59,617 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-11 17:50:59,618 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:50:59,618 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [409294635] [2024-10-11 17:50:59,618 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [409294635] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:50:59,618 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:50:59,618 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 17:50:59,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1224922069] [2024-10-11 17:50:59,618 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:50:59,618 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 17:50:59,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:50:59,619 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 17:50:59,619 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 17:50:59,619 INFO L87 Difference]: Start difference. First operand 14 states and 17 transitions. Second operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 5 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-11 17:50:59,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:50:59,644 INFO L93 Difference]: Finished difference Result 17 states and 20 transitions. [2024-10-11 17:50:59,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 17:50:59,645 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 5 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-11 17:50:59,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:50:59,646 INFO L225 Difference]: With dead ends: 17 [2024-10-11 17:50:59,646 INFO L226 Difference]: Without dead ends: 17 [2024-10-11 17:50:59,647 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 17:50:59,648 INFO L432 NwaCegarLoop]: 9 mSDtfsCounter, 0 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 17:50:59,651 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 31 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 17:50:59,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2024-10-11 17:50:59,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2024-10-11 17:50:59,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 15 states have (on average 1.3333333333333333) internal successors, (20), 16 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:50:59,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 20 transitions. [2024-10-11 17:50:59,653 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 20 transitions. Word has length 8 [2024-10-11 17:50:59,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:50:59,653 INFO L471 AbstractCegarLoop]: Abstraction has 17 states and 20 transitions. [2024-10-11 17:50:59,653 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 5 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-11 17:50:59,653 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 20 transitions. [2024-10-11 17:50:59,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-10-11 17:50:59,653 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:50:59,653 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:50:59,654 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 17:50:59,654 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-11 17:50:59,657 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:50:59,658 INFO L85 PathProgramCache]: Analyzing trace with hash 1461280840, now seen corresponding path program 1 times [2024-10-11 17:50:59,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:50:59,658 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1924299993] [2024-10-11 17:50:59,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:50:59,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:50:59,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:50:59,747 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-11 17:50:59,747 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:50:59,747 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1924299993] [2024-10-11 17:50:59,747 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1924299993] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:50:59,748 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:50:59,748 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 17:50:59,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [324482858] [2024-10-11 17:50:59,748 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:50:59,748 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 17:50:59,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:50:59,749 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 17:50:59,749 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-11 17:50:59,749 INFO L87 Difference]: Start difference. First operand 17 states and 20 transitions. Second operand has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 5 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-11 17:50:59,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:50:59,775 INFO L93 Difference]: Finished difference Result 17 states and 19 transitions. [2024-10-11 17:50:59,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 17:50:59,776 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 5 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-11 17:50:59,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:50:59,776 INFO L225 Difference]: With dead ends: 17 [2024-10-11 17:50:59,776 INFO L226 Difference]: Without dead ends: 17 [2024-10-11 17:50:59,776 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-11 17:50:59,777 INFO L432 NwaCegarLoop]: 7 mSDtfsCounter, 1 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 17:50:59,777 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 25 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 17:50:59,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2024-10-11 17:50:59,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 14. [2024-10-11 17:50:59,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 13 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-11 17:50:59,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 16 transitions. [2024-10-11 17:50:59,778 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 16 transitions. Word has length 8 [2024-10-11 17:50:59,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:50:59,779 INFO L471 AbstractCegarLoop]: Abstraction has 14 states and 16 transitions. [2024-10-11 17:50:59,779 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 5 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-11 17:50:59,779 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 16 transitions. [2024-10-11 17:50:59,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-10-11 17:50:59,781 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:50:59,781 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1] [2024-10-11 17:50:59,782 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 17:50:59,782 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-11 17:50:59,782 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:50:59,782 INFO L85 PathProgramCache]: Analyzing trace with hash 647553063, now seen corresponding path program 1 times [2024-10-11 17:50:59,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:50:59,782 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1066748774] [2024-10-11 17:50:59,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:50:59,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:50:59,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:50:59,887 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:50:59,887 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:50:59,888 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1066748774] [2024-10-11 17:50:59,888 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1066748774] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 17:50:59,888 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [178918598] [2024-10-11 17:50:59,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:50:59,889 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 17:50:59,889 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 17:50:59,892 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 17:50:59,895 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-11 17:50:59,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:50:59,956 INFO L255 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-10-11 17:50:59,960 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 17:50:59,994 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:50:59,994 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 17:51:00,083 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:51:00,084 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [178918598] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 17:51:00,084 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 17:51:00,084 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 10 [2024-10-11 17:51:00,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1428304005] [2024-10-11 17:51:00,084 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 17:51:00,085 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-11 17:51:00,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:51:00,086 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-11 17:51:00,090 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-10-11 17:51:00,091 INFO L87 Difference]: Start difference. First operand 14 states and 16 transitions. Second operand has 10 states, 10 states have (on average 1.8) internal successors, (18), 10 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:51:00,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:51:00,166 INFO L93 Difference]: Finished difference Result 20 states and 22 transitions. [2024-10-11 17:51:00,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 17:51:00,168 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.8) internal successors, (18), 10 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2024-10-11 17:51:00,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:51:00,169 INFO L225 Difference]: With dead ends: 20 [2024-10-11 17:51:00,169 INFO L226 Difference]: Without dead ends: 20 [2024-10-11 17:51:00,170 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-10-11 17:51:00,170 INFO L432 NwaCegarLoop]: 9 mSDtfsCounter, 0 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 17:51:00,172 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 47 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 17:51:00,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2024-10-11 17:51:00,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2024-10-11 17:51:00,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 19 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:51:00,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 22 transitions. [2024-10-11 17:51:00,174 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 22 transitions. Word has length 10 [2024-10-11 17:51:00,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:51:00,176 INFO L471 AbstractCegarLoop]: Abstraction has 20 states and 22 transitions. [2024-10-11 17:51:00,176 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 1.8) internal successors, (18), 10 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:51:00,176 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 22 transitions. [2024-10-11 17:51:00,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-10-11 17:51:00,177 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:51:00,177 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1] [2024-10-11 17:51:00,190 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-10-11 17:51:00,377 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 17:51:00,378 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-11 17:51:00,378 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:51:00,379 INFO L85 PathProgramCache]: Analyzing trace with hash -161793563, now seen corresponding path program 1 times [2024-10-11 17:51:00,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:51:00,379 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [495984983] [2024-10-11 17:51:00,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:51:00,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:51:00,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:51:00,461 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:51:00,461 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:51:00,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [495984983] [2024-10-11 17:51:00,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [495984983] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 17:51:00,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1029789758] [2024-10-11 17:51:00,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:51:00,462 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 17:51:00,462 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 17:51:00,464 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 17:51:00,465 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-11 17:51:00,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:51:00,514 INFO L255 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-10-11 17:51:00,515 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 17:51:00,561 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:51:00,561 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 17:51:00,676 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:51:00,676 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1029789758] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 17:51:00,676 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 17:51:00,676 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 14 [2024-10-11 17:51:00,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1967511199] [2024-10-11 17:51:00,677 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 17:51:00,677 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-11 17:51:00,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:51:00,677 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-11 17:51:00,677 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2024-10-11 17:51:00,678 INFO L87 Difference]: Start difference. First operand 20 states and 22 transitions. Second operand has 14 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 14 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:51:00,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:51:00,745 INFO L93 Difference]: Finished difference Result 33 states and 36 transitions. [2024-10-11 17:51:00,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-11 17:51:00,746 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 14 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2024-10-11 17:51:00,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:51:00,747 INFO L225 Difference]: With dead ends: 33 [2024-10-11 17:51:00,747 INFO L226 Difference]: Without dead ends: 33 [2024-10-11 17:51:00,747 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2024-10-11 17:51:00,748 INFO L432 NwaCegarLoop]: 9 mSDtfsCounter, 0 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 17:51:00,748 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 79 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 17:51:00,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2024-10-11 17:51:00,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 21. [2024-10-11 17:51:00,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 19 states have (on average 1.263157894736842) internal successors, (24), 20 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:51:00,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 24 transitions. [2024-10-11 17:51:00,755 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 24 transitions. Word has length 10 [2024-10-11 17:51:00,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:51:00,755 INFO L471 AbstractCegarLoop]: Abstraction has 21 states and 24 transitions. [2024-10-11 17:51:00,755 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 14 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:51:00,755 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 24 transitions. [2024-10-11 17:51:00,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-10-11 17:51:00,755 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:51:00,756 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1] [2024-10-11 17:51:00,768 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-10-11 17:51:00,957 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 17:51:00,957 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-11 17:51:00,958 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:51:00,958 INFO L85 PathProgramCache]: Analyzing trace with hash 518264807, now seen corresponding path program 1 times [2024-10-11 17:51:00,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:51:00,958 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [336790668] [2024-10-11 17:51:00,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:51:00,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:51:00,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:51:01,242 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-11 17:51:01,242 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:51:01,243 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [336790668] [2024-10-11 17:51:01,243 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [336790668] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 17:51:01,243 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1460556033] [2024-10-11 17:51:01,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:51:01,243 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 17:51:01,243 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 17:51:01,245 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 17:51:01,246 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-11 17:51:01,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:51:01,293 WARN L253 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 51 conjuncts are in the unsatisfiable core [2024-10-11 17:51:01,295 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 17:51:01,375 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 8 treesize of output 1 [2024-10-11 17:51:01,701 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-11 17:51:01,702 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 17:51:02,011 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-11 17:51:02,012 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1460556033] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 17:51:02,012 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 17:51:02,012 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 24 [2024-10-11 17:51:02,012 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [540659350] [2024-10-11 17:51:02,012 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 17:51:02,013 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-10-11 17:51:02,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:51:02,013 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-10-11 17:51:02,013 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=558, Unknown=0, NotChecked=0, Total=650 [2024-10-11 17:51:02,013 INFO L87 Difference]: Start difference. First operand 21 states and 24 transitions. Second operand has 26 states, 25 states have (on average 1.2) internal successors, (30), 25 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-11 17:51:02,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:51:02,152 INFO L93 Difference]: Finished difference Result 24 states and 28 transitions. [2024-10-11 17:51:02,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 17:51:02,153 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 1.2) internal successors, (30), 25 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) Word has length 10 [2024-10-11 17:51:02,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:51:02,154 INFO L225 Difference]: With dead ends: 24 [2024-10-11 17:51:02,154 INFO L226 Difference]: Without dead ends: 24 [2024-10-11 17:51:02,155 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 156 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=92, Invalid=558, Unknown=0, NotChecked=0, Total=650 [2024-10-11 17:51:02,155 INFO L432 NwaCegarLoop]: 3 mSDtfsCounter, 0 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 212 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 216 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 212 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 17:51:02,155 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 27 Invalid, 216 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 212 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 17:51:02,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2024-10-11 17:51:02,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2024-10-11 17:51:02,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 23 states have internal predecessors, (28), 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-11 17:51:02,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 28 transitions. [2024-10-11 17:51:02,159 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 28 transitions. Word has length 10 [2024-10-11 17:51:02,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:51:02,159 INFO L471 AbstractCegarLoop]: Abstraction has 24 states and 28 transitions. [2024-10-11 17:51:02,160 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 1.2) internal successors, (30), 25 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-11 17:51:02,160 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 28 transitions. [2024-10-11 17:51:02,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-10-11 17:51:02,161 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:51:02,161 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:51:02,173 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-11 17:51:02,364 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 17:51:02,365 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-11 17:51:02,365 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:51:02,365 INFO L85 PathProgramCache]: Analyzing trace with hash -1400693256, now seen corresponding path program 1 times [2024-10-11 17:51:02,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:51:02,366 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1940174733] [2024-10-11 17:51:02,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:51:02,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:51:02,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:51:02,421 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-11 17:51:02,422 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:51:02,422 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1940174733] [2024-10-11 17:51:02,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1940174733] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:51:02,422 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:51:02,422 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:51:02,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [27148115] [2024-10-11 17:51:02,422 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:51:02,423 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 17:51:02,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:51:02,423 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 17:51:02,423 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 17:51:02,423 INFO L87 Difference]: Start difference. First operand 24 states and 28 transitions. Second operand has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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-11 17:51:02,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:51:02,431 INFO L93 Difference]: Finished difference Result 23 states and 27 transitions. [2024-10-11 17:51:02,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 17:51:02,431 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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 11 [2024-10-11 17:51:02,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:51:02,431 INFO L225 Difference]: With dead ends: 23 [2024-10-11 17:51:02,432 INFO L226 Difference]: Without dead ends: 14 [2024-10-11 17:51:02,432 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 17:51:02,432 INFO L432 NwaCegarLoop]: 8 mSDtfsCounter, 3 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 17:51:02,432 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 16 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 17:51:02,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2024-10-11 17:51:02,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2024-10-11 17:51:02,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 13 states have (on average 1.0769230769230769) internal successors, (14), 13 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:51:02,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2024-10-11 17:51:02,434 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 11 [2024-10-11 17:51:02,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:51:02,434 INFO L471 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2024-10-11 17:51:02,434 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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-11 17:51:02,435 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2024-10-11 17:51:02,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-10-11 17:51:02,436 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:51:02,437 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1] [2024-10-11 17:51:02,437 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-11 17:51:02,437 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-11 17:51:02,437 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:51:02,437 INFO L85 PathProgramCache]: Analyzing trace with hash -780600363, now seen corresponding path program 2 times [2024-10-11 17:51:02,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:51:02,438 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [946832162] [2024-10-11 17:51:02,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:51:02,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:51:02,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:51:02,876 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:51:02,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:51:02,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [946832162] [2024-10-11 17:51:02,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [946832162] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 17:51:02,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [748928126] [2024-10-11 17:51:02,877 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-11 17:51:02,877 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 17:51:02,877 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 17:51:02,879 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 17:51:02,880 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-11 17:51:02,957 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-11 17:51:02,958 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 17:51:02,959 WARN L253 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 63 conjuncts are in the unsatisfiable core [2024-10-11 17:51:02,962 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 17:51:03,016 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 8 treesize of output 1 [2024-10-11 17:51:03,483 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:51:03,483 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 17:51:03,973 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:51:03,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [748928126] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 17:51:03,973 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 17:51:03,973 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 33 [2024-10-11 17:51:03,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [400246241] [2024-10-11 17:51:03,974 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 17:51:03,974 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2024-10-11 17:51:03,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:51:03,974 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2024-10-11 17:51:03,975 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=150, Invalid=1040, Unknown=0, NotChecked=0, Total=1190 [2024-10-11 17:51:03,975 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand has 35 states, 34 states have (on average 1.1470588235294117) internal successors, (39), 34 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:51:04,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:51:04,268 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2024-10-11 17:51:04,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-11 17:51:04,268 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 1.1470588235294117) internal successors, (39), 34 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2024-10-11 17:51:04,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:51:04,268 INFO L225 Difference]: With dead ends: 16 [2024-10-11 17:51:04,268 INFO L226 Difference]: Without dead ends: 0 [2024-10-11 17:51:04,269 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 404 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=199, Invalid=1361, Unknown=0, NotChecked=0, Total=1560 [2024-10-11 17:51:04,270 INFO L432 NwaCegarLoop]: 1 mSDtfsCounter, 0 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 195 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 199 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 195 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 17:51:04,273 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 10 Invalid, 199 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 195 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 17:51:04,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-11 17:51:04,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-11 17:51:04,274 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-11 17:51:04,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-11 17:51:04,274 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 13 [2024-10-11 17:51:04,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:51:04,274 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-11 17:51:04,274 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 1.1470588235294117) internal successors, (39), 34 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:51:04,274 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-11 17:51:04,274 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-11 17:51:04,276 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 3 remaining) [2024-10-11 17:51:04,277 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 3 remaining) [2024-10-11 17:51:04,277 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (0 of 3 remaining) [2024-10-11 17:51:04,290 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-10-11 17:51:04,478 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2024-10-11 17:51:04,480 INFO L407 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:51:04,482 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 17:51:04,484 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 05:51:04 BoogieIcfgContainer [2024-10-11 17:51:04,484 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 17:51:04,485 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 17:51:04,485 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 17:51:04,485 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 17:51:04,485 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 05:50:58" (3/4) ... [2024-10-11 17:51:04,487 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-11 17:51:04,492 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2024-10-11 17:51:04,492 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2024-10-11 17:51:04,492 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2024-10-11 17:51:04,492 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-11 17:51:04,581 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-11 17:51:04,581 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-11 17:51:04,581 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 17:51:04,582 INFO L158 Benchmark]: Toolchain (without parser) took 6871.35ms. Allocated memory was 163.6MB in the beginning and 274.7MB in the end (delta: 111.1MB). Free memory was 106.0MB in the beginning and 88.4MB in the end (delta: 17.6MB). Peak memory consumption was 129.2MB. Max. memory is 16.1GB. [2024-10-11 17:51:04,582 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 163.6MB. Free memory is still 124.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 17:51:04,582 INFO L158 Benchmark]: CACSL2BoogieTranslator took 294.77ms. Allocated memory is still 163.6MB. Free memory was 106.0MB in the beginning and 88.4MB in the end (delta: 17.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-10-11 17:51:04,582 INFO L158 Benchmark]: Boogie Procedure Inliner took 30.82ms. Allocated memory is still 163.6MB. Free memory was 88.4MB in the beginning and 86.6MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 17:51:04,582 INFO L158 Benchmark]: Boogie Preprocessor took 29.48ms. Allocated memory is still 163.6MB. Free memory was 86.6MB in the beginning and 84.6MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 17:51:04,583 INFO L158 Benchmark]: RCFGBuilder took 249.90ms. Allocated memory is still 163.6MB. Free memory was 84.6MB in the beginning and 72.9MB in the end (delta: 11.7MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-10-11 17:51:04,583 INFO L158 Benchmark]: TraceAbstraction took 6164.40ms. Allocated memory was 163.6MB in the beginning and 274.7MB in the end (delta: 111.1MB). Free memory was 72.0MB in the beginning and 93.1MB in the end (delta: -21.1MB). Peak memory consumption was 91.4MB. Max. memory is 16.1GB. [2024-10-11 17:51:04,583 INFO L158 Benchmark]: Witness Printer took 96.68ms. Allocated memory is still 274.7MB. Free memory was 92.6MB in the beginning and 88.4MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-11 17:51:04,584 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.15ms. Allocated memory is still 163.6MB. Free memory is still 124.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 294.77ms. Allocated memory is still 163.6MB. Free memory was 106.0MB in the beginning and 88.4MB in the end (delta: 17.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 30.82ms. Allocated memory is still 163.6MB. Free memory was 88.4MB in the beginning and 86.6MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 29.48ms. Allocated memory is still 163.6MB. Free memory was 86.6MB in the beginning and 84.6MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 249.90ms. Allocated memory is still 163.6MB. Free memory was 84.6MB in the beginning and 72.9MB in the end (delta: 11.7MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 6164.40ms. Allocated memory was 163.6MB in the beginning and 274.7MB in the end (delta: 111.1MB). Free memory was 72.0MB in the beginning and 93.1MB in the end (delta: -21.1MB). Peak memory consumption was 91.4MB. Max. memory is 16.1GB. * Witness Printer took 96.68ms. Allocated memory is still 274.7MB. Free memory was 92.6MB in the beginning and 88.4MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 554]: 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, 13 locations, 3 error locations. Started 1 CEGAR loops. OverallTime: 6.1s, OverallIterations: 12, TraceHistogramMax: 3, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 0.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 16 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 16 mSDsluCounter, 350 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 255 mSDsCounter, 16 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 648 IncrementalHoareTripleChecker+Invalid, 664 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 16 mSolverCounterUnsat, 95 mSDtfsCounter, 648 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 146 GetRequests, 39 SyntacticMatches, 2 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 604 ImplicationChecksByTransitivity, 1.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=24occurred in iteration=10, InterpolantAutomatonStates: 80, 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, 12 MinimizatonAttempts, 23 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 3.7s InterpolantComputationTime, 144 NumberOfCodeBlocks, 144 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 167 ConstructedInterpolants, 0 QuantifiedInterpolants, 1882 SizeOfPredicates, 9 NumberOfNonLiveVariables, 347 ConjunctsInSsa, 142 ConjunctsInUnsatCore, 20 InterpolantComputations, 8 PerfectInterpolantSequences, 9/56 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 3 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2024-10-11 17:51:04,613 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE