./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/valid-memsafety.prp --file ../../../trunk/examples/svcomp/termination-memory-alloca/cstrcpy-alloca-2.i --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-memory-alloca/cstrcpy-alloca-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 624eab544b12ce67976c98f49727abb376f7f963832aa58f07a7fb9fd050787e --- Real Ultimate output --- This is Ultimate 0.3.0-wip.fs.system-includes-da04345-m [2025-04-30 10:48:26,409 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-30 10:48:26,462 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Default.epf [2025-04-30 10:48:26,465 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-30 10:48:26,465 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-30 10:48:26,492 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-30 10:48:26,492 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-30 10:48:26,492 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-30 10:48:26,493 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-30 10:48:26,493 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-30 10:48:26,493 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-30 10:48:26,494 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-30 10:48:26,494 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-30 10:48:26,494 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-30 10:48:26,494 INFO L153 SettingsManager]: * Use SBE=true [2025-04-30 10:48:26,494 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-30 10:48:26,495 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-30 10:48:26,495 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-30 10:48:26,495 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-04-30 10:48:26,495 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-04-30 10:48:26,495 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-04-30 10:48:26,495 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-30 10:48:26,495 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-04-30 10:48:26,495 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-04-30 10:48:26,495 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-30 10:48:26,495 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-30 10:48:26,495 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-30 10:48:26,496 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-30 10:48:26,496 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-30 10:48:26,496 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-30 10:48:26,496 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-30 10:48:26,496 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-30 10:48:26,496 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-30 10:48:26,496 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-30 10:48:26,497 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-30 10:48:26,497 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-30 10:48:26,497 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-30 10:48:26,497 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-30 10:48:26,497 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-30 10:48:26,497 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-30 10:48:26,497 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-30 10:48:26,497 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-30 10:48:26,497 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-30 10:48:26,497 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 -> 624eab544b12ce67976c98f49727abb376f7f963832aa58f07a7fb9fd050787e [2025-04-30 10:48:26,739 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-30 10:48:26,747 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-30 10:48:26,749 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-30 10:48:26,750 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-30 10:48:26,750 INFO L274 PluginConnector]: CDTParser initialized [2025-04-30 10:48:26,751 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/termination-memory-alloca/cstrcpy-alloca-2.i [2025-04-30 10:48:28,093 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/032402ef9/aa74b60780524382a0c63ffbd477c952/FLAGcdf6cf87a [2025-04-30 10:48:28,353 INFO L389 CDTParser]: Found 1 translation units. [2025-04-30 10:48:28,353 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/termination-memory-alloca/cstrcpy-alloca-2.i [2025-04-30 10:48:28,364 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/032402ef9/aa74b60780524382a0c63ffbd477c952/FLAGcdf6cf87a [2025-04-30 10:48:29,143 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/032402ef9/aa74b60780524382a0c63ffbd477c952 [2025-04-30 10:48:29,145 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-30 10:48:29,146 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-04-30 10:48:29,147 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-30 10:48:29,147 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-30 10:48:29,150 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-30 10:48:29,151 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.04 10:48:29" (1/1) ... [2025-04-30 10:48:29,153 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2c589068 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:48:29, skipping insertion in model container [2025-04-30 10:48:29,153 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.04 10:48:29" (1/1) ... [2025-04-30 10:48:29,177 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-30 10:48:29,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-30 10:48:29,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-30 10:48:29,380 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-30 10:48:29,386 INFO L200 MainTranslator]: Completed pre-run [2025-04-30 10:48:29,426 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-30 10:48:29,448 INFO L204 MainTranslator]: Completed translation [2025-04-30 10:48:29,448 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:48:29 WrapperNode [2025-04-30 10:48:29,448 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-30 10:48:29,449 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-30 10:48:29,449 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-30 10:48:29,449 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-30 10:48:29,453 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:48:29" (1/1) ... [2025-04-30 10:48:29,461 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:48:29" (1/1) ... [2025-04-30 10:48:29,477 INFO L138 Inliner]: procedures = 111, calls = 12, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 57 [2025-04-30 10:48:29,477 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-30 10:48:29,478 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-30 10:48:29,478 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-30 10:48:29,478 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-30 10:48:29,483 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:48:29" (1/1) ... [2025-04-30 10:48:29,483 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:48:29" (1/1) ... [2025-04-30 10:48:29,487 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:48:29" (1/1) ... [2025-04-30 10:48:29,499 INFO L175 MemorySlicer]: Split 3 memory accesses to 2 slices as follows [2, 1]. 67 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-30 10:48:29,500 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:48:29" (1/1) ... [2025-04-30 10:48:29,500 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:48:29" (1/1) ... [2025-04-30 10:48:29,502 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:48:29" (1/1) ... [2025-04-30 10:48:29,503 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:48:29" (1/1) ... [2025-04-30 10:48:29,504 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:48:29" (1/1) ... [2025-04-30 10:48:29,505 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:48:29" (1/1) ... [2025-04-30 10:48:29,505 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:48:29" (1/1) ... [2025-04-30 10:48:29,508 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-30 10:48:29,508 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-30 10:48:29,508 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-30 10:48:29,508 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-30 10:48:29,509 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:48:29" (1/1) ... [2025-04-30 10:48:29,512 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-30 10:48:29,524 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:48:29,532 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-04-30 10:48:29,534 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-04-30 10:48:29,550 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-04-30 10:48:29,550 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-04-30 10:48:29,550 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-04-30 10:48:29,551 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-04-30 10:48:29,551 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-04-30 10:48:29,551 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-04-30 10:48:29,551 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-30 10:48:29,551 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-30 10:48:29,619 INFO L234 CfgBuilder]: Building ICFG [2025-04-30 10:48:29,620 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-30 10:48:29,715 INFO L? ?]: Removed 38 outVars from TransFormulas that were not future-live. [2025-04-30 10:48:29,716 INFO L283 CfgBuilder]: Performing block encoding [2025-04-30 10:48:29,721 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-30 10:48:29,721 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-04-30 10:48:29,721 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.04 10:48:29 BoogieIcfgContainer [2025-04-30 10:48:29,721 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-30 10:48:29,723 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-30 10:48:29,723 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-30 10:48:29,725 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-30 10:48:29,726 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.04 10:48:29" (1/3) ... [2025-04-30 10:48:29,726 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c4af372 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.04 10:48:29, skipping insertion in model container [2025-04-30 10:48:29,726 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:48:29" (2/3) ... [2025-04-30 10:48:29,726 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c4af372 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.04 10:48:29, skipping insertion in model container [2025-04-30 10:48:29,726 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.04 10:48:29" (3/3) ... [2025-04-30 10:48:29,727 INFO L128 eAbstractionObserver]: Analyzing ICFG cstrcpy-alloca-2.i [2025-04-30 10:48:29,736 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-30 10:48:29,737 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG cstrcpy-alloca-2.i that has 1 procedures, 23 locations, 27 edges, 1 initial locations, 1 loop locations, and 7 error locations. [2025-04-30 10:48:29,765 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-30 10:48:29,775 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;@26d8f6e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-30 10:48:29,775 INFO L341 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2025-04-30 10:48:29,778 INFO L278 IsEmpty]: Start isEmpty. Operand has 23 states, 15 states have (on average 1.8) internal successors, (27), 22 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:48:29,781 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-04-30 10:48:29,781 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:48:29,781 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-04-30 10:48:29,781 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 4 more)] === [2025-04-30 10:48:29,785 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:48:29,786 INFO L85 PathProgramCache]: Analyzing trace with hash 889510823, now seen corresponding path program 1 times [2025-04-30 10:48:29,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:48:29,791 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1070066769] [2025-04-30 10:48:29,791 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:48:29,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:48:29,841 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-30 10:48:29,849 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-30 10:48:29,850 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:48:29,850 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:48:29,919 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:48:29,920 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:48:29,920 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1070066769] [2025-04-30 10:48:29,921 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1070066769] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:48:29,922 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:48:29,922 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-30 10:48:29,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [603995425] [2025-04-30 10:48:29,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:48:29,925 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-30 10:48:29,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:48:29,941 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-30 10:48:29,942 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-30 10:48:29,943 INFO L87 Difference]: Start difference. First operand has 23 states, 15 states have (on average 1.8) internal successors, (27), 22 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 1.5) 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-30 10:48:29,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:48:29,992 INFO L93 Difference]: Finished difference Result 24 states and 27 transitions. [2025-04-30 10:48:29,994 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-30 10:48:29,995 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.5) 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-30 10:48:29,995 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:48:29,999 INFO L225 Difference]: With dead ends: 24 [2025-04-30 10:48:29,999 INFO L226 Difference]: Without dead ends: 22 [2025-04-30 10:48:30,000 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-04-30 10:48:30,005 INFO L437 NwaCegarLoop]: 24 mSDtfsCounter, 2 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-30 10:48:30,006 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 58 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-30 10:48:30,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2025-04-30 10:48:30,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2025-04-30 10:48:30,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 15 states have (on average 1.6666666666666667) internal successors, (25), 21 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:48:30,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 25 transitions. [2025-04-30 10:48:30,029 INFO L79 Accepts]: Start accepts. Automaton has 22 states and 25 transitions. Word has length 6 [2025-04-30 10:48:30,030 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:48:30,030 INFO L485 AbstractCegarLoop]: Abstraction has 22 states and 25 transitions. [2025-04-30 10:48:30,030 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.5) 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-30 10:48:30,030 INFO L278 IsEmpty]: Start isEmpty. Operand 22 states and 25 transitions. [2025-04-30 10:48:30,030 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-04-30 10:48:30,030 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:48:30,030 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-04-30 10:48:30,030 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-30 10:48:30,030 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 4 more)] === [2025-04-30 10:48:30,031 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:48:30,031 INFO L85 PathProgramCache]: Analyzing trace with hash 889510859, now seen corresponding path program 1 times [2025-04-30 10:48:30,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:48:30,031 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2071720587] [2025-04-30 10:48:30,031 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:48:30,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:48:30,037 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-30 10:48:30,058 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-30 10:48:30,058 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:48:30,058 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:48:30,297 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:48:30,297 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:48:30,298 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2071720587] [2025-04-30 10:48:30,298 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2071720587] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:48:30,298 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:48:30,298 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-30 10:48:30,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [769888772] [2025-04-30 10:48:30,298 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:48:30,299 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-30 10:48:30,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:48:30,300 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-30 10:48:30,300 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-30 10:48:30,300 INFO L87 Difference]: Start difference. First operand 22 states and 25 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-30 10:48:30,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:48:30,336 INFO L93 Difference]: Finished difference Result 22 states and 26 transitions. [2025-04-30 10:48:30,336 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-30 10:48:30,337 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-30 10:48:30,337 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:48:30,337 INFO L225 Difference]: With dead ends: 22 [2025-04-30 10:48:30,337 INFO L226 Difference]: Without dead ends: 22 [2025-04-30 10:48:30,337 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-04-30 10:48:30,338 INFO L437 NwaCegarLoop]: 19 mSDtfsCounter, 3 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-30 10:48:30,338 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 45 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-30 10:48:30,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2025-04-30 10:48:30,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 21. [2025-04-30 10:48:30,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 15 states have (on average 1.6) internal successors, (24), 20 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:48:30,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 24 transitions. [2025-04-30 10:48:30,340 INFO L79 Accepts]: Start accepts. Automaton has 21 states and 24 transitions. Word has length 6 [2025-04-30 10:48:30,340 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:48:30,340 INFO L485 AbstractCegarLoop]: Abstraction has 21 states and 24 transitions. [2025-04-30 10:48:30,340 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-30 10:48:30,340 INFO L278 IsEmpty]: Start isEmpty. Operand 21 states and 24 transitions. [2025-04-30 10:48:30,340 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-04-30 10:48:30,341 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:48:30,341 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-04-30 10:48:30,341 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-30 10:48:30,341 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 4 more)] === [2025-04-30 10:48:30,341 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:48:30,341 INFO L85 PathProgramCache]: Analyzing trace with hash 889510860, now seen corresponding path program 1 times [2025-04-30 10:48:30,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:48:30,342 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [252513939] [2025-04-30 10:48:30,342 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:48:30,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:48:30,349 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-30 10:48:30,355 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-30 10:48:30,355 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:48:30,355 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:48:30,479 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:48:30,479 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:48:30,479 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [252513939] [2025-04-30 10:48:30,479 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [252513939] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:48:30,479 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:48:30,479 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-30 10:48:30,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2042433221] [2025-04-30 10:48:30,479 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:48:30,479 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-30 10:48:30,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:48:30,480 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-30 10:48:30,480 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-30 10:48:30,480 INFO L87 Difference]: Start difference. First operand 21 states and 24 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-30 10:48:30,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:48:30,513 INFO L93 Difference]: Finished difference Result 22 states and 25 transitions. [2025-04-30 10:48:30,514 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-30 10:48:30,514 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-30 10:48:30,514 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:48:30,514 INFO L225 Difference]: With dead ends: 22 [2025-04-30 10:48:30,514 INFO L226 Difference]: Without dead ends: 22 [2025-04-30 10:48:30,514 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-30 10:48:30,515 INFO L437 NwaCegarLoop]: 21 mSDtfsCounter, 0 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-30 10:48:30,515 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 48 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-30 10:48:30,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2025-04-30 10:48:30,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2025-04-30 10:48:30,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 16 states have (on average 1.5625) internal successors, (25), 21 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:48:30,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 25 transitions. [2025-04-30 10:48:30,520 INFO L79 Accepts]: Start accepts. Automaton has 22 states and 25 transitions. Word has length 6 [2025-04-30 10:48:30,520 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:48:30,520 INFO L485 AbstractCegarLoop]: Abstraction has 22 states and 25 transitions. [2025-04-30 10:48:30,520 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-30 10:48:30,520 INFO L278 IsEmpty]: Start isEmpty. Operand 22 states and 25 transitions. [2025-04-30 10:48:30,520 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-04-30 10:48:30,520 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:48:30,520 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-04-30 10:48:30,521 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-30 10:48:30,521 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 4 more)] === [2025-04-30 10:48:30,521 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:48:30,521 INFO L85 PathProgramCache]: Analyzing trace with hash 889512745, now seen corresponding path program 1 times [2025-04-30 10:48:30,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:48:30,523 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1894011183] [2025-04-30 10:48:30,523 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:48:30,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:48:30,527 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-30 10:48:30,528 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-30 10:48:30,528 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:48:30,528 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:48:30,542 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:48:30,543 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:48:30,543 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1894011183] [2025-04-30 10:48:30,543 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1894011183] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:48:30,543 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:48:30,543 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-30 10:48:30,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1244749781] [2025-04-30 10:48:30,543 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:48:30,543 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-30 10:48:30,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:48:30,544 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-30 10:48:30,544 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-30 10:48:30,545 INFO L87 Difference]: Start difference. First operand 22 states and 25 transitions. 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-30 10:48:30,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:48:30,560 INFO L93 Difference]: Finished difference Result 23 states and 25 transitions. [2025-04-30 10:48:30,560 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-30 10:48:30,561 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-30 10:48:30,561 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:48:30,561 INFO L225 Difference]: With dead ends: 23 [2025-04-30 10:48:30,561 INFO L226 Difference]: Without dead ends: 22 [2025-04-30 10:48:30,561 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-30 10:48:30,562 INFO L437 NwaCegarLoop]: 22 mSDtfsCounter, 2 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-30 10:48:30,565 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 30 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-30 10:48:30,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2025-04-30 10:48:30,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2025-04-30 10:48:30,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 16 states have (on average 1.5) internal successors, (24), 21 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:48:30,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 24 transitions. [2025-04-30 10:48:30,569 INFO L79 Accepts]: Start accepts. Automaton has 22 states and 24 transitions. Word has length 6 [2025-04-30 10:48:30,570 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:48:30,570 INFO L485 AbstractCegarLoop]: Abstraction has 22 states and 24 transitions. [2025-04-30 10:48:30,570 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-30 10:48:30,571 INFO L278 IsEmpty]: Start isEmpty. Operand 22 states and 24 transitions. [2025-04-30 10:48:30,571 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-04-30 10:48:30,571 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:48:30,571 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-04-30 10:48:30,571 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-30 10:48:30,571 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 4 more)] === [2025-04-30 10:48:30,571 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:48:30,571 INFO L85 PathProgramCache]: Analyzing trace with hash 889512782, now seen corresponding path program 1 times [2025-04-30 10:48:30,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:48:30,572 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [65809933] [2025-04-30 10:48:30,572 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:48:30,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:48:30,578 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-30 10:48:30,582 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-30 10:48:30,582 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:48:30,583 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:48:30,694 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:48:30,695 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:48:30,695 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [65809933] [2025-04-30 10:48:30,695 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [65809933] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:48:30,695 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:48:30,695 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-30 10:48:30,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1880900429] [2025-04-30 10:48:30,695 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:48:30,695 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-30 10:48:30,695 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:48:30,695 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-30 10:48:30,695 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-04-30 10:48:30,695 INFO L87 Difference]: Start difference. First operand 22 states and 24 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-30 10:48:30,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:48:30,706 INFO L93 Difference]: Finished difference Result 21 states and 23 transitions. [2025-04-30 10:48:30,706 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-30 10:48:30,706 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-30 10:48:30,706 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:48:30,707 INFO L225 Difference]: With dead ends: 21 [2025-04-30 10:48:30,707 INFO L226 Difference]: Without dead ends: 21 [2025-04-30 10:48:30,707 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-30 10:48:30,707 INFO L437 NwaCegarLoop]: 17 mSDtfsCounter, 1 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 35 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-30 10:48:30,707 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 35 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-30 10:48:30,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2025-04-30 10:48:30,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 19. [2025-04-30 10:48:30,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 14 states have (on average 1.5) internal successors, (21), 18 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:48:30,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 21 transitions. [2025-04-30 10:48:30,709 INFO L79 Accepts]: Start accepts. Automaton has 19 states and 21 transitions. Word has length 6 [2025-04-30 10:48:30,709 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:48:30,709 INFO L485 AbstractCegarLoop]: Abstraction has 19 states and 21 transitions. [2025-04-30 10:48:30,709 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-30 10:48:30,709 INFO L278 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2025-04-30 10:48:30,709 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-04-30 10:48:30,709 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:48:30,709 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:48:30,709 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-30 10:48:30,709 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 4 more)] === [2025-04-30 10:48:30,710 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:48:30,710 INFO L85 PathProgramCache]: Analyzing trace with hash -530222673, now seen corresponding path program 1 times [2025-04-30 10:48:30,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:48:30,710 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [13074219] [2025-04-30 10:48:30,710 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:48:30,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:48:30,719 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-30 10:48:30,722 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-30 10:48:30,722 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:48:30,722 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:48:30,783 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:48:30,784 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:48:30,784 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [13074219] [2025-04-30 10:48:30,784 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [13074219] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:48:30,784 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:48:30,784 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-30 10:48:30,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1353191182] [2025-04-30 10:48:30,784 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:48:30,785 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-30 10:48:30,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:48:30,785 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-30 10:48:30,785 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-30 10:48:30,785 INFO L87 Difference]: Start difference. First operand 19 states and 21 transitions. Second operand has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:48:30,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:48:30,830 INFO L93 Difference]: Finished difference Result 18 states and 20 transitions. [2025-04-30 10:48:30,830 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-30 10:48:30,830 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2025-04-30 10:48:30,830 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:48:30,831 INFO L225 Difference]: With dead ends: 18 [2025-04-30 10:48:30,831 INFO L226 Difference]: Without dead ends: 18 [2025-04-30 10:48:30,831 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-04-30 10:48:30,831 INFO L437 NwaCegarLoop]: 12 mSDtfsCounter, 8 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-30 10:48:30,832 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 30 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-30 10:48:30,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2025-04-30 10:48:30,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2025-04-30 10:48:30,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 17 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:48:30,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 20 transitions. [2025-04-30 10:48:30,834 INFO L79 Accepts]: Start accepts. Automaton has 18 states and 20 transitions. Word has length 9 [2025-04-30 10:48:30,834 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:48:30,834 INFO L485 AbstractCegarLoop]: Abstraction has 18 states and 20 transitions. [2025-04-30 10:48:30,834 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:48:30,834 INFO L278 IsEmpty]: Start isEmpty. Operand 18 states and 20 transitions. [2025-04-30 10:48:30,834 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-04-30 10:48:30,834 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:48:30,835 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:48:30,835 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-04-30 10:48:30,835 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 4 more)] === [2025-04-30 10:48:30,835 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:48:30,835 INFO L85 PathProgramCache]: Analyzing trace with hash -530222672, now seen corresponding path program 1 times [2025-04-30 10:48:30,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:48:30,835 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2084855882] [2025-04-30 10:48:30,835 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:48:30,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:48:30,844 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-30 10:48:30,850 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-30 10:48:30,850 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:48:30,850 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:48:31,001 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:48:31,002 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:48:31,002 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2084855882] [2025-04-30 10:48:31,002 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2084855882] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:48:31,002 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:48:31,002 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-30 10:48:31,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1597465275] [2025-04-30 10:48:31,002 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:48:31,002 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-30 10:48:31,002 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:48:31,002 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-30 10:48:31,003 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-04-30 10:48:31,003 INFO L87 Difference]: Start difference. First operand 18 states and 20 transitions. Second operand has 7 states, 6 states have (on average 1.5) internal successors, (9), 7 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-30 10:48:31,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:48:31,034 INFO L93 Difference]: Finished difference Result 20 states and 22 transitions. [2025-04-30 10:48:31,034 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-30 10:48:31,034 INFO L79 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.5) internal successors, (9), 7 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-30 10:48:31,035 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:48:31,035 INFO L225 Difference]: With dead ends: 20 [2025-04-30 10:48:31,035 INFO L226 Difference]: Without dead ends: 20 [2025-04-30 10:48:31,035 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-04-30 10:48:31,035 INFO L437 NwaCegarLoop]: 15 mSDtfsCounter, 0 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-30 10:48:31,035 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 67 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-30 10:48:31,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2025-04-30 10:48:31,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2025-04-30 10:48:31,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 16 states have (on average 1.375) internal successors, (22), 19 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:48:31,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 22 transitions. [2025-04-30 10:48:31,037 INFO L79 Accepts]: Start accepts. Automaton has 20 states and 22 transitions. Word has length 9 [2025-04-30 10:48:31,037 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:48:31,037 INFO L485 AbstractCegarLoop]: Abstraction has 20 states and 22 transitions. [2025-04-30 10:48:31,037 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.5) internal successors, (9), 7 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-30 10:48:31,037 INFO L278 IsEmpty]: Start isEmpty. Operand 20 states and 22 transitions. [2025-04-30 10:48:31,037 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-04-30 10:48:31,037 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:48:31,037 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:48:31,037 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-04-30 10:48:31,037 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 4 more)] === [2025-04-30 10:48:31,037 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:48:31,037 INFO L85 PathProgramCache]: Analyzing trace with hash 742966322, now seen corresponding path program 1 times [2025-04-30 10:48:31,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:48:31,037 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [129727277] [2025-04-30 10:48:31,038 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:48:31,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:48:31,042 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-30 10:48:31,050 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-30 10:48:31,050 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:48:31,050 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:48:31,143 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:48:31,143 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:48:31,144 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [129727277] [2025-04-30 10:48:31,144 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [129727277] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:48:31,144 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:48:31,144 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-30 10:48:31,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1719524212] [2025-04-30 10:48:31,144 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:48:31,144 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-30 10:48:31,144 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:48:31,145 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-30 10:48:31,145 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-30 10:48:31,145 INFO L87 Difference]: Start difference. First operand 20 states and 22 transitions. Second operand has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:48:31,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:48:31,181 INFO L93 Difference]: Finished difference Result 19 states and 21 transitions. [2025-04-30 10:48:31,181 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-30 10:48:31,181 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2025-04-30 10:48:31,182 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:48:31,182 INFO L225 Difference]: With dead ends: 19 [2025-04-30 10:48:31,182 INFO L226 Difference]: Without dead ends: 19 [2025-04-30 10:48:31,182 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-04-30 10:48:31,182 INFO L437 NwaCegarLoop]: 12 mSDtfsCounter, 8 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-30 10:48:31,182 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 29 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-30 10:48:31,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2025-04-30 10:48:31,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2025-04-30 10:48:31,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 16 states have (on average 1.3125) internal successors, (21), 18 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:48:31,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 21 transitions. [2025-04-30 10:48:31,184 INFO L79 Accepts]: Start accepts. Automaton has 19 states and 21 transitions. Word has length 10 [2025-04-30 10:48:31,184 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:48:31,184 INFO L485 AbstractCegarLoop]: Abstraction has 19 states and 21 transitions. [2025-04-30 10:48:31,184 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:48:31,184 INFO L278 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2025-04-30 10:48:31,184 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-04-30 10:48:31,184 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:48:31,184 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:48:31,184 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-04-30 10:48:31,184 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 4 more)] === [2025-04-30 10:48:31,186 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:48:31,186 INFO L85 PathProgramCache]: Analyzing trace with hash 742966323, now seen corresponding path program 1 times [2025-04-30 10:48:31,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:48:31,186 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [262874980] [2025-04-30 10:48:31,186 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:48:31,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:48:31,193 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-30 10:48:31,200 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-30 10:48:31,201 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:48:31,201 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:48:31,327 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:48:31,327 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:48:31,327 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [262874980] [2025-04-30 10:48:31,327 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [262874980] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:48:31,327 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:48:31,327 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-30 10:48:31,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1610185383] [2025-04-30 10:48:31,328 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:48:31,328 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-30 10:48:31,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:48:31,328 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-30 10:48:31,328 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-04-30 10:48:31,328 INFO L87 Difference]: Start difference. First operand 19 states and 21 transitions. Second operand has 6 states, 5 states have (on average 2.0) internal successors, (10), 6 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:48:31,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:48:31,357 INFO L93 Difference]: Finished difference Result 26 states and 29 transitions. [2025-04-30 10:48:31,357 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-30 10:48:31,357 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 6 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2025-04-30 10:48:31,357 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:48:31,357 INFO L225 Difference]: With dead ends: 26 [2025-04-30 10:48:31,357 INFO L226 Difference]: Without dead ends: 26 [2025-04-30 10:48:31,358 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-04-30 10:48:31,358 INFO L437 NwaCegarLoop]: 13 mSDtfsCounter, 1 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-30 10:48:31,358 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 51 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-30 10:48:31,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2025-04-30 10:48:31,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2025-04-30 10:48:31,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 25 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:48:31,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 29 transitions. [2025-04-30 10:48:31,359 INFO L79 Accepts]: Start accepts. Automaton has 26 states and 29 transitions. Word has length 10 [2025-04-30 10:48:31,359 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:48:31,359 INFO L485 AbstractCegarLoop]: Abstraction has 26 states and 29 transitions. [2025-04-30 10:48:31,360 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 6 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:48:31,360 INFO L278 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2025-04-30 10:48:31,360 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-04-30 10:48:31,360 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:48:31,360 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:48:31,360 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-04-30 10:48:31,360 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 4 more)] === [2025-04-30 10:48:31,360 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:48:31,360 INFO L85 PathProgramCache]: Analyzing trace with hash -66380303, now seen corresponding path program 1 times [2025-04-30 10:48:31,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:48:31,360 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1034649109] [2025-04-30 10:48:31,360 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:48:31,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:48:31,366 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-30 10:48:31,370 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-30 10:48:31,370 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:48:31,370 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:48:31,500 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:48:31,500 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:48:31,500 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1034649109] [2025-04-30 10:48:31,500 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1034649109] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:48:31,500 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:48:31,500 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-30 10:48:31,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [251618080] [2025-04-30 10:48:31,501 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:48:31,501 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-30 10:48:31,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:48:31,502 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-30 10:48:31,502 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-04-30 10:48:31,502 INFO L87 Difference]: Start difference. First operand 26 states and 29 transitions. Second operand has 7 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 7 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:48:31,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:48:31,542 INFO L93 Difference]: Finished difference Result 27 states and 30 transitions. [2025-04-30 10:48:31,542 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-30 10:48:31,542 INFO L79 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 7 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2025-04-30 10:48:31,543 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:48:31,543 INFO L225 Difference]: With dead ends: 27 [2025-04-30 10:48:31,543 INFO L226 Difference]: Without dead ends: 27 [2025-04-30 10:48:31,543 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-04-30 10:48:31,543 INFO L437 NwaCegarLoop]: 11 mSDtfsCounter, 2 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-30 10:48:31,544 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 41 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-30 10:48:31,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2025-04-30 10:48:31,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 20. [2025-04-30 10:48:31,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 19 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:48:31,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 22 transitions. [2025-04-30 10:48:31,546 INFO L79 Accepts]: Start accepts. Automaton has 20 states and 22 transitions. Word has length 10 [2025-04-30 10:48:31,546 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:48:31,546 INFO L485 AbstractCegarLoop]: Abstraction has 20 states and 22 transitions. [2025-04-30 10:48:31,547 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 7 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:48:31,547 INFO L278 IsEmpty]: Start isEmpty. Operand 20 states and 22 transitions. [2025-04-30 10:48:31,547 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-04-30 10:48:31,547 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:48:31,548 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:48:31,548 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-04-30 10:48:31,548 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 4 more)] === [2025-04-30 10:48:31,548 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:48:31,548 INFO L85 PathProgramCache]: Analyzing trace with hash 1743228086, now seen corresponding path program 1 times [2025-04-30 10:48:31,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:48:31,548 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [452594966] [2025-04-30 10:48:31,548 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:48:31,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:48:31,557 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-04-30 10:48:31,565 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-04-30 10:48:31,565 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:48:31,565 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:48:31,700 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:48:31,700 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:48:31,700 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [452594966] [2025-04-30 10:48:31,700 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [452594966] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:48:31,700 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:48:31,700 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-04-30 10:48:31,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1560879330] [2025-04-30 10:48:31,700 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:48:31,701 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-30 10:48:31,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:48:31,701 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-30 10:48:31,701 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-04-30 10:48:31,701 INFO L87 Difference]: Start difference. First operand 20 states and 22 transitions. Second operand has 8 states, 8 states have (on average 1.625) internal successors, (13), 8 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:48:31,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:48:31,736 INFO L93 Difference]: Finished difference Result 27 states and 29 transitions. [2025-04-30 10:48:31,737 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-30 10:48:31,737 INFO L79 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.625) internal successors, (13), 8 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2025-04-30 10:48:31,737 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:48:31,737 INFO L225 Difference]: With dead ends: 27 [2025-04-30 10:48:31,737 INFO L226 Difference]: Without dead ends: 27 [2025-04-30 10:48:31,738 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-04-30 10:48:31,738 INFO L437 NwaCegarLoop]: 12 mSDtfsCounter, 0 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-30 10:48:31,738 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 71 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-30 10:48:31,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2025-04-30 10:48:31,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2025-04-30 10:48:31,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 26 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:48:31,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 29 transitions. [2025-04-30 10:48:31,740 INFO L79 Accepts]: Start accepts. Automaton has 27 states and 29 transitions. Word has length 13 [2025-04-30 10:48:31,740 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:48:31,740 INFO L485 AbstractCegarLoop]: Abstraction has 27 states and 29 transitions. [2025-04-30 10:48:31,740 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.625) internal successors, (13), 8 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:48:31,741 INFO L278 IsEmpty]: Start isEmpty. Operand 27 states and 29 transitions. [2025-04-30 10:48:31,741 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-04-30 10:48:31,741 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:48:31,741 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:48:31,741 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-04-30 10:48:31,741 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 4 more)] === [2025-04-30 10:48:31,741 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:48:31,742 INFO L85 PathProgramCache]: Analyzing trace with hash 1350201076, now seen corresponding path program 1 times [2025-04-30 10:48:31,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:48:31,742 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [191593099] [2025-04-30 10:48:31,742 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:48:31,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:48:31,748 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-04-30 10:48:31,752 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-04-30 10:48:31,752 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:48:31,752 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:48:31,892 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:48:31,892 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:48:31,892 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [191593099] [2025-04-30 10:48:31,892 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [191593099] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:48:31,892 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:48:31,892 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-04-30 10:48:31,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [384977770] [2025-04-30 10:48:31,892 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:48:31,893 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-30 10:48:31,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:48:31,893 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-30 10:48:31,893 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-04-30 10:48:31,893 INFO L87 Difference]: Start difference. First operand 27 states and 29 transitions. Second operand has 9 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 9 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:48:31,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:48:31,942 INFO L93 Difference]: Finished difference Result 42 states and 45 transitions. [2025-04-30 10:48:31,943 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-30 10:48:31,943 INFO L79 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 9 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2025-04-30 10:48:31,943 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:48:31,944 INFO L225 Difference]: With dead ends: 42 [2025-04-30 10:48:31,944 INFO L226 Difference]: Without dead ends: 42 [2025-04-30 10:48:31,944 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-04-30 10:48:31,944 INFO L437 NwaCegarLoop]: 12 mSDtfsCounter, 1 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 71 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-30 10:48:31,944 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 71 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-30 10:48:31,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2025-04-30 10:48:31,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 28. [2025-04-30 10:48:31,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 25 states have (on average 1.24) internal successors, (31), 27 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:48:31,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 31 transitions. [2025-04-30 10:48:31,950 INFO L79 Accepts]: Start accepts. Automaton has 28 states and 31 transitions. Word has length 13 [2025-04-30 10:48:31,950 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:48:31,950 INFO L485 AbstractCegarLoop]: Abstraction has 28 states and 31 transitions. [2025-04-30 10:48:31,950 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 9 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:48:31,950 INFO L278 IsEmpty]: Start isEmpty. Operand 28 states and 31 transitions. [2025-04-30 10:48:31,951 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-04-30 10:48:31,951 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:48:31,951 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:48:31,951 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-04-30 10:48:31,951 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 4 more)] === [2025-04-30 10:48:31,951 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:48:31,952 INFO L85 PathProgramCache]: Analyzing trace with hash 2051265654, now seen corresponding path program 1 times [2025-04-30 10:48:31,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:48:31,952 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [271876031] [2025-04-30 10:48:31,952 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:48:31,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:48:31,958 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-04-30 10:48:31,963 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-04-30 10:48:31,963 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:48:31,963 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:48:32,221 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:48:32,222 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:48:32,222 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [271876031] [2025-04-30 10:48:32,222 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [271876031] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:48:32,222 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1199293703] [2025-04-30 10:48:32,222 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:48:32,222 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:48:32,222 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:48:32,224 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-30 10:48:32,226 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-04-30 10:48:32,268 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-04-30 10:48:32,285 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-04-30 10:48:32,285 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:48:32,285 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:48:32,291 INFO L256 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-04-30 10:48:32,294 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:48:32,341 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-30 10:48:32,488 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-30 10:48:32,488 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 20 treesize of output 17 [2025-04-30 10:48:32,561 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:48:32,561 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:48:32,815 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 15 treesize of output 13 [2025-04-30 10:48:32,822 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 20 treesize of output 16 [2025-04-30 10:48:32,830 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-30 10:48:32,837 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:48:32,837 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1199293703] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:48:32,837 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:48:32,837 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 19 [2025-04-30 10:48:32,837 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [459885217] [2025-04-30 10:48:32,837 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:48:32,838 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-04-30 10:48:32,838 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:48:32,838 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-04-30 10:48:32,838 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=325, Unknown=0, NotChecked=0, Total=380 [2025-04-30 10:48:32,838 INFO L87 Difference]: Start difference. First operand 28 states and 31 transitions. Second operand has 20 states, 19 states have (on average 1.4736842105263157) internal successors, (28), 20 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:48:33,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:48:33,040 INFO L93 Difference]: Finished difference Result 31 states and 35 transitions. [2025-04-30 10:48:33,040 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-30 10:48:33,040 INFO L79 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 1.4736842105263157) internal successors, (28), 20 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2025-04-30 10:48:33,040 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:48:33,040 INFO L225 Difference]: With dead ends: 31 [2025-04-30 10:48:33,040 INFO L226 Difference]: Without dead ends: 31 [2025-04-30 10:48:33,041 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 13 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=74, Invalid=432, Unknown=0, NotChecked=0, Total=506 [2025-04-30 10:48:33,041 INFO L437 NwaCegarLoop]: 11 mSDtfsCounter, 0 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 167 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 171 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 167 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-30 10:48:33,041 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 116 Invalid, 171 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 167 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-30 10:48:33,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2025-04-30 10:48:33,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2025-04-30 10:48:33,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 28 states have (on average 1.25) internal successors, (35), 30 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-30 10:48:33,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 35 transitions. [2025-04-30 10:48:33,043 INFO L79 Accepts]: Start accepts. Automaton has 31 states and 35 transitions. Word has length 13 [2025-04-30 10:48:33,043 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:48:33,043 INFO L485 AbstractCegarLoop]: Abstraction has 31 states and 35 transitions. [2025-04-30 10:48:33,043 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 1.4736842105263157) internal successors, (28), 20 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:48:33,043 INFO L278 IsEmpty]: Start isEmpty. Operand 31 states and 35 transitions. [2025-04-30 10:48:33,043 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-04-30 10:48:33,043 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:48:33,043 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:48:33,050 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-30 10:48:33,248 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-30 10:48:33,248 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 4 more)] === [2025-04-30 10:48:33,248 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:48:33,248 INFO L85 PathProgramCache]: Analyzing trace with hash -1794428712, now seen corresponding path program 1 times [2025-04-30 10:48:33,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:48:33,249 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1498633032] [2025-04-30 10:48:33,249 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:48:33,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:48:33,256 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-30 10:48:33,261 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-30 10:48:33,261 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:48:33,261 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:48:33,342 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:48:33,343 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:48:33,343 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1498633032] [2025-04-30 10:48:33,343 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1498633032] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:48:33,343 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:48:33,343 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-30 10:48:33,343 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [976370684] [2025-04-30 10:48:33,343 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:48:33,343 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-30 10:48:33,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:48:33,343 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-30 10:48:33,343 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-30 10:48:33,343 INFO L87 Difference]: Start difference. First operand 31 states and 35 transitions. Second operand has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:48:33,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:48:33,355 INFO L93 Difference]: Finished difference Result 30 states and 34 transitions. [2025-04-30 10:48:33,355 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-30 10:48:33,355 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2025-04-30 10:48:33,355 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:48:33,355 INFO L225 Difference]: With dead ends: 30 [2025-04-30 10:48:33,355 INFO L226 Difference]: Without dead ends: 19 [2025-04-30 10:48:33,356 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-30 10:48:33,356 INFO L437 NwaCegarLoop]: 13 mSDtfsCounter, 5 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-30 10:48:33,356 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 24 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-30 10:48:33,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2025-04-30 10:48:33,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2025-04-30 10:48:33,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 17 states have (on average 1.1176470588235294) internal successors, (19), 18 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:48:33,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2025-04-30 10:48:33,357 INFO L79 Accepts]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 14 [2025-04-30 10:48:33,357 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:48:33,357 INFO L485 AbstractCegarLoop]: Abstraction has 19 states and 19 transitions. [2025-04-30 10:48:33,358 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:48:33,358 INFO L278 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2025-04-30 10:48:33,358 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-04-30 10:48:33,358 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:48:33,358 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:48:33,358 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-04-30 10:48:33,358 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 4 more)] === [2025-04-30 10:48:33,358 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:48:33,358 INFO L85 PathProgramCache]: Analyzing trace with hash -835274195, now seen corresponding path program 1 times [2025-04-30 10:48:33,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:48:33,358 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1411835930] [2025-04-30 10:48:33,358 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:48:33,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:48:33,365 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-30 10:48:33,372 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-30 10:48:33,375 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:48:33,375 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:48:33,785 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:48:33,786 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:48:33,786 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1411835930] [2025-04-30 10:48:33,786 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1411835930] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:48:33,786 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1334496916] [2025-04-30 10:48:33,786 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:48:33,786 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:48:33,786 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:48:33,788 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-30 10:48:33,790 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-04-30 10:48:33,834 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-30 10:48:33,850 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-30 10:48:33,850 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:48:33,850 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:48:33,851 WARN L254 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 66 conjuncts are in the unsatisfiable core [2025-04-30 10:48:33,854 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:48:33,921 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-04-30 10:48:33,932 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 1 [2025-04-30 10:48:33,945 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2025-04-30 10:48:34,007 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2025-04-30 10:48:34,336 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-30 10:48:34,336 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 19 [2025-04-30 10:48:34,560 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:48:34,560 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:48:34,827 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-30 10:48:34,830 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 14 treesize of output 12 [2025-04-30 10:48:34,872 INFO L172 IndexEqualityManager]: detected equality via solver [2025-04-30 10:48:34,953 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:48:34,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1334496916] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:48:34,953 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:48:34,953 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 31 [2025-04-30 10:48:34,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [606222566] [2025-04-30 10:48:34,953 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:48:34,953 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2025-04-30 10:48:34,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:48:34,954 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2025-04-30 10:48:34,954 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=892, Unknown=0, NotChecked=0, Total=992 [2025-04-30 10:48:34,956 INFO L87 Difference]: Start difference. First operand 19 states and 19 transitions. Second operand has 32 states, 31 states have (on average 1.2903225806451613) internal successors, (40), 32 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-30 10:48:35,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:48:35,528 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2025-04-30 10:48:35,528 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-04-30 10:48:35,528 INFO L79 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 1.2903225806451613) internal successors, (40), 32 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) Word has length 14 [2025-04-30 10:48:35,529 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:48:35,529 INFO L225 Difference]: With dead ends: 19 [2025-04-30 10:48:35,529 INFO L226 Difference]: Without dead ends: 19 [2025-04-30 10:48:35,529 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 290 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=180, Invalid=1626, Unknown=0, NotChecked=0, Total=1806 [2025-04-30 10:48:35,530 INFO L437 NwaCegarLoop]: 3 mSDtfsCounter, 6 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 221 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 224 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 221 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-30 10:48:35,530 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 49 Invalid, 224 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 221 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-30 10:48:35,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2025-04-30 10:48:35,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 18. [2025-04-30 10:48:35,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 17 states have (on average 1.0588235294117647) internal successors, (18), 17 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-30 10:48:35,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2025-04-30 10:48:35,531 INFO L79 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 14 [2025-04-30 10:48:35,531 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:48:35,531 INFO L485 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions. [2025-04-30 10:48:35,531 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 31 states have (on average 1.2903225806451613) internal successors, (40), 32 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-30 10:48:35,531 INFO L278 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2025-04-30 10:48:35,533 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-04-30 10:48:35,534 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:48:35,534 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:48:35,540 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-04-30 10:48:35,734 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,SelfDestructingSolverStorable14 [2025-04-30 10:48:35,735 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 4 more)] === [2025-04-30 10:48:35,735 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:48:35,735 INFO L85 PathProgramCache]: Analyzing trace with hash 1386945660, now seen corresponding path program 2 times [2025-04-30 10:48:35,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:48:35,736 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [802226352] [2025-04-30 10:48:35,736 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-30 10:48:35,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:48:35,742 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 17 statements into 2 equivalence classes. [2025-04-30 10:48:35,755 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 17 of 17 statements. [2025-04-30 10:48:35,755 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-30 10:48:35,755 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:48:36,123 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:48:36,123 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:48:36,123 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [802226352] [2025-04-30 10:48:36,123 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [802226352] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:48:36,123 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [724904197] [2025-04-30 10:48:36,123 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-30 10:48:36,123 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:48:36,123 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:48:36,125 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-30 10:48:36,127 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-04-30 10:48:36,168 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 17 statements into 2 equivalence classes. [2025-04-30 10:48:36,187 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 17 of 17 statements. [2025-04-30 10:48:36,188 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-30 10:48:36,188 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:48:36,189 INFO L256 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 47 conjuncts are in the unsatisfiable core [2025-04-30 10:48:36,191 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:48:36,216 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-30 10:48:37,260 INFO L325 Elim1Store]: treesize reduction 4, result has 76.5 percent of original size [2025-04-30 10:48:37,261 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 30 treesize of output 23 [2025-04-30 10:48:37,306 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 2 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:48:37,307 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:48:37,605 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-30 10:48:37,613 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-30 10:48:37,623 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 29 treesize of output 23 [2025-04-30 10:48:37,666 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:48:37,667 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [724904197] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:48:37,667 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:48:37,667 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 30 [2025-04-30 10:48:37,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [881576255] [2025-04-30 10:48:37,667 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:48:37,668 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2025-04-30 10:48:37,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:48:37,668 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2025-04-30 10:48:37,669 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=817, Unknown=2, NotChecked=0, Total=930 [2025-04-30 10:48:37,669 INFO L87 Difference]: Start difference. First operand 18 states and 18 transitions. Second operand has 31 states, 30 states have (on average 1.3666666666666667) internal successors, (41), 31 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-30 10:48:44,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:48:44,104 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2025-04-30 10:48:44,105 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-04-30 10:48:44,105 INFO L79 Accepts]: Start accepts. Automaton has has 31 states, 30 states have (on average 1.3666666666666667) internal successors, (41), 31 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-30 10:48:44,105 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:48:44,105 INFO L225 Difference]: With dead ends: 30 [2025-04-30 10:48:44,105 INFO L226 Difference]: Without dead ends: 30 [2025-04-30 10:48:44,106 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 294 ImplicationChecksByTransitivity, 6.5s TimeCoverageRelationStatistics Valid=217, Invalid=1585, Unknown=4, NotChecked=0, Total=1806 [2025-04-30 10:48:44,106 INFO L437 NwaCegarLoop]: 5 mSDtfsCounter, 0 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 213 mSolverCounterSat, 0 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 217 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 213 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-04-30 10:48:44,106 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 66 Invalid, 217 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 213 Invalid, 4 Unknown, 0 Unchecked, 1.2s Time] [2025-04-30 10:48:44,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2025-04-30 10:48:44,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2025-04-30 10:48:44,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 29 states have (on average 1.0344827586206897) internal successors, (30), 29 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:48:44,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 30 transitions. [2025-04-30 10:48:44,107 INFO L79 Accepts]: Start accepts. Automaton has 30 states and 30 transitions. Word has length 17 [2025-04-30 10:48:44,108 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:48:44,108 INFO L485 AbstractCegarLoop]: Abstraction has 30 states and 30 transitions. [2025-04-30 10:48:44,108 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 30 states have (on average 1.3666666666666667) internal successors, (41), 31 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-30 10:48:44,108 INFO L278 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2025-04-30 10:48:44,108 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-04-30 10:48:44,108 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:48:44,108 INFO L218 NwaCegarLoop]: trace histogram [6, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:48:44,115 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-30 10:48:44,314 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:48:44,314 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 4 more)] === [2025-04-30 10:48:44,314 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:48:44,314 INFO L85 PathProgramCache]: Analyzing trace with hash -1215675762, now seen corresponding path program 3 times [2025-04-30 10:48:44,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:48:44,315 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1406526715] [2025-04-30 10:48:44,315 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-30 10:48:44,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:48:44,323 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 29 statements into 6 equivalence classes. [2025-04-30 10:48:44,348 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) and asserted 29 of 29 statements. [2025-04-30 10:48:44,349 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2025-04-30 10:48:44,349 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:48:44,965 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:48:44,966 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:48:44,967 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1406526715] [2025-04-30 10:48:44,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1406526715] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:48:44,967 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [558835611] [2025-04-30 10:48:44,967 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-30 10:48:44,967 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:48:44,967 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:48:44,969 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-30 10:48:44,970 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-04-30 10:48:45,014 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 29 statements into 6 equivalence classes. [2025-04-30 10:48:45,050 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) and asserted 29 of 29 statements. [2025-04-30 10:48:45,050 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2025-04-30 10:48:45,050 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:48:45,053 INFO L256 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 71 conjuncts are in the unsatisfiable core [2025-04-30 10:48:45,055 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:48:45,077 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-30 10:48:50,299 INFO L325 Elim1Store]: treesize reduction 4, result has 87.9 percent of original size [2025-04-30 10:48:50,299 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 28 treesize of output 39 [2025-04-30 10:48:50,368 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 17 proven. 18 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-04-30 10:48:50,368 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:48:51,904 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 68 treesize of output 58 [2025-04-30 10:48:51,959 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-30 10:48:51,959 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 104 treesize of output 180 [2025-04-30 10:48:52,011 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 13 treesize of output 9 [2025-04-30 10:48:52,151 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:48:52,151 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [558835611] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:48:52,151 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:48:52,152 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 13, 20] total 44 [2025-04-30 10:48:52,152 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1593436693] [2025-04-30 10:48:52,152 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:48:52,152 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2025-04-30 10:48:52,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:48:52,152 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2025-04-30 10:48:52,153 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=224, Invalid=1756, Unknown=0, NotChecked=0, Total=1980 [2025-04-30 10:48:52,154 INFO L87 Difference]: Start difference. First operand 30 states and 30 transitions. Second operand has 45 states, 44 states have (on average 1.5227272727272727) internal successors, (67), 45 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:48:56,877 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-04-30 10:48:57,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:48:57,518 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2025-04-30 10:48:57,518 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-04-30 10:48:57,519 INFO L79 Accepts]: Start accepts. Automaton has has 45 states, 44 states have (on average 1.5227272727272727) internal successors, (67), 45 states have internal predecessors, (67), 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-30 10:48:57,519 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:48:57,519 INFO L225 Difference]: With dead ends: 29 [2025-04-30 10:48:57,519 INFO L226 Difference]: Without dead ends: 0 [2025-04-30 10:48:57,520 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 21 SyntacticMatches, 9 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 997 ImplicationChecksByTransitivity, 7.4s TimeCoverageRelationStatistics Valid=541, Invalid=3365, Unknown=0, NotChecked=0, Total=3906 [2025-04-30 10:48:57,521 INFO L437 NwaCegarLoop]: 4 mSDtfsCounter, 0 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 204 mSolverCounterSat, 1 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 206 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 204 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2025-04-30 10:48:57,521 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 67 Invalid, 206 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 204 Invalid, 1 Unknown, 0 Unchecked, 4.2s Time] [2025-04-30 10:48:57,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-04-30 10:48:57,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-04-30 10:48:57,521 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-30 10:48:57,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-04-30 10:48:57,521 INFO L79 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 29 [2025-04-30 10:48:57,522 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:48:57,522 INFO L485 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-30 10:48:57,522 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 44 states have (on average 1.5227272727272727) internal successors, (67), 45 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:48:57,522 INFO L278 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-04-30 10:48:57,522 INFO L284 IsEmpty]: Finished isEmpty. No accepting run. [2025-04-30 10:48:57,524 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 7 remaining) [2025-04-30 10:48:57,525 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 7 remaining) [2025-04-30 10:48:57,525 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 7 remaining) [2025-04-30 10:48:57,525 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 7 remaining) [2025-04-30 10:48:57,525 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 7 remaining) [2025-04-30 10:48:57,525 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 7 remaining) [2025-04-30 10:48:57,525 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK (0 of 7 remaining) [2025-04-30 10:48:57,532 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-04-30 10:48:57,726 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,SelfDestructingSolverStorable16 [2025-04-30 10:48:57,728 INFO L422 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:48:57,729 INFO L171 ceAbstractionStarter]: Computing trace abstraction results [2025-04-30 10:48:57,731 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.04 10:48:57 BoogieIcfgContainer [2025-04-30 10:48:57,731 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-04-30 10:48:57,732 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-04-30 10:48:57,732 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-04-30 10:48:57,732 INFO L274 PluginConnector]: Witness Printer initialized [2025-04-30 10:48:57,732 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.04 10:48:29" (3/4) ... [2025-04-30 10:48:57,733 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-04-30 10:48:57,741 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges [2025-04-30 10:48:57,741 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2025-04-30 10:48:57,741 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2025-04-30 10:48:57,741 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-04-30 10:48:57,798 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-04-30 10:48:57,799 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-04-30 10:48:57,799 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-04-30 10:48:57,799 INFO L158 Benchmark]: Toolchain (without parser) took 28653.19ms. Allocated memory was 167.8MB in the beginning and 385.9MB in the end (delta: 218.1MB). Free memory was 122.2MB in the beginning and 201.5MB in the end (delta: -79.3MB). Peak memory consumption was 138.3MB. Max. memory is 16.1GB. [2025-04-30 10:48:57,799 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 201.3MB. Free memory is still 117.6MB. There was no memory consumed. Max. memory is 16.1GB. [2025-04-30 10:48:57,800 INFO L158 Benchmark]: CACSL2BoogieTranslator took 301.49ms. Allocated memory is still 167.8MB. Free memory was 122.2MB in the beginning and 102.9MB in the end (delta: 19.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-04-30 10:48:57,800 INFO L158 Benchmark]: Boogie Procedure Inliner took 28.63ms. Allocated memory is still 167.8MB. Free memory was 102.9MB in the beginning and 101.0MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. [2025-04-30 10:48:57,800 INFO L158 Benchmark]: Boogie Preprocessor took 29.93ms. Allocated memory is still 167.8MB. Free memory was 101.0MB in the beginning and 99.0MB in the end (delta: 2.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-04-30 10:48:57,800 INFO L158 Benchmark]: RCFGBuilder took 213.26ms. Allocated memory is still 167.8MB. Free memory was 99.0MB in the beginning and 85.9MB in the end (delta: 13.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-04-30 10:48:57,800 INFO L158 Benchmark]: TraceAbstraction took 28008.50ms. Allocated memory was 167.8MB in the beginning and 385.9MB in the end (delta: 218.1MB). Free memory was 85.2MB in the beginning and 205.7MB in the end (delta: -120.4MB). Peak memory consumption was 104.8MB. Max. memory is 16.1GB. [2025-04-30 10:48:57,801 INFO L158 Benchmark]: Witness Printer took 66.97ms. Allocated memory is still 385.9MB. Free memory was 205.7MB in the beginning and 201.5MB in the end (delta: 4.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-04-30 10:48:57,802 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22ms. Allocated memory is still 201.3MB. Free memory is still 117.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 301.49ms. Allocated memory is still 167.8MB. Free memory was 122.2MB in the beginning and 102.9MB in the end (delta: 19.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 28.63ms. Allocated memory is still 167.8MB. Free memory was 102.9MB in the beginning and 101.0MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 29.93ms. Allocated memory is still 167.8MB. Free memory was 101.0MB in the beginning and 99.0MB in the end (delta: 2.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 213.26ms. Allocated memory is still 167.8MB. Free memory was 99.0MB in the beginning and 85.9MB in the end (delta: 13.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 28008.50ms. Allocated memory was 167.8MB in the beginning and 385.9MB in the end (delta: 218.1MB). Free memory was 85.2MB in the beginning and 205.7MB in the end (delta: -120.4MB). Peak memory consumption was 104.8MB. Max. memory is 16.1GB. * Witness Printer took 66.97ms. Allocated memory is still 385.9MB. Free memory was 205.7MB in the beginning and 201.5MB in the end (delta: 4.2MB). 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: 555]: 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, 23 locations, 27 edges, 7 error locations. Started 1 CEGAR loops. OverallTime: 28.0s, OverallIterations: 17, TraceHistogramMax: 6, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 13.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 5 mSolverCounterUnknown, 39 SdHoareTripleChecker+Valid, 6.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 39 mSDsluCounter, 898 SdHoareTripleChecker+Invalid, 5.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 672 mSDsCounter, 19 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1223 IncrementalHoareTripleChecker+Invalid, 1247 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 19 mSolverCounterUnsat, 226 mSDtfsCounter, 1223 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 297 GetRequests, 72 SyntacticMatches, 12 SemanticMatches, 213 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1660 ImplicationChecksByTransitivity, 15.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=31occurred in iteration=13, InterpolantAutomatonStates: 138, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 17 MinimizatonAttempts, 25 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 13.4s InterpolantComputationTime, 264 NumberOfCodeBlocks, 264 NumberOfCodeBlocksAsserted, 33 NumberOfCheckSat, 312 ConstructedInterpolants, 52 QuantifiedInterpolants, 4906 SizeOfPredicates, 24 NumberOfNonLiveVariables, 653 ConjunctsInSsa, 215 ConjunctsInUnsatCore, 25 InterpolantComputations, 13 PerfectInterpolantSequences, 36/193 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 7 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-04-30 10:48:57,851 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