./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/valid-memsafety.prp --file ../../../trunk/examples/svcomp/memsafety/test-0019-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version da043454 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 ../../../trunk/examples/svcomp/memsafety/test-0019-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 40afad058466dec508429aba14a695fa830becbd8e90e3307f02f796ff077dad --- Real Ultimate output --- This is Ultimate 0.3.0-wip.fs.system-includes-da04345-m [2025-04-30 10:44:03,594 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-30 10:44:03,634 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-04-30 10:44:03,639 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-30 10:44:03,639 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-30 10:44:03,652 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-30 10:44:03,652 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-30 10:44:03,652 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-30 10:44:03,653 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-30 10:44:03,653 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-30 10:44:03,653 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-30 10:44:03,653 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-30 10:44:03,653 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-30 10:44:03,653 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-30 10:44:03,653 INFO L153 SettingsManager]: * Use SBE=true [2025-04-30 10:44:03,653 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-30 10:44:03,653 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-30 10:44:03,653 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-30 10:44:03,653 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-30 10:44:03,653 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-30 10:44:03,653 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-04-30 10:44:03,653 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-04-30 10:44:03,653 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-04-30 10:44:03,654 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-30 10:44:03,654 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-04-30 10:44:03,654 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-04-30 10:44:03,654 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-30 10:44:03,654 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-30 10:44:03,654 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-30 10:44:03,654 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-30 10:44:03,654 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-30 10:44:03,654 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-30 10:44:03,654 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-30 10:44:03,654 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-30 10:44:03,654 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-30 10:44:03,654 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-30 10:44:03,654 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-30 10:44:03,654 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-30 10:44:03,654 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-30 10:44:03,654 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-30 10:44:03,654 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-30 10:44:03,654 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-30 10:44:03,654 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-30 10:44:03,654 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-30 10:44:03,654 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-30 10:44:03,654 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-30 10:44:03,655 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 -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 40afad058466dec508429aba14a695fa830becbd8e90e3307f02f796ff077dad [2025-04-30 10:44:03,870 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-30 10:44:03,879 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-30 10:44:03,881 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-30 10:44:03,882 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-30 10:44:03,883 INFO L274 PluginConnector]: CDTParser initialized [2025-04-30 10:44:03,884 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/memsafety/test-0019-2.i [2025-04-30 10:44:05,213 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/477aaa522/d6cd6c83ceb9451a95d177e44c7a94d8/FLAG407fc1521 [2025-04-30 10:44:05,492 INFO L389 CDTParser]: Found 1 translation units. [2025-04-30 10:44:05,492 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/memsafety/test-0019-2.i [2025-04-30 10:44:05,505 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/477aaa522/d6cd6c83ceb9451a95d177e44c7a94d8/FLAG407fc1521 [2025-04-30 10:44:06,215 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/477aaa522/d6cd6c83ceb9451a95d177e44c7a94d8 [2025-04-30 10:44:06,217 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-30 10:44:06,218 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-04-30 10:44:06,219 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-30 10:44:06,219 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-30 10:44:06,222 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-30 10:44:06,222 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.04 10:44:06" (1/1) ... [2025-04-30 10:44:06,223 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@585f2ab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:44:06, skipping insertion in model container [2025-04-30 10:44:06,223 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.04 10:44:06" (1/1) ... [2025-04-30 10:44:06,250 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-30 10:44:06,434 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-30 10:44:06,441 INFO L200 MainTranslator]: Completed pre-run [2025-04-30 10:44:06,484 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-30 10:44:06,514 INFO L204 MainTranslator]: Completed translation [2025-04-30 10:44:06,518 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:44:06 WrapperNode [2025-04-30 10:44:06,519 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-30 10:44:06,519 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-30 10:44:06,519 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-30 10:44:06,519 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-30 10:44:06,524 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:44:06" (1/1) ... [2025-04-30 10:44:06,533 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:44:06" (1/1) ... [2025-04-30 10:44:06,551 INFO L138 Inliner]: procedures = 125, calls = 21, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 42 [2025-04-30 10:44:06,552 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-30 10:44:06,553 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-30 10:44:06,553 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-30 10:44:06,553 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-30 10:44:06,559 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:44:06" (1/1) ... [2025-04-30 10:44:06,559 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:44:06" (1/1) ... [2025-04-30 10:44:06,561 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:44:06" (1/1) ... [2025-04-30 10:44:06,575 INFO L175 MemorySlicer]: Split 8 memory accesses to 2 slices as follows [2, 6]. 75 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 4 writes are split as follows [0, 4]. [2025-04-30 10:44:06,575 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:44:06" (1/1) ... [2025-04-30 10:44:06,575 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:44:06" (1/1) ... [2025-04-30 10:44:06,579 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:44:06" (1/1) ... [2025-04-30 10:44:06,580 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:44:06" (1/1) ... [2025-04-30 10:44:06,581 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:44:06" (1/1) ... [2025-04-30 10:44:06,581 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:44:06" (1/1) ... [2025-04-30 10:44:06,582 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:44:06" (1/1) ... [2025-04-30 10:44:06,584 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-30 10:44:06,585 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-30 10:44:06,585 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-30 10:44:06,585 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-30 10:44:06,586 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:44:06" (1/1) ... [2025-04-30 10:44:06,590 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-30 10:44:06,598 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:44:06,608 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-04-30 10:44:06,610 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-04-30 10:44:06,625 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-04-30 10:44:06,626 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-30 10:44:06,626 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-04-30 10:44:06,626 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-04-30 10:44:06,626 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-04-30 10:44:06,626 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-04-30 10:44:06,626 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-04-30 10:44:06,626 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-04-30 10:44:06,626 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-04-30 10:44:06,626 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-04-30 10:44:06,626 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-30 10:44:06,626 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-30 10:44:06,713 INFO L234 CfgBuilder]: Building ICFG [2025-04-30 10:44:06,715 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-30 10:44:06,878 INFO L? ?]: Removed 49 outVars from TransFormulas that were not future-live. [2025-04-30 10:44:06,878 INFO L283 CfgBuilder]: Performing block encoding [2025-04-30 10:44:06,887 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-30 10:44:06,887 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-30 10:44:06,888 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.04 10:44:06 BoogieIcfgContainer [2025-04-30 10:44:06,888 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-30 10:44:06,890 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-30 10:44:06,890 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-30 10:44:06,893 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-30 10:44:06,894 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.04 10:44:06" (1/3) ... [2025-04-30 10:44:06,894 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4734c794 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.04 10:44:06, skipping insertion in model container [2025-04-30 10:44:06,895 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:44:06" (2/3) ... [2025-04-30 10:44:06,895 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4734c794 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.04 10:44:06, skipping insertion in model container [2025-04-30 10:44:06,895 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.04 10:44:06" (3/3) ... [2025-04-30 10:44:06,896 INFO L128 eAbstractionObserver]: Analyzing ICFG test-0019-2.i [2025-04-30 10:44:06,905 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-30 10:44:06,906 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG test-0019-2.i that has 1 procedures, 43 locations, 43 edges, 1 initial locations, 0 loop locations, and 19 error locations. [2025-04-30 10:44:06,933 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-30 10:44:06,941 INFO L340 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;@f446451, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-30 10:44:06,942 INFO L341 AbstractCegarLoop]: Starting to check reachability of 19 error locations. [2025-04-30 10:44:06,945 INFO L278 IsEmpty]: Start isEmpty. Operand has 43 states, 23 states have (on average 1.8695652173913044) internal successors, (43), 42 states have internal predecessors, (43), 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-04-30 10:44:06,948 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2025-04-30 10:44:06,948 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:44:06,949 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1] [2025-04-30 10:44:06,949 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-04-30 10:44:06,953 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:44:06,953 INFO L85 PathProgramCache]: Analyzing trace with hash 29857, now seen corresponding path program 1 times [2025-04-30 10:44:06,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:44:06,959 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2039494644] [2025-04-30 10:44:06,959 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:44:06,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:44:07,024 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-30 10:44:07,039 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-30 10:44:07,040 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:44:07,040 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:44:07,207 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:44:07,209 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:44:07,209 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2039494644] [2025-04-30 10:44:07,210 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2039494644] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:44:07,210 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:44:07,210 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-30 10:44:07,212 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1976497468] [2025-04-30 10:44:07,213 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:44:07,215 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-30 10:44:07,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:44:07,232 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-30 10:44:07,232 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-30 10:44:07,234 INFO L87 Difference]: Start difference. First operand has 43 states, 23 states have (on average 1.8695652173913044) internal successors, (43), 42 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:44:07,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:44:07,289 INFO L93 Difference]: Finished difference Result 41 states and 41 transitions. [2025-04-30 10:44:07,290 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-30 10:44:07,291 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2025-04-30 10:44:07,291 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:44:07,294 INFO L225 Difference]: With dead ends: 41 [2025-04-30 10:44:07,296 INFO L226 Difference]: Without dead ends: 39 [2025-04-30 10:44:07,298 INFO L436 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-04-30 10:44:07,301 INFO L437 NwaCegarLoop]: 36 mSDtfsCounter, 1 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-30 10:44:07,302 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 54 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-30 10:44:07,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2025-04-30 10:44:07,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2025-04-30 10:44:07,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 22 states have (on average 1.7727272727272727) internal successors, (39), 38 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:44:07,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 39 transitions. [2025-04-30 10:44:07,324 INFO L79 Accepts]: Start accepts. Automaton has 39 states and 39 transitions. Word has length 3 [2025-04-30 10:44:07,324 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:44:07,324 INFO L485 AbstractCegarLoop]: Abstraction has 39 states and 39 transitions. [2025-04-30 10:44:07,324 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:44:07,326 INFO L278 IsEmpty]: Start isEmpty. Operand 39 states and 39 transitions. [2025-04-30 10:44:07,326 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2025-04-30 10:44:07,326 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:44:07,326 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1] [2025-04-30 10:44:07,327 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-30 10:44:07,327 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-04-30 10:44:07,327 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:44:07,328 INFO L85 PathProgramCache]: Analyzing trace with hash 29858, now seen corresponding path program 1 times [2025-04-30 10:44:07,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:44:07,328 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1744219022] [2025-04-30 10:44:07,328 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:44:07,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:44:07,336 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-30 10:44:07,345 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-30 10:44:07,348 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:44:07,348 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:44:07,497 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:44:07,498 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:44:07,498 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1744219022] [2025-04-30 10:44:07,498 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1744219022] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:44:07,498 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:44:07,498 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-30 10:44:07,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [899052456] [2025-04-30 10:44:07,499 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:44:07,499 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-30 10:44:07,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:44:07,500 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-30 10:44:07,500 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-30 10:44:07,500 INFO L87 Difference]: Start difference. First operand 39 states and 39 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:44:07,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:44:07,536 INFO L93 Difference]: Finished difference Result 37 states and 37 transitions. [2025-04-30 10:44:07,536 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-30 10:44:07,536 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2025-04-30 10:44:07,536 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:44:07,536 INFO L225 Difference]: With dead ends: 37 [2025-04-30 10:44:07,537 INFO L226 Difference]: Without dead ends: 37 [2025-04-30 10:44:07,537 INFO L436 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-04-30 10:44:07,537 INFO L437 NwaCegarLoop]: 34 mSDtfsCounter, 1 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 57 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-04-30 10:44:07,538 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 57 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-30 10:44:07,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2025-04-30 10:44:07,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2025-04-30 10:44:07,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 22 states have (on average 1.6818181818181819) internal successors, (37), 36 states have internal predecessors, (37), 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-04-30 10:44:07,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 37 transitions. [2025-04-30 10:44:07,540 INFO L79 Accepts]: Start accepts. Automaton has 37 states and 37 transitions. Word has length 3 [2025-04-30 10:44:07,540 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:44:07,540 INFO L485 AbstractCegarLoop]: Abstraction has 37 states and 37 transitions. [2025-04-30 10:44:07,540 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:44:07,540 INFO L278 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2025-04-30 10:44:07,540 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-04-30 10:44:07,540 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:44:07,540 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:44:07,541 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-30 10:44:07,541 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-04-30 10:44:07,541 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:44:07,541 INFO L85 PathProgramCache]: Analyzing trace with hash 59200011, now seen corresponding path program 1 times [2025-04-30 10:44:07,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:44:07,541 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1266365079] [2025-04-30 10:44:07,541 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:44:07,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:44:07,551 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-30 10:44:07,558 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-30 10:44:07,558 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:44:07,558 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:44:07,633 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:44:07,634 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:44:07,634 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1266365079] [2025-04-30 10:44:07,634 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1266365079] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:44:07,634 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:44:07,634 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-30 10:44:07,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [483421289] [2025-04-30 10:44:07,635 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:44:07,635 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-30 10:44:07,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:44:07,636 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-30 10:44:07,636 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-30 10:44:07,636 INFO L87 Difference]: Start difference. First operand 37 states and 37 transitions. Second operand has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:44:07,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:44:07,724 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2025-04-30 10:44:07,725 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-30 10:44:07,725 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2025-04-30 10:44:07,725 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:44:07,726 INFO L225 Difference]: With dead ends: 39 [2025-04-30 10:44:07,726 INFO L226 Difference]: Without dead ends: 39 [2025-04-30 10:44:07,727 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-04-30 10:44:07,727 INFO L437 NwaCegarLoop]: 19 mSDtfsCounter, 31 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-30 10:44:07,727 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 47 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-30 10:44:07,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2025-04-30 10:44:07,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 35. [2025-04-30 10:44:07,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 23 states have (on average 1.565217391304348) internal successors, (36), 34 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-04-30 10:44:07,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 36 transitions. [2025-04-30 10:44:07,732 INFO L79 Accepts]: Start accepts. Automaton has 35 states and 36 transitions. Word has length 8 [2025-04-30 10:44:07,732 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:44:07,732 INFO L485 AbstractCegarLoop]: Abstraction has 35 states and 36 transitions. [2025-04-30 10:44:07,732 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:44:07,732 INFO L278 IsEmpty]: Start isEmpty. Operand 35 states and 36 transitions. [2025-04-30 10:44:07,732 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-04-30 10:44:07,732 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:44:07,733 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:44:07,733 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-30 10:44:07,733 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-04-30 10:44:07,734 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:44:07,735 INFO L85 PathProgramCache]: Analyzing trace with hash 59200012, now seen corresponding path program 1 times [2025-04-30 10:44:07,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:44:07,735 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [215110556] [2025-04-30 10:44:07,735 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:44:07,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:44:07,745 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-30 10:44:07,752 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-30 10:44:07,754 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:44:07,754 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:44:07,880 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:44:07,881 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:44:07,882 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [215110556] [2025-04-30 10:44:07,882 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [215110556] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:44:07,882 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:44:07,882 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-30 10:44:07,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [702642964] [2025-04-30 10:44:07,882 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:44:07,882 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-30 10:44:07,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:44:07,883 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-30 10:44:07,883 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-30 10:44:07,883 INFO L87 Difference]: Start difference. First operand 35 states and 36 transitions. Second operand has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:44:07,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:44:07,939 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2025-04-30 10:44:07,939 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-30 10:44:07,940 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2025-04-30 10:44:07,940 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:44:07,940 INFO L225 Difference]: With dead ends: 31 [2025-04-30 10:44:07,941 INFO L226 Difference]: Without dead ends: 31 [2025-04-30 10:44:07,941 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-04-30 10:44:07,941 INFO L437 NwaCegarLoop]: 21 mSDtfsCounter, 20 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-30 10:44:07,941 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 59 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-30 10:44:07,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2025-04-30 10:44:07,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2025-04-30 10:44:07,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 23 states have (on average 1.3478260869565217) internal successors, (31), 30 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:44:07,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 31 transitions. [2025-04-30 10:44:07,943 INFO L79 Accepts]: Start accepts. Automaton has 31 states and 31 transitions. Word has length 8 [2025-04-30 10:44:07,943 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:44:07,943 INFO L485 AbstractCegarLoop]: Abstraction has 31 states and 31 transitions. [2025-04-30 10:44:07,943 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:44:07,943 INFO L278 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2025-04-30 10:44:07,944 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-04-30 10:44:07,944 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:44:07,944 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:44:07,944 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-30 10:44:07,944 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-04-30 10:44:07,944 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:44:07,945 INFO L85 PathProgramCache]: Analyzing trace with hash 406185098, now seen corresponding path program 1 times [2025-04-30 10:44:07,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:44:07,945 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1061256773] [2025-04-30 10:44:07,945 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:44:07,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:44:07,953 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-04-30 10:44:07,962 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-04-30 10:44:07,963 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:44:07,963 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:44:08,151 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:44:08,152 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:44:08,152 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1061256773] [2025-04-30 10:44:08,152 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1061256773] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:44:08,152 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:44:08,152 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-04-30 10:44:08,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1469150374] [2025-04-30 10:44:08,153 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:44:08,153 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-30 10:44:08,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:44:08,153 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-30 10:44:08,153 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-04-30 10:44:08,154 INFO L87 Difference]: Start difference. First operand 31 states and 31 transitions. Second operand has 8 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 8 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:44:08,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:44:08,218 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2025-04-30 10:44:08,218 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-30 10:44:08,219 INFO L79 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 8 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2025-04-30 10:44:08,219 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:44:08,219 INFO L225 Difference]: With dead ends: 30 [2025-04-30 10:44:08,219 INFO L226 Difference]: Without dead ends: 30 [2025-04-30 10:44:08,219 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2025-04-30 10:44:08,221 INFO L437 NwaCegarLoop]: 17 mSDtfsCounter, 17 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-30 10:44:08,221 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 94 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-30 10:44:08,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2025-04-30 10:44:08,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2025-04-30 10:44:08,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 29 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:44:08,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 30 transitions. [2025-04-30 10:44:08,224 INFO L79 Accepts]: Start accepts. Automaton has 30 states and 30 transitions. Word has length 13 [2025-04-30 10:44:08,224 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:44:08,224 INFO L485 AbstractCegarLoop]: Abstraction has 30 states and 30 transitions. [2025-04-30 10:44:08,224 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 8 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:44:08,224 INFO L278 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2025-04-30 10:44:08,225 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-04-30 10:44:08,225 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:44:08,225 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:44:08,225 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-30 10:44:08,225 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-04-30 10:44:08,225 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:44:08,225 INFO L85 PathProgramCache]: Analyzing trace with hash -293163793, now seen corresponding path program 1 times [2025-04-30 10:44:08,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:44:08,225 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1292497479] [2025-04-30 10:44:08,226 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:44:08,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:44:08,238 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-30 10:44:08,243 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-30 10:44:08,246 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:44:08,246 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:44:08,401 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:44:08,402 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:44:08,402 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1292497479] [2025-04-30 10:44:08,402 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1292497479] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:44:08,402 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:44:08,402 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-04-30 10:44:08,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2036244075] [2025-04-30 10:44:08,402 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:44:08,403 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-30 10:44:08,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:44:08,403 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-30 10:44:08,403 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-04-30 10:44:08,404 INFO L87 Difference]: Start difference. First operand 30 states and 30 transitions. Second operand has 8 states, 7 states have (on average 2.0) internal successors, (14), 8 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:44:08,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:44:08,493 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2025-04-30 10:44:08,493 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-30 10:44:08,493 INFO L79 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.0) internal successors, (14), 8 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2025-04-30 10:44:08,493 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:44:08,493 INFO L225 Difference]: With dead ends: 29 [2025-04-30 10:44:08,493 INFO L226 Difference]: Without dead ends: 29 [2025-04-30 10:44:08,494 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2025-04-30 10:44:08,494 INFO L437 NwaCegarLoop]: 12 mSDtfsCounter, 17 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-30 10:44:08,494 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 54 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-30 10:44:08,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2025-04-30 10:44:08,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2025-04-30 10:44:08,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 28 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-04-30 10:44:08,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2025-04-30 10:44:08,496 INFO L79 Accepts]: Start accepts. Automaton has 29 states and 29 transitions. Word has length 14 [2025-04-30 10:44:08,496 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:44:08,496 INFO L485 AbstractCegarLoop]: Abstraction has 29 states and 29 transitions. [2025-04-30 10:44:08,496 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.0) internal successors, (14), 8 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:44:08,496 INFO L278 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2025-04-30 10:44:08,496 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-04-30 10:44:08,496 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:44:08,496 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:44:08,496 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-04-30 10:44:08,496 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-04-30 10:44:08,499 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:44:08,499 INFO L85 PathProgramCache]: Analyzing trace with hash -498142932, now seen corresponding path program 1 times [2025-04-30 10:44:08,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:44:08,500 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [916860451] [2025-04-30 10:44:08,500 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:44:08,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:44:08,508 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-04-30 10:44:08,522 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-04-30 10:44:08,523 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:44:08,523 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:44:08,675 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:44:08,675 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:44:08,676 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [916860451] [2025-04-30 10:44:08,676 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [916860451] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:44:08,676 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:44:08,676 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-04-30 10:44:08,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1974334868] [2025-04-30 10:44:08,676 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:44:08,676 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-30 10:44:08,676 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:44:08,676 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-30 10:44:08,676 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-04-30 10:44:08,676 INFO L87 Difference]: Start difference. First operand 29 states and 29 transitions. Second operand has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 8 states have internal predecessors, (15), 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-04-30 10:44:08,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:44:08,749 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2025-04-30 10:44:08,750 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-30 10:44:08,750 INFO L79 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 8 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2025-04-30 10:44:08,750 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:44:08,750 INFO L225 Difference]: With dead ends: 28 [2025-04-30 10:44:08,750 INFO L226 Difference]: Without dead ends: 28 [2025-04-30 10:44:08,750 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2025-04-30 10:44:08,751 INFO L437 NwaCegarLoop]: 15 mSDtfsCounter, 8 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-30 10:44:08,751 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 52 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-30 10:44:08,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2025-04-30 10:44:08,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2025-04-30 10:44:08,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 27 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:44:08,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 28 transitions. [2025-04-30 10:44:08,753 INFO L79 Accepts]: Start accepts. Automaton has 28 states and 28 transitions. Word has length 15 [2025-04-30 10:44:08,753 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:44:08,753 INFO L485 AbstractCegarLoop]: Abstraction has 28 states and 28 transitions. [2025-04-30 10:44:08,753 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 8 states have internal predecessors, (15), 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-04-30 10:44:08,753 INFO L278 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2025-04-30 10:44:08,753 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-04-30 10:44:08,754 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:44:08,754 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:44:08,754 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-04-30 10:44:08,754 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-04-30 10:44:08,754 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:44:08,754 INFO L85 PathProgramCache]: Analyzing trace with hash 1750799681, now seen corresponding path program 1 times [2025-04-30 10:44:08,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:44:08,754 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1444764173] [2025-04-30 10:44:08,754 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:44:08,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:44:08,764 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-30 10:44:08,774 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-30 10:44:08,775 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:44:08,775 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-30 10:44:08,775 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-30 10:44:08,778 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-30 10:44:08,787 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-30 10:44:08,789 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:44:08,789 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-30 10:44:08,807 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-30 10:44:08,807 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-30 10:44:08,808 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK (18 of 19 remaining) [2025-04-30 10:44:08,809 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 19 remaining) [2025-04-30 10:44:08,809 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 19 remaining) [2025-04-30 10:44:08,809 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 19 remaining) [2025-04-30 10:44:08,809 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 19 remaining) [2025-04-30 10:44:08,809 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 19 remaining) [2025-04-30 10:44:08,810 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 19 remaining) [2025-04-30 10:44:08,810 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 19 remaining) [2025-04-30 10:44:08,810 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 19 remaining) [2025-04-30 10:44:08,810 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_FREE (9 of 19 remaining) [2025-04-30 10:44:08,810 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_FREE (8 of 19 remaining) [2025-04-30 10:44:08,810 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_FREE (7 of 19 remaining) [2025-04-30 10:44:08,810 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_FREE (6 of 19 remaining) [2025-04-30 10:44:08,810 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE (5 of 19 remaining) [2025-04-30 10:44:08,810 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_FREE (4 of 19 remaining) [2025-04-30 10:44:08,810 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 19 remaining) [2025-04-30 10:44:08,810 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 19 remaining) [2025-04-30 10:44:08,811 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 19 remaining) [2025-04-30 10:44:08,811 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 19 remaining) [2025-04-30 10:44:08,811 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-04-30 10:44:08,814 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:44:08,837 INFO L171 ceAbstractionStarter]: Computing trace abstraction results [2025-04-30 10:44:08,839 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.04 10:44:08 BoogieIcfgContainer [2025-04-30 10:44:08,840 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-04-30 10:44:08,840 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-04-30 10:44:08,840 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-04-30 10:44:08,840 INFO L274 PluginConnector]: Witness Printer initialized [2025-04-30 10:44:08,841 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.04 10:44:06" (3/4) ... [2025-04-30 10:44:08,842 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-04-30 10:44:08,843 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-04-30 10:44:08,843 INFO L158 Benchmark]: Toolchain (without parser) took 2625.03ms. Allocated memory is still 142.6MB. Free memory was 110.9MB in the beginning and 52.4MB in the end (delta: 58.5MB). Peak memory consumption was 62.0MB. Max. memory is 16.1GB. [2025-04-30 10:44:08,843 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 201.3MB. Free memory is still 126.3MB. There was no memory consumed. Max. memory is 16.1GB. [2025-04-30 10:44:08,843 INFO L158 Benchmark]: CACSL2BoogieTranslator took 300.03ms. Allocated memory is still 142.6MB. Free memory was 110.9MB in the beginning and 90.7MB in the end (delta: 20.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-04-30 10:44:08,843 INFO L158 Benchmark]: Boogie Procedure Inliner took 32.88ms. Allocated memory is still 142.6MB. Free memory was 90.7MB in the beginning and 89.0MB in the end (delta: 1.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-04-30 10:44:08,843 INFO L158 Benchmark]: Boogie Preprocessor took 31.27ms. Allocated memory is still 142.6MB. Free memory was 89.0MB in the beginning and 87.2MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. [2025-04-30 10:44:08,844 INFO L158 Benchmark]: RCFGBuilder took 303.13ms. Allocated memory is still 142.6MB. Free memory was 87.2MB in the beginning and 72.7MB in the end (delta: 14.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-04-30 10:44:08,844 INFO L158 Benchmark]: TraceAbstraction took 1949.94ms. Allocated memory is still 142.6MB. Free memory was 71.8MB in the beginning and 52.5MB in the end (delta: 19.3MB). Peak memory consumption was 20.0MB. Max. memory is 16.1GB. [2025-04-30 10:44:08,844 INFO L158 Benchmark]: Witness Printer took 2.49ms. Allocated memory is still 142.6MB. Free memory was 52.5MB in the beginning and 52.4MB in the end (delta: 37.0kB). There was no memory consumed. Max. memory is 16.1GB. [2025-04-30 10:44:08,845 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 126.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 300.03ms. Allocated memory is still 142.6MB. Free memory was 110.9MB in the beginning and 90.7MB in the end (delta: 20.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 32.88ms. Allocated memory is still 142.6MB. Free memory was 90.7MB in the beginning and 89.0MB in the end (delta: 1.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 31.27ms. Allocated memory is still 142.6MB. Free memory was 89.0MB in the beginning and 87.2MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 303.13ms. Allocated memory is still 142.6MB. Free memory was 87.2MB in the beginning and 72.7MB in the end (delta: 14.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 1949.94ms. Allocated memory is still 142.6MB. Free memory was 71.8MB in the beginning and 52.5MB in the end (delta: 19.3MB). Peak memory consumption was 20.0MB. Max. memory is 16.1GB. * Witness Printer took 2.49ms. Allocated memory is still 142.6MB. Free memory was 52.5MB in the beginning and 52.4MB in the end (delta: 37.0kB). There was no memory consumed. 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 - UnprovableResult [Line: 543]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 543. Possible FailurePath: [L544] TData data; [L545] CALL alloc_data(&data) [L529] pdata->lo = malloc(16) [L530] pdata->hi = malloc(24) [L545] RET alloc_data(&data) [L546] CALL free_data(&data) [L534] EXPR data->lo [L534] void *lo = data->lo; [L535] EXPR data->hi [L535] void *hi = data->hi; [L536] COND FALSE !(lo == hi) VAL [data={3:0}] [L540] data->lo = (void *) 0 [L541] data->hi = (void *) 0 [L546] RET free_data(&data) [L547] return 0; [L547] return 0; VAL [\result=0] - 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. - 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: 537]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 537]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 537]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 538]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 538]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 538]: Unable to prove that free always succeeds Unable to prove that free 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, 43 locations, 43 edges, 19 error locations. Started 1 CEGAR loops. OverallTime: 1.9s, OverallIterations: 8, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 95 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 95 mSDsluCounter, 417 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 263 mSDsCounter, 17 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 429 IncrementalHoareTripleChecker+Invalid, 446 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 17 mSolverCounterUnsat, 154 mSDtfsCounter, 429 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 44 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=43occurred in iteration=0, InterpolantAutomatonStates: 41, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 7 MinimizatonAttempts, 4 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 80 NumberOfCodeBlocks, 80 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 57 ConstructedInterpolants, 0 QuantifiedInterpolants, 383 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-04-30 10:44:08,855 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 Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### 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 ../../../trunk/examples/svcomp/memsafety/test-0019-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 40afad058466dec508429aba14a695fa830becbd8e90e3307f02f796ff077dad --- Real Ultimate output --- This is Ultimate 0.3.0-wip.fs.system-includes-da04345-m [2025-04-30 10:44:10,569 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-30 10:44:10,639 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2025-04-30 10:44:10,646 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-30 10:44:10,646 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-30 10:44:10,670 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-30 10:44:10,672 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-30 10:44:10,672 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-30 10:44:10,673 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-30 10:44:10,673 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-30 10:44:10,673 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-30 10:44:10,673 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-30 10:44:10,674 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-30 10:44:10,674 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-30 10:44:10,675 INFO L153 SettingsManager]: * Use SBE=true [2025-04-30 10:44:10,675 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-30 10:44:10,675 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-30 10:44:10,675 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-30 10:44:10,675 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-30 10:44:10,675 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-30 10:44:10,675 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-04-30 10:44:10,675 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-04-30 10:44:10,675 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-04-30 10:44:10,675 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-30 10:44:10,675 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-04-30 10:44:10,676 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-04-30 10:44:10,676 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-04-30 10:44:10,676 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-04-30 10:44:10,676 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-30 10:44:10,676 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-30 10:44:10,676 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-30 10:44:10,676 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-30 10:44:10,676 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-30 10:44:10,677 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-30 10:44:10,677 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-30 10:44:10,677 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-30 10:44:10,677 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-30 10:44:10,677 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-30 10:44:10,677 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-30 10:44:10,677 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-30 10:44:10,677 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-30 10:44:10,677 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-30 10:44:10,678 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-30 10:44:10,678 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-04-30 10:44:10,678 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-04-30 10:44:10,678 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-30 10:44:10,678 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-30 10:44:10,678 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-30 10:44:10,678 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 -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 40afad058466dec508429aba14a695fa830becbd8e90e3307f02f796ff077dad [2025-04-30 10:44:10,910 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-30 10:44:10,918 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-30 10:44:10,920 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-30 10:44:10,921 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-30 10:44:10,921 INFO L274 PluginConnector]: CDTParser initialized [2025-04-30 10:44:10,922 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/memsafety/test-0019-2.i [2025-04-30 10:44:12,233 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/03c5bc36c/554a314fd84444d5b5b64397b701d8b8/FLAG2fa4dd416 [2025-04-30 10:44:12,417 INFO L389 CDTParser]: Found 1 translation units. [2025-04-30 10:44:12,418 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/memsafety/test-0019-2.i [2025-04-30 10:44:12,431 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/03c5bc36c/554a314fd84444d5b5b64397b701d8b8/FLAG2fa4dd416 [2025-04-30 10:44:13,282 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/03c5bc36c/554a314fd84444d5b5b64397b701d8b8 [2025-04-30 10:44:13,284 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-30 10:44:13,285 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-04-30 10:44:13,286 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-30 10:44:13,286 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-30 10:44:13,289 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-30 10:44:13,289 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.04 10:44:13" (1/1) ... [2025-04-30 10:44:13,291 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@765297b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:44:13, skipping insertion in model container [2025-04-30 10:44:13,291 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.04 10:44:13" (1/1) ... [2025-04-30 10:44:13,312 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-30 10:44:13,512 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-30 10:44:13,521 INFO L200 MainTranslator]: Completed pre-run [2025-04-30 10:44:13,562 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-30 10:44:13,594 INFO L204 MainTranslator]: Completed translation [2025-04-30 10:44:13,595 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:44:13 WrapperNode [2025-04-30 10:44:13,595 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-30 10:44:13,596 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-30 10:44:13,596 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-30 10:44:13,596 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-30 10:44:13,600 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:44:13" (1/1) ... [2025-04-30 10:44:13,612 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:44:13" (1/1) ... [2025-04-30 10:44:13,630 INFO L138 Inliner]: procedures = 126, calls = 21, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 43 [2025-04-30 10:44:13,631 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-30 10:44:13,632 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-30 10:44:13,632 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-30 10:44:13,632 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-30 10:44:13,637 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:44:13" (1/1) ... [2025-04-30 10:44:13,637 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:44:13" (1/1) ... [2025-04-30 10:44:13,640 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:44:13" (1/1) ... [2025-04-30 10:44:13,659 INFO L175 MemorySlicer]: Split 8 memory accesses to 2 slices as follows [2, 6]. 75 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 4 writes are split as follows [0, 4]. [2025-04-30 10:44:13,659 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:44:13" (1/1) ... [2025-04-30 10:44:13,659 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:44:13" (1/1) ... [2025-04-30 10:44:13,664 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:44:13" (1/1) ... [2025-04-30 10:44:13,664 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:44:13" (1/1) ... [2025-04-30 10:44:13,665 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:44:13" (1/1) ... [2025-04-30 10:44:13,666 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:44:13" (1/1) ... [2025-04-30 10:44:13,667 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:44:13" (1/1) ... [2025-04-30 10:44:13,669 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-30 10:44:13,670 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-30 10:44:13,670 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-30 10:44:13,670 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-30 10:44:13,673 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:44:13" (1/1) ... [2025-04-30 10:44:13,676 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-30 10:44:13,687 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:44:13,698 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-04-30 10:44:13,702 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-04-30 10:44:13,721 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-04-30 10:44:13,721 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-30 10:44:13,721 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-04-30 10:44:13,721 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-04-30 10:44:13,721 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-04-30 10:44:13,722 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-04-30 10:44:13,722 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-04-30 10:44:13,722 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-04-30 10:44:13,722 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-04-30 10:44:13,722 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2025-04-30 10:44:13,722 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-30 10:44:13,722 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-30 10:44:13,817 INFO L234 CfgBuilder]: Building ICFG [2025-04-30 10:44:13,818 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-30 10:44:14,024 INFO L? ?]: Removed 49 outVars from TransFormulas that were not future-live. [2025-04-30 10:44:14,024 INFO L283 CfgBuilder]: Performing block encoding [2025-04-30 10:44:14,031 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-30 10:44:14,031 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-30 10:44:14,031 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.04 10:44:14 BoogieIcfgContainer [2025-04-30 10:44:14,032 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-30 10:44:14,034 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-30 10:44:14,034 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-30 10:44:14,037 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-30 10:44:14,038 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.04 10:44:13" (1/3) ... [2025-04-30 10:44:14,039 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a3f6190 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.04 10:44:14, skipping insertion in model container [2025-04-30 10:44:14,039 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:44:13" (2/3) ... [2025-04-30 10:44:14,040 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a3f6190 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.04 10:44:14, skipping insertion in model container [2025-04-30 10:44:14,040 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.04 10:44:14" (3/3) ... [2025-04-30 10:44:14,041 INFO L128 eAbstractionObserver]: Analyzing ICFG test-0019-2.i [2025-04-30 10:44:14,050 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-30 10:44:14,051 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG test-0019-2.i that has 1 procedures, 43 locations, 43 edges, 1 initial locations, 0 loop locations, and 19 error locations. [2025-04-30 10:44:14,077 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-30 10:44:14,084 INFO L340 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;@78bf7243, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-30 10:44:14,084 INFO L341 AbstractCegarLoop]: Starting to check reachability of 19 error locations. [2025-04-30 10:44:14,087 INFO L278 IsEmpty]: Start isEmpty. Operand has 43 states, 23 states have (on average 1.8695652173913044) internal successors, (43), 42 states have internal predecessors, (43), 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-04-30 10:44:14,089 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2025-04-30 10:44:14,089 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:44:14,090 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1] [2025-04-30 10:44:14,090 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-04-30 10:44:14,093 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:44:14,093 INFO L85 PathProgramCache]: Analyzing trace with hash 29857, now seen corresponding path program 1 times [2025-04-30 10:44:14,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-04-30 10:44:14,100 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1624892932] [2025-04-30 10:44:14,100 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:44:14,101 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:44:14,101 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:44:14,103 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-04-30 10:44:14,104 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-04-30 10:44:14,157 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-30 10:44:14,166 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-30 10:44:14,167 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:44:14,167 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:44:14,169 INFO L256 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-04-30 10:44:14,173 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:44:14,263 INFO L325 Elim1Store]: treesize reduction 19, result has 26.9 percent of original size [2025-04-30 10:44:14,264 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 15 [2025-04-30 10:44:14,285 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:44:14,286 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-30 10:44:14,287 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-04-30 10:44:14,287 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1624892932] [2025-04-30 10:44:14,287 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1624892932] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:44:14,289 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:44:14,289 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-30 10:44:14,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1932611732] [2025-04-30 10:44:14,290 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:44:14,292 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-30 10:44:14,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-04-30 10:44:14,306 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-30 10:44:14,306 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-30 10:44:14,308 INFO L87 Difference]: Start difference. First operand has 43 states, 23 states have (on average 1.8695652173913044) internal successors, (43), 42 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:44:14,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:44:14,371 INFO L93 Difference]: Finished difference Result 41 states and 41 transitions. [2025-04-30 10:44:14,372 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-30 10:44:14,373 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2025-04-30 10:44:14,373 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:44:14,377 INFO L225 Difference]: With dead ends: 41 [2025-04-30 10:44:14,377 INFO L226 Difference]: Without dead ends: 39 [2025-04-30 10:44:14,378 INFO L436 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-04-30 10:44:14,380 INFO L437 NwaCegarLoop]: 36 mSDtfsCounter, 1 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-30 10:44:14,381 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 54 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-30 10:44:14,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2025-04-30 10:44:14,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2025-04-30 10:44:14,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 22 states have (on average 1.7727272727272727) internal successors, (39), 38 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:44:14,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 39 transitions. [2025-04-30 10:44:14,406 INFO L79 Accepts]: Start accepts. Automaton has 39 states and 39 transitions. Word has length 3 [2025-04-30 10:44:14,406 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:44:14,406 INFO L485 AbstractCegarLoop]: Abstraction has 39 states and 39 transitions. [2025-04-30 10:44:14,407 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:44:14,407 INFO L278 IsEmpty]: Start isEmpty. Operand 39 states and 39 transitions. [2025-04-30 10:44:14,407 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2025-04-30 10:44:14,407 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:44:14,407 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1] [2025-04-30 10:44:14,413 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-04-30 10:44:14,610 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:44:14,610 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-04-30 10:44:14,611 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:44:14,611 INFO L85 PathProgramCache]: Analyzing trace with hash 29858, now seen corresponding path program 1 times [2025-04-30 10:44:14,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-04-30 10:44:14,611 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [127427278] [2025-04-30 10:44:14,611 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:44:14,611 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:44:14,611 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:44:14,614 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-04-30 10:44:14,614 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-04-30 10:44:14,650 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-30 10:44:14,657 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-30 10:44:14,658 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:44:14,658 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:44:14,660 INFO L256 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-04-30 10:44:14,663 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:44:14,691 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-30 10:44:14,692 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 5 [2025-04-30 10:44:14,697 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2025-04-30 10:44:14,706 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:44:14,706 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-30 10:44:14,707 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-04-30 10:44:14,707 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [127427278] [2025-04-30 10:44:14,707 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [127427278] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:44:14,707 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:44:14,707 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-30 10:44:14,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [608247984] [2025-04-30 10:44:14,707 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:44:14,708 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-30 10:44:14,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-04-30 10:44:14,708 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-30 10:44:14,708 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-30 10:44:14,709 INFO L87 Difference]: Start difference. First operand 39 states and 39 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:44:14,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:44:14,753 INFO L93 Difference]: Finished difference Result 38 states and 38 transitions. [2025-04-30 10:44:14,754 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-30 10:44:14,754 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2025-04-30 10:44:14,754 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:44:14,754 INFO L225 Difference]: With dead ends: 38 [2025-04-30 10:44:14,754 INFO L226 Difference]: Without dead ends: 38 [2025-04-30 10:44:14,755 INFO L436 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-04-30 10:44:14,755 INFO L437 NwaCegarLoop]: 36 mSDtfsCounter, 1 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-30 10:44:14,755 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 59 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-30 10:44:14,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2025-04-30 10:44:14,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2025-04-30 10:44:14,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 22 states have (on average 1.7272727272727273) internal successors, (38), 37 states have internal predecessors, (38), 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-04-30 10:44:14,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 38 transitions. [2025-04-30 10:44:14,758 INFO L79 Accepts]: Start accepts. Automaton has 38 states and 38 transitions. Word has length 3 [2025-04-30 10:44:14,758 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:44:14,758 INFO L485 AbstractCegarLoop]: Abstraction has 38 states and 38 transitions. [2025-04-30 10:44:14,760 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:44:14,760 INFO L278 IsEmpty]: Start isEmpty. Operand 38 states and 38 transitions. [2025-04-30 10:44:14,760 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-04-30 10:44:14,760 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:44:14,761 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-04-30 10:44:14,766 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-04-30 10:44:14,961 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:44:14,961 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-04-30 10:44:14,961 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:44:14,962 INFO L85 PathProgramCache]: Analyzing trace with hash 28691811, now seen corresponding path program 1 times [2025-04-30 10:44:14,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-04-30 10:44:14,962 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1083504831] [2025-04-30 10:44:14,962 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:44:14,962 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:44:14,962 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:44:14,964 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-04-30 10:44:14,964 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-04-30 10:44:15,004 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-30 10:44:15,016 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-30 10:44:15,016 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:44:15,017 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:44:15,020 INFO L256 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-04-30 10:44:15,022 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:44:15,041 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-30 10:44:15,042 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 5 [2025-04-30 10:44:15,045 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2025-04-30 10:44:15,098 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-30 10:44:15,099 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2025-04-30 10:44:15,109 INFO L325 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2025-04-30 10:44:15,109 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2025-04-30 10:44:15,117 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:44:15,118 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-30 10:44:15,118 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-04-30 10:44:15,118 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1083504831] [2025-04-30 10:44:15,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1083504831] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:44:15,118 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:44:15,118 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-30 10:44:15,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1391973894] [2025-04-30 10:44:15,118 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:44:15,118 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-30 10:44:15,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-04-30 10:44:15,119 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-30 10:44:15,119 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-30 10:44:15,119 INFO L87 Difference]: Start difference. First operand 38 states and 38 transitions. Second operand has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:44:15,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:44:15,162 INFO L93 Difference]: Finished difference Result 37 states and 37 transitions. [2025-04-30 10:44:15,162 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-30 10:44:15,162 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2025-04-30 10:44:15,163 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:44:15,163 INFO L225 Difference]: With dead ends: 37 [2025-04-30 10:44:15,163 INFO L226 Difference]: Without dead ends: 37 [2025-04-30 10:44:15,163 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-30 10:44:15,164 INFO L437 NwaCegarLoop]: 34 mSDtfsCounter, 0 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 57 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-04-30 10:44:15,164 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 57 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-30 10:44:15,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2025-04-30 10:44:15,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2025-04-30 10:44:15,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 22 states have (on average 1.6818181818181819) internal successors, (37), 36 states have internal predecessors, (37), 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-04-30 10:44:15,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 37 transitions. [2025-04-30 10:44:15,167 INFO L79 Accepts]: Start accepts. Automaton has 37 states and 37 transitions. Word has length 5 [2025-04-30 10:44:15,167 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:44:15,167 INFO L485 AbstractCegarLoop]: Abstraction has 37 states and 37 transitions. [2025-04-30 10:44:15,167 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:44:15,168 INFO L278 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2025-04-30 10:44:15,168 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-04-30 10:44:15,168 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:44:15,168 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:44:15,174 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-04-30 10:44:15,368 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:44:15,369 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-04-30 10:44:15,369 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:44:15,369 INFO L85 PathProgramCache]: Analyzing trace with hash 59200011, now seen corresponding path program 1 times [2025-04-30 10:44:15,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-04-30 10:44:15,369 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [295204536] [2025-04-30 10:44:15,370 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:44:15,370 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:44:15,370 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:44:15,371 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-04-30 10:44:15,373 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-04-30 10:44:15,417 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-30 10:44:15,426 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-30 10:44:15,427 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:44:15,427 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:44:15,427 INFO L256 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-04-30 10:44:15,429 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:44:15,476 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:44:15,477 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-30 10:44:15,477 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-04-30 10:44:15,477 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [295204536] [2025-04-30 10:44:15,477 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [295204536] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:44:15,477 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:44:15,477 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-30 10:44:15,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1063022174] [2025-04-30 10:44:15,478 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:44:15,478 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-30 10:44:15,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-04-30 10:44:15,478 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-30 10:44:15,479 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-30 10:44:15,479 INFO L87 Difference]: Start difference. First operand 37 states and 37 transitions. Second operand has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:44:15,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:44:15,603 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2025-04-30 10:44:15,603 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-30 10:44:15,603 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2025-04-30 10:44:15,604 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:44:15,604 INFO L225 Difference]: With dead ends: 39 [2025-04-30 10:44:15,604 INFO L226 Difference]: Without dead ends: 39 [2025-04-30 10:44:15,604 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-04-30 10:44:15,604 INFO L437 NwaCegarLoop]: 19 mSDtfsCounter, 31 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-30 10:44:15,605 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 47 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-30 10:44:15,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2025-04-30 10:44:15,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 35. [2025-04-30 10:44:15,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 23 states have (on average 1.565217391304348) internal successors, (36), 34 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-04-30 10:44:15,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 36 transitions. [2025-04-30 10:44:15,609 INFO L79 Accepts]: Start accepts. Automaton has 35 states and 36 transitions. Word has length 8 [2025-04-30 10:44:15,609 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:44:15,609 INFO L485 AbstractCegarLoop]: Abstraction has 35 states and 36 transitions. [2025-04-30 10:44:15,609 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:44:15,609 INFO L278 IsEmpty]: Start isEmpty. Operand 35 states and 36 transitions. [2025-04-30 10:44:15,609 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-04-30 10:44:15,609 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:44:15,609 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:44:15,616 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-04-30 10:44:15,810 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:44:15,810 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-04-30 10:44:15,810 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:44:15,811 INFO L85 PathProgramCache]: Analyzing trace with hash 59200012, now seen corresponding path program 1 times [2025-04-30 10:44:15,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-04-30 10:44:15,811 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1402296055] [2025-04-30 10:44:15,811 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:44:15,811 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:44:15,811 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:44:15,813 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-30 10:44:15,814 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-04-30 10:44:15,852 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-30 10:44:15,862 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-30 10:44:15,862 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:44:15,862 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:44:15,864 INFO L256 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-04-30 10:44:15,865 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:44:15,927 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:44:15,927 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-30 10:44:15,927 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-04-30 10:44:15,927 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1402296055] [2025-04-30 10:44:15,927 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1402296055] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:44:15,927 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:44:15,927 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-30 10:44:15,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1777381266] [2025-04-30 10:44:15,928 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:44:15,928 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-30 10:44:15,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-04-30 10:44:15,928 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-30 10:44:15,928 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-30 10:44:15,928 INFO L87 Difference]: Start difference. First operand 35 states and 36 transitions. Second operand has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:44:16,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:44:16,007 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2025-04-30 10:44:16,008 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-30 10:44:16,008 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2025-04-30 10:44:16,008 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:44:16,008 INFO L225 Difference]: With dead ends: 31 [2025-04-30 10:44:16,008 INFO L226 Difference]: Without dead ends: 31 [2025-04-30 10:44:16,008 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-04-30 10:44:16,009 INFO L437 NwaCegarLoop]: 21 mSDtfsCounter, 20 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-30 10:44:16,009 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 59 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-30 10:44:16,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2025-04-30 10:44:16,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2025-04-30 10:44:16,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 23 states have (on average 1.3478260869565217) internal successors, (31), 30 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:44:16,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 31 transitions. [2025-04-30 10:44:16,011 INFO L79 Accepts]: Start accepts. Automaton has 31 states and 31 transitions. Word has length 8 [2025-04-30 10:44:16,011 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:44:16,011 INFO L485 AbstractCegarLoop]: Abstraction has 31 states and 31 transitions. [2025-04-30 10:44:16,011 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:44:16,011 INFO L278 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2025-04-30 10:44:16,012 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-04-30 10:44:16,012 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:44:16,012 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:44:16,017 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-04-30 10:44:16,216 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:44:16,216 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-04-30 10:44:16,216 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:44:16,216 INFO L85 PathProgramCache]: Analyzing trace with hash 406185098, now seen corresponding path program 1 times [2025-04-30 10:44:16,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-04-30 10:44:16,217 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1900974395] [2025-04-30 10:44:16,217 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:44:16,217 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:44:16,217 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:44:16,218 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-30 10:44:16,219 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-04-30 10:44:16,264 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-04-30 10:44:16,278 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-04-30 10:44:16,278 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:44:16,278 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:44:16,280 INFO L256 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-04-30 10:44:16,282 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:44:16,344 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-04-30 10:44:16,427 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:44:16,428 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-30 10:44:16,428 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-04-30 10:44:16,428 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1900974395] [2025-04-30 10:44:16,428 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1900974395] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:44:16,428 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:44:16,428 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-04-30 10:44:16,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1398569658] [2025-04-30 10:44:16,428 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:44:16,428 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-30 10:44:16,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-04-30 10:44:16,428 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-30 10:44:16,429 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-04-30 10:44:16,429 INFO L87 Difference]: Start difference. First operand 31 states and 31 transitions. Second operand has 9 states, 8 states have (on average 1.625) internal successors, (13), 9 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:44:16,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:44:16,593 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2025-04-30 10:44:16,593 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-30 10:44:16,593 INFO L79 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 1.625) internal successors, (13), 9 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2025-04-30 10:44:16,594 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:44:16,594 INFO L225 Difference]: With dead ends: 29 [2025-04-30 10:44:16,594 INFO L226 Difference]: Without dead ends: 29 [2025-04-30 10:44:16,594 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2025-04-30 10:44:16,595 INFO L437 NwaCegarLoop]: 15 mSDtfsCounter, 20 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-30 10:44:16,595 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 92 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-30 10:44:16,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2025-04-30 10:44:16,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2025-04-30 10:44:16,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 28 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-04-30 10:44:16,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2025-04-30 10:44:16,597 INFO L79 Accepts]: Start accepts. Automaton has 29 states and 29 transitions. Word has length 13 [2025-04-30 10:44:16,597 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:44:16,597 INFO L485 AbstractCegarLoop]: Abstraction has 29 states and 29 transitions. [2025-04-30 10:44:16,597 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 1.625) internal successors, (13), 9 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:44:16,597 INFO L278 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2025-04-30 10:44:16,597 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-04-30 10:44:16,597 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:44:16,597 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:44:16,603 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-04-30 10:44:16,797 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:44:16,798 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-04-30 10:44:16,798 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:44:16,798 INFO L85 PathProgramCache]: Analyzing trace with hash -293163793, now seen corresponding path program 1 times [2025-04-30 10:44:16,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-04-30 10:44:16,798 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2053131644] [2025-04-30 10:44:16,798 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:44:16,798 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:44:16,798 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:44:16,800 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-30 10:44:16,801 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-04-30 10:44:16,854 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-30 10:44:16,866 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-30 10:44:16,866 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:44:16,866 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:44:16,868 INFO L256 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-04-30 10:44:16,870 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:44:16,888 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-04-30 10:44:16,898 INFO L354 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 6 treesize of output 7 [2025-04-30 10:44:16,926 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-04-30 10:44:16,962 INFO L325 Elim1Store]: treesize reduction 6, result has 57.1 percent of original size [2025-04-30 10:44:16,962 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 17 [2025-04-30 10:44:16,996 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2025-04-30 10:44:17,088 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-30 10:44:17,088 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 11 [2025-04-30 10:44:17,119 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:44:17,120 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-30 10:44:17,120 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-04-30 10:44:17,120 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2053131644] [2025-04-30 10:44:17,120 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2053131644] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:44:17,120 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:44:17,120 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-04-30 10:44:17,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [357524232] [2025-04-30 10:44:17,120 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:44:17,120 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-30 10:44:17,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-04-30 10:44:17,121 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-30 10:44:17,121 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2025-04-30 10:44:17,121 INFO L87 Difference]: Start difference. First operand 29 states and 29 transitions. Second operand has 11 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 11 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:44:17,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:44:17,335 INFO L93 Difference]: Finished difference Result 17 states and 16 transitions. [2025-04-30 10:44:17,335 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-04-30 10:44:17,335 INFO L79 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 11 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2025-04-30 10:44:17,335 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:44:17,335 INFO L225 Difference]: With dead ends: 17 [2025-04-30 10:44:17,335 INFO L226 Difference]: Without dead ends: 17 [2025-04-30 10:44:17,336 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2025-04-30 10:44:17,339 INFO L437 NwaCegarLoop]: 6 mSDtfsCounter, 3 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-30 10:44:17,339 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 30 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-30 10:44:17,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2025-04-30 10:44:17,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2025-04-30 10:44:17,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 16 states have (on average 1.0) internal successors, (16), 16 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:44:17,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 16 transitions. [2025-04-30 10:44:17,340 INFO L79 Accepts]: Start accepts. Automaton has 17 states and 16 transitions. Word has length 14 [2025-04-30 10:44:17,340 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:44:17,340 INFO L485 AbstractCegarLoop]: Abstraction has 17 states and 16 transitions. [2025-04-30 10:44:17,340 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 11 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:44:17,340 INFO L278 IsEmpty]: Start isEmpty. Operand 17 states and 16 transitions. [2025-04-30 10:44:17,340 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-04-30 10:44:17,340 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:44:17,340 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:44:17,349 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-04-30 10:44:17,541 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:44:17,541 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-04-30 10:44:17,541 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:44:17,541 INFO L85 PathProgramCache]: Analyzing trace with hash 1750799681, now seen corresponding path program 1 times [2025-04-30 10:44:17,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-04-30 10:44:17,542 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1675129912] [2025-04-30 10:44:17,542 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:44:17,542 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:44:17,542 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:44:17,544 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-30 10:44:17,544 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-04-30 10:44:17,591 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-30 10:44:17,676 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-30 10:44:17,676 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:44:17,676 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-30 10:44:17,676 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-30 10:44:17,687 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-30 10:44:17,789 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-30 10:44:17,789 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:44:17,789 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-30 10:44:17,807 INFO L130 FreeRefinementEngine]: Strategy FOX found a feasible trace [2025-04-30 10:44:17,807 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-30 10:44:17,808 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK (18 of 19 remaining) [2025-04-30 10:44:17,809 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 19 remaining) [2025-04-30 10:44:17,809 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 19 remaining) [2025-04-30 10:44:17,809 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 19 remaining) [2025-04-30 10:44:17,809 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 19 remaining) [2025-04-30 10:44:17,809 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 19 remaining) [2025-04-30 10:44:17,809 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 19 remaining) [2025-04-30 10:44:17,809 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 19 remaining) [2025-04-30 10:44:17,809 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 19 remaining) [2025-04-30 10:44:17,809 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_FREE (9 of 19 remaining) [2025-04-30 10:44:17,809 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_FREE (8 of 19 remaining) [2025-04-30 10:44:17,809 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_FREE (7 of 19 remaining) [2025-04-30 10:44:17,809 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_FREE (6 of 19 remaining) [2025-04-30 10:44:17,809 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE (5 of 19 remaining) [2025-04-30 10:44:17,809 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_FREE (4 of 19 remaining) [2025-04-30 10:44:17,809 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 19 remaining) [2025-04-30 10:44:17,810 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 19 remaining) [2025-04-30 10:44:17,810 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 19 remaining) [2025-04-30 10:44:17,810 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 19 remaining) [2025-04-30 10:44:17,817 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-04-30 10:44:18,010 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:44:18,012 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:44:18,032 INFO L171 ceAbstractionStarter]: Computing trace abstraction results [2025-04-30 10:44:18,034 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.04 10:44:18 BoogieIcfgContainer [2025-04-30 10:44:18,034 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-04-30 10:44:18,034 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-04-30 10:44:18,034 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-04-30 10:44:18,034 INFO L274 PluginConnector]: Witness Printer initialized [2025-04-30 10:44:18,035 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.04 10:44:14" (3/4) ... [2025-04-30 10:44:18,040 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-04-30 10:44:18,040 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-04-30 10:44:18,041 INFO L158 Benchmark]: Toolchain (without parser) took 4755.82ms. Allocated memory is still 117.4MB. Free memory was 91.5MB in the beginning and 73.5MB in the end (delta: 18.0MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2025-04-30 10:44:18,041 INFO L158 Benchmark]: CDTParser took 2.03ms. Allocated memory is still 83.9MB. Free memory was 62.1MB in the beginning and 62.1MB in the end (delta: 33.6kB). There was no memory consumed. Max. memory is 16.1GB. [2025-04-30 10:44:18,041 INFO L158 Benchmark]: CACSL2BoogieTranslator took 309.01ms. Allocated memory is still 117.4MB. Free memory was 91.3MB in the beginning and 70.8MB in the end (delta: 20.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-04-30 10:44:18,041 INFO L158 Benchmark]: Boogie Procedure Inliner took 35.93ms. Allocated memory is still 117.4MB. Free memory was 70.8MB in the beginning and 68.9MB in the end (delta: 1.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-04-30 10:44:18,041 INFO L158 Benchmark]: Boogie Preprocessor took 37.43ms. Allocated memory is still 117.4MB. Free memory was 68.9MB in the beginning and 66.8MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-04-30 10:44:18,042 INFO L158 Benchmark]: RCFGBuilder took 361.82ms. Allocated memory is still 117.4MB. Free memory was 66.8MB in the beginning and 50.8MB in the end (delta: 16.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-04-30 10:44:18,042 INFO L158 Benchmark]: TraceAbstraction took 4000.25ms. Allocated memory is still 117.4MB. Free memory was 50.3MB in the beginning and 73.5MB in the end (delta: -23.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-04-30 10:44:18,042 INFO L158 Benchmark]: Witness Printer took 6.33ms. Allocated memory is still 117.4MB. Free memory was 73.5MB in the beginning and 73.5MB in the end (delta: 15.1kB). There was no memory consumed. Max. memory is 16.1GB. [2025-04-30 10:44:18,043 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 2.03ms. Allocated memory is still 83.9MB. Free memory was 62.1MB in the beginning and 62.1MB in the end (delta: 33.6kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 309.01ms. Allocated memory is still 117.4MB. Free memory was 91.3MB in the beginning and 70.8MB in the end (delta: 20.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 35.93ms. Allocated memory is still 117.4MB. Free memory was 70.8MB in the beginning and 68.9MB in the end (delta: 1.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 37.43ms. Allocated memory is still 117.4MB. Free memory was 68.9MB in the beginning and 66.8MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 361.82ms. Allocated memory is still 117.4MB. Free memory was 66.8MB in the beginning and 50.8MB in the end (delta: 16.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 4000.25ms. Allocated memory is still 117.4MB. Free memory was 50.3MB in the beginning and 73.5MB in the end (delta: -23.2MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 6.33ms. Allocated memory is still 117.4MB. Free memory was 73.5MB in the beginning and 73.5MB in the end (delta: 15.1kB). There was no memory consumed. 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 - UnprovableResult [Line: 543]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 543. Possible FailurePath: [L544] TData data; [L545] CALL alloc_data(&data) [L529] pdata->lo = malloc(16) [L530] pdata->hi = malloc(24) [L545] RET alloc_data(&data) [L546] CALL free_data(&data) [L534] EXPR data->lo [L534] void *lo = data->lo; [L535] EXPR data->hi [L535] void *hi = data->hi; [L536] COND FALSE !(lo == hi) VAL [data={32772:0}] [L540] data->lo = (void *) 0 [L541] data->hi = (void *) 0 [L546] RET free_data(&data) [L547] return 0; [L547] return 0; VAL [\result=0] - 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. - 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: 537]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 537]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 537]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 538]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 538]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 538]: Unable to prove that free always succeeds Unable to prove that free 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, 43 locations, 43 edges, 19 error locations. Started 1 CEGAR loops. OverallTime: 3.9s, OverallIterations: 8, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 76 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 76 mSDsluCounter, 398 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 231 mSDsCounter, 19 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 342 IncrementalHoareTripleChecker+Invalid, 361 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 19 mSolverCounterUnsat, 167 mSDtfsCounter, 342 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 56 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=43occurred in iteration=0, InterpolantAutomatonStates: 40, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 7 MinimizatonAttempts, 4 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 70 NumberOfCodeBlocks, 70 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 47 ConstructedInterpolants, 0 QuantifiedInterpolants, 401 SizeOfPredicates, 20 NumberOfNonLiveVariables, 431 ConjunctsInSsa, 85 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-04-30 10:44:18,056 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample