./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/termination-crafted/NonTermination3-1.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/termination-crafted/NonTermination3-1.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash fabc9d8a61dd824da0c561a6d62c57fe8eb320f6ad8009599cd12699fa04e01c --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 08:03:51,790 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 08:03:51,840 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Default.epf [2025-03-04 08:03:51,846 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 08:03:51,849 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 08:03:51,872 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 08:03:51,873 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 08:03:51,873 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 08:03:51,874 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 08:03:51,874 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 08:03:51,874 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 08:03:51,875 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 08:03:51,875 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 08:03:51,875 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 08:03:51,875 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 08:03:51,876 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 08:03:51,876 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 08:03:51,876 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 08:03:51,876 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-04 08:03:51,876 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-04 08:03:51,876 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-04 08:03:51,876 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 08:03:51,876 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-04 08:03:51,876 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 08:03:51,876 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 08:03:51,876 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 08:03:51,876 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 08:03:51,877 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 08:03:51,877 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 08:03:51,877 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 08:03:51,877 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 08:03:51,877 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 08:03:51,877 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 08:03:51,877 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 08:03:51,877 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 08:03:51,877 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 08:03:51,878 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 08:03:51,878 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 08:03:51,878 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 08:03:51,878 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> fabc9d8a61dd824da0c561a6d62c57fe8eb320f6ad8009599cd12699fa04e01c [2025-03-04 08:03:52,099 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 08:03:52,105 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 08:03:52,107 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 08:03:52,107 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 08:03:52,108 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 08:03:52,108 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-crafted/NonTermination3-1.c [2025-03-04 08:03:53,240 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/51279e49d/63fedbfbfc7c4457bde9f8ffd497fcab/FLAGd20fd5e67 [2025-03-04 08:03:53,444 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 08:03:53,449 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-crafted/NonTermination3-1.c [2025-03-04 08:03:53,466 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/51279e49d/63fedbfbfc7c4457bde9f8ffd497fcab/FLAGd20fd5e67 [2025-03-04 08:03:53,489 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/51279e49d/63fedbfbfc7c4457bde9f8ffd497fcab [2025-03-04 08:03:53,491 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 08:03:53,492 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 08:03:53,494 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 08:03:53,494 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 08:03:53,497 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 08:03:53,498 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 08:03:53" (1/1) ... [2025-03-04 08:03:53,499 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@32dcde73 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 08:03:53, skipping insertion in model container [2025-03-04 08:03:53,500 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 08:03:53" (1/1) ... [2025-03-04 08:03:53,508 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 08:03:53,613 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 08:03:53,616 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 08:03:53,627 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 08:03:53,641 INFO L204 MainTranslator]: Completed translation [2025-03-04 08:03:53,642 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 08:03:53 WrapperNode [2025-03-04 08:03:53,642 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 08:03:53,643 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 08:03:53,643 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 08:03:53,643 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 08:03:53,647 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 08:03:53" (1/1) ... [2025-03-04 08:03:53,651 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 08:03:53" (1/1) ... [2025-03-04 08:03:53,660 INFO L138 Inliner]: procedures = 8, calls = 8, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 41 [2025-03-04 08:03:53,661 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 08:03:53,661 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 08:03:53,661 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 08:03:53,661 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 08:03:53,666 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 08:03:53" (1/1) ... [2025-03-04 08:03:53,666 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 08:03:53" (1/1) ... [2025-03-04 08:03:53,671 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 08:03:53" (1/1) ... [2025-03-04 08:03:53,681 INFO L175 MemorySlicer]: Split 3 memory accesses to 1 slices as follows [3]. 100 percent of accesses are in the largest equivalence class. The 0 initializations are split as follows [0]. The 2 writes are split as follows [2]. [2025-03-04 08:03:53,681 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 08:03:53" (1/1) ... [2025-03-04 08:03:53,682 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 08:03:53" (1/1) ... [2025-03-04 08:03:53,685 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 08:03:53" (1/1) ... [2025-03-04 08:03:53,686 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 08:03:53" (1/1) ... [2025-03-04 08:03:53,687 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 08:03:53" (1/1) ... [2025-03-04 08:03:53,687 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 08:03:53" (1/1) ... [2025-03-04 08:03:53,688 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 08:03:53,689 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 08:03:53,689 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 08:03:53,689 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 08:03:53,690 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 08:03:53" (1/1) ... [2025-03-04 08:03:53,693 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 08:03:53,703 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 08:03:53,714 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-04 08:03:53,717 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-04 08:03:53,735 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-04 08:03:53,735 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 08:03:53,735 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 08:03:53,736 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-04 08:03:53,736 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-04 08:03:53,736 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-04 08:03:53,782 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 08:03:53,783 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 08:03:53,913 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L11: call ULTIMATE.dealloc(main_~#a~0#1.base, main_~#a~0#1.offset);havoc main_~#a~0#1.base, main_~#a~0#1.offset; [2025-03-04 08:03:53,919 INFO L? ?]: Removed 20 outVars from TransFormulas that were not future-live. [2025-03-04 08:03:53,922 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 08:03:53,928 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 08:03:53,929 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 08:03:53,929 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 08:03:53 BoogieIcfgContainer [2025-03-04 08:03:53,929 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 08:03:53,931 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 08:03:53,931 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 08:03:53,934 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 08:03:53,935 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 08:03:53" (1/3) ... [2025-03-04 08:03:53,936 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c7c5a90 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 08:03:53, skipping insertion in model container [2025-03-04 08:03:53,936 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 08:03:53" (2/3) ... [2025-03-04 08:03:53,937 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c7c5a90 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 08:03:53, skipping insertion in model container [2025-03-04 08:03:53,937 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 08:03:53" (3/3) ... [2025-03-04 08:03:53,939 INFO L128 eAbstractionObserver]: Analyzing ICFG NonTermination3-1.c [2025-03-04 08:03:53,950 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 08:03:53,951 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG NonTermination3-1.c that has 1 procedures, 22 locations, 1 initial locations, 2 loop locations, and 7 error locations. [2025-03-04 08:03:53,975 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 08:03:53,985 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;@4020dde0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 08:03:53,986 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2025-03-04 08:03:53,988 INFO L276 IsEmpty]: Start isEmpty. Operand has 22 states, 14 states have (on average 1.7857142857142858) internal successors, (25), 21 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 08:03:53,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-03-04 08:03:53,992 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 08:03:53,993 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-03-04 08:03:53,993 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 4 more)] === [2025-03-04 08:03:53,998 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 08:03:53,999 INFO L85 PathProgramCache]: Analyzing trace with hash 1753662, now seen corresponding path program 1 times [2025-03-04 08:03:54,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 08:03:54,004 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [463857993] [2025-03-04 08:03:54,004 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 08:03:54,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 08:03:54,052 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-04 08:03:54,066 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-04 08:03:54,066 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 08:03:54,066 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 08:03:54,155 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 08:03:54,156 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 08:03:54,156 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [463857993] [2025-03-04 08:03:54,160 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [463857993] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 08:03:54,160 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 08:03:54,160 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 08:03:54,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1750185520] [2025-03-04 08:03:54,161 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 08:03:54,165 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 08:03:54,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 08:03:54,183 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 08:03:54,183 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 08:03:54,185 INFO L87 Difference]: Start difference. First operand has 22 states, 14 states have (on average 1.7857142857142858) internal successors, (25), 21 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 08:03:54,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 08:03:54,218 INFO L93 Difference]: Finished difference Result 19 states and 21 transitions. [2025-03-04 08:03:54,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 08:03:54,220 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2025-03-04 08:03:54,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 08:03:54,224 INFO L225 Difference]: With dead ends: 19 [2025-03-04 08:03:54,224 INFO L226 Difference]: Without dead ends: 17 [2025-03-04 08:03:54,226 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 08:03:54,228 INFO L435 NwaCegarLoop]: 14 mSDtfsCounter, 11 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 08:03:54,229 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 15 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 08:03:54,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2025-03-04 08:03:54,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2025-03-04 08:03:54,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 16 states have internal predecessors, (19), 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) [2025-03-04 08:03:54,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 19 transitions. [2025-03-04 08:03:54,252 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 19 transitions. Word has length 4 [2025-03-04 08:03:54,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 08:03:54,252 INFO L471 AbstractCegarLoop]: Abstraction has 17 states and 19 transitions. [2025-03-04 08:03:54,252 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 08:03:54,252 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2025-03-04 08:03:54,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-03-04 08:03:54,253 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 08:03:54,253 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-03-04 08:03:54,253 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 08:03:54,254 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 4 more)] === [2025-03-04 08:03:54,254 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 08:03:54,254 INFO L85 PathProgramCache]: Analyzing trace with hash 1753663, now seen corresponding path program 1 times [2025-03-04 08:03:54,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 08:03:54,254 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [637771882] [2025-03-04 08:03:54,254 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 08:03:54,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 08:03:54,262 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-04 08:03:54,274 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-04 08:03:54,274 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 08:03:54,274 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 08:03:54,381 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 08:03:54,382 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 08:03:54,382 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [637771882] [2025-03-04 08:03:54,382 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [637771882] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 08:03:54,382 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 08:03:54,382 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 08:03:54,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [553873487] [2025-03-04 08:03:54,382 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 08:03:54,383 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 08:03:54,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 08:03:54,386 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 08:03:54,386 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 08:03:54,387 INFO L87 Difference]: Start difference. First operand 17 states and 19 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 08:03:54,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 08:03:54,410 INFO L93 Difference]: Finished difference Result 20 states and 22 transitions. [2025-03-04 08:03:54,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 08:03:54,411 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2025-03-04 08:03:54,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 08:03:54,411 INFO L225 Difference]: With dead ends: 20 [2025-03-04 08:03:54,411 INFO L226 Difference]: Without dead ends: 20 [2025-03-04 08:03:54,411 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 08:03:54,412 INFO L435 NwaCegarLoop]: 16 mSDtfsCounter, 1 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 08:03:54,412 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 24 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 08:03:54,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2025-03-04 08:03:54,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 19. [2025-03-04 08:03:54,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 15 states have (on average 1.4) internal successors, (21), 18 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 08:03:54,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 21 transitions. [2025-03-04 08:03:54,416 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 21 transitions. Word has length 4 [2025-03-04 08:03:54,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 08:03:54,416 INFO L471 AbstractCegarLoop]: Abstraction has 19 states and 21 transitions. [2025-03-04 08:03:54,416 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 08:03:54,416 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2025-03-04 08:03:54,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-03-04 08:03:54,416 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 08:03:54,416 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2025-03-04 08:03:54,416 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 08:03:54,417 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 4 more)] === [2025-03-04 08:03:54,417 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 08:03:54,417 INFO L85 PathProgramCache]: Analyzing trace with hash 703728279, now seen corresponding path program 1 times [2025-03-04 08:03:54,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 08:03:54,417 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1336575746] [2025-03-04 08:03:54,417 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 08:03:54,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 08:03:54,426 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-04 08:03:54,436 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 08:03:54,436 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 08:03:54,436 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 08:03:54,558 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 08:03:54,559 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 08:03:54,559 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1336575746] [2025-03-04 08:03:54,559 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1336575746] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 08:03:54,559 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [740770825] [2025-03-04 08:03:54,559 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 08:03:54,560 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 08:03:54,560 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 08:03:54,562 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 08:03:54,564 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-04 08:03:54,598 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-04 08:03:54,607 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 08:03:54,607 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 08:03:54,607 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 08:03:54,608 INFO L256 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-04 08:03:54,611 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 08:03:54,659 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 [2025-03-04 08:03:54,728 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 08:03:54,728 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 08:03:54,799 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 08:03:54,800 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [740770825] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 08:03:54,800 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 08:03:54,800 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2025-03-04 08:03:54,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1478861006] [2025-03-04 08:03:54,800 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 08:03:54,800 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 08:03:54,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 08:03:54,801 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 08:03:54,801 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-03-04 08:03:54,801 INFO L87 Difference]: Start difference. First operand 19 states and 21 transitions. Second operand has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 7 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) [2025-03-04 08:03:54,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 08:03:54,870 INFO L93 Difference]: Finished difference Result 28 states and 32 transitions. [2025-03-04 08:03:54,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 08:03:54,871 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 7 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) Word has length 7 [2025-03-04 08:03:54,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 08:03:54,872 INFO L225 Difference]: With dead ends: 28 [2025-03-04 08:03:54,872 INFO L226 Difference]: Without dead ends: 28 [2025-03-04 08:03:54,872 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2025-03-04 08:03:54,872 INFO L435 NwaCegarLoop]: 15 mSDtfsCounter, 5 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 08:03:54,873 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 31 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 08:03:54,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2025-03-04 08:03:54,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2025-03-04 08:03:54,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 24 states have (on average 1.3333333333333333) internal successors, (32), 27 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 08:03:54,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2025-03-04 08:03:54,879 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 32 transitions. Word has length 7 [2025-03-04 08:03:54,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 08:03:54,879 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 32 transitions. [2025-03-04 08:03:54,879 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 7 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) [2025-03-04 08:03:54,879 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2025-03-04 08:03:54,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-03-04 08:03:54,879 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 08:03:54,879 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1] [2025-03-04 08:03:54,887 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-04 08:03:55,079 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 08:03:55,080 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 4 more)] === [2025-03-04 08:03:55,080 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 08:03:55,080 INFO L85 PathProgramCache]: Analyzing trace with hash 1295488285, now seen corresponding path program 1 times [2025-03-04 08:03:55,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 08:03:55,081 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1172611687] [2025-03-04 08:03:55,081 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 08:03:55,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 08:03:55,087 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-04 08:03:55,092 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-04 08:03:55,092 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 08:03:55,092 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 08:03:55,198 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-04 08:03:55,199 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 08:03:55,199 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1172611687] [2025-03-04 08:03:55,199 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1172611687] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 08:03:55,199 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 08:03:55,199 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 08:03:55,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1779023612] [2025-03-04 08:03:55,199 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 08:03:55,199 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 08:03:55,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 08:03:55,199 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 08:03:55,199 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 08:03:55,200 INFO L87 Difference]: Start difference. First operand 28 states and 32 transitions. Second operand has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 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) [2025-03-04 08:03:55,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 08:03:55,265 INFO L93 Difference]: Finished difference Result 32 states and 39 transitions. [2025-03-04 08:03:55,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 08:03:55,266 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 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 12 [2025-03-04 08:03:55,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 08:03:55,266 INFO L225 Difference]: With dead ends: 32 [2025-03-04 08:03:55,266 INFO L226 Difference]: Without dead ends: 32 [2025-03-04 08:03:55,267 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-03-04 08:03:55,268 INFO L435 NwaCegarLoop]: 12 mSDtfsCounter, 14 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 08:03:55,268 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 25 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 08:03:55,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2025-03-04 08:03:55,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 27. [2025-03-04 08:03:55,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 26 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 08:03:55,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2025-03-04 08:03:55,272 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 31 transitions. Word has length 12 [2025-03-04 08:03:55,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 08:03:55,272 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 31 transitions. [2025-03-04 08:03:55,272 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 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) [2025-03-04 08:03:55,272 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2025-03-04 08:03:55,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-03-04 08:03:55,272 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 08:03:55,272 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 08:03:55,273 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 08:03:55,273 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 4 more)] === [2025-03-04 08:03:55,276 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 08:03:55,277 INFO L85 PathProgramCache]: Analyzing trace with hash 1505432015, now seen corresponding path program 1 times [2025-03-04 08:03:55,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 08:03:55,277 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1281518170] [2025-03-04 08:03:55,277 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 08:03:55,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 08:03:55,281 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-04 08:03:55,285 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-04 08:03:55,285 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 08:03:55,285 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 08:03:55,304 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-04 08:03:55,305 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 08:03:55,305 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1281518170] [2025-03-04 08:03:55,305 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1281518170] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 08:03:55,305 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 08:03:55,305 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 08:03:55,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1833939645] [2025-03-04 08:03:55,305 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 08:03:55,305 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 08:03:55,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 08:03:55,306 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 08:03:55,306 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 08:03:55,306 INFO L87 Difference]: Start difference. First operand 27 states and 31 transitions. Second operand has 3 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) [2025-03-04 08:03:55,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 08:03:55,316 INFO L93 Difference]: Finished difference Result 28 states and 32 transitions. [2025-03-04 08:03:55,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 08:03:55,317 INFO L78 Accepts]: Start accepts. Automaton has has 3 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 13 [2025-03-04 08:03:55,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 08:03:55,319 INFO L225 Difference]: With dead ends: 28 [2025-03-04 08:03:55,319 INFO L226 Difference]: Without dead ends: 28 [2025-03-04 08:03:55,319 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 08:03:55,319 INFO L435 NwaCegarLoop]: 17 mSDtfsCounter, 0 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 28 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 [2025-03-04 08:03:55,320 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 28 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 08:03:55,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2025-03-04 08:03:55,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2025-03-04 08:03:55,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 25 states have (on average 1.28) internal successors, (32), 27 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 08:03:55,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2025-03-04 08:03:55,324 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 32 transitions. Word has length 13 [2025-03-04 08:03:55,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 08:03:55,324 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 32 transitions. [2025-03-04 08:03:55,324 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 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) [2025-03-04 08:03:55,325 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2025-03-04 08:03:55,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-03-04 08:03:55,325 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 08:03:55,325 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 08:03:55,325 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 08:03:55,325 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 4 more)] === [2025-03-04 08:03:55,325 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 08:03:55,325 INFO L85 PathProgramCache]: Analyzing trace with hash -576248844, now seen corresponding path program 1 times [2025-03-04 08:03:55,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 08:03:55,325 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1285452897] [2025-03-04 08:03:55,326 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 08:03:55,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 08:03:55,330 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-04 08:03:55,332 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-04 08:03:55,333 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 08:03:55,333 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 08:03:55,375 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 08:03:55,375 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 08:03:55,375 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1285452897] [2025-03-04 08:03:55,375 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1285452897] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 08:03:55,376 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [580451580] [2025-03-04 08:03:55,376 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 08:03:55,376 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 08:03:55,376 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 08:03:55,378 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 08:03:55,379 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-04 08:03:55,402 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-04 08:03:55,412 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-04 08:03:55,412 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 08:03:55,412 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 08:03:55,413 INFO L256 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 08:03:55,413 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 08:03:55,431 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 08:03:55,431 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 08:03:55,461 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 08:03:55,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [580451580] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 08:03:55,461 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 08:03:55,461 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2025-03-04 08:03:55,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2131493551] [2025-03-04 08:03:55,461 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 08:03:55,461 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 08:03:55,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 08:03:55,462 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 08:03:55,462 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2025-03-04 08:03:55,462 INFO L87 Difference]: Start difference. First operand 28 states and 32 transitions. Second operand has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 9 states have internal predecessors, (26), 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) [2025-03-04 08:03:55,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 08:03:55,488 INFO L93 Difference]: Finished difference Result 33 states and 36 transitions. [2025-03-04 08:03:55,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 08:03:55,489 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 9 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2025-03-04 08:03:55,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 08:03:55,489 INFO L225 Difference]: With dead ends: 33 [2025-03-04 08:03:55,489 INFO L226 Difference]: Without dead ends: 33 [2025-03-04 08:03:55,489 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2025-03-04 08:03:55,490 INFO L435 NwaCegarLoop]: 14 mSDtfsCounter, 4 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 08:03:55,490 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 50 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 08:03:55,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2025-03-04 08:03:55,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2025-03-04 08:03:55,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 30 states have (on average 1.2) internal successors, (36), 32 states have internal predecessors, (36), 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) [2025-03-04 08:03:55,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 36 transitions. [2025-03-04 08:03:55,494 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 36 transitions. Word has length 14 [2025-03-04 08:03:55,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 08:03:55,494 INFO L471 AbstractCegarLoop]: Abstraction has 33 states and 36 transitions. [2025-03-04 08:03:55,495 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 9 states have internal predecessors, (26), 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) [2025-03-04 08:03:55,495 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 36 transitions. [2025-03-04 08:03:55,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-03-04 08:03:55,495 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 08:03:55,495 INFO L218 NwaCegarLoop]: trace histogram [5, 4, 4, 1, 1, 1] [2025-03-04 08:03:55,501 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-04 08:03:55,695 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2025-03-04 08:03:55,696 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 4 more)] === [2025-03-04 08:03:55,696 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 08:03:55,696 INFO L85 PathProgramCache]: Analyzing trace with hash -216267713, now seen corresponding path program 2 times [2025-03-04 08:03:55,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 08:03:55,696 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1453905205] [2025-03-04 08:03:55,696 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 08:03:55,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 08:03:55,702 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 16 statements into 2 equivalence classes. [2025-03-04 08:03:55,712 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 16 of 16 statements. [2025-03-04 08:03:55,712 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 08:03:55,712 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 08:03:55,888 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 9 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 08:03:55,888 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 08:03:55,889 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1453905205] [2025-03-04 08:03:55,889 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1453905205] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 08:03:55,889 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [943963252] [2025-03-04 08:03:55,889 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 08:03:55,889 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 08:03:55,889 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 08:03:55,891 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 08:03:55,893 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-04 08:03:55,918 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 16 statements into 2 equivalence classes. [2025-03-04 08:03:55,928 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 16 of 16 statements. [2025-03-04 08:03:55,929 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 08:03:55,929 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 08:03:55,929 INFO L256 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-04 08:03:55,931 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 08:03:55,938 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 [2025-03-04 08:03:56,042 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 08:03:56,042 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 08:03:56,042 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [943963252] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 08:03:56,042 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 08:03:56,042 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 9 [2025-03-04 08:03:56,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [481898811] [2025-03-04 08:03:56,042 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 08:03:56,043 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 08:03:56,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 08:03:56,043 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 08:03:56,043 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2025-03-04 08:03:56,043 INFO L87 Difference]: Start difference. First operand 33 states and 36 transitions. Second operand has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 8 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) [2025-03-04 08:03:56,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 08:03:56,086 INFO L93 Difference]: Finished difference Result 32 states and 34 transitions. [2025-03-04 08:03:56,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 08:03:56,086 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 8 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) Word has length 16 [2025-03-04 08:03:56,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 08:03:56,087 INFO L225 Difference]: With dead ends: 32 [2025-03-04 08:03:56,087 INFO L226 Difference]: Without dead ends: 32 [2025-03-04 08:03:56,087 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2025-03-04 08:03:56,087 INFO L435 NwaCegarLoop]: 13 mSDtfsCounter, 2 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 08:03:56,087 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 29 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 08:03:56,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2025-03-04 08:03:56,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2025-03-04 08:03:56,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 30 states have (on average 1.1333333333333333) internal successors, (34), 31 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 08:03:56,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 34 transitions. [2025-03-04 08:03:56,089 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 34 transitions. Word has length 16 [2025-03-04 08:03:56,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 08:03:56,089 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 34 transitions. [2025-03-04 08:03:56,089 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 8 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) [2025-03-04 08:03:56,089 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 34 transitions. [2025-03-04 08:03:56,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-03-04 08:03:56,092 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 08:03:56,092 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 08:03:56,098 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-04 08:03:56,292 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 08:03:56,296 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 4 more)] === [2025-03-04 08:03:56,296 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 08:03:56,296 INFO L85 PathProgramCache]: Analyzing trace with hash -1182931468, now seen corresponding path program 2 times [2025-03-04 08:03:56,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 08:03:56,297 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1388560499] [2025-03-04 08:03:56,297 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 08:03:56,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 08:03:56,306 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 26 statements into 2 equivalence classes. [2025-03-04 08:03:56,311 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 8 of 26 statements. [2025-03-04 08:03:56,311 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 08:03:56,311 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 08:03:56,351 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2025-03-04 08:03:56,351 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 08:03:56,352 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1388560499] [2025-03-04 08:03:56,352 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1388560499] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 08:03:56,352 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 08:03:56,352 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 08:03:56,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [554206436] [2025-03-04 08:03:56,352 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 08:03:56,352 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 08:03:56,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 08:03:56,353 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 08:03:56,353 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 08:03:56,353 INFO L87 Difference]: Start difference. First operand 32 states and 34 transitions. Second operand has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 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) [2025-03-04 08:03:56,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 08:03:56,363 INFO L93 Difference]: Finished difference Result 31 states and 33 transitions. [2025-03-04 08:03:56,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 08:03:56,363 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 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 26 [2025-03-04 08:03:56,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 08:03:56,364 INFO L225 Difference]: With dead ends: 31 [2025-03-04 08:03:56,364 INFO L226 Difference]: Without dead ends: 28 [2025-03-04 08:03:56,364 INFO L434 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 [2025-03-04 08:03:56,364 INFO L435 NwaCegarLoop]: 11 mSDtfsCounter, 5 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 08:03:56,365 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 20 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 08:03:56,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2025-03-04 08:03:56,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2025-03-04 08:03:56,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 27 states have (on average 1.0740740740740742) internal successors, (29), 27 states have internal predecessors, (29), 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) [2025-03-04 08:03:56,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 29 transitions. [2025-03-04 08:03:56,366 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 29 transitions. Word has length 26 [2025-03-04 08:03:56,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 08:03:56,366 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 29 transitions. [2025-03-04 08:03:56,367 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 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) [2025-03-04 08:03:56,367 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 29 transitions. [2025-03-04 08:03:56,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-03-04 08:03:56,367 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 08:03:56,367 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 08:03:56,367 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 08:03:56,367 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 4 more)] === [2025-03-04 08:03:56,368 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 08:03:56,368 INFO L85 PathProgramCache]: Analyzing trace with hash 1983004013, now seen corresponding path program 1 times [2025-03-04 08:03:56,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 08:03:56,368 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [606832056] [2025-03-04 08:03:56,368 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 08:03:56,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 08:03:56,374 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-04 08:03:56,378 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-04 08:03:56,379 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 08:03:56,379 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 08:03:56,456 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 08:03:56,456 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 08:03:56,457 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [606832056] [2025-03-04 08:03:56,457 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [606832056] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 08:03:56,457 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1050952292] [2025-03-04 08:03:56,457 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 08:03:56,457 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 08:03:56,457 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 08:03:56,459 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 08:03:56,460 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-04 08:03:56,497 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-04 08:03:56,509 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-04 08:03:56,509 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 08:03:56,509 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 08:03:56,510 INFO L256 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-04 08:03:56,511 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 08:03:56,539 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 08:03:56,539 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 08:03:56,622 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 08:03:56,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1050952292] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 08:03:56,623 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 08:03:56,623 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 13 [2025-03-04 08:03:56,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1402354774] [2025-03-04 08:03:56,623 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 08:03:56,623 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-04 08:03:56,623 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 08:03:56,623 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-04 08:03:56,624 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-03-04 08:03:56,624 INFO L87 Difference]: Start difference. First operand 28 states and 29 transitions. Second operand has 13 states, 13 states have (on average 3.230769230769231) internal successors, (42), 13 states have internal predecessors, (42), 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) [2025-03-04 08:03:56,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 08:03:56,660 INFO L93 Difference]: Finished difference Result 40 states and 41 transitions. [2025-03-04 08:03:56,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-04 08:03:56,661 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.230769230769231) internal successors, (42), 13 states have internal predecessors, (42), 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 27 [2025-03-04 08:03:56,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 08:03:56,661 INFO L225 Difference]: With dead ends: 40 [2025-03-04 08:03:56,662 INFO L226 Difference]: Without dead ends: 40 [2025-03-04 08:03:56,662 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 46 SyntacticMatches, 4 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-03-04 08:03:56,663 INFO L435 NwaCegarLoop]: 10 mSDtfsCounter, 2 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 08:03:56,663 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 26 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 08:03:56,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2025-03-04 08:03:56,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2025-03-04 08:03:56,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 39 states have (on average 1.0512820512820513) internal successors, (41), 39 states have internal predecessors, (41), 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) [2025-03-04 08:03:56,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 41 transitions. [2025-03-04 08:03:56,667 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 41 transitions. Word has length 27 [2025-03-04 08:03:56,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 08:03:56,667 INFO L471 AbstractCegarLoop]: Abstraction has 40 states and 41 transitions. [2025-03-04 08:03:56,667 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.230769230769231) internal successors, (42), 13 states have internal predecessors, (42), 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) [2025-03-04 08:03:56,668 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 41 transitions. [2025-03-04 08:03:56,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2025-03-04 08:03:56,668 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 08:03:56,668 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 08:03:56,678 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-04 08:03:56,868 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 08:03:56,869 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 4 more)] === [2025-03-04 08:03:56,869 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 08:03:56,869 INFO L85 PathProgramCache]: Analyzing trace with hash 417774445, now seen corresponding path program 2 times [2025-03-04 08:03:56,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 08:03:56,869 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [549744727] [2025-03-04 08:03:56,869 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 08:03:56,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 08:03:56,877 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 39 statements into 2 equivalence classes. [2025-03-04 08:03:56,889 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 39 of 39 statements. [2025-03-04 08:03:56,890 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 08:03:56,890 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 08:03:56,890 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 08:03:56,892 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-03-04 08:03:56,901 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-03-04 08:03:56,901 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 08:03:56,901 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 08:03:56,920 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 08:03:56,920 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-04 08:03:56,921 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 7 remaining) [2025-03-04 08:03:56,922 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (5 of 7 remaining) [2025-03-04 08:03:56,922 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 7 remaining) [2025-03-04 08:03:56,923 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 7 remaining) [2025-03-04 08:03:56,923 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 7 remaining) [2025-03-04 08:03:56,923 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 7 remaining) [2025-03-04 08:03:56,923 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 7 remaining) [2025-03-04 08:03:56,923 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-04 08:03:56,925 INFO L422 BasicCegarLoop]: Path program histogram: [2, 2, 2, 1, 1, 1, 1] [2025-03-04 08:03:56,948 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-04 08:03:56,950 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.03 08:03:56 BoogieIcfgContainer [2025-03-04 08:03:56,951 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-04 08:03:56,951 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-04 08:03:56,951 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-04 08:03:56,952 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-04 08:03:56,952 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 08:03:53" (3/4) ... [2025-03-04 08:03:56,953 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2025-03-04 08:03:56,985 INFO L127 tionWitnessGenerator]: Generated YAML witness of length 14. [2025-03-04 08:03:57,023 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-04 08:03:57,024 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-04 08:03:57,024 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-04 08:03:57,025 INFO L158 Benchmark]: Toolchain (without parser) took 3532.83ms. Allocated memory is still 142.6MB. Free memory was 112.8MB in the beginning and 80.9MB in the end (delta: 31.9MB). Peak memory consumption was 34.2MB. Max. memory is 16.1GB. [2025-03-04 08:03:57,025 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 201.3MB. Free memory is still 125.2MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 08:03:57,025 INFO L158 Benchmark]: CACSL2BoogieTranslator took 149.11ms. Allocated memory is still 142.6MB. Free memory was 112.4MB in the beginning and 102.3MB in the end (delta: 10.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 08:03:57,026 INFO L158 Benchmark]: Boogie Procedure Inliner took 17.82ms. Allocated memory is still 142.6MB. Free memory was 102.3MB in the beginning and 101.0MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 08:03:57,026 INFO L158 Benchmark]: Boogie Preprocessor took 26.91ms. Allocated memory is still 142.6MB. Free memory was 101.0MB in the beginning and 100.1MB in the end (delta: 895.3kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 08:03:57,026 INFO L158 Benchmark]: IcfgBuilder took 240.52ms. Allocated memory is still 142.6MB. Free memory was 100.1MB in the beginning and 88.3MB in the end (delta: 11.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-04 08:03:57,026 INFO L158 Benchmark]: TraceAbstraction took 3019.76ms. Allocated memory is still 142.6MB. Free memory was 87.9MB in the beginning and 86.3MB in the end (delta: 1.6MB). Peak memory consumption was 650.9kB. Max. memory is 16.1GB. [2025-03-04 08:03:57,027 INFO L158 Benchmark]: Witness Printer took 72.47ms. Allocated memory is still 142.6MB. Free memory was 86.3MB in the beginning and 80.9MB in the end (delta: 5.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 08:03:57,030 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18ms. Allocated memory is still 201.3MB. Free memory is still 125.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 149.11ms. Allocated memory is still 142.6MB. Free memory was 112.4MB in the beginning and 102.3MB in the end (delta: 10.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 17.82ms. Allocated memory is still 142.6MB. Free memory was 102.3MB in the beginning and 101.0MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 26.91ms. Allocated memory is still 142.6MB. Free memory was 101.0MB in the beginning and 100.1MB in the end (delta: 895.3kB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 240.52ms. Allocated memory is still 142.6MB. Free memory was 100.1MB in the beginning and 88.3MB in the end (delta: 11.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 3019.76ms. Allocated memory is still 142.6MB. Free memory was 87.9MB in the beginning and 86.3MB in the end (delta: 1.6MB). Peak memory consumption was 650.9kB. Max. memory is 16.1GB. * Witness Printer took 72.47ms. Allocated memory is still 142.6MB. Free memory was 86.3MB in the beginning and 80.9MB in the end (delta: 5.3MB). Peak memory consumption was 8.4MB. 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 - CounterExampleResult [Line: -1]: pointer dereference may fail pointer dereference may fail We found a FailurePath: [L10] int i = __VERIFIER_nondet_int(); [L11] int a[10]; [L13] int n = 0; VAL [a={2:0}, i=0, n=0] [L13] COND TRUE n < 10 [L14] a[n] = __VERIFIER_nondet_int() [L13] ++n VAL [a={2:0}, i=0, n=1] [L13] COND TRUE n < 10 [L14] a[n] = __VERIFIER_nondet_int() [L13] ++n VAL [a={2:0}, i=0, n=2] [L13] COND TRUE n < 10 [L14] a[n] = __VERIFIER_nondet_int() [L13] ++n VAL [a={2:0}, i=0, n=3] [L13] COND TRUE n < 10 [L14] a[n] = __VERIFIER_nondet_int() [L13] ++n VAL [a={2:0}, i=0, n=4] [L13] COND TRUE n < 10 [L14] a[n] = __VERIFIER_nondet_int() [L13] ++n VAL [a={2:0}, i=0, n=5] [L13] COND TRUE n < 10 [L14] a[n] = __VERIFIER_nondet_int() [L13] ++n VAL [a={2:0}, i=0, n=6] [L13] COND TRUE n < 10 [L14] a[n] = __VERIFIER_nondet_int() [L13] ++n VAL [a={2:0}, i=0, n=7] [L13] COND TRUE n < 10 [L14] a[n] = __VERIFIER_nondet_int() [L13] ++n VAL [a={2:0}, i=0, n=8] [L13] COND TRUE n < 10 [L14] a[n] = __VERIFIER_nondet_int() [L13] ++n VAL [a={2:0}, i=0, n=9] [L13] COND TRUE n < 10 [L14] a[n] = __VERIFIER_nondet_int() [L13] ++n VAL [a={2:0}, i=0, n=10] [L13] COND FALSE !(n < 10) [L17] COND TRUE 0 <= i && i < 10 && a[i] >= 0 [L17] 0 <= i && i < 10 && a[i] >= 0 VAL [a={2:0}, i=0] [L17] 0 <= i && i < 10 && a[i] >= 0 [L17] EXPR a[i] [L17] 0 <= i && i < 10 && a[i] >= 0 VAL [a={2:0}] [L17] COND TRUE 0 <= i && i < 10 && a[i] >= 0 [L18] i = __VERIFIER_nondet_int() [L20] a[i] = 0 - UnprovableResult [Line: 9]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 22 locations, 7 error locations. Started 1 CEGAR loops. OverallTime: 3.0s, OverallIterations: 10, TraceHistogramMax: 10, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 0.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 44 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 44 mSDsluCounter, 248 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 126 mSDsCounter, 10 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 238 IncrementalHoareTripleChecker+Invalid, 248 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 10 mSolverCounterUnsat, 122 mSDtfsCounter, 238 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 146 GetRequests, 100 SyntacticMatches, 4 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=40occurred in iteration=9, InterpolantAutomatonStates: 52, 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, 9 MinimizatonAttempts, 6 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 226 NumberOfCodeBlocks, 208 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 219 ConstructedInterpolants, 0 QuantifiedInterpolants, 1142 SizeOfPredicates, 0 NumberOfNonLiveVariables, 289 ConjunctsInSsa, 32 ConjunctsInUnsatCore, 16 InterpolantComputations, 6 PerfectInterpolantSequences, 96/287 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, ConComCheckerStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2025-03-04 08:03:57,042 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(valid-deref)