./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/valid-memsafety.prp --file ../../../trunk/examples/svcomp/termination-15/cstrcmp_diffterm_alloca.c --full-output --architecture 64bit -------------------------------------------------------------------------------- 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/termination-15/cstrcmp_diffterm_alloca.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 8a023f13ccfdc4ed81eea2f64ad2224e1560af5a8c7aadc845f5ef9d6f3d96bc --- Real Ultimate output --- This is Ultimate 0.3.0-wip.fs.system-includes-da04345-m [2025-04-29 11:26:47,447 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-29 11:26:47,495 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Default.epf [2025-04-29 11:26:47,498 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-29 11:26:47,498 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-29 11:26:47,518 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-29 11:26:47,519 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-29 11:26:47,519 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-29 11:26:47,520 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-29 11:26:47,520 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-29 11:26:47,520 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-29 11:26:47,520 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-29 11:26:47,520 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-29 11:26:47,521 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-29 11:26:47,521 INFO L153 SettingsManager]: * Use SBE=true [2025-04-29 11:26:47,521 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-29 11:26:47,521 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-29 11:26:47,521 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-29 11:26:47,521 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-04-29 11:26:47,521 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-04-29 11:26:47,521 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-04-29 11:26:47,521 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-29 11:26:47,522 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-04-29 11:26:47,522 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-04-29 11:26:47,522 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-29 11:26:47,522 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-29 11:26:47,522 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-29 11:26:47,522 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-29 11:26:47,522 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-29 11:26:47,522 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-29 11:26:47,522 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-29 11:26:47,522 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-29 11:26:47,522 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-29 11:26:47,522 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-29 11:26:47,522 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-29 11:26:47,522 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-29 11:26:47,522 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-29 11:26:47,522 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-29 11:26:47,522 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-29 11:26:47,522 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-29 11:26:47,522 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-29 11:26:47,522 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-29 11:26:47,523 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-29 11:26:47,523 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 8a023f13ccfdc4ed81eea2f64ad2224e1560af5a8c7aadc845f5ef9d6f3d96bc [2025-04-29 11:26:47,722 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-29 11:26:47,730 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-29 11:26:47,732 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-29 11:26:47,733 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-29 11:26:47,733 INFO L274 PluginConnector]: CDTParser initialized [2025-04-29 11:26:47,734 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/termination-15/cstrcmp_diffterm_alloca.c [2025-04-29 11:26:49,019 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/776d91ead/aaeddd7e05ef496792757a4c3201018a/FLAG84caa0fd7 [2025-04-29 11:26:49,217 INFO L389 CDTParser]: Found 1 translation units. [2025-04-29 11:26:49,218 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/termination-15/cstrcmp_diffterm_alloca.c [2025-04-29 11:26:49,224 WARN L117 ultiparseSymbolTable]: System include stdlib.h could not be resolved by CDT -- only built-in system includes are available. [2025-04-29 11:26:49,224 WARN L117 ultiparseSymbolTable]: System include alloca.h could not be resolved by CDT -- only built-in system includes are available. [2025-04-29 11:26:49,246 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/776d91ead/aaeddd7e05ef496792757a4c3201018a/FLAG84caa0fd7 [2025-04-29 11:26:50,221 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/776d91ead/aaeddd7e05ef496792757a4c3201018a [2025-04-29 11:26:50,223 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-29 11:26:50,224 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-04-29 11:26:50,226 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-29 11:26:50,226 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-29 11:26:50,229 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-29 11:26:50,230 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.04 11:26:50" (1/1) ... [2025-04-29 11:26:50,231 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@127f858f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:26:50, skipping insertion in model container [2025-04-29 11:26:50,231 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.04 11:26:50" (1/1) ... [2025-04-29 11:26:50,241 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-29 11:26:50,376 WARN L1150 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-04-29 11:26:50,377 WARN L1150 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-04-29 11:26:50,381 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-29 11:26:50,391 INFO L200 MainTranslator]: Completed pre-run [2025-04-29 11:26:50,414 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-29 11:26:50,423 INFO L204 MainTranslator]: Completed translation [2025-04-29 11:26:50,424 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:26:50 WrapperNode [2025-04-29 11:26:50,424 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-29 11:26:50,424 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-29 11:26:50,425 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-29 11:26:50,425 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-29 11:26:50,429 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:26:50" (1/1) ... [2025-04-29 11:26:50,433 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:26:50" (1/1) ... [2025-04-29 11:26:50,448 INFO L138 Inliner]: procedures = 9, calls = 16, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 71 [2025-04-29 11:26:50,449 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-29 11:26:50,449 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-29 11:26:50,449 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-29 11:26:50,449 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-29 11:26:50,454 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:26:50" (1/1) ... [2025-04-29 11:26:50,454 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:26:50" (1/1) ... [2025-04-29 11:26:50,456 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:26:50" (1/1) ... [2025-04-29 11:26:50,467 INFO L175 MemorySlicer]: Split 7 memory accesses to 2 slices as follows [4, 3]. 57 percent of accesses are in the largest equivalence class. The 0 initializations are split as follows [0, 0]. The 2 writes are split as follows [1, 1]. [2025-04-29 11:26:50,468 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:26:50" (1/1) ... [2025-04-29 11:26:50,468 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:26:50" (1/1) ... [2025-04-29 11:26:50,471 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:26:50" (1/1) ... [2025-04-29 11:26:50,471 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:26:50" (1/1) ... [2025-04-29 11:26:50,473 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:26:50" (1/1) ... [2025-04-29 11:26:50,474 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:26:50" (1/1) ... [2025-04-29 11:26:50,474 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:26:50" (1/1) ... [2025-04-29 11:26:50,476 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-29 11:26:50,477 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-29 11:26:50,477 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-29 11:26:50,477 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-29 11:26:50,478 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:26:50" (1/1) ... [2025-04-29 11:26:50,481 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-29 11:26:50,490 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:26:50,502 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-29 11:26:50,505 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-29 11:26:50,521 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-04-29 11:26:50,521 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-04-29 11:26:50,521 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-29 11:26:50,521 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-29 11:26:50,521 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-04-29 11:26:50,522 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-04-29 11:26:50,522 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-04-29 11:26:50,522 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-04-29 11:26:50,580 INFO L234 CfgBuilder]: Building ICFG [2025-04-29 11:26:50,581 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-29 11:26:50,757 INFO L? ?]: Removed 50 outVars from TransFormulas that were not future-live. [2025-04-29 11:26:50,757 INFO L283 CfgBuilder]: Performing block encoding [2025-04-29 11:26:50,763 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-29 11:26:50,765 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-04-29 11:26:50,765 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.04 11:26:50 BoogieIcfgContainer [2025-04-29 11:26:50,765 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-29 11:26:50,767 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-29 11:26:50,768 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-29 11:26:50,771 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-29 11:26:50,771 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.04 11:26:50" (1/3) ... [2025-04-29 11:26:50,772 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@94a658f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.04 11:26:50, skipping insertion in model container [2025-04-29 11:26:50,772 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:26:50" (2/3) ... [2025-04-29 11:26:50,772 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@94a658f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.04 11:26:50, skipping insertion in model container [2025-04-29 11:26:50,773 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.04 11:26:50" (3/3) ... [2025-04-29 11:26:50,774 INFO L128 eAbstractionObserver]: Analyzing ICFG cstrcmp_diffterm_alloca.c [2025-04-29 11:26:50,786 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-29 11:26:50,788 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG cstrcmp_diffterm_alloca.c that has 1 procedures, 39 locations, 43 edges, 1 initial locations, 1 loop locations, and 15 error locations. [2025-04-29 11:26:50,823 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-29 11:26:50,835 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;@5aaa1199, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-29 11:26:50,835 INFO L341 AbstractCegarLoop]: Starting to check reachability of 15 error locations. [2025-04-29 11:26:50,838 INFO L278 IsEmpty]: Start isEmpty. Operand has 39 states, 23 states have (on average 1.8695652173913044) internal successors, (43), 38 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-29 11:26:50,842 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-04-29 11:26:50,842 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:26:50,843 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-04-29 11:26:50,843 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2025-04-29 11:26:50,847 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:26:50,848 INFO L85 PathProgramCache]: Analyzing trace with hash 889510731, now seen corresponding path program 1 times [2025-04-29 11:26:50,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:26:50,854 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1234257288] [2025-04-29 11:26:50,855 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:26:50,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:26:50,907 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-29 11:26:50,931 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-29 11:26:50,932 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:26:50,932 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:26:51,076 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-29 11:26:51,076 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:26:51,076 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1234257288] [2025-04-29 11:26:51,077 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1234257288] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:26:51,077 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:26:51,077 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-29 11:26:51,078 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [962511883] [2025-04-29 11:26:51,078 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:26:51,081 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-29 11:26:51,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:26:51,099 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-29 11:26:51,099 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:26:51,101 INFO L87 Difference]: Start difference. First operand has 39 states, 23 states have (on average 1.8695652173913044) internal successors, (43), 38 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 3.0) internal successors, (6), 3 states have internal predecessors, (6), 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-29 11:26:51,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:26:51,150 INFO L93 Difference]: Finished difference Result 38 states and 41 transitions. [2025-04-29 11:26:51,152 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 11:26:51,152 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 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 6 [2025-04-29 11:26:51,153 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:26:51,157 INFO L225 Difference]: With dead ends: 38 [2025-04-29 11:26:51,157 INFO L226 Difference]: Without dead ends: 36 [2025-04-29 11:26:51,158 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-29 11:26:51,162 INFO L437 NwaCegarLoop]: 36 mSDtfsCounter, 4 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 11:26:51,162 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 55 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 11:26:51,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2025-04-29 11:26:51,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2025-04-29 11:26:51,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 22 states have (on average 1.7727272727272727) internal successors, (39), 35 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-29 11:26:51,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 39 transitions. [2025-04-29 11:26:51,189 INFO L79 Accepts]: Start accepts. Automaton has 36 states and 39 transitions. Word has length 6 [2025-04-29 11:26:51,189 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:26:51,189 INFO L485 AbstractCegarLoop]: Abstraction has 36 states and 39 transitions. [2025-04-29 11:26:51,189 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 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-29 11:26:51,189 INFO L278 IsEmpty]: Start isEmpty. Operand 36 states and 39 transitions. [2025-04-29 11:26:51,190 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-04-29 11:26:51,190 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:26:51,190 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-04-29 11:26:51,190 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-29 11:26:51,190 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2025-04-29 11:26:51,190 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:26:51,191 INFO L85 PathProgramCache]: Analyzing trace with hash 889510732, now seen corresponding path program 1 times [2025-04-29 11:26:51,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:26:51,191 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1919977829] [2025-04-29 11:26:51,191 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:26:51,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:26:51,200 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-29 11:26:51,209 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-29 11:26:51,213 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:26:51,213 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:26:51,395 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-29 11:26:51,395 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:26:51,395 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1919977829] [2025-04-29 11:26:51,396 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1919977829] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:26:51,396 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:26:51,396 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-29 11:26:51,396 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1230183824] [2025-04-29 11:26:51,396 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:26:51,397 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-29 11:26:51,397 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:26:51,397 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-29 11:26:51,398 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-29 11:26:51,398 INFO L87 Difference]: Start difference. First operand 36 states and 39 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 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-29 11:26:51,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:26:51,440 INFO L93 Difference]: Finished difference Result 39 states and 43 transitions. [2025-04-29 11:26:51,440 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-29 11:26:51,440 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 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 6 [2025-04-29 11:26:51,440 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:26:51,440 INFO L225 Difference]: With dead ends: 39 [2025-04-29 11:26:51,440 INFO L226 Difference]: Without dead ends: 39 [2025-04-29 11:26:51,440 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-29 11:26:51,441 INFO L437 NwaCegarLoop]: 37 mSDtfsCounter, 1 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 11:26:51,441 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 90 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 11:26:51,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2025-04-29 11:26:51,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2025-04-29 11:26:51,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 25 states have (on average 1.72) internal successors, (43), 38 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-29 11:26:51,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 43 transitions. [2025-04-29 11:26:51,446 INFO L79 Accepts]: Start accepts. Automaton has 39 states and 43 transitions. Word has length 6 [2025-04-29 11:26:51,446 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:26:51,446 INFO L485 AbstractCegarLoop]: Abstraction has 39 states and 43 transitions. [2025-04-29 11:26:51,446 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 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-29 11:26:51,446 INFO L278 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2025-04-29 11:26:51,446 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-04-29 11:26:51,446 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:26:51,447 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-04-29 11:26:51,447 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-29 11:26:51,447 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2025-04-29 11:26:51,448 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:26:51,448 INFO L85 PathProgramCache]: Analyzing trace with hash 889570314, now seen corresponding path program 1 times [2025-04-29 11:26:51,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:26:51,448 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [796727688] [2025-04-29 11:26:51,448 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:26:51,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:26:51,454 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-29 11:26:51,462 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-29 11:26:51,464 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:26:51,464 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:26:51,605 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-29 11:26:51,606 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:26:51,606 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [796727688] [2025-04-29 11:26:51,606 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [796727688] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:26:51,606 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:26:51,606 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-29 11:26:51,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2139387695] [2025-04-29 11:26:51,607 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:26:51,608 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-29 11:26:51,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:26:51,608 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-29 11:26:51,608 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-04-29 11:26:51,608 INFO L87 Difference]: Start difference. First operand 39 states and 43 transitions. Second operand has 5 states, 4 states have (on average 1.5) internal successors, (6), 5 states have internal predecessors, (6), 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-29 11:26:51,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:26:51,647 INFO L93 Difference]: Finished difference Result 38 states and 42 transitions. [2025-04-29 11:26:51,647 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-29 11:26:51,648 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.5) internal successors, (6), 5 states have internal predecessors, (6), 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 6 [2025-04-29 11:26:51,648 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:26:51,648 INFO L225 Difference]: With dead ends: 38 [2025-04-29 11:26:51,648 INFO L226 Difference]: Without dead ends: 38 [2025-04-29 11:26:51,648 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-04-29 11:26:51,649 INFO L437 NwaCegarLoop]: 34 mSDtfsCounter, 2 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 11:26:51,649 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 85 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 11:26:51,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2025-04-29 11:26:51,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 35. [2025-04-29 11:26:51,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 22 states have (on average 1.7272727272727273) internal successors, (38), 34 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-29 11:26:51,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 38 transitions. [2025-04-29 11:26:51,655 INFO L79 Accepts]: Start accepts. Automaton has 35 states and 38 transitions. Word has length 6 [2025-04-29 11:26:51,655 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:26:51,655 INFO L485 AbstractCegarLoop]: Abstraction has 35 states and 38 transitions. [2025-04-29 11:26:51,655 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.5) internal successors, (6), 5 states have internal predecessors, (6), 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-29 11:26:51,655 INFO L278 IsEmpty]: Start isEmpty. Operand 35 states and 38 transitions. [2025-04-29 11:26:51,655 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-04-29 11:26:51,655 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:26:51,655 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:26:51,656 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-29 11:26:51,656 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2025-04-29 11:26:51,656 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:26:51,656 INFO L85 PathProgramCache]: Analyzing trace with hash 1805028874, now seen corresponding path program 1 times [2025-04-29 11:26:51,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:26:51,656 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1991338000] [2025-04-29 11:26:51,656 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:26:51,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:26:51,660 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-29 11:26:51,669 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-29 11:26:51,669 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:26:51,669 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:26:51,800 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-29 11:26:51,800 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:26:51,800 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1991338000] [2025-04-29 11:26:51,800 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1991338000] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:26:51,800 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:26:51,800 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-29 11:26:51,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1164502742] [2025-04-29 11:26:51,800 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:26:51,801 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-29 11:26:51,801 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:26:51,801 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-29 11:26:51,801 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-29 11:26:51,801 INFO L87 Difference]: Start difference. First operand 35 states and 38 transitions. Second operand has 5 states, 4 states have (on average 1.75) internal successors, (7), 5 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:26:51,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:26:51,868 INFO L93 Difference]: Finished difference Result 37 states and 41 transitions. [2025-04-29 11:26:51,868 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-29 11:26:51,869 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.75) internal successors, (7), 5 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2025-04-29 11:26:51,869 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:26:51,869 INFO L225 Difference]: With dead ends: 37 [2025-04-29 11:26:51,870 INFO L226 Difference]: Without dead ends: 37 [2025-04-29 11:26:51,870 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-04-29 11:26:51,870 INFO L437 NwaCegarLoop]: 32 mSDtfsCounter, 4 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 11:26:51,873 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 95 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 11:26:51,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2025-04-29 11:26:51,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 34. [2025-04-29 11:26:51,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 22 states have (on average 1.6818181818181819) internal successors, (37), 33 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-29 11:26:51,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 37 transitions. [2025-04-29 11:26:51,875 INFO L79 Accepts]: Start accepts. Automaton has 34 states and 37 transitions. Word has length 7 [2025-04-29 11:26:51,876 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:26:51,876 INFO L485 AbstractCegarLoop]: Abstraction has 34 states and 37 transitions. [2025-04-29 11:26:51,878 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.75) internal successors, (7), 5 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:26:51,878 INFO L278 IsEmpty]: Start isEmpty. Operand 34 states and 37 transitions. [2025-04-29 11:26:51,878 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-04-29 11:26:51,878 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:26:51,878 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:26:51,878 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-29 11:26:51,879 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2025-04-29 11:26:51,879 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:26:51,879 INFO L85 PathProgramCache]: Analyzing trace with hash 1805028875, now seen corresponding path program 1 times [2025-04-29 11:26:51,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:26:51,879 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [881814683] [2025-04-29 11:26:51,879 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:26:51,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:26:51,887 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-29 11:26:51,894 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-29 11:26:51,895 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:26:51,895 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:26:51,970 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-29 11:26:51,970 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:26:51,970 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [881814683] [2025-04-29 11:26:51,970 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [881814683] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:26:51,970 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:26:51,970 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-29 11:26:51,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [648241816] [2025-04-29 11:26:51,970 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:26:51,970 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-29 11:26:51,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:26:51,971 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-29 11:26:51,971 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-29 11:26:51,971 INFO L87 Difference]: Start difference. First operand 34 states and 37 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:26:51,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:26:51,983 INFO L93 Difference]: Finished difference Result 37 states and 40 transitions. [2025-04-29 11:26:51,983 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-29 11:26:51,984 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2025-04-29 11:26:51,984 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:26:51,984 INFO L225 Difference]: With dead ends: 37 [2025-04-29 11:26:51,984 INFO L226 Difference]: Without dead ends: 37 [2025-04-29 11:26:51,984 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-29 11:26:51,985 INFO L437 NwaCegarLoop]: 34 mSDtfsCounter, 0 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 11:26:51,985 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 65 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 11:26:51,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2025-04-29 11:26:51,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2025-04-29 11:26:51,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 25 states have (on average 1.6) internal successors, (40), 36 states have internal predecessors, (40), 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-29 11:26:51,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 40 transitions. [2025-04-29 11:26:51,987 INFO L79 Accepts]: Start accepts. Automaton has 37 states and 40 transitions. Word has length 7 [2025-04-29 11:26:51,987 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:26:51,987 INFO L485 AbstractCegarLoop]: Abstraction has 37 states and 40 transitions. [2025-04-29 11:26:51,987 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:26:51,987 INFO L278 IsEmpty]: Start isEmpty. Operand 37 states and 40 transitions. [2025-04-29 11:26:51,987 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-04-29 11:26:51,987 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:26:51,987 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:26:51,987 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-29 11:26:51,989 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2025-04-29 11:26:51,990 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:26:51,990 INFO L85 PathProgramCache]: Analyzing trace with hash 1805088457, now seen corresponding path program 1 times [2025-04-29 11:26:51,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:26:51,992 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [658000821] [2025-04-29 11:26:51,992 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:26:51,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:26:51,998 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-29 11:26:52,003 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-29 11:26:52,004 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:26:52,004 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:26:52,118 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-29 11:26:52,119 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:26:52,119 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [658000821] [2025-04-29 11:26:52,119 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [658000821] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:26:52,119 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:26:52,119 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-29 11:26:52,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1205412764] [2025-04-29 11:26:52,119 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:26:52,119 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-29 11:26:52,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:26:52,119 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-29 11:26:52,120 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-04-29 11:26:52,120 INFO L87 Difference]: Start difference. First operand 37 states and 40 transitions. Second operand has 5 states, 4 states have (on average 1.75) internal successors, (7), 5 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:26:52,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:26:52,134 INFO L93 Difference]: Finished difference Result 36 states and 39 transitions. [2025-04-29 11:26:52,135 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-29 11:26:52,135 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.75) internal successors, (7), 5 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2025-04-29 11:26:52,135 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:26:52,135 INFO L225 Difference]: With dead ends: 36 [2025-04-29 11:26:52,135 INFO L226 Difference]: Without dead ends: 36 [2025-04-29 11:26:52,135 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-04-29 11:26:52,136 INFO L437 NwaCegarLoop]: 31 mSDtfsCounter, 1 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 11:26:52,136 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 61 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 11:26:52,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2025-04-29 11:26:52,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 33. [2025-04-29 11:26:52,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 22 states have (on average 1.6363636363636365) internal successors, (36), 32 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:26:52,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 36 transitions. [2025-04-29 11:26:52,137 INFO L79 Accepts]: Start accepts. Automaton has 33 states and 36 transitions. Word has length 7 [2025-04-29 11:26:52,138 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:26:52,138 INFO L485 AbstractCegarLoop]: Abstraction has 33 states and 36 transitions. [2025-04-29 11:26:52,138 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.75) internal successors, (7), 5 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:26:52,138 INFO L278 IsEmpty]: Start isEmpty. Operand 33 states and 36 transitions. [2025-04-29 11:26:52,138 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-04-29 11:26:52,138 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:26:52,138 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:26:52,138 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-04-29 11:26:52,138 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2025-04-29 11:26:52,138 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:26:52,140 INFO L85 PathProgramCache]: Analyzing trace with hash -534039922, now seen corresponding path program 1 times [2025-04-29 11:26:52,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:26:52,140 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [549057295] [2025-04-29 11:26:52,140 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:26:52,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:26:52,145 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-29 11:26:52,150 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-29 11:26:52,150 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:26:52,150 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:26:52,170 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-29 11:26:52,170 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:26:52,171 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [549057295] [2025-04-29 11:26:52,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [549057295] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:26:52,171 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:26:52,171 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-29 11:26:52,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [890374657] [2025-04-29 11:26:52,171 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:26:52,171 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-29 11:26:52,171 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:26:52,172 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-29 11:26:52,172 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-29 11:26:52,172 INFO L87 Difference]: Start difference. First operand 33 states and 36 transitions. Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:26:52,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:26:52,207 INFO L93 Difference]: Finished difference Result 30 states and 33 transitions. [2025-04-29 11:26:52,207 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-29 11:26:52,207 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2025-04-29 11:26:52,207 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:26:52,207 INFO L225 Difference]: With dead ends: 30 [2025-04-29 11:26:52,207 INFO L226 Difference]: Without dead ends: 30 [2025-04-29 11:26:52,207 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-29 11:26:52,208 INFO L437 NwaCegarLoop]: 21 mSDtfsCounter, 11 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 11:26:52,208 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 42 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 11:26:52,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2025-04-29 11:26:52,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2025-04-29 11:26:52,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 22 states have (on average 1.5) internal successors, (33), 29 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:26:52,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 33 transitions. [2025-04-29 11:26:52,209 INFO L79 Accepts]: Start accepts. Automaton has 30 states and 33 transitions. Word has length 9 [2025-04-29 11:26:52,209 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:26:52,209 INFO L485 AbstractCegarLoop]: Abstraction has 30 states and 33 transitions. [2025-04-29 11:26:52,210 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:26:52,210 INFO L278 IsEmpty]: Start isEmpty. Operand 30 states and 33 transitions. [2025-04-29 11:26:52,210 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-04-29 11:26:52,210 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:26:52,210 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:26:52,210 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-04-29 11:26:52,210 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2025-04-29 11:26:52,210 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:26:52,210 INFO L85 PathProgramCache]: Analyzing trace with hash -534039921, now seen corresponding path program 1 times [2025-04-29 11:26:52,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:26:52,210 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1662244312] [2025-04-29 11:26:52,210 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:26:52,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:26:52,215 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-29 11:26:52,218 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-29 11:26:52,218 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:26:52,218 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:26:52,290 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-29 11:26:52,290 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:26:52,290 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1662244312] [2025-04-29 11:26:52,290 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1662244312] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:26:52,290 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:26:52,290 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-29 11:26:52,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [17874591] [2025-04-29 11:26:52,290 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:26:52,290 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-29 11:26:52,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:26:52,291 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-29 11:26:52,291 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-04-29 11:26:52,291 INFO L87 Difference]: Start difference. First operand 30 states and 33 transitions. Second operand has 6 states, 5 states have (on average 1.8) internal successors, (9), 6 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:26:52,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:26:52,339 INFO L93 Difference]: Finished difference Result 41 states and 46 transitions. [2025-04-29 11:26:52,340 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-29 11:26:52,340 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.8) internal successors, (9), 6 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2025-04-29 11:26:52,341 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:26:52,341 INFO L225 Difference]: With dead ends: 41 [2025-04-29 11:26:52,341 INFO L226 Difference]: Without dead ends: 41 [2025-04-29 11:26:52,341 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-04-29 11:26:52,341 INFO L437 NwaCegarLoop]: 23 mSDtfsCounter, 12 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 11:26:52,342 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 77 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 11:26:52,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2025-04-29 11:26:52,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 38. [2025-04-29 11:26:52,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 30 states have (on average 1.5) internal successors, (45), 37 states have internal predecessors, (45), 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-29 11:26:52,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 45 transitions. [2025-04-29 11:26:52,345 INFO L79 Accepts]: Start accepts. Automaton has 38 states and 45 transitions. Word has length 9 [2025-04-29 11:26:52,346 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:26:52,346 INFO L485 AbstractCegarLoop]: Abstraction has 38 states and 45 transitions. [2025-04-29 11:26:52,346 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.8) internal successors, (9), 6 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:26:52,346 INFO L278 IsEmpty]: Start isEmpty. Operand 38 states and 45 transitions. [2025-04-29 11:26:52,346 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-04-29 11:26:52,346 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:26:52,347 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:26:52,348 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-04-29 11:26:52,348 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2025-04-29 11:26:52,349 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:26:52,349 INFO L85 PathProgramCache]: Analyzing trace with hash -1693266156, now seen corresponding path program 1 times [2025-04-29 11:26:52,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:26:52,349 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1715253480] [2025-04-29 11:26:52,349 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:26:52,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:26:52,356 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-04-29 11:26:52,361 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-04-29 11:26:52,361 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:26:52,361 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:26:52,397 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-29 11:26:52,397 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:26:52,397 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1715253480] [2025-04-29 11:26:52,397 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1715253480] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:26:52,397 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:26:52,397 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-29 11:26:52,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [604027184] [2025-04-29 11:26:52,398 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:26:52,398 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-29 11:26:52,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:26:52,398 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-29 11:26:52,398 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-29 11:26:52,398 INFO L87 Difference]: Start difference. First operand 38 states and 45 transitions. Second operand has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 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-29 11:26:52,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:26:52,427 INFO L93 Difference]: Finished difference Result 36 states and 42 transitions. [2025-04-29 11:26:52,428 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-29 11:26:52,428 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 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-29 11:26:52,428 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:26:52,428 INFO L225 Difference]: With dead ends: 36 [2025-04-29 11:26:52,428 INFO L226 Difference]: Without dead ends: 36 [2025-04-29 11:26:52,429 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-29 11:26:52,429 INFO L437 NwaCegarLoop]: 20 mSDtfsCounter, 11 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 11:26:52,429 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 40 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 11:26:52,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2025-04-29 11:26:52,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2025-04-29 11:26:52,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 30 states have (on average 1.4) internal successors, (42), 35 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:26:52,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 42 transitions. [2025-04-29 11:26:52,435 INFO L79 Accepts]: Start accepts. Automaton has 36 states and 42 transitions. Word has length 13 [2025-04-29 11:26:52,435 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:26:52,435 INFO L485 AbstractCegarLoop]: Abstraction has 36 states and 42 transitions. [2025-04-29 11:26:52,435 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 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-29 11:26:52,435 INFO L278 IsEmpty]: Start isEmpty. Operand 36 states and 42 transitions. [2025-04-29 11:26:52,435 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-04-29 11:26:52,435 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:26:52,436 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:26:52,436 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-04-29 11:26:52,436 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2025-04-29 11:26:52,436 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:26:52,437 INFO L85 PathProgramCache]: Analyzing trace with hash -1693266155, now seen corresponding path program 1 times [2025-04-29 11:26:52,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:26:52,437 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [280144116] [2025-04-29 11:26:52,437 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:26:52,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:26:52,443 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-04-29 11:26:52,448 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-04-29 11:26:52,449 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:26:52,449 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:26:52,594 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-29 11:26:52,595 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:26:52,595 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [280144116] [2025-04-29 11:26:52,595 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [280144116] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:26:52,595 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:26:52,595 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-29 11:26:52,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [424403367] [2025-04-29 11:26:52,595 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:26:52,596 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-29 11:26:52,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:26:52,596 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-29 11:26:52,596 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-04-29 11:26:52,597 INFO L87 Difference]: Start difference. First operand 36 states and 42 transitions. Second operand has 6 states, 5 states have (on average 2.6) internal successors, (13), 6 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-29 11:26:52,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:26:52,640 INFO L93 Difference]: Finished difference Result 39 states and 44 transitions. [2025-04-29 11:26:52,640 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-29 11:26:52,641 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 6 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-29 11:26:52,641 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:26:52,641 INFO L225 Difference]: With dead ends: 39 [2025-04-29 11:26:52,641 INFO L226 Difference]: Without dead ends: 39 [2025-04-29 11:26:52,641 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-04-29 11:26:52,642 INFO L437 NwaCegarLoop]: 21 mSDtfsCounter, 7 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 11:26:52,642 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 69 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 11:26:52,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2025-04-29 11:26:52,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 38. [2025-04-29 11:26:52,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 32 states have (on average 1.34375) internal successors, (43), 37 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-29 11:26:52,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 43 transitions. [2025-04-29 11:26:52,644 INFO L79 Accepts]: Start accepts. Automaton has 38 states and 43 transitions. Word has length 13 [2025-04-29 11:26:52,644 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:26:52,644 INFO L485 AbstractCegarLoop]: Abstraction has 38 states and 43 transitions. [2025-04-29 11:26:52,644 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 6 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-29 11:26:52,644 INFO L278 IsEmpty]: Start isEmpty. Operand 38 states and 43 transitions. [2025-04-29 11:26:52,644 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-04-29 11:26:52,645 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:26:52,645 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:26:52,645 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-04-29 11:26:52,645 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2025-04-29 11:26:52,645 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:26:52,645 INFO L85 PathProgramCache]: Analyzing trace with hash -951363233, now seen corresponding path program 1 times [2025-04-29 11:26:52,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:26:52,645 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1227292385] [2025-04-29 11:26:52,645 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:26:52,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:26:52,651 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-29 11:26:52,653 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-29 11:26:52,653 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:26:52,656 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:26:52,670 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:26:52,671 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:26:52,671 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1227292385] [2025-04-29 11:26:52,671 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1227292385] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:26:52,671 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:26:52,671 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-29 11:26:52,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [738234626] [2025-04-29 11:26:52,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:26:52,671 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-29 11:26:52,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:26:52,673 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-29 11:26:52,673 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:26:52,673 INFO L87 Difference]: Start difference. First operand 38 states and 43 transitions. Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 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-29 11:26:52,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:26:52,682 INFO L93 Difference]: Finished difference Result 40 states and 45 transitions. [2025-04-29 11:26:52,682 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 11:26:52,682 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 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-29 11:26:52,682 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:26:52,682 INFO L225 Difference]: With dead ends: 40 [2025-04-29 11:26:52,682 INFO L226 Difference]: Without dead ends: 40 [2025-04-29 11:26:52,683 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:26:52,683 INFO L437 NwaCegarLoop]: 30 mSDtfsCounter, 0 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 11:26:52,683 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 53 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 11:26:52,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2025-04-29 11:26:52,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2025-04-29 11:26:52,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 34 states have (on average 1.3235294117647058) internal successors, (45), 39 states have internal predecessors, (45), 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-29 11:26:52,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 45 transitions. [2025-04-29 11:26:52,685 INFO L79 Accepts]: Start accepts. Automaton has 40 states and 45 transitions. Word has length 14 [2025-04-29 11:26:52,685 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:26:52,685 INFO L485 AbstractCegarLoop]: Abstraction has 40 states and 45 transitions. [2025-04-29 11:26:52,685 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 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-29 11:26:52,685 INFO L278 IsEmpty]: Start isEmpty. Operand 40 states and 45 transitions. [2025-04-29 11:26:52,685 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-04-29 11:26:52,685 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:26:52,685 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:26:52,685 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-04-29 11:26:52,685 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2025-04-29 11:26:52,686 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:26:52,686 INFO L85 PathProgramCache]: Analyzing trace with hash 674330372, now seen corresponding path program 1 times [2025-04-29 11:26:52,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:26:52,686 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1808889302] [2025-04-29 11:26:52,686 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:26:52,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:26:52,692 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-04-29 11:26:52,697 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-04-29 11:26:52,697 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:26:52,697 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:26:52,803 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:26:52,803 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:26:52,803 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1808889302] [2025-04-29 11:26:52,803 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1808889302] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:26:52,803 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:26:52,803 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-04-29 11:26:52,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2072683014] [2025-04-29 11:26:52,804 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:26:52,804 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-29 11:26:52,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:26:52,807 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-29 11:26:52,808 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-04-29 11:26:52,808 INFO L87 Difference]: Start difference. First operand 40 states and 45 transitions. Second operand has 8 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:26:52,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:26:52,865 INFO L93 Difference]: Finished difference Result 50 states and 56 transitions. [2025-04-29 11:26:52,865 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-29 11:26:52,865 INFO L79 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2025-04-29 11:26:52,865 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:26:52,865 INFO L225 Difference]: With dead ends: 50 [2025-04-29 11:26:52,865 INFO L226 Difference]: Without dead ends: 50 [2025-04-29 11:26:52,866 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2025-04-29 11:26:52,866 INFO L437 NwaCegarLoop]: 23 mSDtfsCounter, 6 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 11:26:52,866 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 125 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 11:26:52,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2025-04-29 11:26:52,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 48. [2025-04-29 11:26:52,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 42 states have (on average 1.2857142857142858) internal successors, (54), 47 states have internal predecessors, (54), 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-29 11:26:52,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 54 transitions. [2025-04-29 11:26:52,868 INFO L79 Accepts]: Start accepts. Automaton has 48 states and 54 transitions. Word has length 17 [2025-04-29 11:26:52,868 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:26:52,868 INFO L485 AbstractCegarLoop]: Abstraction has 48 states and 54 transitions. [2025-04-29 11:26:52,868 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:26:52,868 INFO L278 IsEmpty]: Start isEmpty. Operand 48 states and 54 transitions. [2025-04-29 11:26:52,868 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-04-29 11:26:52,868 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:26:52,868 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:26:52,868 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-04-29 11:26:52,868 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2025-04-29 11:26:52,869 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:26:52,869 INFO L85 PathProgramCache]: Analyzing trace with hash -605533306, now seen corresponding path program 1 times [2025-04-29 11:26:52,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:26:52,869 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [454606151] [2025-04-29 11:26:52,869 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:26:52,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:26:52,877 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-04-29 11:26:52,883 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-04-29 11:26:52,883 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:26:52,883 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:26:53,124 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:26:53,124 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:26:53,125 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [454606151] [2025-04-29 11:26:53,125 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [454606151] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:26:53,125 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1894437726] [2025-04-29 11:26:53,125 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:26:53,125 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:26:53,125 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:26:53,127 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-29 11:26:53,128 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-29 11:26:53,162 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-04-29 11:26:53,175 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-04-29 11:26:53,175 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:26:53,175 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:26:53,177 INFO L256 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-04-29 11:26:53,181 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:26:53,224 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 14 treesize of output 10 [2025-04-29 11:26:53,339 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 11:26:53,339 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 18 treesize of output 19 [2025-04-29 11:26:53,511 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:26:53,512 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:26:53,747 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 11 [2025-04-29 11:26:53,754 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 22 treesize of output 20 [2025-04-29 11:26:53,762 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 5 treesize of output 3 [2025-04-29 11:26:53,769 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:26:53,769 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1894437726] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:26:53,769 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:26:53,769 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 20 [2025-04-29 11:26:53,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1570389581] [2025-04-29 11:26:53,770 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:26:53,770 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-04-29 11:26:53,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:26:53,770 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-04-29 11:26:53,771 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=348, Unknown=0, NotChecked=0, Total=420 [2025-04-29 11:26:53,771 INFO L87 Difference]: Start difference. First operand 48 states and 54 transitions. Second operand has 21 states, 20 states have (on average 2.05) internal successors, (41), 21 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:26:54,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:26:54,116 INFO L93 Difference]: Finished difference Result 59 states and 67 transitions. [2025-04-29 11:26:54,116 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-04-29 11:26:54,117 INFO L79 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 2.05) internal successors, (41), 21 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2025-04-29 11:26:54,117 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:26:54,117 INFO L225 Difference]: With dead ends: 59 [2025-04-29 11:26:54,117 INFO L226 Difference]: Without dead ends: 59 [2025-04-29 11:26:54,118 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 20 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=127, Invalid=575, Unknown=0, NotChecked=0, Total=702 [2025-04-29 11:26:54,118 INFO L437 NwaCegarLoop]: 21 mSDtfsCounter, 51 mSDsluCounter, 175 mSDsCounter, 0 mSdLazyCounter, 312 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 196 SdHoareTripleChecker+Invalid, 321 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 312 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-29 11:26:54,118 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 196 Invalid, 321 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 312 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-29 11:26:54,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2025-04-29 11:26:54,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 48. [2025-04-29 11:26:54,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 44 states have (on average 1.2272727272727273) internal successors, (54), 47 states have internal predecessors, (54), 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-29 11:26:54,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 54 transitions. [2025-04-29 11:26:54,124 INFO L79 Accepts]: Start accepts. Automaton has 48 states and 54 transitions. Word has length 17 [2025-04-29 11:26:54,124 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:26:54,124 INFO L485 AbstractCegarLoop]: Abstraction has 48 states and 54 transitions. [2025-04-29 11:26:54,125 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 2.05) internal successors, (41), 21 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:26:54,125 INFO L278 IsEmpty]: Start isEmpty. Operand 48 states and 54 transitions. [2025-04-29 11:26:54,125 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-04-29 11:26:54,126 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:26:54,126 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:26:54,133 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-04-29 11:26:54,326 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,SelfDestructingSolverStorable12 [2025-04-29 11:26:54,327 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2025-04-29 11:26:54,327 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:26:54,327 INFO L85 PathProgramCache]: Analyzing trace with hash -2022256866, now seen corresponding path program 1 times [2025-04-29 11:26:54,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:26:54,327 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1169916787] [2025-04-29 11:26:54,327 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:26:54,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:26:54,334 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-04-29 11:26:54,341 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-04-29 11:26:54,341 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:26:54,341 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:26:54,446 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-29 11:26:54,447 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:26:54,447 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1169916787] [2025-04-29 11:26:54,447 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1169916787] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:26:54,447 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:26:54,447 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-29 11:26:54,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1076351288] [2025-04-29 11:26:54,447 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:26:54,447 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-29 11:26:54,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:26:54,448 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-29 11:26:54,448 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-29 11:26:54,448 INFO L87 Difference]: Start difference. First operand 48 states and 54 transitions. Second operand has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:26:54,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:26:54,463 INFO L93 Difference]: Finished difference Result 47 states and 53 transitions. [2025-04-29 11:26:54,463 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-29 11:26:54,464 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2025-04-29 11:26:54,464 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:26:54,464 INFO L225 Difference]: With dead ends: 47 [2025-04-29 11:26:54,464 INFO L226 Difference]: Without dead ends: 32 [2025-04-29 11:26:54,464 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-29 11:26:54,464 INFO L437 NwaCegarLoop]: 19 mSDtfsCounter, 11 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 11:26:54,465 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 36 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 11:26:54,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2025-04-29 11:26:54,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2025-04-29 11:26:54,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 29 states have (on average 1.1724137931034482) internal successors, (34), 31 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:26:54,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 34 transitions. [2025-04-29 11:26:54,467 INFO L79 Accepts]: Start accepts. Automaton has 32 states and 34 transitions. Word has length 18 [2025-04-29 11:26:54,467 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:26:54,467 INFO L485 AbstractCegarLoop]: Abstraction has 32 states and 34 transitions. [2025-04-29 11:26:54,467 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:26:54,467 INFO L278 IsEmpty]: Start isEmpty. Operand 32 states and 34 transitions. [2025-04-29 11:26:54,467 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-04-29 11:26:54,467 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:26:54,467 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:26:54,467 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-04-29 11:26:54,468 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2025-04-29 11:26:54,468 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:26:54,468 INFO L85 PathProgramCache]: Analyzing trace with hash -803433332, now seen corresponding path program 1 times [2025-04-29 11:26:54,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:26:54,468 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2105288576] [2025-04-29 11:26:54,468 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:26:54,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:26:54,474 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-04-29 11:26:54,479 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-04-29 11:26:54,479 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:26:54,479 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:26:54,653 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:26:54,653 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:26:54,653 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2105288576] [2025-04-29 11:26:54,653 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2105288576] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:26:54,653 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:26:54,653 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-04-29 11:26:54,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [638890277] [2025-04-29 11:26:54,654 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:26:54,654 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-29 11:26:54,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:26:54,654 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-29 11:26:54,654 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2025-04-29 11:26:54,655 INFO L87 Difference]: Start difference. First operand 32 states and 34 transitions. Second operand has 12 states, 12 states have (on average 1.75) internal successors, (21), 12 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:26:54,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:26:54,758 INFO L93 Difference]: Finished difference Result 43 states and 44 transitions. [2025-04-29 11:26:54,758 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-04-29 11:26:54,759 INFO L79 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.75) internal successors, (21), 12 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2025-04-29 11:26:54,759 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:26:54,759 INFO L225 Difference]: With dead ends: 43 [2025-04-29 11:26:54,759 INFO L226 Difference]: Without dead ends: 32 [2025-04-29 11:26:54,759 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=211, Unknown=0, NotChecked=0, Total=272 [2025-04-29 11:26:54,760 INFO L437 NwaCegarLoop]: 15 mSDtfsCounter, 11 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 11:26:54,760 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 101 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 11:26:54,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2025-04-29 11:26:54,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2025-04-29 11:26:54,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 29 states have (on average 1.1379310344827587) internal successors, (33), 31 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:26:54,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 33 transitions. [2025-04-29 11:26:54,761 INFO L79 Accepts]: Start accepts. Automaton has 32 states and 33 transitions. Word has length 21 [2025-04-29 11:26:54,761 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:26:54,761 INFO L485 AbstractCegarLoop]: Abstraction has 32 states and 33 transitions. [2025-04-29 11:26:54,762 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 1.75) internal successors, (21), 12 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:26:54,762 INFO L278 IsEmpty]: Start isEmpty. Operand 32 states and 33 transitions. [2025-04-29 11:26:54,762 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-04-29 11:26:54,762 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:26:54,762 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:26:54,762 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-04-29 11:26:54,762 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2025-04-29 11:26:54,763 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:26:54,763 INFO L85 PathProgramCache]: Analyzing trace with hash 1497389258, now seen corresponding path program 1 times [2025-04-29 11:26:54,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:26:54,763 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [14355614] [2025-04-29 11:26:54,763 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:26:54,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:26:54,767 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-04-29 11:26:54,772 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-04-29 11:26:54,772 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:26:54,772 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:26:55,051 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:26:55,051 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:26:55,051 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [14355614] [2025-04-29 11:26:55,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [14355614] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:26:55,051 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1502481338] [2025-04-29 11:26:55,052 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:26:55,052 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:26:55,052 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:26:55,054 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-29 11:26:55,055 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-29 11:26:55,091 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-04-29 11:26:55,103 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-04-29 11:26:55,103 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:26:55,103 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:26:55,104 INFO L256 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-04-29 11:26:55,106 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:26:55,117 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 14 treesize of output 10 [2025-04-29 11:26:55,331 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2025-04-29 11:26:55,382 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 11:26:55,383 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 18 treesize of output 19 [2025-04-29 11:26:55,528 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:26:55,528 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:26:55,798 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 12 [2025-04-29 11:26:55,895 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 11 [2025-04-29 11:26:55,900 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 22 treesize of output 20 [2025-04-29 11:26:55,904 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 5 treesize of output 3 [2025-04-29 11:26:55,912 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:26:55,912 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1502481338] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:26:55,912 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:26:55,913 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 12] total 32 [2025-04-29 11:26:55,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1787193090] [2025-04-29 11:26:55,913 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:26:55,913 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2025-04-29 11:26:55,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:26:55,914 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2025-04-29 11:26:55,915 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=917, Unknown=0, NotChecked=0, Total=1056 [2025-04-29 11:26:55,915 INFO L87 Difference]: Start difference. First operand 32 states and 33 transitions. Second operand has 33 states, 32 states have (on average 1.5) internal successors, (48), 33 states have internal predecessors, (48), 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-29 11:26:56,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:26:56,479 INFO L93 Difference]: Finished difference Result 46 states and 47 transitions. [2025-04-29 11:26:56,480 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-04-29 11:26:56,480 INFO L79 Accepts]: Start accepts. Automaton has has 33 states, 32 states have (on average 1.5) internal successors, (48), 33 states have internal predecessors, (48), 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 21 [2025-04-29 11:26:56,480 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:26:56,480 INFO L225 Difference]: With dead ends: 46 [2025-04-29 11:26:56,480 INFO L226 Difference]: Without dead ends: 39 [2025-04-29 11:26:56,481 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 20 SyntacticMatches, 2 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 310 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=271, Invalid=1535, Unknown=0, NotChecked=0, Total=1806 [2025-04-29 11:26:56,481 INFO L437 NwaCegarLoop]: 13 mSDtfsCounter, 37 mSDsluCounter, 144 mSDsCounter, 0 mSdLazyCounter, 349 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 157 SdHoareTripleChecker+Invalid, 358 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 349 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-29 11:26:56,482 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 157 Invalid, 358 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 349 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-29 11:26:56,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2025-04-29 11:26:56,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 36. [2025-04-29 11:26:56,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 33 states have (on average 1.0909090909090908) internal successors, (36), 35 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-29 11:26:56,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 36 transitions. [2025-04-29 11:26:56,483 INFO L79 Accepts]: Start accepts. Automaton has 36 states and 36 transitions. Word has length 21 [2025-04-29 11:26:56,483 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:26:56,483 INFO L485 AbstractCegarLoop]: Abstraction has 36 states and 36 transitions. [2025-04-29 11:26:56,483 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 32 states have (on average 1.5) internal successors, (48), 33 states have internal predecessors, (48), 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-29 11:26:56,483 INFO L278 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2025-04-29 11:26:56,483 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-29 11:26:56,483 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:26:56,484 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:26:56,490 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-04-29 11:26:56,688 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,SelfDestructingSolverStorable15 [2025-04-29 11:26:56,688 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2025-04-29 11:26:56,688 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:26:56,688 INFO L85 PathProgramCache]: Analyzing trace with hash -1670832583, now seen corresponding path program 1 times [2025-04-29 11:26:56,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:26:56,689 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1539205472] [2025-04-29 11:26:56,689 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:26:56,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:26:56,694 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-04-29 11:26:56,701 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-04-29 11:26:56,701 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:26:56,701 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:26:57,001 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:26:57,001 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:26:57,001 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1539205472] [2025-04-29 11:26:57,001 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1539205472] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:26:57,002 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [298208649] [2025-04-29 11:26:57,002 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:26:57,002 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:26:57,002 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:26:57,004 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-29 11:26:57,005 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-29 11:26:57,043 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-04-29 11:26:57,058 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-04-29 11:26:57,058 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:26:57,058 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:26:57,061 INFO L256 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 42 conjuncts are in the unsatisfiable core [2025-04-29 11:26:57,063 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:26:57,082 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 14 treesize of output 10 [2025-04-29 11:26:57,860 INFO L325 Elim1Store]: treesize reduction 8, result has 65.2 percent of original size [2025-04-29 11:26:57,861 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 49 treesize of output 36 [2025-04-29 11:26:57,915 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 11:26:57,915 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 16 treesize of output 20 [2025-04-29 11:26:57,963 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:26:57,964 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:26:58,410 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 11:26:58,410 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 23 treesize of output 26 [2025-04-29 11:26:58,665 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 25 [2025-04-29 11:26:58,670 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 39 [2025-04-29 11:26:58,675 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 5 treesize of output 3 [2025-04-29 11:26:58,703 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:26:58,703 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [298208649] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:26:58,703 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:26:58,704 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 19, 19] total 43 [2025-04-29 11:26:58,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1305754160] [2025-04-29 11:26:58,704 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:26:58,704 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2025-04-29 11:26:58,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:26:58,704 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2025-04-29 11:26:58,705 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=1592, Unknown=0, NotChecked=0, Total=1892 [2025-04-29 11:26:58,705 INFO L87 Difference]: Start difference. First operand 36 states and 36 transitions. Second operand has 44 states, 43 states have (on average 1.5116279069767442) internal successors, (65), 44 states have internal predecessors, (65), 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-29 11:27:00,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:27:00,116 INFO L93 Difference]: Finished difference Result 38 states and 38 transitions. [2025-04-29 11:27:00,117 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2025-04-29 11:27:00,117 INFO L79 Accepts]: Start accepts. Automaton has has 44 states, 43 states have (on average 1.5116279069767442) internal successors, (65), 44 states have internal predecessors, (65), 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 25 [2025-04-29 11:27:00,117 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:27:00,117 INFO L225 Difference]: With dead ends: 38 [2025-04-29 11:27:00,117 INFO L226 Difference]: Without dead ends: 38 [2025-04-29 11:27:00,119 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 14 SyntacticMatches, 2 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1061 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=818, Invalid=3874, Unknown=0, NotChecked=0, Total=4692 [2025-04-29 11:27:00,119 INFO L437 NwaCegarLoop]: 6 mSDtfsCounter, 31 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 631 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 633 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 631 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-29 11:27:00,120 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 128 Invalid, 633 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 631 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-29 11:27:00,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2025-04-29 11:27:00,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 35. [2025-04-29 11:27:00,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 33 states have (on average 1.0606060606060606) internal successors, (35), 34 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:27:00,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 35 transitions. [2025-04-29 11:27:00,121 INFO L79 Accepts]: Start accepts. Automaton has 35 states and 35 transitions. Word has length 25 [2025-04-29 11:27:00,121 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:27:00,121 INFO L485 AbstractCegarLoop]: Abstraction has 35 states and 35 transitions. [2025-04-29 11:27:00,121 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 43 states have (on average 1.5116279069767442) internal successors, (65), 44 states have internal predecessors, (65), 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-29 11:27:00,121 INFO L278 IsEmpty]: Start isEmpty. Operand 35 states and 35 transitions. [2025-04-29 11:27:00,121 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-04-29 11:27:00,122 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:27:00,122 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:27:00,128 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-04-29 11:27:00,322 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:27:00,322 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2025-04-29 11:27:00,323 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:27:00,323 INFO L85 PathProgramCache]: Analyzing trace with hash -373369409, now seen corresponding path program 2 times [2025-04-29 11:27:00,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:27:00,323 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [761759728] [2025-04-29 11:27:00,323 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-29 11:27:00,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:27:00,329 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 29 statements into 2 equivalence classes. [2025-04-29 11:27:00,343 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 29 of 29 statements. [2025-04-29 11:27:00,343 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-29 11:27:00,343 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:27:00,785 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:27:00,786 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:27:00,786 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [761759728] [2025-04-29 11:27:00,786 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [761759728] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:27:00,786 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1660725573] [2025-04-29 11:27:00,786 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-29 11:27:00,786 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:27:00,786 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:27:00,790 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-29 11:27:00,795 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-29 11:27:00,829 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 29 statements into 2 equivalence classes. [2025-04-29 11:27:00,844 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 29 of 29 statements. [2025-04-29 11:27:00,844 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-29 11:27:00,844 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:27:00,845 INFO L256 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 45 conjuncts are in the unsatisfiable core [2025-04-29 11:27:00,847 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:27:00,882 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 14 treesize of output 10 [2025-04-29 11:27:11,434 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 11:27:11,434 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 37 treesize of output 33 [2025-04-29 11:27:15,585 INFO L325 Elim1Store]: treesize reduction 4, result has 76.5 percent of original size [2025-04-29 11:27:15,586 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 23 [2025-04-29 11:27:15,688 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 1 proven. 14 refuted. 3 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:27:15,688 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:27:16,424 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 11:27:16,424 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 41 treesize of output 36 [2025-04-29 11:27:16,543 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 25 [2025-04-29 11:27:16,547 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 11:27:16,548 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 29 treesize of output 23 [2025-04-29 11:27:16,553 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 21 treesize of output 17 [2025-04-29 11:27:16,624 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:27:16,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1660725573] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:27:16,625 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:27:16,625 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 21, 21] total 51 [2025-04-29 11:27:16,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1540275622] [2025-04-29 11:27:16,625 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:27:16,625 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2025-04-29 11:27:16,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:27:16,626 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2025-04-29 11:27:16,627 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=256, Invalid=2391, Unknown=5, NotChecked=0, Total=2652 [2025-04-29 11:27:16,627 INFO L87 Difference]: Start difference. First operand 35 states and 35 transitions. Second operand has 52 states, 51 states have (on average 1.4509803921568627) internal successors, (74), 52 states have internal predecessors, (74), 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-29 11:27:39,655 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-04-29 11:27:39,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:27:39,655 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions. [2025-04-29 11:27:39,661 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2025-04-29 11:27:39,661 INFO L79 Accepts]: Start accepts. Automaton has has 52 states, 51 states have (on average 1.4509803921568627) internal successors, (74), 52 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2025-04-29 11:27:39,662 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:27:39,662 INFO L225 Difference]: With dead ends: 36 [2025-04-29 11:27:39,662 INFO L226 Difference]: Without dead ends: 0 [2025-04-29 11:27:39,663 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 19 SyntacticMatches, 1 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1316 ImplicationChecksByTransitivity, 33.2s TimeCoverageRelationStatistics Valid=758, Invalid=5550, Unknown=12, NotChecked=0, Total=6320 [2025-04-29 11:27:39,663 INFO L437 NwaCegarLoop]: 5 mSDtfsCounter, 61 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 695 mSolverCounterSat, 5 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 129 SdHoareTripleChecker+Invalid, 704 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 695 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.3s IncrementalHoareTripleChecker+Time [2025-04-29 11:27:39,663 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 129 Invalid, 704 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 695 Invalid, 4 Unknown, 0 Unchecked, 5.3s Time] [2025-04-29 11:27:39,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-04-29 11:27:39,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-04-29 11:27:39,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:27:39,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-04-29 11:27:39,664 INFO L79 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 29 [2025-04-29 11:27:39,664 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:27:39,664 INFO L485 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-29 11:27:39,664 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 51 states have (on average 1.4509803921568627) internal successors, (74), 52 states have internal predecessors, (74), 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-29 11:27:39,664 INFO L278 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-04-29 11:27:39,664 INFO L284 IsEmpty]: Finished isEmpty. No accepting run. [2025-04-29 11:27:39,666 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 15 remaining) [2025-04-29 11:27:39,667 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 15 remaining) [2025-04-29 11:27:39,667 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 15 remaining) [2025-04-29 11:27:39,667 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 15 remaining) [2025-04-29 11:27:39,667 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 15 remaining) [2025-04-29 11:27:39,667 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 15 remaining) [2025-04-29 11:27:39,667 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 15 remaining) [2025-04-29 11:27:39,667 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 15 remaining) [2025-04-29 11:27:39,668 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 15 remaining) [2025-04-29 11:27:39,668 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 15 remaining) [2025-04-29 11:27:39,668 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 15 remaining) [2025-04-29 11:27:39,668 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 15 remaining) [2025-04-29 11:27:39,669 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 15 remaining) [2025-04-29 11:27:39,669 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 15 remaining) [2025-04-29 11:27:39,669 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK (0 of 15 remaining) [2025-04-29 11:27:39,675 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-04-29 11:27:39,869 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,SelfDestructingSolverStorable17 [2025-04-29 11:27:39,871 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:27:39,873 INFO L171 ceAbstractionStarter]: Computing trace abstraction results [2025-04-29 11:27:39,874 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.04 11:27:39 BoogieIcfgContainer [2025-04-29 11:27:39,874 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-04-29 11:27:39,875 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-04-29 11:27:39,875 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-04-29 11:27:39,875 INFO L274 PluginConnector]: Witness Printer initialized [2025-04-29 11:27:39,876 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.04 11:26:50" (3/4) ... [2025-04-29 11:27:39,877 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-04-29 11:27:39,883 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges [2025-04-29 11:27:39,883 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2025-04-29 11:27:39,883 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2025-04-29 11:27:39,883 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-04-29 11:27:39,943 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-04-29 11:27:39,943 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-04-29 11:27:39,943 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-04-29 11:27:39,944 INFO L158 Benchmark]: Toolchain (without parser) took 49719.20ms. Allocated memory was 142.6MB in the beginning and 343.9MB in the end (delta: 201.3MB). Free memory was 111.0MB in the beginning and 128.1MB in the end (delta: -17.1MB). Peak memory consumption was 179.2MB. Max. memory is 16.1GB. [2025-04-29 11:27:39,944 INFO L158 Benchmark]: CDTParser took 1.03ms. Allocated memory is still 201.3MB. Free memory is still 125.0MB. There was no memory consumed. Max. memory is 16.1GB. [2025-04-29 11:27:39,944 INFO L158 Benchmark]: CACSL2BoogieTranslator took 198.48ms. Allocated memory is still 142.6MB. Free memory was 109.8MB in the beginning and 96.2MB in the end (delta: 13.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-04-29 11:27:39,944 INFO L158 Benchmark]: Boogie Procedure Inliner took 24.40ms. Allocated memory is still 142.6MB. Free memory was 96.2MB in the beginning and 95.0MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-04-29 11:27:39,944 INFO L158 Benchmark]: Boogie Preprocessor took 27.26ms. Allocated memory is still 142.6MB. Free memory was 95.0MB in the beginning and 93.7MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. [2025-04-29 11:27:39,944 INFO L158 Benchmark]: RCFGBuilder took 288.70ms. Allocated memory is still 142.6MB. Free memory was 92.5MB in the beginning and 78.2MB in the end (delta: 14.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-04-29 11:27:39,944 INFO L158 Benchmark]: TraceAbstraction took 49107.15ms. Allocated memory was 142.6MB in the beginning and 343.9MB in the end (delta: 201.3MB). Free memory was 78.2MB in the beginning and 132.0MB in the end (delta: -53.8MB). Peak memory consumption was 145.6MB. Max. memory is 16.1GB. [2025-04-29 11:27:39,945 INFO L158 Benchmark]: Witness Printer took 68.15ms. Allocated memory is still 343.9MB. Free memory was 132.0MB in the beginning and 128.1MB in the end (delta: 3.9MB). There was no memory consumed. Max. memory is 16.1GB. [2025-04-29 11:27:39,946 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.03ms. Allocated memory is still 201.3MB. Free memory is still 125.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 198.48ms. Allocated memory is still 142.6MB. Free memory was 109.8MB in the beginning and 96.2MB in the end (delta: 13.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 24.40ms. Allocated memory is still 142.6MB. Free memory was 96.2MB in the beginning and 95.0MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 27.26ms. Allocated memory is still 142.6MB. Free memory was 95.0MB in the beginning and 93.7MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 288.70ms. Allocated memory is still 142.6MB. Free memory was 92.5MB in the beginning and 78.2MB in the end (delta: 14.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 49107.15ms. Allocated memory was 142.6MB in the beginning and 343.9MB in the end (delta: 201.3MB). Free memory was 78.2MB in the beginning and 132.0MB in the end (delta: -53.8MB). Peak memory consumption was 145.6MB. Max. memory is 16.1GB. * Witness Printer took 68.15ms. Allocated memory is still 343.9MB. Free memory was 132.0MB in the beginning and 128.1MB in the end (delta: 3.9MB). 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 - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 27]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 39 locations, 43 edges, 15 error locations. Started 1 CEGAR loops. OverallTime: 49.1s, OverallIterations: 18, TraceHistogramMax: 3, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 26.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 4 mSolverCounterUnknown, 261 SdHoareTripleChecker+Valid, 6.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 261 mSDsluCounter, 1604 SdHoareTripleChecker+Invalid, 6.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1183 mSDsCounter, 45 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2494 IncrementalHoareTripleChecker+Invalid, 2543 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 45 mSolverCounterUnsat, 421 mSDtfsCounter, 2494 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 362 GetRequests, 91 SyntacticMatches, 7 SemanticMatches, 264 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2804 ImplicationChecksByTransitivity, 37.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=48occurred in iteration=12, InterpolantAutomatonStates: 165, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 18 MinimizatonAttempts, 32 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 21.5s InterpolantComputationTime, 337 NumberOfCodeBlocks, 337 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 403 ConstructedInterpolants, 59 QuantifiedInterpolants, 5607 SizeOfPredicates, 45 NumberOfNonLiveVariables, 510 ConjunctsInSsa, 137 ConjunctsInUnsatCore, 26 InterpolantComputations, 14 PerfectInterpolantSequences, 12/109 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 - AllSpecificationsHoldResult: All specifications hold 15 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-04-29 11:27:39,969 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE