./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/valid-memsafety.prp --file ../../../trunk/examples/svcomp/termination-15/cstrcat_reverse_alloca.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-15/cstrcat_reverse_alloca.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 f7e74a0e03b60f29f7d157510f3d5b3a3ebad4fa8c21c80c2e088ad68134a4dc --- Real Ultimate output --- This is Ultimate 0.3.0-wip.fs.system-includes-da04345-m [2025-04-30 10:46:45,296 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-30 10:46:45,356 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Default.epf [2025-04-30 10:46:45,362 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-30 10:46:45,362 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-30 10:46:45,383 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-30 10:46:45,384 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-30 10:46:45,384 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-30 10:46:45,384 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-30 10:46:45,384 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-30 10:46:45,384 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-30 10:46:45,384 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-30 10:46:45,385 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-30 10:46:45,385 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-30 10:46:45,385 INFO L153 SettingsManager]: * Use SBE=true [2025-04-30 10:46:45,385 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-30 10:46:45,385 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-30 10:46:45,385 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-30 10:46:45,385 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-04-30 10:46:45,385 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-04-30 10:46:45,385 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-04-30 10:46:45,385 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-30 10:46:45,386 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-04-30 10:46:45,386 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-04-30 10:46:45,386 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-30 10:46:45,386 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-30 10:46:45,386 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-30 10:46:45,386 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-30 10:46:45,386 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-30 10:46:45,386 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-30 10:46:45,386 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-30 10:46:45,387 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-30 10:46:45,387 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-30 10:46:45,387 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-30 10:46:45,387 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-30 10:46:45,387 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-30 10:46:45,387 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-30 10:46:45,387 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-30 10:46:45,387 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-30 10:46:45,387 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-30 10:46:45,387 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-30 10:46:45,387 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-30 10:46:45,387 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-30 10:46:45,387 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 -> f7e74a0e03b60f29f7d157510f3d5b3a3ebad4fa8c21c80c2e088ad68134a4dc [2025-04-30 10:46:45,616 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-30 10:46:45,626 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-30 10:46:45,628 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-30 10:46:45,629 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-30 10:46:45,629 INFO L274 PluginConnector]: CDTParser initialized [2025-04-30 10:46:45,631 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/termination-15/cstrcat_reverse_alloca.i [2025-04-30 10:46:46,989 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/07ee96778/ff0896382ffa4c67ab856d97cacd8f7d/FLAGbb92708bd [2025-04-30 10:46:47,247 INFO L389 CDTParser]: Found 1 translation units. [2025-04-30 10:46:47,248 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/termination-15/cstrcat_reverse_alloca.i [2025-04-30 10:46:47,262 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/07ee96778/ff0896382ffa4c67ab856d97cacd8f7d/FLAGbb92708bd [2025-04-30 10:46:48,040 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/07ee96778/ff0896382ffa4c67ab856d97cacd8f7d [2025-04-30 10:46:48,042 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-30 10:46:48,043 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-04-30 10:46:48,044 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-30 10:46:48,044 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-30 10:46:48,046 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-30 10:46:48,047 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.04 10:46:48" (1/1) ... [2025-04-30 10:46:48,047 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4f123695 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:46:48, skipping insertion in model container [2025-04-30 10:46:48,047 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.04 10:46:48" (1/1) ... [2025-04-30 10:46:48,066 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-30 10:46:48,267 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:46:48,267 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:46:48,271 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-30 10:46:48,277 INFO L200 MainTranslator]: Completed pre-run [2025-04-30 10:46:48,331 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-30 10:46:48,356 INFO L204 MainTranslator]: Completed translation [2025-04-30 10:46:48,356 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:46:48 WrapperNode [2025-04-30 10:46:48,356 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-30 10:46:48,357 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-30 10:46:48,357 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-30 10:46:48,357 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-30 10:46:48,361 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:46:48" (1/1) ... [2025-04-30 10:46:48,372 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:46:48" (1/1) ... [2025-04-30 10:46:48,388 INFO L138 Inliner]: procedures = 152, calls = 14, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 73 [2025-04-30 10:46:48,390 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-30 10:46:48,391 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-30 10:46:48,391 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-30 10:46:48,391 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-30 10:46:48,397 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:46:48" (1/1) ... [2025-04-30 10:46:48,397 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:46:48" (1/1) ... [2025-04-30 10:46:48,400 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:46:48" (1/1) ... [2025-04-30 10:46:48,411 INFO L175 MemorySlicer]: Split 5 memory accesses to 2 slices as follows [3, 2]. 60 percent of accesses are in the largest equivalence class. The 0 initializations are split as follows [0, 0]. The 3 writes are split as follows [2, 1]. [2025-04-30 10:46:48,411 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:46:48" (1/1) ... [2025-04-30 10:46:48,411 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:46:48" (1/1) ... [2025-04-30 10:46:48,417 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:46:48" (1/1) ... [2025-04-30 10:46:48,421 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:46:48" (1/1) ... [2025-04-30 10:46:48,422 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:46:48" (1/1) ... [2025-04-30 10:46:48,423 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:46:48" (1/1) ... [2025-04-30 10:46:48,427 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:46:48" (1/1) ... [2025-04-30 10:46:48,430 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-30 10:46:48,431 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-30 10:46:48,431 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-30 10:46:48,431 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-30 10:46:48,431 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:46:48" (1/1) ... [2025-04-30 10:46:48,436 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-30 10:46:48,446 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:46:48,457 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:46:48,459 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:46:48,479 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-04-30 10:46:48,479 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-04-30 10:46:48,479 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-04-30 10:46:48,479 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-04-30 10:46:48,479 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-04-30 10:46:48,480 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-04-30 10:46:48,480 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-30 10:46:48,480 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-30 10:46:48,546 INFO L234 CfgBuilder]: Building ICFG [2025-04-30 10:46:48,547 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-30 10:46:48,683 INFO L? ?]: Removed 47 outVars from TransFormulas that were not future-live. [2025-04-30 10:46:48,684 INFO L283 CfgBuilder]: Performing block encoding [2025-04-30 10:46:48,692 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-30 10:46:48,693 INFO L312 CfgBuilder]: Removed 2 assume(true) statements. [2025-04-30 10:46:48,693 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.04 10:46:48 BoogieIcfgContainer [2025-04-30 10:46:48,693 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-30 10:46:48,695 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-30 10:46:48,695 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-30 10:46:48,699 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-30 10:46:48,699 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.04 10:46:48" (1/3) ... [2025-04-30 10:46:48,700 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5af69cac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.04 10:46:48, skipping insertion in model container [2025-04-30 10:46:48,700 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:46:48" (2/3) ... [2025-04-30 10:46:48,700 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5af69cac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.04 10:46:48, skipping insertion in model container [2025-04-30 10:46:48,701 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.04 10:46:48" (3/3) ... [2025-04-30 10:46:48,702 INFO L128 eAbstractionObserver]: Analyzing ICFG cstrcat_reverse_alloca.i [2025-04-30 10:46:48,711 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-30 10:46:48,712 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG cstrcat_reverse_alloca.i that has 1 procedures, 32 locations, 39 edges, 1 initial locations, 2 loop locations, and 11 error locations. [2025-04-30 10:46:48,739 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-30 10:46:48,747 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;@27ba5f6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-30 10:46:48,748 INFO L341 AbstractCegarLoop]: Starting to check reachability of 11 error locations. [2025-04-30 10:46:48,750 INFO L278 IsEmpty]: Start isEmpty. Operand has 32 states, 20 states have (on average 1.95) internal successors, (39), 31 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:46:48,753 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-04-30 10:46:48,753 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:46:48,753 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:46:48,753 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2025-04-30 10:46:48,756 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:46:48,757 INFO L85 PathProgramCache]: Analyzing trace with hash 1805031064, now seen corresponding path program 1 times [2025-04-30 10:46:48,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:46:48,762 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2125626362] [2025-04-30 10:46:48,762 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:46:48,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:46:48,809 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-30 10:46:48,822 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-30 10:46:48,823 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:46:48,823 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:46:48,877 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:46:48,879 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:46:48,879 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2125626362] [2025-04-30 10:46:48,880 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2125626362] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:46:48,881 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:46:48,881 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-30 10:46:48,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [866591788] [2025-04-30 10:46:48,883 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:46:48,886 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-30 10:46:48,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:46:48,903 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-30 10:46:48,903 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-30 10:46:48,905 INFO L87 Difference]: Start difference. First operand has 32 states, 20 states have (on average 1.95) internal successors, (39), 31 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:46:48,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:46:48,954 INFO L93 Difference]: Finished difference Result 33 states and 38 transitions. [2025-04-30 10:46:48,955 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-30 10:46:48,956 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2025-04-30 10:46:48,956 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:46:48,960 INFO L225 Difference]: With dead ends: 33 [2025-04-30 10:46:48,960 INFO L226 Difference]: Without dead ends: 30 [2025-04-30 10:46:48,961 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:46:48,965 INFO L437 NwaCegarLoop]: 35 mSDtfsCounter, 3 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-30 10:46:48,966 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 49 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-30 10:46:48,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2025-04-30 10:46:48,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2025-04-30 10:46:48,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 29 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:46:48,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 34 transitions. [2025-04-30 10:46:48,993 INFO L79 Accepts]: Start accepts. Automaton has 30 states and 34 transitions. Word has length 7 [2025-04-30 10:46:48,993 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:46:48,993 INFO L485 AbstractCegarLoop]: Abstraction has 30 states and 34 transitions. [2025-04-30 10:46:48,994 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:46:48,994 INFO L278 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2025-04-30 10:46:48,994 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-04-30 10:46:48,994 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:46:48,994 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:46:48,994 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-30 10:46:48,994 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2025-04-30 10:46:48,995 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:46:48,995 INFO L85 PathProgramCache]: Analyzing trace with hash 1805031082, now seen corresponding path program 1 times [2025-04-30 10:46:48,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:46:48,996 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [457445324] [2025-04-30 10:46:48,996 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:46:48,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:46:49,008 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-30 10:46:49,023 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-30 10:46:49,023 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:46:49,024 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:46:49,135 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:46:49,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:46:49,135 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [457445324] [2025-04-30 10:46:49,136 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [457445324] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:46:49,136 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:46:49,136 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-30 10:46:49,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [803110067] [2025-04-30 10:46:49,136 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:46:49,137 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-30 10:46:49,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:46:49,137 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-30 10:46:49,137 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-30 10:46:49,137 INFO L87 Difference]: Start difference. First operand 30 states and 34 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:46:49,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:46:49,166 INFO L93 Difference]: Finished difference Result 29 states and 33 transitions. [2025-04-30 10:46:49,166 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-30 10:46:49,166 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2025-04-30 10:46:49,166 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:46:49,167 INFO L225 Difference]: With dead ends: 29 [2025-04-30 10:46:49,167 INFO L226 Difference]: Without dead ends: 29 [2025-04-30 10:46:49,168 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:46:49,168 INFO L437 NwaCegarLoop]: 28 mSDtfsCounter, 4 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-30 10:46:49,170 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 44 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-30 10:46:49,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2025-04-30 10:46:49,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2025-04-30 10:46:49,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 19 states have (on average 1.736842105263158) internal successors, (33), 28 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:46:49,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 33 transitions. [2025-04-30 10:46:49,173 INFO L79 Accepts]: Start accepts. Automaton has 29 states and 33 transitions. Word has length 7 [2025-04-30 10:46:49,173 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:46:49,173 INFO L485 AbstractCegarLoop]: Abstraction has 29 states and 33 transitions. [2025-04-30 10:46:49,174 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:46:49,174 INFO L278 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2025-04-30 10:46:49,174 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-04-30 10:46:49,174 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:46:49,174 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:46:49,175 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-30 10:46:49,175 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2025-04-30 10:46:49,175 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:46:49,177 INFO L85 PathProgramCache]: Analyzing trace with hash 1805031083, now seen corresponding path program 1 times [2025-04-30 10:46:49,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:46:49,177 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1387124358] [2025-04-30 10:46:49,177 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:46:49,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:46:49,184 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-30 10:46:49,208 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-30 10:46:49,209 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:46:49,209 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:46:49,398 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:46:49,398 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:46:49,398 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1387124358] [2025-04-30 10:46:49,399 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1387124358] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:46:49,399 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:46:49,399 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-30 10:46:49,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [209889369] [2025-04-30 10:46:49,399 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:46:49,399 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-30 10:46:49,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:46:49,400 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-30 10:46:49,400 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-30 10:46:49,400 INFO L87 Difference]: Start difference. First operand 29 states and 33 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:46:49,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:46:49,442 INFO L93 Difference]: Finished difference Result 37 states and 43 transitions. [2025-04-30 10:46:49,442 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-30 10:46:49,442 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2025-04-30 10:46:49,442 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:46:49,442 INFO L225 Difference]: With dead ends: 37 [2025-04-30 10:46:49,443 INFO L226 Difference]: Without dead ends: 37 [2025-04-30 10:46:49,443 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:46:49,443 INFO L437 NwaCegarLoop]: 28 mSDtfsCounter, 11 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-30 10:46:49,443 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 76 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-30 10:46:49,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2025-04-30 10:46:49,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 33. [2025-04-30 10:46:49,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 23 states have (on average 1.6956521739130435) internal successors, (39), 32 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:46:49,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 39 transitions. [2025-04-30 10:46:49,447 INFO L79 Accepts]: Start accepts. Automaton has 33 states and 39 transitions. Word has length 7 [2025-04-30 10:46:49,447 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:46:49,447 INFO L485 AbstractCegarLoop]: Abstraction has 33 states and 39 transitions. [2025-04-30 10:46:49,447 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:46:49,447 INFO L278 IsEmpty]: Start isEmpty. Operand 33 states and 39 transitions. [2025-04-30 10:46:49,447 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-04-30 10:46:49,447 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:46:49,447 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:46:49,447 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-30 10:46:49,448 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2025-04-30 10:46:49,448 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:46:49,448 INFO L85 PathProgramCache]: Analyzing trace with hash 1806878125, now seen corresponding path program 1 times [2025-04-30 10:46:49,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:46:49,448 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2119621064] [2025-04-30 10:46:49,448 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:46:49,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:46:49,458 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-30 10:46:49,470 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-30 10:46:49,470 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:46:49,470 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:46:49,638 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:46:49,638 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:46:49,638 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2119621064] [2025-04-30 10:46:49,638 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2119621064] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:46:49,638 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:46:49,638 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-30 10:46:49,638 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1041899814] [2025-04-30 10:46:49,638 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:46:49,639 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-30 10:46:49,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:46:49,639 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-30 10:46:49,639 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-04-30 10:46:49,640 INFO L87 Difference]: Start difference. First operand 33 states and 39 transitions. Second operand has 6 states, 5 states have (on average 1.4) internal successors, (7), 6 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:46:49,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:46:49,771 INFO L93 Difference]: Finished difference Result 41 states and 49 transitions. [2025-04-30 10:46:49,774 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-30 10:46:49,775 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.4) internal successors, (7), 6 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2025-04-30 10:46:49,775 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:46:49,776 INFO L225 Difference]: With dead ends: 41 [2025-04-30 10:46:49,776 INFO L226 Difference]: Without dead ends: 41 [2025-04-30 10:46:49,776 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2025-04-30 10:46:49,776 INFO L437 NwaCegarLoop]: 26 mSDtfsCounter, 31 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-30 10:46:49,777 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 71 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-30 10:46:49,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2025-04-30 10:46:49,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 33. [2025-04-30 10:46:49,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 23 states have (on average 1.6956521739130435) internal successors, (39), 32 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:46:49,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 39 transitions. [2025-04-30 10:46:49,781 INFO L79 Accepts]: Start accepts. Automaton has 33 states and 39 transitions. Word has length 7 [2025-04-30 10:46:49,781 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:46:49,781 INFO L485 AbstractCegarLoop]: Abstraction has 33 states and 39 transitions. [2025-04-30 10:46:49,781 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.4) internal successors, (7), 6 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:46:49,781 INFO L278 IsEmpty]: Start isEmpty. Operand 33 states and 39 transitions. [2025-04-30 10:46:49,781 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-04-30 10:46:49,781 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:46:49,781 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:46:49,781 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-30 10:46:49,782 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2025-04-30 10:46:49,782 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:46:49,782 INFO L85 PathProgramCache]: Analyzing trace with hash 1806937707, now seen corresponding path program 1 times [2025-04-30 10:46:49,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:46:49,782 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1787382461] [2025-04-30 10:46:49,782 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:46:49,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:46:49,789 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-30 10:46:49,795 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-30 10:46:49,795 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:46:49,795 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:46:49,882 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:46:49,882 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:46:49,882 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1787382461] [2025-04-30 10:46:49,882 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1787382461] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:46:49,882 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:46:49,882 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-30 10:46:49,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [135085827] [2025-04-30 10:46:49,882 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:46:49,883 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-30 10:46:49,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:46:49,883 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-30 10:46:49,883 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-30 10:46:49,883 INFO L87 Difference]: Start difference. First operand 33 states and 39 transitions. Second operand has 5 states, 4 states have (on average 1.75) internal successors, (7), 5 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:46:49,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:46:49,942 INFO L93 Difference]: Finished difference Result 32 states and 38 transitions. [2025-04-30 10:46:49,942 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-30 10:46:49,943 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.75) internal successors, (7), 5 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2025-04-30 10:46:49,943 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:46:49,943 INFO L225 Difference]: With dead ends: 32 [2025-04-30 10:46:49,943 INFO L226 Difference]: Without dead ends: 32 [2025-04-30 10:46:49,943 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-04-30 10:46:49,944 INFO L437 NwaCegarLoop]: 25 mSDtfsCounter, 11 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-30 10:46:49,945 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 80 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-30 10:46:49,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2025-04-30 10:46:49,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 28. [2025-04-30 10:46:49,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 19 states have (on average 1.6842105263157894) internal successors, (32), 27 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:46:49,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2025-04-30 10:46:49,949 INFO L79 Accepts]: Start accepts. Automaton has 28 states and 32 transitions. Word has length 7 [2025-04-30 10:46:49,949 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:46:49,949 INFO L485 AbstractCegarLoop]: Abstraction has 28 states and 32 transitions. [2025-04-30 10:46:49,949 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.75) internal successors, (7), 5 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:46:49,949 INFO L278 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2025-04-30 10:46:49,950 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-04-30 10:46:49,950 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:46:49,950 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:46:49,950 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-30 10:46:49,950 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2025-04-30 10:46:49,950 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:46:49,950 INFO L85 PathProgramCache]: Analyzing trace with hash 121388693, now seen corresponding path program 1 times [2025-04-30 10:46:49,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:46:49,951 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [169696850] [2025-04-30 10:46:49,951 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:46:49,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:46:49,956 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-30 10:46:49,959 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-30 10:46:49,959 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:46:49,959 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:46:49,981 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:46:49,982 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:46:49,982 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [169696850] [2025-04-30 10:46:49,982 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [169696850] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:46:49,982 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:46:49,982 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-30 10:46:49,982 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1201017013] [2025-04-30 10:46:49,982 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:46:49,982 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-30 10:46:49,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:46:49,982 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-30 10:46:49,983 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-30 10:46:49,983 INFO L87 Difference]: Start difference. First operand 28 states and 32 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:46:50,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:46:50,009 INFO L93 Difference]: Finished difference Result 27 states and 31 transitions. [2025-04-30 10:46:50,009 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-30 10:46:50,009 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2025-04-30 10:46:50,009 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:46:50,009 INFO L225 Difference]: With dead ends: 27 [2025-04-30 10:46:50,009 INFO L226 Difference]: Without dead ends: 27 [2025-04-30 10:46:50,010 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:46:50,010 INFO L437 NwaCegarLoop]: 27 mSDtfsCounter, 1 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-30 10:46:50,010 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 43 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-30 10:46:50,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2025-04-30 10:46:50,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2025-04-30 10:46:50,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 19 states have (on average 1.631578947368421) internal successors, (31), 26 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:46:50,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2025-04-30 10:46:50,012 INFO L79 Accepts]: Start accepts. Automaton has 27 states and 31 transitions. Word has length 8 [2025-04-30 10:46:50,012 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:46:50,012 INFO L485 AbstractCegarLoop]: Abstraction has 27 states and 31 transitions. [2025-04-30 10:46:50,012 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:46:50,012 INFO L278 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2025-04-30 10:46:50,012 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-04-30 10:46:50,012 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:46:50,016 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:46:50,016 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-04-30 10:46:50,016 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2025-04-30 10:46:50,017 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:46:50,017 INFO L85 PathProgramCache]: Analyzing trace with hash 121388694, now seen corresponding path program 1 times [2025-04-30 10:46:50,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:46:50,017 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1801084113] [2025-04-30 10:46:50,017 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:46:50,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:46:50,023 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-30 10:46:50,029 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-30 10:46:50,030 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:46:50,030 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:46:50,135 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:46:50,136 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:46:50,136 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1801084113] [2025-04-30 10:46:50,136 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1801084113] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:46:50,136 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:46:50,136 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-30 10:46:50,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1018812489] [2025-04-30 10:46:50,136 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:46:50,136 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-30 10:46:50,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:46:50,136 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-30 10:46:50,136 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-30 10:46:50,136 INFO L87 Difference]: Start difference. First operand 27 states and 31 transitions. Second operand has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:46:50,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:46:50,186 INFO L93 Difference]: Finished difference Result 35 states and 41 transitions. [2025-04-30 10:46:50,186 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-30 10:46:50,186 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2025-04-30 10:46:50,186 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:46:50,186 INFO L225 Difference]: With dead ends: 35 [2025-04-30 10:46:50,186 INFO L226 Difference]: Without dead ends: 35 [2025-04-30 10:46:50,187 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-04-30 10:46:50,187 INFO L437 NwaCegarLoop]: 26 mSDtfsCounter, 9 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-30 10:46:50,187 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 66 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-30 10:46:50,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2025-04-30 10:46:50,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 31. [2025-04-30 10:46:50,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 23 states have (on average 1.565217391304348) internal successors, (36), 30 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:46:50,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 36 transitions. [2025-04-30 10:46:50,191 INFO L79 Accepts]: Start accepts. Automaton has 31 states and 36 transitions. Word has length 8 [2025-04-30 10:46:50,191 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:46:50,191 INFO L485 AbstractCegarLoop]: Abstraction has 31 states and 36 transitions. [2025-04-30 10:46:50,192 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:46:50,192 INFO L278 IsEmpty]: Start isEmpty. Operand 31 states and 36 transitions. [2025-04-30 10:46:50,192 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-04-30 10:46:50,192 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:46:50,192 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:46:50,192 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-04-30 10:46:50,192 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2025-04-30 10:46:50,192 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:46:50,192 INFO L85 PathProgramCache]: Analyzing trace with hash 121448276, now seen corresponding path program 1 times [2025-04-30 10:46:50,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:46:50,192 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1510672588] [2025-04-30 10:46:50,192 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:46:50,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:46:50,198 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-30 10:46:50,202 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-30 10:46:50,203 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:46:50,203 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:46:50,291 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:46:50,291 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:46:50,291 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1510672588] [2025-04-30 10:46:50,291 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1510672588] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:46:50,292 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:46:50,292 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-30 10:46:50,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [945801919] [2025-04-30 10:46:50,292 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:46:50,292 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-30 10:46:50,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:46:50,292 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-30 10:46:50,293 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-04-30 10:46:50,293 INFO L87 Difference]: Start difference. First operand 31 states and 36 transitions. Second operand has 6 states, 5 states have (on average 1.6) internal successors, (8), 6 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:46:50,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:46:50,343 INFO L93 Difference]: Finished difference Result 35 states and 40 transitions. [2025-04-30 10:46:50,343 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-30 10:46:50,343 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.6) internal successors, (8), 6 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2025-04-30 10:46:50,343 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:46:50,343 INFO L225 Difference]: With dead ends: 35 [2025-04-30 10:46:50,343 INFO L226 Difference]: Without dead ends: 35 [2025-04-30 10:46:50,344 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-04-30 10:46:50,344 INFO L437 NwaCegarLoop]: 27 mSDtfsCounter, 13 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-30 10:46:50,344 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 83 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-30 10:46:50,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2025-04-30 10:46:50,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 31. [2025-04-30 10:46:50,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 23 states have (on average 1.565217391304348) internal successors, (36), 30 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:46:50,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 36 transitions. [2025-04-30 10:46:50,346 INFO L79 Accepts]: Start accepts. Automaton has 31 states and 36 transitions. Word has length 8 [2025-04-30 10:46:50,346 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:46:50,346 INFO L485 AbstractCegarLoop]: Abstraction has 31 states and 36 transitions. [2025-04-30 10:46:50,346 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.6) internal successors, (8), 6 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:46:50,347 INFO L278 IsEmpty]: Start isEmpty. Operand 31 states and 36 transitions. [2025-04-30 10:46:50,347 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-04-30 10:46:50,347 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:46:50,347 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:46:50,347 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-04-30 10:46:50,347 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2025-04-30 10:46:50,348 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:46:50,348 INFO L85 PathProgramCache]: Analyzing trace with hash 123235736, now seen corresponding path program 1 times [2025-04-30 10:46:50,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:46:50,348 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1062712975] [2025-04-30 10:46:50,348 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:46:50,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:46:50,352 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-30 10:46:50,355 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-30 10:46:50,355 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:46:50,355 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:46:50,455 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:46:50,456 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:46:50,456 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1062712975] [2025-04-30 10:46:50,456 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1062712975] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:46:50,456 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:46:50,456 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-30 10:46:50,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [368023480] [2025-04-30 10:46:50,456 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:46:50,457 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-30 10:46:50,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:46:50,457 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-30 10:46:50,457 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-04-30 10:46:50,457 INFO L87 Difference]: Start difference. First operand 31 states and 36 transitions. Second operand has 6 states, 5 states have (on average 1.6) internal successors, (8), 6 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:46:50,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:46:50,475 INFO L93 Difference]: Finished difference Result 37 states and 42 transitions. [2025-04-30 10:46:50,476 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-30 10:46:50,476 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.6) internal successors, (8), 6 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2025-04-30 10:46:50,476 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:46:50,476 INFO L225 Difference]: With dead ends: 37 [2025-04-30 10:46:50,477 INFO L226 Difference]: Without dead ends: 37 [2025-04-30 10:46:50,477 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-04-30 10:46:50,478 INFO L437 NwaCegarLoop]: 24 mSDtfsCounter, 11 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-30 10:46:50,478 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 48 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-30 10:46:50,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2025-04-30 10:46:50,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 31. [2025-04-30 10:46:50,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 23 states have (on average 1.565217391304348) internal successors, (36), 30 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:46:50,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 36 transitions. [2025-04-30 10:46:50,481 INFO L79 Accepts]: Start accepts. Automaton has 31 states and 36 transitions. Word has length 8 [2025-04-30 10:46:50,481 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:46:50,482 INFO L485 AbstractCegarLoop]: Abstraction has 31 states and 36 transitions. [2025-04-30 10:46:50,482 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.6) internal successors, (8), 6 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:46:50,482 INFO L278 IsEmpty]: Start isEmpty. Operand 31 states and 36 transitions. [2025-04-30 10:46:50,482 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-04-30 10:46:50,482 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:46:50,482 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:46:50,482 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-04-30 10:46:50,482 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2025-04-30 10:46:50,483 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:46:50,483 INFO L85 PathProgramCache]: Analyzing trace with hash 123295318, now seen corresponding path program 1 times [2025-04-30 10:46:50,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:46:50,483 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [738625098] [2025-04-30 10:46:50,483 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:46:50,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:46:50,487 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-30 10:46:50,492 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-30 10:46:50,492 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:46:50,492 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:46:50,580 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:46:50,580 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:46:50,581 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [738625098] [2025-04-30 10:46:50,581 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [738625098] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:46:50,581 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:46:50,581 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-30 10:46:50,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [371031051] [2025-04-30 10:46:50,581 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:46:50,581 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-30 10:46:50,581 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:46:50,581 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-30 10:46:50,581 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-04-30 10:46:50,581 INFO L87 Difference]: Start difference. First operand 31 states and 36 transitions. Second operand has 6 states, 5 states have (on average 1.6) internal successors, (8), 6 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:46:50,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:46:50,612 INFO L93 Difference]: Finished difference Result 30 states and 35 transitions. [2025-04-30 10:46:50,612 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-30 10:46:50,612 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.6) internal successors, (8), 6 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2025-04-30 10:46:50,612 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:46:50,613 INFO L225 Difference]: With dead ends: 30 [2025-04-30 10:46:50,613 INFO L226 Difference]: Without dead ends: 30 [2025-04-30 10:46:50,613 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2025-04-30 10:46:50,613 INFO L437 NwaCegarLoop]: 24 mSDtfsCounter, 9 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-30 10:46:50,613 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 45 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-30 10:46:50,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2025-04-30 10:46:50,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 26. [2025-04-30 10:46:50,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 19 states have (on average 1.5789473684210527) internal successors, (30), 25 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:46:50,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 30 transitions. [2025-04-30 10:46:50,615 INFO L79 Accepts]: Start accepts. Automaton has 26 states and 30 transitions. Word has length 8 [2025-04-30 10:46:50,615 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:46:50,615 INFO L485 AbstractCegarLoop]: Abstraction has 26 states and 30 transitions. [2025-04-30 10:46:50,615 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.6) internal successors, (8), 6 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:46:50,615 INFO L278 IsEmpty]: Start isEmpty. Operand 26 states and 30 transitions. [2025-04-30 10:46:50,615 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-04-30 10:46:50,615 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:46:50,616 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:46:50,616 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-04-30 10:46:50,616 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2025-04-30 10:46:50,616 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:46:50,616 INFO L85 PathProgramCache]: Analyzing trace with hash 690417049, now seen corresponding path program 1 times [2025-04-30 10:46:50,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:46:50,616 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [79341029] [2025-04-30 10:46:50,616 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:46:50,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:46:50,621 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-30 10:46:50,624 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-30 10:46:50,624 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:46:50,624 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:46:50,646 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:46:50,646 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:46:50,646 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [79341029] [2025-04-30 10:46:50,646 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [79341029] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:46:50,646 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:46:50,646 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-30 10:46:50,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2139358681] [2025-04-30 10:46:50,646 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:46:50,647 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-30 10:46:50,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:46:50,647 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-30 10:46:50,647 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-30 10:46:50,647 INFO L87 Difference]: Start difference. First operand 26 states and 30 transitions. Second operand has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 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:46:50,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:46:50,671 INFO L93 Difference]: Finished difference Result 25 states and 29 transitions. [2025-04-30 10:46:50,671 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-30 10:46:50,671 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 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:46:50,672 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:46:50,672 INFO L225 Difference]: With dead ends: 25 [2025-04-30 10:46:50,672 INFO L226 Difference]: Without dead ends: 25 [2025-04-30 10:46:50,672 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-30 10:46:50,672 INFO L437 NwaCegarLoop]: 17 mSDtfsCounter, 13 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-30 10:46:50,673 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 36 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-30 10:46:50,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2025-04-30 10:46:50,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2025-04-30 10:46:50,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 19 states have (on average 1.5263157894736843) internal successors, (29), 24 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:46:50,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 29 transitions. [2025-04-30 10:46:50,674 INFO L79 Accepts]: Start accepts. Automaton has 25 states and 29 transitions. Word has length 10 [2025-04-30 10:46:50,674 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:46:50,674 INFO L485 AbstractCegarLoop]: Abstraction has 25 states and 29 transitions. [2025-04-30 10:46:50,674 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 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:46:50,675 INFO L278 IsEmpty]: Start isEmpty. Operand 25 states and 29 transitions. [2025-04-30 10:46:50,675 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-04-30 10:46:50,675 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:46:50,675 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:46:50,675 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-04-30 10:46:50,675 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2025-04-30 10:46:50,675 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:46:50,675 INFO L85 PathProgramCache]: Analyzing trace with hash 690417050, now seen corresponding path program 1 times [2025-04-30 10:46:50,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:46:50,676 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1000582587] [2025-04-30 10:46:50,676 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:46:50,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:46:50,680 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-30 10:46:50,683 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-30 10:46:50,684 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:46:50,684 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:46:50,812 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:46:50,813 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:46:50,813 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1000582587] [2025-04-30 10:46:50,813 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1000582587] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:46:50,813 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:46:50,813 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-30 10:46:50,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [505852721] [2025-04-30 10:46:50,813 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:46:50,813 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-30 10:46:50,813 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:46:50,813 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-30 10:46:50,813 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-04-30 10:46:50,813 INFO L87 Difference]: Start difference. First operand 25 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:46:50,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:46:50,844 INFO L93 Difference]: Finished difference Result 33 states and 38 transitions. [2025-04-30 10:46:50,844 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-30 10:46:50,845 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:46:50,845 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:46:50,845 INFO L225 Difference]: With dead ends: 33 [2025-04-30 10:46:50,845 INFO L226 Difference]: Without dead ends: 33 [2025-04-30 10:46:50,845 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-04-30 10:46:50,845 INFO L437 NwaCegarLoop]: 23 mSDtfsCounter, 7 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-30 10:46:50,846 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 59 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-30 10:46:50,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2025-04-30 10:46:50,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 30. [2025-04-30 10:46:50,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 24 states have (on average 1.4166666666666667) internal successors, (34), 29 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:46:50,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 34 transitions. [2025-04-30 10:46:50,847 INFO L79 Accepts]: Start accepts. Automaton has 30 states and 34 transitions. Word has length 10 [2025-04-30 10:46:50,847 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:46:50,847 INFO L485 AbstractCegarLoop]: Abstraction has 30 states and 34 transitions. [2025-04-30 10:46:50,847 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:46:50,847 INFO L278 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2025-04-30 10:46:50,847 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-04-30 10:46:50,847 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:46:50,847 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:46:50,847 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-04-30 10:46:50,847 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2025-04-30 10:46:50,848 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:46:50,848 INFO L85 PathProgramCache]: Analyzing trace with hash 747675352, now seen corresponding path program 1 times [2025-04-30 10:46:50,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:46:50,848 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2020946163] [2025-04-30 10:46:50,848 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:46:50,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:46:50,857 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-30 10:46:50,862 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-30 10:46:50,862 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:46:50,862 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:46:51,012 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:46:51,012 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:46:51,012 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2020946163] [2025-04-30 10:46:51,012 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2020946163] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:46:51,012 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:46:51,013 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-30 10:46:51,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1330791012] [2025-04-30 10:46:51,013 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:46:51,013 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-30 10:46:51,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:46:51,013 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-30 10:46:51,013 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-04-30 10:46:51,013 INFO L87 Difference]: Start difference. First operand 30 states and 34 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:46:51,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:46:51,086 INFO L93 Difference]: Finished difference Result 44 states and 50 transitions. [2025-04-30 10:46:51,087 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-30 10:46:51,087 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:46:51,087 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:46:51,088 INFO L225 Difference]: With dead ends: 44 [2025-04-30 10:46:51,088 INFO L226 Difference]: Without dead ends: 44 [2025-04-30 10:46:51,088 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-04-30 10:46:51,088 INFO L437 NwaCegarLoop]: 22 mSDtfsCounter, 13 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-30 10:46:51,088 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 97 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-30 10:46:51,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2025-04-30 10:46:51,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 31. [2025-04-30 10:46:51,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 25 states have (on average 1.44) internal successors, (36), 30 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:46:51,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 36 transitions. [2025-04-30 10:46:51,090 INFO L79 Accepts]: Start accepts. Automaton has 31 states and 36 transitions. Word has length 10 [2025-04-30 10:46:51,090 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:46:51,090 INFO L485 AbstractCegarLoop]: Abstraction has 31 states and 36 transitions. [2025-04-30 10:46:51,090 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:46:51,090 INFO L278 IsEmpty]: Start isEmpty. Operand 31 states and 36 transitions. [2025-04-30 10:46:51,090 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-04-30 10:46:51,090 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:46:51,090 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:46:51,090 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-04-30 10:46:51,090 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2025-04-30 10:46:51,091 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:46:51,091 INFO L85 PathProgramCache]: Analyzing trace with hash -1772284582, now seen corresponding path program 1 times [2025-04-30 10:46:51,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:46:51,091 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1529866082] [2025-04-30 10:46:51,091 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:46:51,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:46:51,096 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-30 10:46:51,101 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-30 10:46:51,101 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:46:51,101 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:46:51,282 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:46:51,282 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:46:51,282 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1529866082] [2025-04-30 10:46:51,282 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1529866082] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:46:51,282 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:46:51,282 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-04-30 10:46:51,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1179703220] [2025-04-30 10:46:51,283 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:46:51,283 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-30 10:46:51,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:46:51,283 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-30 10:46:51,283 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-04-30 10:46:51,284 INFO L87 Difference]: Start difference. First operand 31 states and 36 transitions. Second operand has 8 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 8 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:46:51,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:46:51,340 INFO L93 Difference]: Finished difference Result 35 states and 41 transitions. [2025-04-30 10:46:51,340 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-30 10:46:51,341 INFO L79 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 8 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:46:51,341 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:46:51,341 INFO L225 Difference]: With dead ends: 35 [2025-04-30 10:46:51,341 INFO L226 Difference]: Without dead ends: 35 [2025-04-30 10:46:51,341 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2025-04-30 10:46:51,342 INFO L437 NwaCegarLoop]: 20 mSDtfsCounter, 11 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-30 10:46:51,342 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 90 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-30 10:46:51,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2025-04-30 10:46:51,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 26. [2025-04-30 10:46:51,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 20 states have (on average 1.5) internal successors, (30), 25 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:46:51,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 30 transitions. [2025-04-30 10:46:51,344 INFO L79 Accepts]: Start accepts. Automaton has 26 states and 30 transitions. Word has length 10 [2025-04-30 10:46:51,344 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:46:51,344 INFO L485 AbstractCegarLoop]: Abstraction has 26 states and 30 transitions. [2025-04-30 10:46:51,344 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 8 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:46:51,344 INFO L278 IsEmpty]: Start isEmpty. Operand 26 states and 30 transitions. [2025-04-30 10:46:51,344 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-04-30 10:46:51,344 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:46:51,344 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:46:51,344 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-04-30 10:46:51,345 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2025-04-30 10:46:51,345 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:46:51,345 INFO L85 PathProgramCache]: Analyzing trace with hash -384062742, now seen corresponding path program 1 times [2025-04-30 10:46:51,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:46:51,345 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [782069212] [2025-04-30 10:46:51,345 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:46:51,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:46:51,353 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-04-30 10:46:51,359 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-04-30 10:46:51,359 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:46:51,359 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:46:51,503 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:46:51,503 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:46:51,503 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [782069212] [2025-04-30 10:46:51,503 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [782069212] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:46:51,503 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [217305111] [2025-04-30 10:46:51,503 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:46:51,503 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:46:51,504 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:46:51,505 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:46:51,507 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:46:51,550 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-04-30 10:46:51,562 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-04-30 10:46:51,562 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:46:51,562 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:46:51,567 INFO L256 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-04-30 10:46:51,570 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:46:51,636 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 13 treesize of output 9 [2025-04-30 10:46:51,680 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:46:51,680 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-30 10:46:51,680 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [217305111] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:46:51,680 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-30 10:46:51,680 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 13 [2025-04-30 10:46:51,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [219150602] [2025-04-30 10:46:51,681 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:46:51,681 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-30 10:46:51,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:46:51,681 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-30 10:46:51,681 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2025-04-30 10:46:51,681 INFO L87 Difference]: Start difference. First operand 26 states and 30 transitions. Second operand has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 7 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:46:51,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:46:51,735 INFO L93 Difference]: Finished difference Result 38 states and 43 transitions. [2025-04-30 10:46:51,735 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-30 10:46:51,735 INFO L79 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 7 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:46:51,735 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:46:51,736 INFO L225 Difference]: With dead ends: 38 [2025-04-30 10:46:51,736 INFO L226 Difference]: Without dead ends: 38 [2025-04-30 10:46:51,736 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2025-04-30 10:46:51,736 INFO L437 NwaCegarLoop]: 23 mSDtfsCounter, 6 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-30 10:46:51,736 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 121 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-30 10:46:51,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2025-04-30 10:46:51,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 33. [2025-04-30 10:46:51,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 27 states have (on average 1.4074074074074074) internal successors, (38), 32 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:46:51,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 38 transitions. [2025-04-30 10:46:51,740 INFO L79 Accepts]: Start accepts. Automaton has 33 states and 38 transitions. Word has length 13 [2025-04-30 10:46:51,740 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:46:51,740 INFO L485 AbstractCegarLoop]: Abstraction has 33 states and 38 transitions. [2025-04-30 10:46:51,740 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 7 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:46:51,740 INFO L278 IsEmpty]: Start isEmpty. Operand 33 states and 38 transitions. [2025-04-30 10:46:51,740 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-04-30 10:46:51,740 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:46:51,740 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:46:51,747 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-04-30 10:46:51,945 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,SelfDestructingSolverStorable14 [2025-04-30 10:46:51,945 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2025-04-30 10:46:51,945 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:46:51,945 INFO L85 PathProgramCache]: Analyzing trace with hash -384060619, now seen corresponding path program 1 times [2025-04-30 10:46:51,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:46:51,945 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [726288493] [2025-04-30 10:46:51,945 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:46:51,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:46:51,952 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-04-30 10:46:51,955 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-04-30 10:46:51,955 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:46:51,955 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:46:51,988 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:46:51,988 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:46:51,988 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [726288493] [2025-04-30 10:46:51,988 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [726288493] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:46:51,988 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:46:51,988 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-30 10:46:51,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1528808887] [2025-04-30 10:46:51,988 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:46:51,989 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-30 10:46:51,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:46:51,989 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-30 10:46:51,989 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-30 10:46:51,989 INFO L87 Difference]: Start difference. First operand 33 states and 38 transitions. Second operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 5 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:46:52,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:46:52,018 INFO L93 Difference]: Finished difference Result 32 states and 37 transitions. [2025-04-30 10:46:52,019 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-30 10:46:52,019 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 5 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:46:52,019 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:46:52,019 INFO L225 Difference]: With dead ends: 32 [2025-04-30 10:46:52,019 INFO L226 Difference]: Without dead ends: 32 [2025-04-30 10:46:52,019 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:46:52,020 INFO L437 NwaCegarLoop]: 18 mSDtfsCounter, 11 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-30 10:46:52,020 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 50 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-30 10:46:52,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2025-04-30 10:46:52,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2025-04-30 10:46:52,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 27 states have (on average 1.3703703703703705) internal successors, (37), 31 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:46:52,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 37 transitions. [2025-04-30 10:46:52,025 INFO L79 Accepts]: Start accepts. Automaton has 32 states and 37 transitions. Word has length 13 [2025-04-30 10:46:52,025 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:46:52,025 INFO L485 AbstractCegarLoop]: Abstraction has 32 states and 37 transitions. [2025-04-30 10:46:52,025 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 5 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:46:52,025 INFO L278 IsEmpty]: Start isEmpty. Operand 32 states and 37 transitions. [2025-04-30 10:46:52,025 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-04-30 10:46:52,025 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:46:52,025 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:46:52,025 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-04-30 10:46:52,025 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2025-04-30 10:46:52,025 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:46:52,025 INFO L85 PathProgramCache]: Analyzing trace with hash -384060618, now seen corresponding path program 1 times [2025-04-30 10:46:52,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:46:52,026 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1912642060] [2025-04-30 10:46:52,026 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:46:52,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:46:52,033 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-04-30 10:46:52,038 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-04-30 10:46:52,039 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:46:52,039 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:46:52,144 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:46:52,145 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:46:52,145 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1912642060] [2025-04-30 10:46:52,145 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1912642060] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:46:52,145 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:46:52,145 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-30 10:46:52,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [522161106] [2025-04-30 10:46:52,145 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:46:52,145 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-30 10:46:52,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:46:52,145 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-30 10:46:52,145 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-04-30 10:46:52,145 INFO L87 Difference]: Start difference. First operand 32 states and 37 transitions. Second operand has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 7 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:46:52,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:46:52,188 INFO L93 Difference]: Finished difference Result 52 states and 61 transitions. [2025-04-30 10:46:52,189 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-30 10:46:52,189 INFO L79 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 7 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:46:52,189 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:46:52,189 INFO L225 Difference]: With dead ends: 52 [2025-04-30 10:46:52,189 INFO L226 Difference]: Without dead ends: 52 [2025-04-30 10:46:52,190 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-04-30 10:46:52,190 INFO L437 NwaCegarLoop]: 20 mSDtfsCounter, 9 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-30 10:46:52,190 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 87 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-30 10:46:52,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2025-04-30 10:46:52,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 51. [2025-04-30 10:46:52,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 46 states have (on average 1.326086956521739) internal successors, (61), 50 states have internal predecessors, (61), 0 states have call successors, (0), 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:46:52,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 61 transitions. [2025-04-30 10:46:52,192 INFO L79 Accepts]: Start accepts. Automaton has 51 states and 61 transitions. Word has length 13 [2025-04-30 10:46:52,192 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:46:52,192 INFO L485 AbstractCegarLoop]: Abstraction has 51 states and 61 transitions. [2025-04-30 10:46:52,192 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 7 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:46:52,192 INFO L278 IsEmpty]: Start isEmpty. Operand 51 states and 61 transitions. [2025-04-30 10:46:52,193 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-04-30 10:46:52,193 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:46:52,193 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:46:52,193 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-04-30 10:46:52,193 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2025-04-30 10:46:52,193 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:46:52,193 INFO L85 PathProgramCache]: Analyzing trace with hash 295995628, now seen corresponding path program 1 times [2025-04-30 10:46:52,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:46:52,193 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [439001615] [2025-04-30 10:46:52,193 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:46:52,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:46:52,199 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-04-30 10:46:52,201 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-04-30 10:46:52,202 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:46:52,202 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:46:52,355 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:46:52,356 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:46:52,356 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [439001615] [2025-04-30 10:46:52,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [439001615] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:46:52,356 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [297536060] [2025-04-30 10:46:52,356 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:46:52,356 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:46:52,356 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:46:52,358 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:46:52,359 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:46:52,396 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-04-30 10:46:52,408 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-04-30 10:46:52,408 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:46:52,408 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:46:52,409 INFO L256 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 34 conjuncts are in the unsatisfiable core [2025-04-30 10:46:52,410 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:46:52,482 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:46:52,482 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:46:52,554 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 26 treesize of output 22 [2025-04-30 10:46:52,639 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:46:52,640 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [297536060] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:46:52,640 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:46:52,640 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 16 [2025-04-30 10:46:52,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [876672004] [2025-04-30 10:46:52,640 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:46:52,640 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-04-30 10:46:52,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:46:52,641 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-04-30 10:46:52,641 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=225, Unknown=0, NotChecked=0, Total=272 [2025-04-30 10:46:52,641 INFO L87 Difference]: Start difference. First operand 51 states and 61 transitions. Second operand has 17 states, 16 states have (on average 1.875) internal successors, (30), 17 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:46:52,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:46:52,757 INFO L93 Difference]: Finished difference Result 85 states and 100 transitions. [2025-04-30 10:46:52,757 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-30 10:46:52,757 INFO L79 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 1.875) internal successors, (30), 17 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2025-04-30 10:46:52,757 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:46:52,758 INFO L225 Difference]: With dead ends: 85 [2025-04-30 10:46:52,758 INFO L226 Difference]: Without dead ends: 85 [2025-04-30 10:46:52,758 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=71, Invalid=271, Unknown=0, NotChecked=0, Total=342 [2025-04-30 10:46:52,758 INFO L437 NwaCegarLoop]: 19 mSDtfsCounter, 41 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 153 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 153 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-30 10:46:52,758 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 142 Invalid, 159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 153 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-30 10:46:52,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2025-04-30 10:46:52,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 65. [2025-04-30 10:46:52,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 60 states have (on average 1.2833333333333334) internal successors, (77), 64 states have internal predecessors, (77), 0 states have call successors, (0), 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:46:52,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 77 transitions. [2025-04-30 10:46:52,763 INFO L79 Accepts]: Start accepts. Automaton has 65 states and 77 transitions. Word has length 13 [2025-04-30 10:46:52,763 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:46:52,763 INFO L485 AbstractCegarLoop]: Abstraction has 65 states and 77 transitions. [2025-04-30 10:46:52,763 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 1.875) internal successors, (30), 17 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:46:52,764 INFO L278 IsEmpty]: Start isEmpty. Operand 65 states and 77 transitions. [2025-04-30 10:46:52,764 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-04-30 10:46:52,764 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:46:52,764 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:46:52,771 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:46:52,964 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,SelfDestructingSolverStorable17 [2025-04-30 10:46:52,965 INFO L403 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2025-04-30 10:46:52,965 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:46:52,965 INFO L85 PathProgramCache]: Analyzing trace with hash -777089752, now seen corresponding path program 1 times [2025-04-30 10:46:52,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:46:52,965 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [613200666] [2025-04-30 10:46:52,965 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:46:52,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:46:52,970 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-04-30 10:46:52,973 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-04-30 10:46:52,973 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:46:52,973 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:46:53,088 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:46:53,088 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:46:53,088 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [613200666] [2025-04-30 10:46:53,088 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [613200666] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:46:53,088 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1776411631] [2025-04-30 10:46:53,088 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:46:53,088 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:46:53,088 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:46:53,090 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:46:53,092 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:46:53,130 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-04-30 10:46:53,143 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-04-30 10:46:53,143 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:46:53,143 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:46:53,144 INFO L256 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-04-30 10:46:53,145 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:46:53,159 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:46:53,189 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:46:53,189 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-30 10:46:53,189 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1776411631] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:46:53,189 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-30 10:46:53,189 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 12 [2025-04-30 10:46:53,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1211310931] [2025-04-30 10:46:53,189 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:46:53,189 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-30 10:46:53,189 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:46:53,190 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-30 10:46:53,190 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2025-04-30 10:46:53,190 INFO L87 Difference]: Start difference. First operand 65 states and 77 transitions. Second operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:46:53,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:46:53,221 INFO L93 Difference]: Finished difference Result 79 states and 91 transitions. [2025-04-30 10:46:53,222 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-30 10:46:53,222 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2025-04-30 10:46:53,222 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:46:53,222 INFO L225 Difference]: With dead ends: 79 [2025-04-30 10:46:53,222 INFO L226 Difference]: Without dead ends: 79 [2025-04-30 10:46:53,223 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2025-04-30 10:46:53,223 INFO L437 NwaCegarLoop]: 22 mSDtfsCounter, 2 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-30 10:46:53,223 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 98 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-30 10:46:53,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2025-04-30 10:46:53,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 65. [2025-04-30 10:46:53,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 60 states have (on average 1.2833333333333334) internal successors, (77), 64 states have internal predecessors, (77), 0 states have call successors, (0), 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:46:53,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 77 transitions. [2025-04-30 10:46:53,225 INFO L79 Accepts]: Start accepts. Automaton has 65 states and 77 transitions. Word has length 13 [2025-04-30 10:46:53,225 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:46:53,225 INFO L485 AbstractCegarLoop]: Abstraction has 65 states and 77 transitions. [2025-04-30 10:46:53,225 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:46:53,225 INFO L278 IsEmpty]: Start isEmpty. Operand 65 states and 77 transitions. [2025-04-30 10:46:53,226 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-04-30 10:46:53,226 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:46:53,226 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:46:53,232 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:46:53,430 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:46:53,430 INFO L403 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2025-04-30 10:46:53,430 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:46:53,430 INFO L85 PathProgramCache]: Analyzing trace with hash -97031382, now seen corresponding path program 1 times [2025-04-30 10:46:53,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:46:53,430 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1971966795] [2025-04-30 10:46:53,430 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:46:53,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:46:53,436 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-04-30 10:46:53,439 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-04-30 10:46:53,439 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:46:53,439 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:46:53,529 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:46:53,529 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:46:53,529 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1971966795] [2025-04-30 10:46:53,529 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1971966795] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:46:53,529 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1945271067] [2025-04-30 10:46:53,529 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:46:53,529 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:46:53,529 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:46:53,531 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:46:53,532 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:46:53,572 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-04-30 10:46:53,582 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-04-30 10:46:53,582 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:46:53,582 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:46:53,583 INFO L256 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-04-30 10:46:53,584 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:46:53,626 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:46:53,626 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:46:53,660 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 7 treesize of output 5 [2025-04-30 10:46:53,685 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:46:53,685 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1945271067] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:46:53,685 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:46:53,686 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 10 [2025-04-30 10:46:53,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [182287688] [2025-04-30 10:46:53,686 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:46:53,686 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-30 10:46:53,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:46:53,687 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-30 10:46:53,687 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2025-04-30 10:46:53,687 INFO L87 Difference]: Start difference. First operand 65 states and 77 transitions. Second operand has 11 states, 10 states have (on average 2.5) internal successors, (25), 11 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:46:53,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:46:53,778 INFO L93 Difference]: Finished difference Result 91 states and 108 transitions. [2025-04-30 10:46:53,778 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-30 10:46:53,779 INFO L79 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.5) internal successors, (25), 11 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) Word has length 13 [2025-04-30 10:46:53,779 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:46:53,779 INFO L225 Difference]: With dead ends: 91 [2025-04-30 10:46:53,779 INFO L226 Difference]: Without dead ends: 91 [2025-04-30 10:46:53,779 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 19 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2025-04-30 10:46:53,779 INFO L437 NwaCegarLoop]: 19 mSDtfsCounter, 15 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 138 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 153 SdHoareTripleChecker+Invalid, 141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-30 10:46:53,780 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 153 Invalid, 141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 138 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-30 10:46:53,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2025-04-30 10:46:53,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 55. [2025-04-30 10:46:53,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 50 states have (on average 1.3) internal successors, (65), 54 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:46:53,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 65 transitions. [2025-04-30 10:46:53,781 INFO L79 Accepts]: Start accepts. Automaton has 55 states and 65 transitions. Word has length 13 [2025-04-30 10:46:53,781 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:46:53,781 INFO L485 AbstractCegarLoop]: Abstraction has 55 states and 65 transitions. [2025-04-30 10:46:53,781 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.5) internal successors, (25), 11 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:46:53,781 INFO L278 IsEmpty]: Start isEmpty. Operand 55 states and 65 transitions. [2025-04-30 10:46:53,781 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-04-30 10:46:53,782 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:46:53,782 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:46:53,787 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:46:53,982 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:46:53,982 INFO L403 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2025-04-30 10:46:53,982 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:46:53,982 INFO L85 PathProgramCache]: Analyzing trace with hash 317003960, now seen corresponding path program 1 times [2025-04-30 10:46:53,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:46:53,982 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [907163064] [2025-04-30 10:46:53,983 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:46:53,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:46:53,987 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-04-30 10:46:53,990 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-04-30 10:46:53,990 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:46:53,990 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:46:54,083 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:46:54,083 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:46:54,083 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [907163064] [2025-04-30 10:46:54,084 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [907163064] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:46:54,084 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:46:54,084 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-04-30 10:46:54,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [45822841] [2025-04-30 10:46:54,085 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:46:54,085 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-30 10:46:54,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:46:54,085 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-30 10:46:54,085 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-04-30 10:46:54,085 INFO L87 Difference]: Start difference. First operand 55 states and 65 transitions. Second operand has 9 states, 8 states have (on average 1.625) internal successors, (13), 9 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:46:54,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:46:54,164 INFO L93 Difference]: Finished difference Result 96 states and 113 transitions. [2025-04-30 10:46:54,164 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-30 10:46:54,164 INFO L79 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 1.625) internal successors, (13), 9 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2025-04-30 10:46:54,164 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:46:54,165 INFO L225 Difference]: With dead ends: 96 [2025-04-30 10:46:54,165 INFO L226 Difference]: Without dead ends: 96 [2025-04-30 10:46:54,165 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2025-04-30 10:46:54,165 INFO L437 NwaCegarLoop]: 20 mSDtfsCounter, 18 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-30 10:46:54,165 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 99 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-30 10:46:54,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2025-04-30 10:46:54,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 55. [2025-04-30 10:46:54,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 50 states have (on average 1.3) internal successors, (65), 54 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:46:54,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 65 transitions. [2025-04-30 10:46:54,167 INFO L79 Accepts]: Start accepts. Automaton has 55 states and 65 transitions. Word has length 13 [2025-04-30 10:46:54,167 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:46:54,167 INFO L485 AbstractCegarLoop]: Abstraction has 55 states and 65 transitions. [2025-04-30 10:46:54,167 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 1.625) internal successors, (13), 9 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:46:54,167 INFO L278 IsEmpty]: Start isEmpty. Operand 55 states and 65 transitions. [2025-04-30 10:46:54,167 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-04-30 10:46:54,167 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:46:54,167 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:46:54,167 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-04-30 10:46:54,168 INFO L403 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2025-04-30 10:46:54,168 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:46:54,168 INFO L85 PathProgramCache]: Analyzing trace with hash -76023050, now seen corresponding path program 1 times [2025-04-30 10:46:54,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:46:54,168 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [609987908] [2025-04-30 10:46:54,168 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:46:54,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:46:54,172 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-04-30 10:46:54,176 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-04-30 10:46:54,176 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:46:54,176 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:46:54,357 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:46:54,358 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:46:54,358 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [609987908] [2025-04-30 10:46:54,358 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [609987908] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:46:54,358 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:46:54,358 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-04-30 10:46:54,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [775791945] [2025-04-30 10:46:54,358 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:46:54,358 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-30 10:46:54,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:46:54,358 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-30 10:46:54,358 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2025-04-30 10:46:54,359 INFO L87 Difference]: Start difference. First operand 55 states and 65 transitions. Second operand has 9 states, 8 states have (on average 1.625) internal successors, (13), 9 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:46:54,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:46:54,424 INFO L93 Difference]: Finished difference Result 58 states and 69 transitions. [2025-04-30 10:46:54,425 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-30 10:46:54,425 INFO L79 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 1.625) internal successors, (13), 9 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2025-04-30 10:46:54,425 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:46:54,425 INFO L225 Difference]: With dead ends: 58 [2025-04-30 10:46:54,425 INFO L226 Difference]: Without dead ends: 58 [2025-04-30 10:46:54,425 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2025-04-30 10:46:54,427 INFO L437 NwaCegarLoop]: 16 mSDtfsCounter, 11 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-30 10:46:54,427 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 73 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-30 10:46:54,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2025-04-30 10:46:54,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 36. [2025-04-30 10:46:54,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 31 states have (on average 1.3225806451612903) internal successors, (41), 35 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:46:54,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 41 transitions. [2025-04-30 10:46:54,428 INFO L79 Accepts]: Start accepts. Automaton has 36 states and 41 transitions. Word has length 13 [2025-04-30 10:46:54,429 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:46:54,429 INFO L485 AbstractCegarLoop]: Abstraction has 36 states and 41 transitions. [2025-04-30 10:46:54,429 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 1.625) internal successors, (13), 9 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:46:54,429 INFO L278 IsEmpty]: Start isEmpty. Operand 36 states and 41 transitions. [2025-04-30 10:46:54,429 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-04-30 10:46:54,429 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:46:54,429 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:46:54,429 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-04-30 10:46:54,429 INFO L403 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2025-04-30 10:46:54,429 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:46:54,429 INFO L85 PathProgramCache]: Analyzing trace with hash 979022724, now seen corresponding path program 1 times [2025-04-30 10:46:54,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:46:54,429 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [319936528] [2025-04-30 10:46:54,429 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:46:54,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:46:54,439 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-30 10:46:54,442 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-30 10:46:54,442 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:46:54,442 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:46:54,458 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:46:54,458 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:46:54,458 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [319936528] [2025-04-30 10:46:54,458 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [319936528] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:46:54,458 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:46:54,459 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-30 10:46:54,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1525094241] [2025-04-30 10:46:54,459 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:46:54,459 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-30 10:46:54,459 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:46:54,459 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-30 10:46:54,460 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-30 10:46:54,460 INFO L87 Difference]: Start difference. First operand 36 states and 41 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:46:54,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:46:54,486 INFO L93 Difference]: Finished difference Result 35 states and 40 transitions. [2025-04-30 10:46:54,486 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-30 10:46:54,486 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:46:54,486 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:46:54,486 INFO L225 Difference]: With dead ends: 35 [2025-04-30 10:46:54,486 INFO L226 Difference]: Without dead ends: 35 [2025-04-30 10:46:54,487 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:46:54,487 INFO L437 NwaCegarLoop]: 20 mSDtfsCounter, 9 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-30 10:46:54,488 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 35 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-30 10:46:54,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2025-04-30 10:46:54,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2025-04-30 10:46:54,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 31 states have (on average 1.2903225806451613) internal successors, (40), 34 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:46:54,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 40 transitions. [2025-04-30 10:46:54,489 INFO L79 Accepts]: Start accepts. Automaton has 35 states and 40 transitions. Word has length 14 [2025-04-30 10:46:54,489 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:46:54,489 INFO L485 AbstractCegarLoop]: Abstraction has 35 states and 40 transitions. [2025-04-30 10:46:54,489 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:46:54,489 INFO L278 IsEmpty]: Start isEmpty. Operand 35 states and 40 transitions. [2025-04-30 10:46:54,489 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-04-30 10:46:54,489 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:46:54,490 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:46:54,490 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-04-30 10:46:54,490 INFO L403 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2025-04-30 10:46:54,490 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:46:54,490 INFO L85 PathProgramCache]: Analyzing trace with hash 979022725, now seen corresponding path program 1 times [2025-04-30 10:46:54,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:46:54,490 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [498743092] [2025-04-30 10:46:54,490 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:46:54,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:46:54,496 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-30 10:46:54,499 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-30 10:46:54,500 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:46:54,500 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:46:54,601 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:46:54,602 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:46:54,602 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [498743092] [2025-04-30 10:46:54,602 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [498743092] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:46:54,602 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:46:54,602 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-04-30 10:46:54,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1465149882] [2025-04-30 10:46:54,602 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:46:54,602 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-30 10:46:54,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:46:54,602 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-30 10:46:54,602 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-04-30 10:46:54,602 INFO L87 Difference]: Start difference. First operand 35 states and 40 transitions. Second operand has 8 states, 7 states have (on average 2.0) internal successors, (14), 8 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:46:54,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:46:54,636 INFO L93 Difference]: Finished difference Result 38 states and 43 transitions. [2025-04-30 10:46:54,636 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-30 10:46:54,636 INFO L79 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.0) internal successors, (14), 8 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2025-04-30 10:46:54,637 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:46:54,637 INFO L225 Difference]: With dead ends: 38 [2025-04-30 10:46:54,637 INFO L226 Difference]: Without dead ends: 38 [2025-04-30 10:46:54,637 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-04-30 10:46:54,638 INFO L437 NwaCegarLoop]: 20 mSDtfsCounter, 4 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-30 10:46:54,638 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 65 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-30 10:46:54,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2025-04-30 10:46:54,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2025-04-30 10:46:54,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 34 states have (on average 1.2647058823529411) internal successors, (43), 37 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:46:54,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 43 transitions. [2025-04-30 10:46:54,640 INFO L79 Accepts]: Start accepts. Automaton has 38 states and 43 transitions. Word has length 14 [2025-04-30 10:46:54,640 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:46:54,640 INFO L485 AbstractCegarLoop]: Abstraction has 38 states and 43 transitions. [2025-04-30 10:46:54,640 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.0) internal successors, (14), 8 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:46:54,640 INFO L278 IsEmpty]: Start isEmpty. Operand 38 states and 43 transitions. [2025-04-30 10:46:54,640 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-04-30 10:46:54,640 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:46:54,640 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:46:54,640 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-04-30 10:46:54,640 INFO L403 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2025-04-30 10:46:54,641 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:46:54,641 INFO L85 PathProgramCache]: Analyzing trace with hash 585995715, now seen corresponding path program 1 times [2025-04-30 10:46:54,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:46:54,642 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1378319075] [2025-04-30 10:46:54,642 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:46:54,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:46:54,646 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-30 10:46:54,650 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-30 10:46:54,650 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:46:54,650 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:46:54,765 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:46:54,765 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:46:54,765 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1378319075] [2025-04-30 10:46:54,765 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1378319075] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:46:54,765 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:46:54,766 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-04-30 10:46:54,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1160667024] [2025-04-30 10:46:54,766 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:46:54,766 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-30 10:46:54,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:46:54,766 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-30 10:46:54,766 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-04-30 10:46:54,766 INFO L87 Difference]: Start difference. First operand 38 states and 43 transitions. Second operand has 8 states, 7 states have (on average 2.0) internal successors, (14), 8 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:46:54,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:46:54,831 INFO L93 Difference]: Finished difference Result 58 states and 65 transitions. [2025-04-30 10:46:54,832 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-30 10:46:54,832 INFO L79 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.0) internal successors, (14), 8 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2025-04-30 10:46:54,832 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:46:54,832 INFO L225 Difference]: With dead ends: 58 [2025-04-30 10:46:54,832 INFO L226 Difference]: Without dead ends: 58 [2025-04-30 10:46:54,832 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2025-04-30 10:46:54,832 INFO L437 NwaCegarLoop]: 19 mSDtfsCounter, 11 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-30 10:46:54,833 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 96 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-30 10:46:54,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2025-04-30 10:46:54,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 45. [2025-04-30 10:46:54,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 41 states have (on average 1.2682926829268293) internal successors, (52), 44 states have internal predecessors, (52), 0 states have call successors, (0), 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:46:54,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 52 transitions. [2025-04-30 10:46:54,834 INFO L79 Accepts]: Start accepts. Automaton has 45 states and 52 transitions. Word has length 14 [2025-04-30 10:46:54,834 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:46:54,834 INFO L485 AbstractCegarLoop]: Abstraction has 45 states and 52 transitions. [2025-04-30 10:46:54,834 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.0) internal successors, (14), 8 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:46:54,834 INFO L278 IsEmpty]: Start isEmpty. Operand 45 states and 52 transitions. [2025-04-30 10:46:54,834 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-04-30 10:46:54,834 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:46:54,834 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:46:54,834 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-04-30 10:46:54,834 INFO L403 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2025-04-30 10:46:54,835 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:46:54,835 INFO L85 PathProgramCache]: Analyzing trace with hash 1287060293, now seen corresponding path program 1 times [2025-04-30 10:46:54,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:46:54,835 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1079373548] [2025-04-30 10:46:54,835 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:46:54,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:46:54,839 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-30 10:46:54,842 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-30 10:46:54,842 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:46:54,842 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:46:54,924 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:46:54,924 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:46:54,924 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1079373548] [2025-04-30 10:46:54,924 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1079373548] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:46:54,924 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:46:54,924 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-30 10:46:54,924 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2047863685] [2025-04-30 10:46:54,924 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:46:54,925 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-30 10:46:54,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:46:54,925 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-30 10:46:54,925 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-04-30 10:46:54,925 INFO L87 Difference]: Start difference. First operand 45 states and 52 transitions. Second operand has 7 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 7 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:46:54,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:46:54,962 INFO L93 Difference]: Finished difference Result 48 states and 55 transitions. [2025-04-30 10:46:54,962 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-30 10:46:54,962 INFO L79 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 7 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:46:54,962 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:46:54,962 INFO L225 Difference]: With dead ends: 48 [2025-04-30 10:46:54,962 INFO L226 Difference]: Without dead ends: 48 [2025-04-30 10:46:54,963 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-04-30 10:46:54,963 INFO L437 NwaCegarLoop]: 18 mSDtfsCounter, 3 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-30 10:46:54,965 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 71 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-30 10:46:54,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2025-04-30 10:46:54,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 38. [2025-04-30 10:46:54,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 34 states have (on average 1.2647058823529411) internal successors, (43), 37 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:46:54,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 43 transitions. [2025-04-30 10:46:54,966 INFO L79 Accepts]: Start accepts. Automaton has 38 states and 43 transitions. Word has length 14 [2025-04-30 10:46:54,966 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:46:54,966 INFO L485 AbstractCegarLoop]: Abstraction has 38 states and 43 transitions. [2025-04-30 10:46:54,967 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 7 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:46:54,967 INFO L278 IsEmpty]: Start isEmpty. Operand 38 states and 43 transitions. [2025-04-30 10:46:54,967 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-04-30 10:46:54,967 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:46:54,967 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:46:54,967 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-04-30 10:46:54,967 INFO L403 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2025-04-30 10:46:54,967 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:46:54,967 INFO L85 PathProgramCache]: Analyzing trace with hash 437876312, now seen corresponding path program 2 times [2025-04-30 10:46:54,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:46:54,968 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1259554891] [2025-04-30 10:46:54,968 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-30 10:46:54,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:46:54,974 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 16 statements into 2 equivalence classes. [2025-04-30 10:46:54,980 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 16 of 16 statements. [2025-04-30 10:46:54,980 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-30 10:46:54,980 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:46:55,099 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-30 10:46:55,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:46:55,099 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1259554891] [2025-04-30 10:46:55,099 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1259554891] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:46:55,099 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:46:55,099 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-04-30 10:46:55,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1505278811] [2025-04-30 10:46:55,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:46:55,099 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-30 10:46:55,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:46:55,099 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-30 10:46:55,100 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-04-30 10:46:55,100 INFO L87 Difference]: Start difference. First operand 38 states and 43 transitions. Second operand has 9 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 9 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:46:55,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:46:55,160 INFO L93 Difference]: Finished difference Result 52 states and 58 transitions. [2025-04-30 10:46:55,161 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-30 10:46:55,161 INFO L79 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 9 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2025-04-30 10:46:55,161 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:46:55,161 INFO L225 Difference]: With dead ends: 52 [2025-04-30 10:46:55,161 INFO L226 Difference]: Without dead ends: 52 [2025-04-30 10:46:55,161 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2025-04-30 10:46:55,161 INFO L437 NwaCegarLoop]: 21 mSDtfsCounter, 12 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-30 10:46:55,162 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 121 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-30 10:46:55,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2025-04-30 10:46:55,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 39. [2025-04-30 10:46:55,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 35 states have (on average 1.2857142857142858) internal successors, (45), 38 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:46:55,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 45 transitions. [2025-04-30 10:46:55,163 INFO L79 Accepts]: Start accepts. Automaton has 39 states and 45 transitions. Word has length 16 [2025-04-30 10:46:55,163 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:46:55,163 INFO L485 AbstractCegarLoop]: Abstraction has 39 states and 45 transitions. [2025-04-30 10:46:55,163 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 9 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:46:55,163 INFO L278 IsEmpty]: Start isEmpty. Operand 39 states and 45 transitions. [2025-04-30 10:46:55,163 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-04-30 10:46:55,163 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:46:55,163 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:46:55,163 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-04-30 10:46:55,163 INFO L403 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2025-04-30 10:46:55,163 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:46:55,163 INFO L85 PathProgramCache]: Analyzing trace with hash -148929702, now seen corresponding path program 2 times [2025-04-30 10:46:55,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:46:55,163 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [973640011] [2025-04-30 10:46:55,163 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-30 10:46:55,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:46:55,169 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 16 statements into 2 equivalence classes. [2025-04-30 10:46:55,182 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 16 of 16 statements. [2025-04-30 10:46:55,182 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-30 10:46:55,182 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:46:55,442 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:46:55,442 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:46:55,442 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [973640011] [2025-04-30 10:46:55,442 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [973640011] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:46:55,442 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [271024679] [2025-04-30 10:46:55,442 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-30 10:46:55,442 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:46:55,442 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:46:55,444 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-30 10:46:55,445 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-04-30 10:46:55,488 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 16 statements into 2 equivalence classes. [2025-04-30 10:46:55,501 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 16 of 16 statements. [2025-04-30 10:46:55,501 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-30 10:46:55,501 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:46:55,504 INFO L256 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 42 conjuncts are in the unsatisfiable core [2025-04-30 10:46:55,506 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:46:55,551 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 16 treesize of output 12 [2025-04-30 10:46:55,663 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-30 10:46:55,663 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 19 [2025-04-30 10:46:55,773 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:46:55,773 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:46:55,820 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 7 treesize of output 5 [2025-04-30 10:46:55,927 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:46:55,933 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 20 [2025-04-30 10:46:56,024 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:46:56,024 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [271024679] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:46:56,024 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:46:56,024 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 27 [2025-04-30 10:46:56,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1681430161] [2025-04-30 10:46:56,024 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:46:56,025 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-04-30 10:46:56,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:46:56,025 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-04-30 10:46:56,025 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=654, Unknown=0, NotChecked=0, Total=756 [2025-04-30 10:46:56,025 INFO L87 Difference]: Start difference. First operand 39 states and 45 transitions. Second operand has 28 states, 27 states have (on average 1.4814814814814814) internal successors, (40), 28 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:46:56,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:46:56,323 INFO L93 Difference]: Finished difference Result 57 states and 67 transitions. [2025-04-30 10:46:56,324 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-30 10:46:56,324 INFO L79 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 1.4814814814814814) internal successors, (40), 28 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 16 [2025-04-30 10:46:56,324 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:46:56,325 INFO L225 Difference]: With dead ends: 57 [2025-04-30 10:46:56,325 INFO L226 Difference]: Without dead ends: 57 [2025-04-30 10:46:56,325 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 12 SyntacticMatches, 3 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 263 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=157, Invalid=899, Unknown=0, NotChecked=0, Total=1056 [2025-04-30 10:46:56,325 INFO L437 NwaCegarLoop]: 23 mSDtfsCounter, 38 mSDsluCounter, 256 mSDsCounter, 0 mSdLazyCounter, 334 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 279 SdHoareTripleChecker+Invalid, 343 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 334 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-30 10:46:56,326 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 279 Invalid, 343 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 334 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-30 10:46:56,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2025-04-30 10:46:56,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 42. [2025-04-30 10:46:56,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 38 states have (on average 1.2894736842105263) internal successors, (49), 41 states have internal predecessors, (49), 0 states have call successors, (0), 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:46:56,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 49 transitions. [2025-04-30 10:46:56,343 INFO L79 Accepts]: Start accepts. Automaton has 42 states and 49 transitions. Word has length 16 [2025-04-30 10:46:56,343 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:46:56,343 INFO L485 AbstractCegarLoop]: Abstraction has 42 states and 49 transitions. [2025-04-30 10:46:56,343 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 1.4814814814814814) internal successors, (40), 28 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:46:56,343 INFO L278 IsEmpty]: Start isEmpty. Operand 42 states and 49 transitions. [2025-04-30 10:46:56,343 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-04-30 10:46:56,343 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:46:56,343 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:46:56,352 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-04-30 10:46:56,544 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2025-04-30 10:46:56,544 INFO L403 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2025-04-30 10:46:56,545 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:46:56,545 INFO L85 PathProgramCache]: Analyzing trace with hash -1056906948, now seen corresponding path program 1 times [2025-04-30 10:46:56,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:46:56,545 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1722000127] [2025-04-30 10:46:56,545 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:46:56,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:46:56,549 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-04-30 10:46:56,554 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-04-30 10:46:56,554 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:46:56,554 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:46:56,653 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:46:56,653 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:46:56,653 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1722000127] [2025-04-30 10:46:56,653 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1722000127] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:46:56,653 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:46:56,653 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-04-30 10:46:56,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [666801922] [2025-04-30 10:46:56,653 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:46:56,653 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-30 10:46:56,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:46:56,654 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-30 10:46:56,654 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-04-30 10:46:56,654 INFO L87 Difference]: Start difference. First operand 42 states and 49 transitions. Second operand has 8 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:46:56,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:46:56,695 INFO L93 Difference]: Finished difference Result 76 states and 89 transitions. [2025-04-30 10:46:56,695 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-30 10:46:56,695 INFO L79 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2025-04-30 10:46:56,695 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:46:56,696 INFO L225 Difference]: With dead ends: 76 [2025-04-30 10:46:56,696 INFO L226 Difference]: Without dead ends: 76 [2025-04-30 10:46:56,696 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2025-04-30 10:46:56,696 INFO L437 NwaCegarLoop]: 20 mSDtfsCounter, 11 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-30 10:46:56,696 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 102 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-30 10:46:56,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2025-04-30 10:46:56,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 72. [2025-04-30 10:46:56,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 68 states have (on average 1.2794117647058822) internal successors, (87), 71 states have internal predecessors, (87), 0 states have call successors, (0), 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:46:56,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 87 transitions. [2025-04-30 10:46:56,698 INFO L79 Accepts]: Start accepts. Automaton has 72 states and 87 transitions. Word has length 17 [2025-04-30 10:46:56,698 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:46:56,698 INFO L485 AbstractCegarLoop]: Abstraction has 72 states and 87 transitions. [2025-04-30 10:46:56,698 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:46:56,698 INFO L278 IsEmpty]: Start isEmpty. Operand 72 states and 87 transitions. [2025-04-30 10:46:56,698 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-04-30 10:46:56,698 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:46:56,698 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:46:56,698 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-04-30 10:46:56,698 INFO L403 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2025-04-30 10:46:56,698 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:46:56,699 INFO L85 PathProgramCache]: Analyzing trace with hash -321787627, now seen corresponding path program 1 times [2025-04-30 10:46:56,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:46:56,699 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1450814572] [2025-04-30 10:46:56,699 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:46:56,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:46:56,703 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-04-30 10:46:56,707 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-04-30 10:46:56,709 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:46:56,709 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:46:56,829 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:46:56,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:46:56,829 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1450814572] [2025-04-30 10:46:56,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1450814572] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:46:56,829 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [932994710] [2025-04-30 10:46:56,829 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:46:56,829 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:46:56,829 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:46:56,831 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-30 10:46:56,832 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-04-30 10:46:56,879 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-04-30 10:46:56,891 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-04-30 10:46:56,891 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:46:56,891 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:46:56,892 INFO L256 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-04-30 10:46:56,893 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:46:56,927 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-30 10:46:56,927 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-30 10:46:56,927 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [932994710] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:46:56,927 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-30 10:46:56,927 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 10 [2025-04-30 10:46:56,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1005402419] [2025-04-30 10:46:56,927 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:46:56,927 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-30 10:46:56,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:46:56,928 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-30 10:46:56,928 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2025-04-30 10:46:56,928 INFO L87 Difference]: Start difference. First operand 72 states and 87 transitions. Second operand has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:46:56,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:46:56,948 INFO L93 Difference]: Finished difference Result 73 states and 87 transitions. [2025-04-30 10:46:56,948 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-30 10:46:56,948 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2025-04-30 10:46:56,948 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:46:56,949 INFO L225 Difference]: With dead ends: 73 [2025-04-30 10:46:56,949 INFO L226 Difference]: Without dead ends: 73 [2025-04-30 10:46:56,949 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2025-04-30 10:46:56,949 INFO L437 NwaCegarLoop]: 23 mSDtfsCounter, 1 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-30 10:46:56,949 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 47 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-30 10:46:56,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2025-04-30 10:46:56,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 67. [2025-04-30 10:46:56,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 63 states have (on average 1.2857142857142858) internal successors, (81), 66 states have internal predecessors, (81), 0 states have call successors, (0), 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:46:56,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 81 transitions. [2025-04-30 10:46:56,951 INFO L79 Accepts]: Start accepts. Automaton has 67 states and 81 transitions. Word has length 17 [2025-04-30 10:46:56,951 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:46:56,951 INFO L485 AbstractCegarLoop]: Abstraction has 67 states and 81 transitions. [2025-04-30 10:46:56,951 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:46:56,951 INFO L278 IsEmpty]: Start isEmpty. Operand 67 states and 81 transitions. [2025-04-30 10:46:56,952 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-04-30 10:46:56,952 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:46:56,952 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:46:56,958 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-04-30 10:46:57,155 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:46:57,155 INFO L403 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2025-04-30 10:46:57,155 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:46:57,155 INFO L85 PathProgramCache]: Analyzing trace with hash 1958196670, now seen corresponding path program 1 times [2025-04-30 10:46:57,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:46:57,155 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [134588499] [2025-04-30 10:46:57,155 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:46:57,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:46:57,160 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-04-30 10:46:57,164 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-04-30 10:46:57,164 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:46:57,164 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:46:57,274 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:46:57,274 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:46:57,274 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [134588499] [2025-04-30 10:46:57,274 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [134588499] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:46:57,274 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:46:57,274 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-04-30 10:46:57,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1612466074] [2025-04-30 10:46:57,274 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:46:57,274 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-30 10:46:57,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:46:57,274 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-30 10:46:57,274 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-04-30 10:46:57,275 INFO L87 Difference]: Start difference. First operand 67 states and 81 transitions. Second operand has 9 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 9 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:46:57,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:46:57,369 INFO L93 Difference]: Finished difference Result 89 states and 103 transitions. [2025-04-30 10:46:57,369 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-30 10:46:57,369 INFO L79 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 9 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2025-04-30 10:46:57,369 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:46:57,370 INFO L225 Difference]: With dead ends: 89 [2025-04-30 10:46:57,370 INFO L226 Difference]: Without dead ends: 89 [2025-04-30 10:46:57,370 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=162, Unknown=0, NotChecked=0, Total=210 [2025-04-30 10:46:57,370 INFO L437 NwaCegarLoop]: 19 mSDtfsCounter, 11 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-30 10:46:57,370 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 121 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-30 10:46:57,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2025-04-30 10:46:57,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 66. [2025-04-30 10:46:57,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 62 states have (on average 1.2741935483870968) internal successors, (79), 65 states have internal predecessors, (79), 0 states have call successors, (0), 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:46:57,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 79 transitions. [2025-04-30 10:46:57,372 INFO L79 Accepts]: Start accepts. Automaton has 66 states and 79 transitions. Word has length 17 [2025-04-30 10:46:57,372 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:46:57,372 INFO L485 AbstractCegarLoop]: Abstraction has 66 states and 79 transitions. [2025-04-30 10:46:57,372 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 9 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:46:57,372 INFO L278 IsEmpty]: Start isEmpty. Operand 66 states and 79 transitions. [2025-04-30 10:46:57,372 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-04-30 10:46:57,372 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:46:57,372 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:46:57,372 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-04-30 10:46:57,372 INFO L403 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2025-04-30 10:46:57,372 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:46:57,374 INFO L85 PathProgramCache]: Analyzing trace with hash 947079420, now seen corresponding path program 1 times [2025-04-30 10:46:57,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:46:57,374 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1598860166] [2025-04-30 10:46:57,374 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:46:57,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:46:57,379 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-04-30 10:46:57,383 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-04-30 10:46:57,383 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:46:57,383 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:46:57,547 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:46:57,548 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:46:57,548 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1598860166] [2025-04-30 10:46:57,548 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1598860166] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:46:57,548 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [692236553] [2025-04-30 10:46:57,548 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:46:57,548 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:46:57,548 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:46:57,550 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-30 10:46:57,551 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-04-30 10:46:57,603 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-04-30 10:46:57,621 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-04-30 10:46:57,621 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:46:57,621 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:46:57,622 INFO L256 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 32 conjuncts are in the unsatisfiable core [2025-04-30 10:46:57,623 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:46:57,657 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-04-30 10:46:57,755 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-30 10:46:57,756 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 17 treesize of output 17 [2025-04-30 10:46:57,789 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:46:57,789 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:46:57,851 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-30 10:46:57,852 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 23 [2025-04-30 10:46:57,969 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 12 treesize of output 10 [2025-04-30 10:46:57,972 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:46:58,008 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:46:58,008 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [692236553] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:46:58,008 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:46:58,008 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 9] total 21 [2025-04-30 10:46:58,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [751336224] [2025-04-30 10:46:58,008 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:46:58,009 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-04-30 10:46:58,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:46:58,009 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-04-30 10:46:58,009 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=400, Unknown=0, NotChecked=0, Total=462 [2025-04-30 10:46:58,009 INFO L87 Difference]: Start difference. First operand 66 states and 79 transitions. Second operand has 22 states, 21 states have (on average 2.0) internal successors, (42), 22 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:46:58,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:46:58,103 INFO L93 Difference]: Finished difference Result 69 states and 83 transitions. [2025-04-30 10:46:58,104 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-30 10:46:58,106 INFO L79 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 2.0) internal successors, (42), 22 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2025-04-30 10:46:58,106 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:46:58,107 INFO L225 Difference]: With dead ends: 69 [2025-04-30 10:46:58,107 INFO L226 Difference]: Without dead ends: 69 [2025-04-30 10:46:58,107 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 19 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=78, Invalid=474, Unknown=0, NotChecked=0, Total=552 [2025-04-30 10:46:58,107 INFO L437 NwaCegarLoop]: 19 mSDtfsCounter, 8 mSDsluCounter, 161 mSDsCounter, 0 mSdLazyCounter, 143 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 180 SdHoareTripleChecker+Invalid, 144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-30 10:46:58,108 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 180 Invalid, 144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 143 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-30 10:46:58,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2025-04-30 10:46:58,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2025-04-30 10:46:58,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 65 states have (on average 1.2769230769230768) internal successors, (83), 68 states have internal predecessors, (83), 0 states have call successors, (0), 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:46:58,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 83 transitions. [2025-04-30 10:46:58,111 INFO L79 Accepts]: Start accepts. Automaton has 69 states and 83 transitions. Word has length 17 [2025-04-30 10:46:58,111 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:46:58,111 INFO L485 AbstractCegarLoop]: Abstraction has 69 states and 83 transitions. [2025-04-30 10:46:58,111 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 2.0) internal successors, (42), 22 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:46:58,111 INFO L278 IsEmpty]: Start isEmpty. Operand 69 states and 83 transitions. [2025-04-30 10:46:58,112 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-04-30 10:46:58,112 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:46:58,112 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:46:58,118 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-04-30 10:46:58,312 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:46:58,312 INFO L403 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2025-04-30 10:46:58,312 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:46:58,312 INFO L85 PathProgramCache]: Analyzing trace with hash 1595698474, now seen corresponding path program 1 times [2025-04-30 10:46:58,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:46:58,313 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [868255146] [2025-04-30 10:46:58,313 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:46:58,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:46:58,317 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-04-30 10:46:58,321 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-04-30 10:46:58,321 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:46:58,321 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:46:58,391 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:46:58,391 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:46:58,391 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [868255146] [2025-04-30 10:46:58,391 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [868255146] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:46:58,391 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:46:58,391 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-30 10:46:58,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [150215934] [2025-04-30 10:46:58,391 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:46:58,391 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-30 10:46:58,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:46:58,392 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-30 10:46:58,392 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-30 10:46:58,392 INFO L87 Difference]: Start difference. First operand 69 states and 83 transitions. Second operand has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:46:58,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:46:58,407 INFO L93 Difference]: Finished difference Result 68 states and 82 transitions. [2025-04-30 10:46:58,407 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-30 10:46:58,407 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2025-04-30 10:46:58,407 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:46:58,408 INFO L225 Difference]: With dead ends: 68 [2025-04-30 10:46:58,408 INFO L226 Difference]: Without dead ends: 54 [2025-04-30 10:46:58,408 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:46:58,408 INFO L437 NwaCegarLoop]: 19 mSDtfsCounter, 9 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-30 10:46:58,408 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 36 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-30 10:46:58,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2025-04-30 10:46:58,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2025-04-30 10:46:58,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 51 states have (on average 1.1764705882352942) internal successors, (60), 53 states have internal predecessors, (60), 0 states have call successors, (0), 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:46:58,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 60 transitions. [2025-04-30 10:46:58,410 INFO L79 Accepts]: Start accepts. Automaton has 54 states and 60 transitions. Word has length 18 [2025-04-30 10:46:58,410 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:46:58,410 INFO L485 AbstractCegarLoop]: Abstraction has 54 states and 60 transitions. [2025-04-30 10:46:58,410 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:46:58,410 INFO L278 IsEmpty]: Start isEmpty. Operand 54 states and 60 transitions. [2025-04-30 10:46:58,410 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-04-30 10:46:58,410 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:46:58,410 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:46:58,411 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2025-04-30 10:46:58,411 INFO L403 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2025-04-30 10:46:58,411 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:46:58,411 INFO L85 PathProgramCache]: Analyzing trace with hash -705309057, now seen corresponding path program 1 times [2025-04-30 10:46:58,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:46:58,411 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1228084321] [2025-04-30 10:46:58,411 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:46:58,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:46:58,416 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-04-30 10:46:58,419 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-04-30 10:46:58,420 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:46:58,420 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:46:58,573 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:46:58,574 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:46:58,574 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1228084321] [2025-04-30 10:46:58,574 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1228084321] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:46:58,574 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [970736715] [2025-04-30 10:46:58,574 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:46:58,574 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:46:58,574 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:46:58,576 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-30 10:46:58,577 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-04-30 10:46:58,635 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-04-30 10:46:58,649 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-04-30 10:46:58,649 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:46:58,650 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:46:58,650 INFO L256 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 41 conjuncts are in the unsatisfiable core [2025-04-30 10:46:58,652 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:46:58,721 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:46:58,721 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:46:58,820 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 7 treesize of output 5 [2025-04-30 10:46:58,871 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:46:58,872 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [970736715] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:46:58,872 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:46:58,872 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 18 [2025-04-30 10:46:58,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1274678387] [2025-04-30 10:46:58,873 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:46:58,873 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-04-30 10:46:58,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:46:58,873 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-04-30 10:46:58,873 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=284, Unknown=0, NotChecked=0, Total=342 [2025-04-30 10:46:58,873 INFO L87 Difference]: Start difference. First operand 54 states and 60 transitions. Second operand has 19 states, 18 states have (on average 2.111111111111111) internal successors, (38), 19 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:46:59,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:46:59,091 INFO L93 Difference]: Finished difference Result 72 states and 78 transitions. [2025-04-30 10:46:59,092 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-04-30 10:46:59,092 INFO L79 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 2.111111111111111) internal successors, (38), 19 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2025-04-30 10:46:59,092 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:46:59,092 INFO L225 Difference]: With dead ends: 72 [2025-04-30 10:46:59,092 INFO L226 Difference]: Without dead ends: 72 [2025-04-30 10:46:59,093 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=144, Invalid=612, Unknown=0, NotChecked=0, Total=756 [2025-04-30 10:46:59,093 INFO L437 NwaCegarLoop]: 12 mSDtfsCounter, 20 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 191 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 197 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 191 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-30 10:46:59,093 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 93 Invalid, 197 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 191 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-30 10:46:59,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2025-04-30 10:46:59,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 71. [2025-04-30 10:46:59,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 68 states have (on average 1.1470588235294117) internal successors, (78), 70 states have internal predecessors, (78), 0 states have call successors, (0), 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:46:59,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 78 transitions. [2025-04-30 10:46:59,094 INFO L79 Accepts]: Start accepts. Automaton has 71 states and 78 transitions. Word has length 18 [2025-04-30 10:46:59,095 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:46:59,095 INFO L485 AbstractCegarLoop]: Abstraction has 71 states and 78 transitions. [2025-04-30 10:46:59,095 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 2.111111111111111) internal successors, (38), 19 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:46:59,095 INFO L278 IsEmpty]: Start isEmpty. Operand 71 states and 78 transitions. [2025-04-30 10:46:59,095 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-04-30 10:46:59,095 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:46:59,095 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:46:59,106 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-04-30 10:46:59,295 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable33 [2025-04-30 10:46:59,296 INFO L403 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2025-04-30 10:46:59,296 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:46:59,296 INFO L85 PathProgramCache]: Analyzing trace with hash -63554262, now seen corresponding path program 3 times [2025-04-30 10:46:59,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:46:59,296 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1986599532] [2025-04-30 10:46:59,296 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-30 10:46:59,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:46:59,301 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 19 statements into 4 equivalence classes. [2025-04-30 10:46:59,312 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 19 of 19 statements. [2025-04-30 10:46:59,312 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-04-30 10:46:59,312 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:46:59,566 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:46:59,566 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:46:59,566 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1986599532] [2025-04-30 10:46:59,566 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1986599532] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:46:59,566 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [483115472] [2025-04-30 10:46:59,566 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-30 10:46:59,566 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:46:59,566 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:46:59,568 INFO L229 MonitoredProcess]: Starting monitored process 10 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:46:59,570 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-04-30 10:46:59,618 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 19 statements into 4 equivalence classes. [2025-04-30 10:46:59,633 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 19 of 19 statements. [2025-04-30 10:46:59,633 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-04-30 10:46:59,633 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:46:59,635 INFO L256 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 55 conjuncts are in the unsatisfiable core [2025-04-30 10:46:59,636 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:46:59,664 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 16 treesize of output 12 [2025-04-30 10:47:01,174 INFO L325 Elim1Store]: treesize reduction 4, result has 84.6 percent of original size [2025-04-30 10:47:01,175 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 32 [2025-04-30 10:47:01,288 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 11 refuted. 1 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:47:01,289 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:47:01,463 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 7 treesize of output 5 [2025-04-30 10:47:01,540 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 33 treesize of output 29 [2025-04-30 10:47:01,545 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 47 treesize of output 41 [2025-04-30 10:47:01,636 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:47:01,636 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [483115472] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:47:01,636 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:47:01,636 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 13] total 35 [2025-04-30 10:47:01,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [78997035] [2025-04-30 10:47:01,636 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:47:01,636 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2025-04-30 10:47:01,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:47:01,637 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2025-04-30 10:47:01,637 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=166, Invalid=1093, Unknown=1, NotChecked=0, Total=1260 [2025-04-30 10:47:01,637 INFO L87 Difference]: Start difference. First operand 71 states and 78 transitions. Second operand has 36 states, 35 states have (on average 1.3714285714285714) internal successors, (48), 36 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:47:06,884 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:47:07,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:47:07,282 INFO L93 Difference]: Finished difference Result 94 states and 104 transitions. [2025-04-30 10:47:07,282 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-04-30 10:47:07,282 INFO L79 Accepts]: Start accepts. Automaton has has 36 states, 35 states have (on average 1.3714285714285714) internal successors, (48), 36 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-04-30 10:47:07,282 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:47:07,283 INFO L225 Difference]: With dead ends: 94 [2025-04-30 10:47:07,283 INFO L226 Difference]: Without dead ends: 94 [2025-04-30 10:47:07,283 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 16 SyntacticMatches, 2 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 516 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=288, Invalid=1690, Unknown=2, NotChecked=0, Total=1980 [2025-04-30 10:47:07,284 INFO L437 NwaCegarLoop]: 15 mSDtfsCounter, 53 mSDsluCounter, 186 mSDsCounter, 0 mSdLazyCounter, 411 mSolverCounterSat, 14 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 201 SdHoareTripleChecker+Invalid, 427 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 411 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.7s IncrementalHoareTripleChecker+Time [2025-04-30 10:47:07,284 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 201 Invalid, 427 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 411 Invalid, 2 Unknown, 0 Unchecked, 4.7s Time] [2025-04-30 10:47:07,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2025-04-30 10:47:07,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 83. [2025-04-30 10:47:07,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 80 states have (on average 1.15) internal successors, (92), 82 states have internal predecessors, (92), 0 states have call successors, (0), 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:47:07,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 92 transitions. [2025-04-30 10:47:07,285 INFO L79 Accepts]: Start accepts. Automaton has 83 states and 92 transitions. Word has length 19 [2025-04-30 10:47:07,285 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:47:07,285 INFO L485 AbstractCegarLoop]: Abstraction has 83 states and 92 transitions. [2025-04-30 10:47:07,286 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 35 states have (on average 1.3714285714285714) internal successors, (48), 36 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:47:07,286 INFO L278 IsEmpty]: Start isEmpty. Operand 83 states and 92 transitions. [2025-04-30 10:47:07,286 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-04-30 10:47:07,286 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:47:07,286 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:47:07,294 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-04-30 10:47:07,488 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable34 [2025-04-30 10:47:07,488 INFO L403 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2025-04-30 10:47:07,488 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:47:07,488 INFO L85 PathProgramCache]: Analyzing trace with hash -882105342, now seen corresponding path program 2 times [2025-04-30 10:47:07,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:47:07,488 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [843301216] [2025-04-30 10:47:07,488 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-30 10:47:07,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:47:07,493 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 21 statements into 2 equivalence classes. [2025-04-30 10:47:07,501 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 21 of 21 statements. [2025-04-30 10:47:07,501 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-30 10:47:07,501 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:47:07,668 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:47:07,668 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:47:07,668 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [843301216] [2025-04-30 10:47:07,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [843301216] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:47:07,668 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [472244558] [2025-04-30 10:47:07,668 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-30 10:47:07,668 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:47:07,668 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:47:07,670 INFO L229 MonitoredProcess]: Starting monitored process 11 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:47:07,671 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-04-30 10:47:07,725 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 21 statements into 2 equivalence classes. [2025-04-30 10:47:07,742 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 21 of 21 statements. [2025-04-30 10:47:07,742 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-30 10:47:07,742 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:47:07,743 INFO L256 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 36 conjuncts are in the unsatisfiable core [2025-04-30 10:47:07,744 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:47:07,749 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-04-30 10:47:07,808 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-30 10:47:07,809 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 17 treesize of output 17 [2025-04-30 10:47:07,849 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:47:07,849 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:47:07,991 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-30 10:47:07,992 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 49 [2025-04-30 10:47:08,076 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 10 treesize of output 8 [2025-04-30 10:47:08,077 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:47:08,079 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:47:08,079 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [472244558] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:47:08,079 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:47:08,079 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2025-04-30 10:47:08,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1728270414] [2025-04-30 10:47:08,079 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:47:08,079 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-04-30 10:47:08,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:47:08,080 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-04-30 10:47:08,080 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=318, Unknown=0, NotChecked=0, Total=380 [2025-04-30 10:47:08,080 INFO L87 Difference]: Start difference. First operand 83 states and 92 transitions. Second operand has 20 states, 19 states have (on average 2.0) internal successors, (38), 20 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:47:08,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:47:08,211 INFO L93 Difference]: Finished difference Result 82 states and 90 transitions. [2025-04-30 10:47:08,212 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-04-30 10:47:08,212 INFO L79 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 2.0) internal successors, (38), 20 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2025-04-30 10:47:08,212 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:47:08,212 INFO L225 Difference]: With dead ends: 82 [2025-04-30 10:47:08,212 INFO L226 Difference]: Without dead ends: 66 [2025-04-30 10:47:08,212 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 30 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=94, Invalid=412, Unknown=0, NotChecked=0, Total=506 [2025-04-30 10:47:08,213 INFO L437 NwaCegarLoop]: 15 mSDtfsCounter, 6 mSDsluCounter, 164 mSDsCounter, 0 mSdLazyCounter, 190 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 179 SdHoareTripleChecker+Invalid, 190 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 190 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-30 10:47:08,213 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 179 Invalid, 190 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 190 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-30 10:47:08,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2025-04-30 10:47:08,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 60. [2025-04-30 10:47:08,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 58 states have (on average 1.1379310344827587) internal successors, (66), 59 states have internal predecessors, (66), 0 states have call successors, (0), 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:47:08,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 66 transitions. [2025-04-30 10:47:08,214 INFO L79 Accepts]: Start accepts. Automaton has 60 states and 66 transitions. Word has length 21 [2025-04-30 10:47:08,214 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:47:08,214 INFO L485 AbstractCegarLoop]: Abstraction has 60 states and 66 transitions. [2025-04-30 10:47:08,214 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 2.0) internal successors, (38), 20 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:47:08,214 INFO L278 IsEmpty]: Start isEmpty. Operand 60 states and 66 transitions. [2025-04-30 10:47:08,214 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-04-30 10:47:08,214 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:47:08,214 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:47:08,220 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2025-04-30 10:47:08,418 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable35 [2025-04-30 10:47:08,418 INFO L403 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2025-04-30 10:47:08,419 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:47:08,419 INFO L85 PathProgramCache]: Analyzing trace with hash -905080515, now seen corresponding path program 1 times [2025-04-30 10:47:08,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:47:08,419 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [878595298] [2025-04-30 10:47:08,419 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:47:08,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:47:08,424 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-04-30 10:47:08,439 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-04-30 10:47:08,439 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:47:08,439 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:47:09,035 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:47:09,035 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:47:09,035 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [878595298] [2025-04-30 10:47:09,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [878595298] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:47:09,036 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [137407129] [2025-04-30 10:47:09,036 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:47:09,036 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:47:09,036 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:47:09,038 INFO L229 MonitoredProcess]: Starting monitored process 12 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:47:09,039 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-04-30 10:47:09,097 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-04-30 10:47:09,117 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-04-30 10:47:09,117 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:47:09,118 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:47:09,119 INFO L256 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 64 conjuncts are in the unsatisfiable core [2025-04-30 10:47:09,121 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:47:09,193 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 16 treesize of output 12 [2025-04-30 10:47:09,285 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-30 10:47:09,286 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 19 [2025-04-30 10:47:09,467 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:47:09,468 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:47:09,697 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2025-04-30 10:47:09,776 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:47:09,779 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 20 [2025-04-30 10:47:09,843 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:47:09,844 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [137407129] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:47:09,844 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:47:09,844 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12, 12] total 34 [2025-04-30 10:47:09,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [562046572] [2025-04-30 10:47:09,844 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:47:09,844 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2025-04-30 10:47:09,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:47:09,845 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2025-04-30 10:47:09,845 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=1074, Unknown=0, NotChecked=0, Total=1190 [2025-04-30 10:47:09,845 INFO L87 Difference]: Start difference. First operand 60 states and 66 transitions. Second operand has 35 states, 34 states have (on average 1.8235294117647058) internal successors, (62), 35 states have internal predecessors, (62), 0 states have call successors, (0), 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:47:10,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:47:10,485 INFO L93 Difference]: Finished difference Result 74 states and 80 transitions. [2025-04-30 10:47:10,485 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2025-04-30 10:47:10,485 INFO L79 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 1.8235294117647058) internal successors, (62), 35 states have internal predecessors, (62), 0 states have call successors, (0), 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 24 [2025-04-30 10:47:10,486 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:47:10,486 INFO L225 Difference]: With dead ends: 74 [2025-04-30 10:47:10,486 INFO L226 Difference]: Without dead ends: 56 [2025-04-30 10:47:10,486 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 26 SyntacticMatches, 1 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 540 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=357, Invalid=2295, Unknown=0, NotChecked=0, Total=2652 [2025-04-30 10:47:10,487 INFO L437 NwaCegarLoop]: 15 mSDtfsCounter, 20 mSDsluCounter, 236 mSDsCounter, 0 mSdLazyCounter, 572 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 251 SdHoareTripleChecker+Invalid, 577 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 572 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-30 10:47:10,487 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 251 Invalid, 577 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 572 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-30 10:47:10,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2025-04-30 10:47:10,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2025-04-30 10:47:10,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 54 states have (on average 1.1111111111111112) internal successors, (60), 55 states have internal predecessors, (60), 0 states have call successors, (0), 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:47:10,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 60 transitions. [2025-04-30 10:47:10,488 INFO L79 Accepts]: Start accepts. Automaton has 56 states and 60 transitions. Word has length 24 [2025-04-30 10:47:10,488 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:47:10,488 INFO L485 AbstractCegarLoop]: Abstraction has 56 states and 60 transitions. [2025-04-30 10:47:10,488 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 1.8235294117647058) internal successors, (62), 35 states have internal predecessors, (62), 0 states have call successors, (0), 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:47:10,488 INFO L278 IsEmpty]: Start isEmpty. Operand 56 states and 60 transitions. [2025-04-30 10:47:10,488 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-30 10:47:10,488 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:47:10,488 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:47:10,494 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2025-04-30 10:47:10,689 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable36 [2025-04-30 10:47:10,689 INFO L403 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2025-04-30 10:47:10,689 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:47:10,689 INFO L85 PathProgramCache]: Analyzing trace with hash -464548054, now seen corresponding path program 4 times [2025-04-30 10:47:10,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:47:10,690 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1541076929] [2025-04-30 10:47:10,690 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-30 10:47:10,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:47:10,697 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 25 statements into 2 equivalence classes. [2025-04-30 10:47:10,704 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 23 of 25 statements. [2025-04-30 10:47:10,708 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-04-30 10:47:10,708 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:47:11,303 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:47:11,303 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:47:11,303 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1541076929] [2025-04-30 10:47:11,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1541076929] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:47:11,303 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [979669777] [2025-04-30 10:47:11,303 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-30 10:47:11,303 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:47:11,303 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:47:11,305 INFO L229 MonitoredProcess]: Starting monitored process 13 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:47:11,306 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-04-30 10:47:11,357 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 25 statements into 2 equivalence classes. [2025-04-30 10:47:11,374 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 23 of 25 statements. [2025-04-30 10:47:11,374 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-04-30 10:47:11,374 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:47:11,375 WARN L254 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 75 conjuncts are in the unsatisfiable core [2025-04-30 10:47:11,378 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:47:11,388 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 16 treesize of output 12 [2025-04-30 10:47:17,952 INFO L325 Elim1Store]: treesize reduction 16, result has 75.4 percent of original size [2025-04-30 10:47:17,952 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 10 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 5 case distinctions, treesize of input 60 treesize of output 71 [2025-04-30 10:47:18,027 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 19 proven. 13 refuted. 3 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:47:18,027 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:47:18,612 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 7 treesize of output 5 [2025-04-30 10:47:18,747 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 84 treesize of output 74 [2025-04-30 10:47:18,755 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 122 treesize of output 104 [2025-04-30 10:47:18,765 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:47:18,766 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [979669777] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:47:18,766 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:47:18,766 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 51 [2025-04-30 10:47:18,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1336643710] [2025-04-30 10:47:18,766 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:47:18,766 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2025-04-30 10:47:18,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:47:18,766 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2025-04-30 10:47:18,767 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=370, Invalid=2279, Unknown=3, NotChecked=0, Total=2652 [2025-04-30 10:47:18,767 INFO L87 Difference]: Start difference. First operand 56 states and 60 transitions. Second operand has 52 states, 51 states have (on average 1.1568627450980393) internal successors, (59), 52 states have internal predecessors, (59), 0 states have call successors, (0), 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:47:21,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:47:21,754 INFO L93 Difference]: Finished difference Result 61 states and 65 transitions. [2025-04-30 10:47:21,754 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-04-30 10:47:21,755 INFO L79 Accepts]: Start accepts. Automaton has has 52 states, 51 states have (on average 1.1568627450980393) internal successors, (59), 52 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-04-30 10:47:21,755 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:47:21,755 INFO L225 Difference]: With dead ends: 61 [2025-04-30 10:47:21,755 INFO L226 Difference]: Without dead ends: 37 [2025-04-30 10:47:21,755 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 16 SyntacticMatches, 2 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 785 ImplicationChecksByTransitivity, 9.8s TimeCoverageRelationStatistics Valid=607, Invalid=2810, Unknown=5, NotChecked=0, Total=3422 [2025-04-30 10:47:21,756 INFO L437 NwaCegarLoop]: 11 mSDtfsCounter, 9 mSDsluCounter, 247 mSDsCounter, 0 mSdLazyCounter, 767 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 258 SdHoareTripleChecker+Invalid, 767 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 767 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-30 10:47:21,756 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 258 Invalid, 767 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 767 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-30 10:47:21,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2025-04-30 10:47:21,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 28. [2025-04-30 10:47:21,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 27 states have (on average 1.0740740740740742) internal successors, (29), 27 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:47:21,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 29 transitions. [2025-04-30 10:47:21,757 INFO L79 Accepts]: Start accepts. Automaton has 28 states and 29 transitions. Word has length 25 [2025-04-30 10:47:21,757 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:47:21,757 INFO L485 AbstractCegarLoop]: Abstraction has 28 states and 29 transitions. [2025-04-30 10:47:21,757 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 51 states have (on average 1.1568627450980393) internal successors, (59), 52 states have internal predecessors, (59), 0 states have call successors, (0), 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:47:21,757 INFO L278 IsEmpty]: Start isEmpty. Operand 28 states and 29 transitions. [2025-04-30 10:47:21,757 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-04-30 10:47:21,757 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:47:21,757 INFO L218 NwaCegarLoop]: trace histogram [4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:47:21,763 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2025-04-30 10:47:21,957 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable37 [2025-04-30 10:47:21,958 INFO L403 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2025-04-30 10:47:21,958 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:47:21,958 INFO L85 PathProgramCache]: Analyzing trace with hash 1078632401, now seen corresponding path program 2 times [2025-04-30 10:47:21,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:47:21,958 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1560647363] [2025-04-30 10:47:21,958 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-30 10:47:21,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:47:21,964 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 27 statements into 2 equivalence classes. [2025-04-30 10:47:21,978 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 27 of 27 statements. [2025-04-30 10:47:21,978 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-30 10:47:21,978 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:47:22,471 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:47:22,471 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:47:22,471 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1560647363] [2025-04-30 10:47:22,471 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1560647363] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:47:22,471 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [462296398] [2025-04-30 10:47:22,471 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-30 10:47:22,471 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:47:22,471 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:47:22,473 INFO L229 MonitoredProcess]: Starting monitored process 14 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:47:22,474 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-04-30 10:47:22,526 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 27 statements into 2 equivalence classes. [2025-04-30 10:47:22,542 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 27 of 27 statements. [2025-04-30 10:47:22,542 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-30 10:47:22,542 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:47:22,543 INFO L256 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 69 conjuncts are in the unsatisfiable core [2025-04-30 10:47:22,547 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:47:22,577 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 16 treesize of output 12 [2025-04-30 10:47:28,093 INFO L325 Elim1Store]: treesize reduction 4, result has 87.9 percent of original size [2025-04-30 10:47:28,094 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:47:28,318 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 2 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:47:28,318 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:47:28,439 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 7 treesize of output 5 [2025-04-30 10:47:28,748 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 31 treesize of output 27 [2025-04-30 10:47:28,755 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-30 10:47:28,755 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 47 [2025-04-30 10:47:28,821 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:47:28,821 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [462296398] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:47:28,821 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:47:28,821 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 44 [2025-04-30 10:47:28,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1166383267] [2025-04-30 10:47:28,821 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:47:28,821 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2025-04-30 10:47:28,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:47:28,822 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2025-04-30 10:47:28,822 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=178, Invalid=1800, Unknown=2, NotChecked=0, Total=1980 [2025-04-30 10:47:28,822 INFO L87 Difference]: Start difference. First operand 28 states and 29 transitions. Second operand has 45 states, 44 states have (on average 1.6136363636363635) internal successors, (71), 45 states have internal predecessors, (71), 0 states have call successors, (0), 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:47:33,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:47:33,962 INFO L93 Difference]: Finished difference Result 34 states and 36 transitions. [2025-04-30 10:47:33,962 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2025-04-30 10:47:33,962 INFO L79 Accepts]: Start accepts. Automaton has has 45 states, 44 states have (on average 1.6136363636363635) internal successors, (71), 45 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2025-04-30 10:47:33,962 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:47:33,962 INFO L225 Difference]: With dead ends: 34 [2025-04-30 10:47:33,962 INFO L226 Difference]: Without dead ends: 0 [2025-04-30 10:47:33,963 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 24 SyntacticMatches, 1 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 862 ImplicationChecksByTransitivity, 10.0s TimeCoverageRelationStatistics Valid=594, Invalid=4095, Unknown=3, NotChecked=0, Total=4692 [2025-04-30 10:47:33,963 INFO L437 NwaCegarLoop]: 6 mSDtfsCounter, 40 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 574 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 597 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 574 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-04-30 10:47:33,963 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 141 Invalid, 597 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 574 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-04-30 10:47:33,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-04-30 10:47:33,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-04-30 10:47:33,964 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:47:33,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-04-30 10:47:33,964 INFO L79 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 27 [2025-04-30 10:47:33,964 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:47:33,964 INFO L485 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-30 10:47:33,964 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 44 states have (on average 1.6136363636363635) internal successors, (71), 45 states have internal predecessors, (71), 0 states have call successors, (0), 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:47:33,964 INFO L278 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-04-30 10:47:33,964 INFO L284 IsEmpty]: Finished isEmpty. No accepting run. [2025-04-30 10:47:33,966 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 11 remaining) [2025-04-30 10:47:33,967 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 11 remaining) [2025-04-30 10:47:33,967 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 11 remaining) [2025-04-30 10:47:33,967 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 11 remaining) [2025-04-30 10:47:33,967 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 11 remaining) [2025-04-30 10:47:33,967 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 11 remaining) [2025-04-30 10:47:33,967 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 11 remaining) [2025-04-30 10:47:33,967 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 11 remaining) [2025-04-30 10:47:33,968 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 11 remaining) [2025-04-30 10:47:33,968 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 11 remaining) [2025-04-30 10:47:33,968 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK (0 of 11 remaining) [2025-04-30 10:47:33,974 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2025-04-30 10:47:34,168 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable38 [2025-04-30 10:47:34,171 INFO L422 BasicCegarLoop]: Path program histogram: [4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:47:34,172 INFO L171 ceAbstractionStarter]: Computing trace abstraction results [2025-04-30 10:47:34,174 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.04 10:47:34 BoogieIcfgContainer [2025-04-30 10:47:34,174 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-04-30 10:47:34,174 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-04-30 10:47:34,174 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-04-30 10:47:34,174 INFO L274 PluginConnector]: Witness Printer initialized [2025-04-30 10:47:34,175 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.04 10:46:48" (3/4) ... [2025-04-30 10:47:34,176 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-04-30 10:47:34,184 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges [2025-04-30 10:47:34,184 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2025-04-30 10:47:34,185 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2025-04-30 10:47:34,185 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-04-30 10:47:34,239 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-04-30 10:47:34,240 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-04-30 10:47:34,240 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-04-30 10:47:34,240 INFO L158 Benchmark]: Toolchain (without parser) took 46197.70ms. Allocated memory was 142.6MB in the beginning and 453.0MB in the end (delta: 310.4MB). Free memory was 109.4MB in the beginning and 195.5MB in the end (delta: -86.1MB). Peak memory consumption was 225.6MB. Max. memory is 16.1GB. [2025-04-30 10:47:34,240 INFO L158 Benchmark]: CDTParser took 1.03ms. Allocated memory is still 201.3MB. Free memory is still 127.6MB. There was no memory consumed. Max. memory is 16.1GB. [2025-04-30 10:47:34,241 INFO L158 Benchmark]: CACSL2BoogieTranslator took 312.83ms. Allocated memory is still 142.6MB. Free memory was 109.4MB in the beginning and 88.0MB in the end (delta: 21.4MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-04-30 10:47:34,241 INFO L158 Benchmark]: Boogie Procedure Inliner took 33.45ms. Allocated memory is still 142.6MB. Free memory was 88.0MB in the beginning and 86.0MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-04-30 10:47:34,241 INFO L158 Benchmark]: Boogie Preprocessor took 39.49ms. Allocated memory is still 142.6MB. Free memory was 86.0MB in the beginning and 84.1MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. [2025-04-30 10:47:34,241 INFO L158 Benchmark]: RCFGBuilder took 262.69ms. Allocated memory is still 142.6MB. Free memory was 84.1MB in the beginning and 69.3MB in the end (delta: 14.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-04-30 10:47:34,241 INFO L158 Benchmark]: TraceAbstraction took 45478.95ms. Allocated memory was 142.6MB in the beginning and 453.0MB in the end (delta: 310.4MB). Free memory was 69.3MB in the beginning and 199.9MB in the end (delta: -130.6MB). Peak memory consumption was 175.3MB. Max. memory is 16.1GB. [2025-04-30 10:47:34,242 INFO L158 Benchmark]: Witness Printer took 65.92ms. Allocated memory is still 453.0MB. Free memory was 199.9MB in the beginning and 195.5MB in the end (delta: 4.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-04-30 10:47:34,242 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.03ms. Allocated memory is still 201.3MB. Free memory is still 127.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 312.83ms. Allocated memory is still 142.6MB. Free memory was 109.4MB in the beginning and 88.0MB in the end (delta: 21.4MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 33.45ms. Allocated memory is still 142.6MB. Free memory was 88.0MB in the beginning and 86.0MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 39.49ms. Allocated memory is still 142.6MB. Free memory was 86.0MB in the beginning and 84.1MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 262.69ms. Allocated memory is still 142.6MB. Free memory was 84.1MB in the beginning and 69.3MB in the end (delta: 14.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 45478.95ms. Allocated memory was 142.6MB in the beginning and 453.0MB in the end (delta: 310.4MB). Free memory was 69.3MB in the beginning and 199.9MB in the end (delta: -130.6MB). Peak memory consumption was 175.3MB. Max. memory is 16.1GB. * Witness Printer took 65.92ms. Allocated memory is still 453.0MB. Free memory was 199.9MB in the beginning and 195.5MB in the end (delta: 4.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 373]: 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, 32 locations, 39 edges, 11 error locations. Started 1 CEGAR loops. OverallTime: 45.4s, OverallIterations: 39, TraceHistogramMax: 5, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 16.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 2 mSolverCounterUnknown, 525 SdHoareTripleChecker+Valid, 8.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 525 mSDsluCounter, 3986 SdHoareTripleChecker+Invalid, 7.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3182 mSDsCounter, 113 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4701 IncrementalHoareTripleChecker+Invalid, 4816 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 113 mSolverCounterUnsat, 804 mSDtfsCounter, 4701 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 794 GetRequests, 265 SyntacticMatches, 14 SemanticMatches, 515 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3510 ImplicationChecksByTransitivity, 26.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=83occurred in iteration=35, InterpolantAutomatonStates: 346, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 39 MinimizatonAttempts, 309 StatesRemovedByMinimization, 28 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 24.3s InterpolantComputationTime, 763 NumberOfCodeBlocks, 759 NumberOfCodeBlocksAsserted, 65 NumberOfCheckSat, 894 ConstructedInterpolants, 49 QuantifiedInterpolants, 10296 SizeOfPredicates, 91 NumberOfNonLiveVariables, 1841 ConjunctsInSsa, 552 ConjunctsInUnsatCore, 62 InterpolantComputations, 29 PerfectInterpolantSequences, 40/302 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 11 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-04-30 10:47:34,296 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